Date Added: Sep 2011
Geographic routing protocols have attracted significant attention from the Wireless Sensor Network (WSN) research community, because they are simple and scalable. In geographic routing, a source node obtains the location of a destination node from a location service, or through a hash-function in a data centric storage scheme. A packet is then forwarded to the neighbor that is geographically closest to the destination. This greedy approach allows near-optimal path length in uniform and dense networks without obstacles (i.e., network holes).