Greedy Geographic Routing using Dynamic Potential Field for Wireless Ad Hoc Networks

Greedy geographic routing has been considered as an attractive approach due to its simplicity and scalability. However, greedy routing is insufficient in terms of routing convergence because of the local maximum problem. In this letter, we propose a novel greedy routing scheme based on a potential field method that dynamically eliminates the local maximum condition