基于位置信息的自适应Ad Hoc路由协议  

Location-based Adaptive Ad Hoc Routing (LAAR)

作　　者：张棋飞[1] 刘威[1] 杨宗凯[1] 袁林锋[1] 

机构地区：[1]华中科技大学电子与信息工程系,武汉430074

出　　处：《计算机科学》2007年第5期20-24,共5页Computer Science

基　　金：国家自然科学基金资助项目(60572049)

摘　　要：传统的基于位置信息的路由算法往往采用分布式预测机制,可靠性不高,特别当源节点不知道目的节点位置时只能采用洪泛策略,增大了通信开销。本文提出一种基于位置信息的自适应路由机制LAAR(Location-based A-daptive Ad hoc Routing)。LAAR采用分层的体系结构获得全网一致的拓扑视图,消除分布式预测带来的不确定性,通过路由前的位置查询避免洪泛。LAAR综合利用多种位置更新机制,在限制网络开销的同时保障位置信息的准确性。LAAR的自适应调节机制将节点的运动状态与路由发现过程结合,实现对目的节点的动态跟踪,提高路由性能。仿真结果表明,随着节点移动速度的增加,LAAR能够获得比LAR更小的控制开销;同时在节点密度较大情况下,LAAR能获得更高的分组投递率。The distributed prediction adopted in traditional location-based algorithms is not credible. Moreover, once source＇node is ignorant of destination position, flooding scheme is used instead, which increases control overhead. This paper proposes a novel routing scheme referred as Location-based Adaptive Ad hoe Routing （LAAR）. LAAR adopts hierarchical architecture to achieve a network-wide consistent topology view to eliminate inaccuracy that may be introduced by distributed prediction and avoids flooding by location query before routing. LAAR integrated several location updating schemes to restrict overhead while ensuring position accuracy. LAAR implements destination mobility tracking through adaptive adjustment mechanism by associating node movement with route discovery to enhance the possibility of finding a feasible route. Simulation results show that LAAR not only achieves smaller control overhead compared to LAR with increasing velocity but also outperforms LAR over a large density of nodes on delivery rate.

关 键 词：自组织网络 路由算法 基于位置信息 运动状态指标 

分 类 号：TP273.2[自动化与计算机技术—检测技术与自动化装置]