Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
This paper describes a novel routing mechanism for a network of highly mobile sensor nodes that routes data over dynamically changing topologies, using only information from neares...
Geographic protocols are very promising for wireless ad hoc and sensor networks due to the low state storage and low message overhead. Under certain idealized conditions, geograph...
Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local informa...
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...