多并发流无线网状网中的机会路由算法  

Opportunistic Routing for Multi-Flow in Wireless Mesh Networks

作　　者：何施茗[1] 张大方[1] 谢鲲[1] 张继[1] 乔宏[1] 

机构地区：[1]湖南大学信息科学与工程学院,湖南长沙410082

出　　处：《电子学报》2014年第5期1004-1008,共5页Acta Electronica Sinica

基　　金：国家973重点基础研究发展规划(No.2012CB315805);国家自然科学基金(No.61003305;No.61173168;No.61173167;No.61070194)

摘　　要：现有机会路由选择未考虑数据流的分布,可能使候选节点空闲或过载,导致网络吞吐量提升有限.本文将多并发流的机会路由描述成一个凸优化问题,基于对偶和子梯度方法,提出分布式联合候选节点选择和速率分配的多流机会路由算法(Opportunistic Routing for Multi-Flow,ORMF).该算法迭代进行流速率分配,并在速率分配过程中完成候选节点选择.实验结果表明,与基于期望传输次数和期望任意传输次数指标的机会路由相比,ORMF平均可提高33.4%和27.9%的汇聚吞吐量.Opportunistic routing （OR） does not take account of the traffic load, therefore, some nodes may be overloaded while the others may be idle,leading to network performance decline. The OR for multi-flow is described as a convex optimization problem. By primal-dual and sub-gradient methods, a distributed joint candidate nodes selection and rate allocation opportunistic muting for multi-flow algorithm （ORMF） is proposed. ORMF allocates the flow rate iteratively which decides the candidate node. The simulation results show that the throughputs of ORMF ave 33.4% and 27.9% ,higher than those of OR with expected transmis- sion number and expected anycast wansmission metrics,respectively.

关 键 词：无线网状网 多并发流 机会路由 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]