632 search results - page 20 / 127 » On Routing in Circulant Graphs |
103
click to vote
ESA
2009
Springer
15 years 6 months ago
2009
Springer
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...
110
click to vote
SENSYS
2006
ACM
15 years 5 months ago
2006
ACM
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...
115
click to vote
DASFAA
2011
IEEE
14 years 3 months ago
2011
IEEE
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...
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
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...
127
click to vote
COMCOM
2006
14 years 12 months ago
2006
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...