On the minimum node degree and connectivity of a wireless multihop network

By Christian Bettstetter. ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2002

1,021 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/ccaf1eeb48ced2dc35c59356439fc128ca571d25

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

A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks (2005, background): “Note that these parameters are chosen based on the analysis in [23] to obtain sparse and connected topologies.”
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks (2003, methodology): “This result, which has been used in [1] to characterize the k-connectivity of dense ad hoc networks, reveals an interesting analogy with nongeometric random graphs, which display the same behavior.”
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…”
Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards (2007, methodology): “For sparse networks, the CTR is expressed as follows [12]:”
Modeling interactome: scale-free or geometric? (2004, background): “Other designed and optimized communication networks, such as wireless multihop networks (Bettstetter, 2002), electrical power-grid and protein structure networks (Milo et al.”
Analytical modeling and mitigation techniques for the energy hole problem in sensor networks (2007, background): “The problem of what node density can ensure network connectivity is investigated in [35].”
On the Connectivity of Ad Hoc Networks (2004, background): “Bettstetter gave the relation between P(con) and P(no iso node) [1] and showed how to compute the tight approximation for the critical (r0, n)-values for uniformly distributed nodes in two dimensions if border effects are avoided [1, 3] and if they are taken into account [2, 4].”
Impact of interferences on connectivity in ad hoc networks (2005, background): “setting, relations between -connectivity (the property that the graph has a minimal cutset equal to ) and the node degree are studied in [6], whereas this problem is addressed when the transmission”
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks (2003, background): “For example, theoretical results with respect to routing ([1], [24]), capacity ([14], [17]), connectivity ([3], [16], [30]), and minimum power issues cannot be applied directly in a mobile scenario that employs the RWP model.”
Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks (2006, background): “If the sensor network is sparse and the radio range is small, it is possible that the ad-hoc network is not fully connected [30].”
On k-coverage in a mostly sleeping sensor network (2004, methodology): “For the random uniform deployment, the conditions for k-connectivity has been derived in [3, 15] when p = 1.”