Quantile models for the threshold range for k-connectivity

Authors:
Henri Koskinen
Affiliations:
Helsinki University of Technology (HUT), HUT, Finland
Venue:
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Year:
2004

Citing 3
Cited 0

On k-connectivity for a geometric random graph

Random Structures & Algorithms
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regression models for the threshold range for k-connectivity when the nodes are uniformly distributed in a square region. The cases k =1,2,3 are considered: with $k=1$, the models are based on known asymptotic results to assure correct limiting behavior; with k =2,3, an attempt is made to generalize these results and the models are built accordingly. Verification with independent simulation data shows all the models to be able to predict k-connectivity with good accuracy under this network model.