244 search results - page 8 / 49 » Algorithmic Techniques for Maintaining Shortest Routes in Dy... |
MSWIM
2003
ACM
14 years 1 months ago
2003
ACM
Recently, geographic routing in wireless networks has gained attention due to several advantages of location information. Location information eliminates the necessity to set up a...
SIGMETRICS
2011
ACM
12 years 10 months ago
2011
ACM
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
SAINT
2008
IEEE
14 years 2 months ago
2008
IEEE
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...