Game-Based Resource Allocation For Relay Communication

Along with the development of the wireless communication, relay communication faces the green and intelligent development tendency. How to solve the problem of the resource allocation in the relay communication has been of top priority. This thesis aims to solve problems of power allocation and relay selection by the game theory, and does the performance analysis and simulation validation.This thesis mainly studies the power allocation and the relay selection. In the respect of power allocation problem, it is studied that, for meeting the transmission requirement of the destination node, base station and relays allocation their own power resource to achieve Nash equilibrium and Stackelberg equilibrium under the interference of the other sites; in the research on the power allocation in an area by auction theory, this thesis not only raises a solution in the case of every relay obtaining the complete channel information of the network, but also proposes the iterative updating algorithm for the dynamic allocation of the power resource in the case of every relay obtaining the incomplete information, and analyzes the convergent stability of this algorithm. Regarding to the problem of relay selection, we firstly studies that, in the relay network with some private relays which can feedback the false channel information for the profit, the AGV mechanism not only enforces telling-truth on all relays, but also obviously narrows down the revenue gap among relays; then studies the relay selection in the relay network with malicious nodes, and the solution based on the reputation model selects the relays with high prestige and transmission rate for forwarding the signal, and promotes the transmission performance of the network.