177 search results - page 34 / 36 » Link Distance and Shortest Path Problems in the Plane |
CIKM
2007
Springer
14 years 19 days ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
SIGCOMM
1999
ACM
14 years 29 days ago
1999
ACM
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...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
This paper is motivated by the observation that current research in ad hoc networks mostly assumes a physically flat network architecture with the nodes having homogeneous charact...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
TWC
2008
13 years 8 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...