7 search results - page 1 / 2 » Scalable Routing Via Greedy Embedding |
INFOCOM
2009
IEEE
13 years 11 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 ...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—We study scalable routing for a sensor network deployed in complicated 3D settings such as underground tunnels in gas system or water system. The nodes are in general 3D space b...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— We propose a scalable and reliable point-topoint routing algorithm for ad hoc wireless networks and sensornets. Our algorithm assigns to each node of the network a virt...
OPODIS
2008
13 years 6 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
—In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing ...