On the connectivity of wireless multi-hop networks with arbitrary wireless channel models

Authors:
Xiaoyuan Ta;Guoqiang Mao;Brian D. O. Anderson
Affiliations:
University of Sydney;University of Sydney;Australian National University
Venue:
IEEE Communications Letters
Year:
2009

Citing 3
Cited 1

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
Extremal Properties of Three-Dimensional Sensor Networks with Applications

IEEE Transactions on Mobile Computing
Connectivity of wireless multihop networks in a shadow fading environment

Wireless Networks

Phase transition width of connectivity of wireless multi-hop networks in shadowing environment

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Considering a wireless multi-hop network where a total of n nodes are randomly, independently and uniformly distributed in a unit square in R2 and each node has a uniform transmission power, a fundamental problem is to investigate the connectivity of such networks. In this letter, we prove that the probability of having a connected network and the probability of having no isolated node asymptotically converges to the same value as n goes to infinity for an arbitrary wireless channel model satisfying certain intuitively reasonable conditions.