203 search results - page 14 / 41 » On greedy geographic routing algorithms in sensing-covered n... |
SENSYS
2004
ACM
14 years 1 months ago
2004
ACM
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
MSWIM
2003
ACM
14 years 24 days ago
2003
ACM
Recently, geographic routing in wireless networks has gained attention due to several advantages of location information. Location information eliminates the necessity to set up a...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...