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

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

作　　者：袁永琼[1] 

机构地区：[1]中国电子科技集团公司第20研究所通信事业部,陕西西安710068

出　　处：《电子科技》2013年第5期135-138,共4页Electronic Science and Technology

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

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

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