Random graph theory based connectivity analysis in wireless sensor networks with Rayleigh fading channels

Connectivity is an essential merit of wireless sensor networks. There has been great interest in exploring the minimum density of sensor nodes that is needed to achieve a connected wireless network. This becomes difficult when uncertain features increase, such as Rayleigh fading channels. In this paper, we describe a range-dependent model for sensor networks by using random graph theory, and study the connectivity problem with this model. We calculate the probability of an arbitrary node being isolated, and thus obtain the probability of the whole network being connected. By giving the required minimum density, our work can guide in designing of the wireless sensor networks with fading channels. Moreover, the numerical results shows that the fading effect would degrade the connectivity of the wireless sensor networks.

[1]  Marco Zuniga,et al.  Analyzing the transitional region in low power wireless links , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[2]  P. R. Kumar,et al.  Critical power for asymptotic connectivity , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[3]  P. Grindrod.  Range-dependent random graphs and their application to modeling large small-world Proteome datasets. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Gustavo Alonso,et al.  Connectivity in the presence of Shadowing in 802.11 Ad Hoc Networks , 2004 .

[5]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[6]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[8]  Christian Bettstetter,et al.  Connectivity of Wireless Multihop Networks in a Shadow Fading Environment , 2005, Wirel. Networks.