497 search results - page 2 / 100 » Curve-Based Greedy Routing Algorithm for Sensor Networks |
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
GD
2008
Springer
13 years 6 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
IPSN
2009
Springer
13 years 11 months ago
2009
Springer
