基于最大化网络吞吐量的WMN信道分配算法  

Wireless Mesh Networks Channel Assignment Based on Maximize Network Throughput

作　　者：郑鹏宇[1] 何世彪[1] 戴昊峰[1] 张晖[1] 

机构地区：[1]重庆通信学院,重庆400035

出　　处：《电视技术》2013年第19期176-180,共5页Video Engineering

基　　金：重庆市自然科学基金项目(CSTC;2012JJA40033)

摘　　要：为了解决无线Mesh网络中的信道分配问题,提出了一种基于博弈论的信道分配算法。该算法将网络中每一个节点模型化为一个博弈者,每个博弈者的策略为信道的分配方案,并将整个网络的吞吐量作为效用函数的目标,效用函数的物理意义则是在给定流量需求矩阵下传输的成功率。博弈者通过相互博弈来优化收益函数以最大化网络吞吐量。通过NS2.34仿真分析得出,GBCA算法在收敛性、丢包率和吞吐量上都要优于当前的算法。In order to solve the problem of channel assignment,a game-based channel allocation algorithm is proposed.The algorithm models the nodes as the players,whose strategies are the allocation of channels,and regards the entire network＇ s throughput 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 networks.Simulation results based on NS2.34 show that GBCA has a quite good performance on convergence and loss rate and throughput.

关 键 词：无线MESH网络 信道分配 博弈论 网络吞吐量 

分 类 号：TN92[电子电信—通信与信息系统]