Research On Relay Selection And Power Allocation Algrithm In Cooperative Communication Network Based On Game Theory

With the rapid development of wireless communication, high data rate is required and quality of service should be guaranteed. In communication systems, shadowing, path loss and multipath seriously affect the transmission rate and quality of service. Cooperative communication as one of the key technologies in future wireless communication overcomes above problems effectively. However, applied to commercial network, the key technical problems of relay selection and power allocation should be addressed in depth. Existing literatures on relay selection and power allocation in cooperative communication mostly adopt centralized control strategy, and it incurs heavy signaling overhead and requires accurate channel estimation. However, distributed control strategy only requires incomplete channel state information and partial information exchange between the users and relay nodes. Moreover, game theory has been widely used in the research on wireless communication. Above the reasons is why game theory is adopted in distributed relay selection and power allocation in cooperative communication.The paper studies relay selection and power allocation based on Stackelberg game in cooperative communication. First, we elaborate the basic knowledge of cooperative communication, including concept, basic principle, classification of diversity and classical receive merging technique, as well as the classical relay transmission strategy and key techniques in cooperative communication. Secondly, detailed introduction of the existing single-user relay selection and power allocation algorithm based on Stackelberg game in cooperative communication is given. And then, detailed simulation and analysis of the existing algorithm is carried on. Because of the number of collaborative relay is so large when the network has more relay nodes, an algorithm to limit the number of collaborative relay is proposed. Simulation results show that although the loss of some cooperative diversity gain, the proposed algorithm greatly reduces the complexity of the algorithm and signaling overhead, increases the practicability of the algorithm. Next, multi-user relay selection and power allocation algorithm based on the Stackelberg game is simulated and analyzed. Because of existing literatures do not give the formula of cost price of power, a corrected cost price of power algorithm is proposed. Simulation results show that users on good channel conditions will be punished and gain less power, while users on poor channel conditions will be compensated and allocated more power. So the fairness among users is enhanced. Finally, the work of the thesis is summarized.