一种基于节点位置信息的Ad Hoc网络路由算法  

A Position-Based DSR Algorithm for Ad Hoc Networks

作　　者：刘卫彪[1] 张修如[1] 朱光辉[1] 

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

出　　处：《计算机技术与发展》2007年第10期158-161,共4页Computer Technology and Development

摘　　要：由于传统的DSR路由协议在路由选择时采取向邻居节点全部转发路由信息的策略,在路由请求过多时,容易引起转发次数过多而导致一些节点能量不足,进而导致网络瘫痪,而且在进行最终路由选择时没有充分考虑整个链路的移动性,所以不一定是最佳路由。文中利用移动Ad Hoc网络节点的位置信息提出了一种对DSR路由协议进行改进的路由算法PBDSR。该算法利用通信节点的位置信息构建路由选择区域,取代了传统DSR协议贪婪转发机制,引用链路总体距离和移动性参数作为路由选择的权,可以选择出一种节能路由。仿真表明可以使网络的生存周期和稳定性得到较大改善。Traditional DSR routing protocol always transmits information to all conscutive nodes, so when much routing requests occur, it is easy to induce that some nodes with inadequate energy and even the network breaks down. Otherwise when selecting final routing, it doesn＇t consider fully mobility of the whole link circuit, therefore it musm＇ t be the optimum. This paper presents a Position - Based - DSR Algorithm （PBDSR） improved on DSR routing protocol. PBDSR makes up a zone with the node＇s position information for .selecting router, and replaces the greedy transmit meehanism of DSR,uses the collectivity distance of the chain and mobile parameter as the weight of router selecting. Ultimately it can help to select a best router for saving energy thereby improving the survival period and stability of the Ad Hoc net effectively.

关 键 词：AD HOC网络 链路总体距离 移动性参数 

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