29 search results - page 4 / 6 » Greedy Virtual Coordinates for Geographic Routing |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the n...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
ADHOC
2007
14 years 9 months ago
2007
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
INFOCOM
2007
IEEE
15 years 3 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 ...