203 search results - page 1 / 41 » On greedy geographic routing algorithms in sensing-covered n... |
MOBIHOC
2010
ACM
13 years 2 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
MOBIHOC
2004
ACM
14 years 3 months ago
2004
ACM
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 ...
MOBIHOC
2006
ACM
14 years 3 months ago
2006
ACM
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
ICNP
2007
IEEE
13 years 10 months ago
2007
IEEE
— We present a new approach for generating virtual coordinates that produces usable coordinates quickly and improves the routing performance of existing geographic routing algori...
SENSYS
2010
ACM
13 years 2 months ago
2010
ACM
Geographic routing is of interest for sensor networks because a point-to-point primitive is an important building block for data-centric applications. While there is a significant...