An Improved Greedy Geographic Routing in Large-Scale Sensor Networks for Reduction of Local Minima Problem
Geographic (or geometric) routing is known for routing messages in greedy manner. It means that the current node selects a neighbor node that is closest to the destination and forwards the message to it. Despite its simplicity and general efficiency, this strategy alone does not guarantee delivery of message due to the existence of local minima (or dead ends). If the authors want to overcome local minima then it is necessary for nodes to maintain extra nonlocal state or to use auxiliary mechanisms. They study, how to facilitate greedy forwarding by using a minimum amount of such nonlocal states in topologically complex networks.