On the minimum node degree and connectivity of a wireless multihop network
Top Cited Papers
- 9 June 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
This paper investigates two fundamental characteristics of a wireless multi -hop network: its minimum node degree and its k--connectivity. Both topology attributes depend on the spatial distribution of the nodes and their transmission range. Using typical modeling assumptions :--- :a random uniform distribution of the nodes and a simple link model :--- :we derive an analytical expression that enables the determination of the required range r0 that creates, for a given node density ρ, an almost surely k--connected network. Equivalently, if the maximum r0 of the nodes is given, we can find out how many nodes are needed to cover a certain area with a k--connected network. We also investigate these questions by various simulations and thereby verify our analytical expressions. Finally, the impact of mobility is discussed.The results of this paper are of practical value for researchers in this area, e.g., if they set the parameters in a network--level simulation of a mobile ad hoc network or if they design a wireless sensor network.Keywords
This publication has 19 references indexed in Scilit:
- Shallow water acoustic networksIEEE Communications Magazine, 2001
- Mobility modeling in wireless networksACM SIGMOBILE Mobile Computing and Communications Review, 2001
- A probabilistic analysis for the range assignment problem in ad hoc networksPublished by Association for Computing Machinery (ACM) ,2001
- Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric GraphsCombinatorics, Probability and Computing, 2000
- Wireless integrated network sensorsCommunications of the ACM, 2000
- Mersenne twisterACM Transactions on Modeling and Computer Simulation, 1998
- The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]dAdvances in Applied Probability, 1997
- On the connectivity of radio networksIEEE Transactions on Information Theory, 1991
- Critical connectivity phenomena in multihop radio modelsIEEE Transactions on Communications, 1989
- Connectivity properties of a packet radio network modelIEEE Transactions on Information Theory, 1989