摘要
近几年地理Ad Hoc路由以其独立选路由、避免泛洪以及有良好的可扩展性和适应性而得到快速发展。地理路由面临一个由贪婪方式转发而失败的本地最小问题,该文提出了一种启发式的地理位置辅助路由协议AGAR,利用启发函数对获得位置信息进行路径优化,克服了平面路由算法解决本地最小问题所带来的复杂性。仿真结果表明,该协议能有效地降低网络中扩展节点数目,具有较高的包投递率和较低的端到端延迟。
Wireless Ad Hoc geographic routing has been extensively studied over the last several years. Each intermediate node independently selects the next hop using the given location information of destination. Geographic routing, which eliminates the overhead of route request packet flooding, is scalable and suitable for large scale Ad Hoc networks. However, geographic routing may select the long detour paths when faces the problem of what to do at local minimum node where greedy forwarding fails. This paper proposes a novel geographic routing approach called A^＊ Geographic Ad Hoc Routing （AGAR）, which uses the heuristic function and hosts＇ location information to optimize this path and overcomes the complexity of the planar graph routing. Simulation results show that AGAR significantly reduces the number of the extended nodes on various network topologies, improves the packet delivery success rate and decreases the average end-to-end delay.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第1期137-139,共3页
Computer Engineering
基金
国家自然科学基金资助项目(60473136)
关键词
AD
HOC网络
AGAR
路由协议
Ad Hoc network
A^＊ Geographic Ad Hoc Routing（AGAR）
routing protocol
