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 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.
In REF , the upper bound of the connectivity probability is proposed as a function of the node density.
On the minimum node degree and connectivity of a wireless multihop network
MobiHoc '02
Computer Science