On the Connectivity of Ad Hoc Networks
By Christian Bettstetter. Computer/law journal, 2004
311 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/811639f0b563b5a45fc9788cb9c43cd15b3e4c2f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Esa Hyytiä
- Sumit Singh
- Pasi E. Lassila
- Christian Hartmann
- Jorma T. Virtamo
- R. Mudumbai
- Upamanyu Madhow
- Mohamed-Slim Alouini
Citations in the corpus
- Underwater Optical Wireless Communications, Networking, and Localization: A Survey (2018, background): “The problem of network connectivity is addressed in [250] for omnidirectional networks such that no”
- Connectivity of Wireless Multihop Networks in a Shadow Fading Environment (2003, methodology): “For the case of no fading (σ = 0), we have shown in [2, 3 ] that Penrose’s mathematical theorems on the connectivity of random disk graphs [21] can be employed.”
- Spatial node distribution of the random waypoint mobility model with applications (2006, methodology): “, in [21] and [22] where it is assumed that the nodes are either uniformly distributed or move according to (basic) RWP process.”
- Interference Analysis for Highly Directional 60-GHz Mesh Networks: The Case for Rethinking Medium Access Control (2011, methodology): “In order to calculate the required node densities, we employ the analytical model and connectivity results presented in [32].”