摘要
无线mesh网络中的信道分配会极大地影响网络的性能。为了解决无线mesh网络中的信道分配问题,提出了一种基于博弈论的信道分配(GBCA)算法。该算法将网络中每一个节点模型化为一个博弈者,每个博弈者的策略为信道的分配方案,并将整个网络的吞吐量作为效用函数的目标,效用函数的物理意义则是在给定流量需求矩阵下传输的成功率。博弈者通过相互博弈来优化收益函数,以最大化网络吞吐量。并针对GBCA算法的不足,提出了一种改进算法———GBCA-TP算法。通过NS2.34仿真分析得出,GBCA算法和GBCA-TP算法在收敛性、分组丢失率和吞吐量上都要优于当前的算法。
The channel assignment could affect the performance of wireless mesh network（WMN） greatly.In order to solve the problem of channel assignment,a game-based channel allocation algorithm was proposed.The algorithm modeled the nodes as the players,whose strategies were the allocations of channels,and the entire network’s throughput was regarded as the target of the utility function.The physical meaning of utility function is the successful transmission traffic given a traffic demand matrix.In order to optimize the utility function,the player could maximize the throughput of the network.Then an improved algorithm named GBCA-TP was proposed,which aimed at the insufficiency of GBCA.Simulation results based on NS2.34 show that GBCA and GBCA-TP have quite good performances on convergence,loss rate and throughput.
出处
《电信科学》
北大核心
2013年第7期59-65,共7页
Telecommunications Science
基金
重庆市自然科学基金资助项目(No.cstc2012jjA40033)
