无线mesh网中一种基于博弈论的公平性路由协议gametheoretical.pdfVIP

第33 卷第11 期 通 信 学 报 Vol.33 No. 11 2012 年11 月 Journa l on Communications November 2012 doi:10.3969/j .issn.1000-436x.2012.11.003 无线mesh 网中一种基于博弈论的公平性路由协议 姬文江，马建峰，田有亮，马卓 （西安电子科技大学计算机学院，陕西西安 710071 ） 摘 要：提出一种基于博弈论的以树为拓扑结构的公平性路由协议。新的协议综合了先验式路由和按需路由，并 且将路由计算和信道资源分配控制分布到树中的每个枝节点上，降低了根节点的负担，使其更适合于无线 mesh 网的通信需求。仿真结果表明，新的路由协议改进了AODV、HWMP 路由协议的端到端平均延迟和网络吞吐量， 并且网络中各个无线节点占有的信道资源基本相近，满足公平性原则。 关键词：无线mesh 网；公平性；路由协议；博弈论 中图分类号：TN925+.93 文献标识码：A 文章编号：1000-436X(2012)11-0017-07 Game theoretical routing protocol with fairness problem in wireless mesh networks JI Wen-jiang , MA Jian-feng, TIAN You-liang, MA Zhuo (School of Computer Science, Xidian University, Xi’an 710071, China) Abstract: Based on game theory, a routing protocol studied with irness problem was proposed. Each router had the same opportunities of Internet access no matter how far from the gateway. Based on the tree topology, the calculation of route could be distributed to every branches of the tree, which greatly reduced the load of the root and more suitable for wireless mesh networks. The simulation results show that the new protocol is more suitable for wireless mesh networks compare with AODV and HWMP, no matter in network throughput or average end -to-end delays, as far as fairness. Key words: wireless mesh networks; fairness; routing protocol; game theory 网关MPP 。MP 之间通过单跳链接，和网关一起构 1 引言 成了一个无线骨干网，为移动终端提供最后一英里