TY - JOUR
T1 - Connectivity analysis of wireless sensor networks with regular topologies in the presence of channel fading
AU - Rajagopalan, Ramesh
AU - Varshney, Pramod K.
N1 - Funding Information:
Manuscript received July 19, 2006; revised October 14, 2006 and February 23, 2007; accepted April 14, 2007. The associate editor coordinating the review of this letter and approving it for publication was D. Wu. This work was supported by the Air Force Office of Scientific Research under grant FA9550-06-1-0277. R. Rajagopalan is with the Department of Electrical and Computer Engineering, Florida State University, Panama City, USA (e-mail: [email protected]). P. K. Varshney is with the Department of Electrical Engineering and Computer Science, 335 Link Hall, Syracuse University, USA (e-mail: [email protected]). Digital Object Identifier 10.1109/TWC.2009.060484
PY - 2009/7
Y1 - 2009/7
N2 - This paper investigates the probabilistic connectivity of wireless sensor networks in the presence of channel fading. Due to the stochastic nature of wireless channels in sensor networks, the geometric disk shaped model widely used for connectivity analysis of sensor networks can be misleading. In this paper, we develop a mathematical model to evaluate the probabilistic connectivity of sensor networks which incorporates the characteristics of wireless channels, multi-access interference, the network topology and the propagation environment. We present an analytical framework for the computation of node isolation probability and network connectivity under different channel fading models. We also analyze the connectivity of sensor networks in the presence of unreliable sensors. We present numerical and simulation results that compare different regular topologies in terms of several metrics such as node isolation probability, end-to-end connectivity, and network connectivity.
AB - This paper investigates the probabilistic connectivity of wireless sensor networks in the presence of channel fading. Due to the stochastic nature of wireless channels in sensor networks, the geometric disk shaped model widely used for connectivity analysis of sensor networks can be misleading. In this paper, we develop a mathematical model to evaluate the probabilistic connectivity of sensor networks which incorporates the characteristics of wireless channels, multi-access interference, the network topology and the propagation environment. We present an analytical framework for the computation of node isolation probability and network connectivity under different channel fading models. We also analyze the connectivity of sensor networks in the presence of unreliable sensors. We present numerical and simulation results that compare different regular topologies in terms of several metrics such as node isolation probability, end-to-end connectivity, and network connectivity.
KW - Channel fading
KW - Network connectivity
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=77956275211&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77956275211&partnerID=8YFLogxK
U2 - 10.1109/TWC.2009.060484
DO - 10.1109/TWC.2009.060484
M3 - Article
AN - SCOPUS:77956275211
SN - 1536-1276
VL - 8
SP - 3475
EP - 3483
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 7
ER -