On k-connectivity for a geometric random graph
Random Structures & Algorithms
Wireless Sensor Placement For Reliable and Efficient Data Collection
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 5 - Volume 5
Connectivity of wireless multihop networks in a shadow fading environment
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Connectivity in wireless ad-hoc networks with a log-normal radio model
Mobile Networks and Applications
Critical node lifetimes in random networks via the Chen-Stein method
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On Route Lifetime in Multihop Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Unreliable sensor grids: coverage, connectivity and diameter
Ad Hoc Networks
Entropy and the law of small numbers
IEEE Transactions on Information Theory
Modeling reliability for wireless sensor node coverage in assistive testbeds
Proceedings of the 3rd International Conference on PErvasive Technologies Related to Assistive Environments
Coverage extension by means of non-conventional multi-hop communications
Computer Communications
On the deployment of wireless sensor networks with regular topology patterns
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
A reliable and flexible data gathering protocol for battery limited wireless sensor networks
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.01 |
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.