Sciweavers

632 search results - page 20 / 127
» On Routing in Circulant Graphs
Sort
View
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 4 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
SENSYS
2006
ACM
14 years 3 months ago
Lazy cross-link removal for geographic routing
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
DASFAA
2011
IEEE
311views Database» more  DASFAA 2011»
13 years 1 months ago
3D Indoor Route Planning for Arbitrary-Shape Objects
Route planning, which is used to calculate feasible routes in a given environment, is one of the key issues in navigation systems. According to different constraints in different...
Wenjie Yuan, Markus Schneider
ICDCS
2006
IEEE
14 years 3 months ago
Routing in Networks with Low Doubling Dimension
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg,...
COMCOM
2006
110views more  COMCOM 2006»
13 years 9 months ago
Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
Milos Stojmenovic, Amiya Nayak