177 search results - page 34 / 36 » Link Distance and Shortest Path Problems in the Plane |
191
click to vote
CIKM
2007
Springer
15 years 10 months 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...
158
click to vote
SIGCOMM
1999
ACM
15 years 10 months 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...
160
click to vote
IFIP
2004
Springer
15 years 11 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...
138
click to vote
INFOCOM
2008
IEEE
16 years 12 days ago
2008
IEEE
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
191
click to vote
TWC
2008
15 years 5 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...