388 search results - page 66 / 78 » Reference Path Ad Hoc Routing Mechanism |
100
Voted
ALGOSENSORS
2004
Springer
15 years 2 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
ALGOSENSORS
2009
Springer
15 years 24 days ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
115
click to vote
ICC
2009
IEEE
14 years 7 months ago
2009
IEEE
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
114
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
Analyzing TCP operation over 802.11 multihop ad hoc networks involves a cross-layer study. In this work, we investigate the effect of congestion and MAC contention on the interact...