论文信息 - Exact probability of connectivity one-dimensional ad hoc wireless networks

Exact probability of connectivity one-dimensional ad hoc wireless networks

The probability that a one-dimensional stationary ad hoc wireless network is composed of at most C clusters is presented. The probability of network connectivity, i.e. the case of C=1, can be derived as a special case. A very simple approximate formula is also presented for the probability of network connectivity. We also explain our approximation heuristically, which confirms the analytical result. The analysis is validated by computing the probability of network connectivity and comparing it with the Monte Carlo simulation results.

Said Nader-Esfahani | Akbar Ghasemi

[1] D. Manjunath,et al. On the connectivity in finite ad hoc networks , 2002, IEEE Communications Letters.

[2] Bu-Sung Lee,et al. A closed form network connectivity formula one-dimensional MANETs , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3] Piyush Gupta,et al. Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[4] Christian Bettstetter,et al. On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[5] Christian Bettstetter,et al. On the Connectivity of Ad Hoc Networks , 2004, Comput. J..

[6] Paolo Santi,et al. The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..