Research Based On Game Theory Resource Optimization Method In Wireless Mesh Networks

Recently with the explosive growth of intelligent terminals and various wireless broadband devices,it is very urgent that not only the basic voice service should be provided,but also improving the coverage range,the transmission rate and delivering the media service with very high quality for the wireless communication networks.And finally the ubiquitous network access is the ultimate object of the wireless networks.According to the statistics,t he mobile data traffic will increase 1000-fold from 2010 to 2020.In order to support the access of various broadband services,especially the Internet access,wireless mesh network which can self-form and self-heal,is a good solution.Compared to the cell networks,wireless mesh network(WMN)has many advantages,such as lower deployment cost,installation more easily,better non-line-of-sight propagation,more stable transmission,wider bandwidth and better network capacity.In this paper,the problems of distributed spectrum allocation and distributed relay selection in the wireless mesh network are investigated.To sum up,the main research of this paper includes the following aspects:1.The concept and the network construction of the wireless mesh net work are introduced briefly.And the advantages of the wireless mesh network compared to other types of networks are discussed.By observing the development of the wireless mesh network,the actual application prospects are given.2.The problem of distributed spectrum allocation in the wireless mesh network is formulated as a non-cooperative game model.Aiming to minimize the network physical interference,the utility function is defined as the minus of the interference.Thus,the problem of minimizing the network interference is equal to the problem of maximizing the network utility.And the proposed game model is proved to be an ordinal potential game.In addition,based on the classical best response algorithm,the concurrent best response algorithm is p roposed.The simulation result shows that the convergence speed of the proposed algorithm is faster.3.Using the theory of matching game,the problem of optimizing the distributed relay selection is investigated.Aiming to optimize the network throughput,a deny-accept algorithm is introduced to faster matching optimization,and aiming to optimize users' satisfaction,a distributed matching algorithm is given.Not only the network satisfaction is optimized,but also the fairness problem is ensured.And the network performance is improved.