摘要
提出了一种基于地理位置信息的启发式Ad Hoc网络路由方法,该方法将传统的A*算法改造后用于Ad Hoc网络的路由搜索,解决了由贪婪方式转发而失败的本地最小问题,避免了繁杂的路由平面构造与维护,计算机仿真显示,它需要的开销较小并能提供较高的分组传输成功率。
A heuristic routing method based on the geographic position is proposed for Ad Hoe networks in this paper. The traditional A - star algorithm is improved to apply in Ad Hoc networks. The problems of at local minimum node caused by greedy forward fail are solved. The complexto construct and maintenance of the routing planar graph are also avoided. Simulations showed that the proposed routing performed well in routing information protocol, cost less resources and possessed higher success rate of packet transmission.
出处
《南阳理工学院学报》
2009年第4期10-13,共4页
Journal of Nanyang Institute of Technology
基金
河南省教育厅自然科学研究计划项目:2008C510006
南阳理工学院基金项目
关键词
AD
HOC网络
启发式路由
A*算法
Ad Hoc networks
Heuristic routing method
A - star algorithm
