390 search results - page 25 / 78 » Computing shortest paths for any number of hops |
137
click to vote
EUC
2005
Springer
15 years 7 months ago
2005
Springer
Recent studies in wireless sensor networks (WSN) have observed that the irregular link quality is a common phenomenon, rather than an anomaly. The irregular link quality, especiall...
115
Voted
COMGEO
2010
ACM
15 years 2 months ago
2010
ACM
A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distanc...
118
Voted
TWC
2008
15 years 1 months ago
2008
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...
101
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
120
click to vote
WCNC
2008
IEEE
15 years 8 months ago
2008
IEEE
—We present link-diversity routing, a routing paradigm that achieves high path resilience in mobile ad hoc networks. Link-diversity routing chooses each hop of a packet’s route...