Sciweavers

63 search results - page 6 / 13
» Greedy Routing with Bounded Stretch
Sort
View
SPAA
2003
ACM
14 years 3 months ago
Compact routing with name independence
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...
Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan...
ICDCS
2008
IEEE
14 years 4 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
IPPS
2010
IEEE
13 years 7 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
PODC
2006
ACM
14 years 3 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
SENSYS
2010
ACM
13 years 7 months ago
Practical 3D geographic routing for wireless sensor networks
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...
Jiangwei Zhou, Yu Chen, Ben Leong, Pratibha Sundar...