移动Ad Hoc网络中的分布式协作路由算法  

Distributed cooperative routing algorithm for mobile Ad Hoc networks

作　　者：张晚生[1] 刘凯[1] 王力[1,2] 

机构地区：[1]北京航空航天大学电子信息工程学院,北京100191 [2]中国民用航空局飞行校验中心,北京101312

出　　处：《西安电子科技大学学报》2011年第5期34-39,共6页Journal of Xidian University

基　　金：国家自然科学基金资助项目(60933012);国家科技重大专项资助项目(2009ZX03006-001-003);国家杰出青年科学基金资助项目(60625102);中央高校基本科研业务费专项资金资助项目(YWF-10-01-A16)

摘　　要：为了提高移动Ad Hoc网络的吞吐量,提出了一种分布式、面向吞吐量优化的协作路由(TOCR)算法.首先分析了协作链路的吞吐量性能,理论分析表明,协作节点可以提高接收信噪比(SNR),从而提高分组的成功接收概率和链路吞吐量;然后在自适应转发分群路由(AFCR)算法的基础上,逐跳选择使得链路吞吐量最大的协作节点来建立协作链路;最终建立从源节点到目的节点具有最大网络吞吐量的协作路由.仿真结果表明,与无协作的路由算法相比,该算法明显改善了网络的吞吐量,尤其是在较低发送功率和大量节点的情况下.A distributed throughput-optimized cooperative routing （TOCR） algorithm is proposed to improve network throughput in the mobile Ad Hoc network. Through theoretical analysis, by means of a cooperative relay, the received signal-to-noise ratio （SNR） at a recipient node can be increased, and then the probability of successful packet reception and link throughput are increased. Based on the adaptive forwarding cluster routing （AFCR） algorithm, the TOCR algorithm constructs cooperative links with maximum throughput on a route hop by hop, and finally establishes the route with the maximum throughput from the source node to the destination node. Simulation results show that compared with the noncooperative routing algorithm, the proposed algorithm can obviously improve network throughput, especially in the presence of low transmission power and a large number of nodes.

关 键 词：移动AD HOC网络 协作路由 协作通信 节点选择 

分 类 号：TN915.04[电子电信—通信与信息系统]