Heuristic Ad Hoc Network Routing Protocol Based on Geographic Location
Wei-Zhi Wu · Jisuanji gongcheng · 2008
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.