Connectivity in ad-hoc and hybrid networks

By Olivier Dousse, Patrick Thiran, Martin J. Hasler. Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002

586 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/10d57596576b36b6bf4726ebec2f8a776f1f5af8

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Probabilistic broadcast for flooding in wireless mobile ad hoc networks (2003, methodology): “Phase transition has been applied to reduce traffic for multicast in wired networks [2], to study optimum power ranges for connectivity [3], [11] and for enhancing connectivity in hybrid MANET/Wired networks [7].”
Worst-Case optimal and average-case efficient geometric ad-hoc routing (2003, background): “Network connectivity—above all in this transition range—is one of the main issues in percolation theory [7].”
On the capacity of hybrid wireless networks (2003, background): “In a recent study [2], the authors proposed a hybrid network model to improve network connectivity.”
On the Connectivity of Ad Hoc Networks (2004, methodology): “[39] addressed connectivity-related aspects employing methods from percolation theory.”
Spatial node distribution of the random waypoint mobility model with applications (2006, background): “On the other hand, the uniform distribution is commonly assumed in many performance studies, for example in studies on ad hoc network capacity (see, e.g., [2] and [3]) and connectivity properties of random networks (see, e.g., [4], [5], and [6]).”
Connectivity of Wireless Multihop Networks in a Shadow Fading Environment (2003, background): “Connectivity of Wireless Multihop Networks in a Shadow Fading Environment Christian Bettstetter and Christian Hartmann Technische Universit¨at M¨unchen (TUM) Institute of Communication Networks 80290 Munich, Germany http://www.lkn.ei.tum.de lastname@ei.tum.de ABSTRACT This paper investigates the c”
Impact of interferences on connectivity in ad hoc networks (2005, background): “RANDOM graphs associated with the Poisson Boolean model and percolation properties of these graphs have been considered in [1] for analyzing the connectivity of ad hoc networks.”
Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case (2008, background): “Although a number of different metrics have been proposed (for example [45]), no widespread agreement exists, especially if one needs to capture both disconnected”
Analytical Model for Connectivity in Vehicular Ad Hoc Networks (2008, methodology): “Note that the tail probability is a continuous (for distances larger than R [12]) and nonperiodic function of distance; hence, the Gaver–Stehfest method is appropriate for our purpose.”
Spray and wait: an efficient routing scheme for intermittently connected mobile networks (2005, background): “Although a number of different metrics have been proposed (for example [10]), no widespread agreement exists, especially if one needs to capture both disconnected and connected networks.”
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks (2003, methodology): “This result is obtained making use of the theory of continuum percolation [19], which is also used in [9] to investigate the connectivity of hybrid ad hoc networks.”
XTC: a practical topology control algorithm for ad-hoc networks (2004, background): “As studied in percolation theory [3], network densityis an important parameter influencing the properties of average-ca s networks.”