无线自组织网络中一种拥塞意识的多径路由算法

›› 2013, Vol. 26 ›› Issue (5): 135-.

无线自组织网络中一种拥塞意识的多径路由算法

袁永琼

(中国电子科技集团公司第20研究所通信事业部,陕西西安 710068)

出版日期:2013-05-15 发布日期:2013-06-20
作者简介:袁永琼(1981—),女,博士,助理工程师。研究方向:无线自组织网络,路由技术。E-mail:yuanyq@ee.buaa.edu.cn

A Congestion-aware Multipath Routing Algorithm for Wireless Ad hoc Networks

YUAN Yongqiong

(Communications Division,20^th Research Institute of China Electronic Technology Group Corporation,Xi'an 710068,China)

Online:2013-05-15 Published:2013-06-20

摘要/Abstract

摘要：

提出了无线自组织网络中一种拥塞意识的多径路由算法。该算法在路由发现过程中,综合节点的队列长度和路径跳数来动态确定路由请求消息的转发概率,可以在保证路由请求消息有一定送达率的条件下,降低路由开销;在路径选择和流量分配过程中,综合考虑节点的队列长度和路径质量作为路由度量,发现流量高吞吐量低拥塞路径,并基于该度量值进行流量分配。仿真结果显示,所提出的多径路由算法能有效提高网络性能。

关键词: 无线自组织网络, 多径路由, 拥塞意识

Abstract:

A Congestion-aware Multipath Routing (CMR) algorithm for wireless ad hoc networks is presented in this paper.In the route discovery,the probability of each node forwarding rout is dynamically adjusted according to the queue size and the number of route hops in route request message.This strategy could reduce network routing load,and guarantee the most nodes to receive the packet.In the route selection and demands distribution,the proposed algorithm is based on the node queue length and the link quality as routing metric to find high throughput and low congestion routes and to distribute the demands among the multiple paths.Simulation shows that the proposed multipath routing algorithm can significantly improve the network performance.

Key words: wireless ad hoc networks;multipath routing;congestion-aware

中图分类号:

TN926

袁永琼. 无线自组织网络中一种拥塞意识的多径路由算法[J]. , 2013, 26(5): 135-.

YUAN Yongqiong. A Congestion-aware Multipath Routing Algorithm for Wireless Ad hoc Networks[J]. , 2013, 26(5): 135-.

参考文献

［1］MARINA M K,DAS S R.On-demand multipath distance vector routing in ad hoc networks［C］.Nineth International Conference on Network Protocols,2001:14-23.

［2］WANG L,SHU Y,DONG M,et al.Adaptive multipath source routing in ad hoc networks［C］.Proc.of IEEE ICC,2001:867-871.

［3］HAAS Z J,HALPERN J Y.Gossip-based ad hoc routing［J］.IEEE/ACM Transactions on Networking,2006,14(3):479-491.

［4］BAKO B,SCHOCH E,KARGL F,et al.Advanced adaptive gossiping using 2-hop neighborhood information［C］.IEEE Globecom,2008:1-6.

［5］JIANG Guoxing,YI Ming.Low overhead on-demand routing protocol for mobile ad hoc networks［J］.Journal on Communications,2009,30(7):27-35.

［6］ABBAS A M,JAIN B N.Analysis of disjoint multipath routing for mobile ad hoc networks［C］.Proc.of IEEE ICPWC 2005,2005:42-46.

［7］VELERA A,SEAH W,RAO S.Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing［J］.IEEE Transactions on Mobile Computing,2005,4(5):443-457.

［8］MARINA M K,DAS S R.On-demand multipath distance vector routing in ad hoc networks ［C］.Nineth International Conference on Network Protocols,2001:14-23.

［9］WANG L,SHU Y,DONG M,et al.Adaptive multipath source routing in ad hoc networks［C］.Proc.of IEEE ICC2001,2001:867-871.

［10］COUTO D,AGUAYO D,BICKET J,et al.A high-throughput path metric for multi-hop wireless routing［J］.Wireless Networks,2005,11(4):419-434.

［11］LASSABE F,CHARLET D,CANALDA P,et al.Friis and iterative trilateration based WiFi devices tracking［C］.Montbéliard,Sochaux,France:The 14th Euromicro International Conference on Parallel,Distributed and Network-Based Processing(PDP 2006),2006:362-365.

［12］DIMITRI B,ROBERT G.Data networks［M］.Newyork:Prentice Hall,1992.

［13］YOON J,LIU M,NOBLE B.Random waypoint considered harmful［C］.Proc.of IEEE Infocom,2003:1312-1321.