203 search results - page 15 / 41 » On greedy geographic routing algorithms in sensing-covered n... |
IV
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider routing methods for networks when geographic positions of nodes are available. Instead of using the original geographic coordinates, however, we precompute virtual coo...
TSP
2008
13 years 7 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
WASA
2009
Springer
14 years 3 days ago
2009
Springer
Mobile underwater sensor networks are usually featured with three-dimensional topology, high node mobility and long propagation delays. For such networks, geographic routing has be...
COR
2008
13 years 7 months ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
STOC
2004
ACM
14 years 1 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...