This study presents an approach to the problem of predicting k-connectivity in wireless multihop networks. Assuming the network consists of randomly placed nodes with a common transmission range, the threshold range for k-connectivity is a random variable. Knowing the distribution of this random variable under the circumstances of interest allows one to determine how the number of nodes, the transmission range, and the network area are related so that a random network realization is k-connected with a given probability.

sensor networks - ad hoc networks -  k-connectivity - graph algorithms