Node Selection In Cooperative Communication Based On Coalitional Game Theory

Cooperative communication can make full use of the system resources.Nodes in the network cooperate with each other can improve the network performance and the communication quality.The existing research focuses on the exact resource configuration of the system,while the effect of interference to nodes is not considered.In this scenario,the increasement in power can ensure high data rate,but it increases the energy consumption and introduces interference to the neighboring nodes.Considering the competition and the interference among the coalitions,we propose a distributed relay selection algorithm to achieve the maximum security performance based on the coalition game.We also propose the optimal power allocation algorithm to deal with the competition and interference based on the non-cooperative game with the price.Then the optimal coalition power is distributed according to the channel gain to the destination.The simulation results indicate that not only the stable coalition can be formed,the proposed algorithms effectively save the power cost and improve the security utilities of the coalition.A dynamic Bayesian coalitional game among unmanned aerial vehicles(UAVs)network is analyzed to deal with the uncertainty of UAVs' type and the formation of dynamic coalition.According to the expected payoffs of the UAVs with minimum communication delay,a scheme of Bayesian coalitional game has been proposed to analyze how UAVs select their strategies.Moreover,a belief update mechanism to find possible coalition members in the system is introduced.Simulations are carried out to show that the obtained coalitional structure is Nash-stable.