Abstract: Geographic routing in Ad Hoc Networks faces a local minimum problem when greedy forwarding strategy fails. A Geographic Ad hoc Routing protocol (GAR) was proposed. GAR protocol divides the routing regions and makes use of the slope forwarding strategy. As a result, the scope of the search is narrowed, and the paths are optimized. GALMR protocol is proposed by improving GAR protocol. The proposed protocol takes advantage of landmarks to reduce the hops of routing paths, the performance is improved. Analytical and experimental results show that GALMR protocol has high data packet arrival rate and low average end-to-end delay.

Key words: Ad Hoc Networks, Geographic, Local Minimum Node, Slope forwarding Strategy, Simulation

摘要： Ad Hoc网络中基于地理位置信息的路由面临一个贪婪转发策略失败的本地最小问题，提出了一种基于地理位置信息的Ad hoc路由协议GAR。在GAR协议中，根据节点拓扑变化，划分路由范围，进一步缩小了路由范围，提出了利用斜率转发策略克服了路由算法解决本地最小问题所带来的复杂性。在GAR协议的基础上进一步改进，提出了GALMR协议，该协议通过标记节点发现过程，减少路由跳数，提高算法的执行效率。理论分析和实验结果显示GALMR算法具有较高的数据分组抵达率和较低的平均端到端延迟。

关键词: Ad Hoc网络, 地理位置, 本地最小节点, 斜率转发策略, 仿真模拟