摘要
针对Ad Hoc网络中基于地理位置信息的路由面临的贪婪转发策略失败的本地最小问题,提出了一种基于斜率的Ad Hoc路由协议GAR。GAR不需要维护全局网路拓扑结构,利用斜率转发策略解决了路由算法解决本地最小问题所带来的复杂性问题。在GAR协议的基础上进一步改进,提出了GALMR协议,该协议通过标记节点发现过程,减少路由跳数,提高算法的执行效率。理论分析和实验结果显示,GALMR算法具有较高的数据分组抵达率和较低的平均端到端延迟。
Geographic routing in Ad Hoe Networks faces a local minimum problem when greedy forwarding strategy fails. The proposed Geographic Ad hoc Routing protocol （GAR） did not need to maintain global network topology, and it used slope- based forwarding strategy to solve the local minimum problem and is easy to implement. GALMR protocol was proposed by improving GAR protocol. The proposed protocol takes advantage of landmarks to reduce the hops of routing paths, and the performance is improved. The analytical and experimental results show that GALMR protocol has high data packet arrival rate and low average end-to-end delay.
出处
《计算机应用》
CSCD
北大核心
2011年第1期225-228,共4页
journal of Computer Applications
基金
广东省自然科学基金资助项目(7005946)
教育部科学技术研究重点项目(207143)
关键词
自组网络
地理位置
本地最小节点
斜率转发策略
仿真模拟
Ad Hoe network
geographic location
local minimum node
slope forwarding strategy
simulation
