DMCA
On the Minimum Node Degree and Connectivity of a Wireless Multihop Network (2002)
| Venue: | ACM MobiHoc |
| Citations: | 318 - 4 self |
BibTeX
@ARTICLE{Bettstetter02onthe,
author = {Christian Bettstetter},
title = {On the Minimum Node Degree and Connectivity of a Wireless Multihop Network},
journal = {ACM MobiHoc},
year = {2002}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k–connectivity. Both topology attributes depend on the spa-tial 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 de-rive an analytical expression that enables the determination of the required range r0 that creates, for a given node den-sity ρ, 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 ex-pressions. Finally, the impact of mobility is discussed. The results of this paper are of practical value for re-searchers 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. Categories and Subject Descriptors C.2 [Computer-communication networks]: Network architecture and design—wireless communication, network communications, network topology; G.2.2 [Discrete math-ematics]: Graph theory; F.2.2 [Probability and statis-tics]: Stochastic processes
Keyphrases
wireless multihop network minimum node degree network communication node den-sity typical modeling assumption simple link model network architecture network level simulation mobile ad hoc network spa-tial distribution fundamental characteristic design wireless communication practical value subject descriptor various simulation certain area maximum r0 graph theory random uniform distribution stochastic process computer-communication network network topology transmission range analytical expression analytical ex-pressions wireless sensor network many node discrete math-ematics required range r0
