An improved protocol for AdHoc network routing protocol based on geographic location
Jipeng Zhou · Microcomputer Information · 2010
Wiress AdHoc geographic routing has been extensively studied over the last several years.Each intermediate node independently selects the next hop using the given location of destination.Geographic routing,which eliminates the overhead of route request packet flooding,is scalable and suitable for large scale AdHoc 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 an improved protocol of AGAR,which solves the triangular routing problem and the problem of the shortest path.The simulation results that the improved algorithm will have great packet delivery success rate and decreases the overhead.