Sciweavers

1204 search results - page 77 / 241
» Optimal Routing in a Small-World Network
Sort
View
PODC
2006
ACM
15 years 11 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...
SIGCOMM
1999
ACM
15 years 10 months ago
A Simple Approximation to Minimum-Delay Routing
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
Srinivas Vutukury, J. J. Garcia-Luna-Aceves
INFORMATIKTAGE
2008
15 years 7 months ago
An Energy-Efficient Routing Protocol for Linear Wireless Sensor Networks
: Economical power use is essential to allow for long-lasting operation of wireless sensor networks. This applies equally to linear sensor networks as they emerge when sensors are ...
Marco Zimmerling
ICPP
2006
IEEE
15 years 12 months ago
Social Welfare Based Routing in Ad hoc Networks
— Due to resource scarcity, a paramount concern in ad hoc networks is to utilize the limited resources efficiently. The self-organized nature of ad hoc networks makes the social...
Mingming Lu, Jie Wu
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 10 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...