Reliable networks with unreliable sensors

Authors:
Srikanth Sastry;Tsvetomira Radeva;Jianer Chen;Jennifer L. Welch
Affiliations:
Department of Computer Science and Engineering, Texas A&M University, College Station, TX;Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA;Department of Computer Science and Engineering, Texas A&M University, College Station, TX;Department of Computer Science and Engineering, Texas A&M University, College Station, TX
Venue:
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Year:
2011

Citing 11
Cited 0

Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results

IEEE Transactions on Computers
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Planar tilings by polyominoes, polyhexes, and polyiamonds

Journal of Computational and Applied Mathematics
Deploying a Wireless Sensor Network on an Active Volcano

IEEE Internet Computing
Deploying wireless sensors to achieve both coverage and connectivity

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Probabilistic analysis on mesh network fault tolerance

Journal of Parallel and Distributed Computing
Connectivity in Sensor Networks

HICSS '07 Proceedings of the 40th Annual Hawaii International Conference on System Sciences
Fault tolerance measures for large-scale wireless sensor networks

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Unreliable sensor grids: coverage, connectivity and diameter

Ad Hoc Networks
Critical sensor density for partial connectivity in large area wireless sensor networks

INFOCOM'10 Proceedings of the 29th conference on Information communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks (WSNs) deployed in hostile environments suffer from a high rate of node failure. We investigate the effect of such failure rate on network connectivity. We provide a formal analysis that establishes the relationship between node density, network size, failure probability, and network connectivity. We show that as network size and density increase, the probability of network partitioning becomes arbitrarily small. We show that large networks can maintain connectivity despite a significantly high probability of node failure. We derive mathematical functions that provide lower bounds on network connectivity in WSNs. We compute these functions for some realistic values of node reliability, area covered by the network, and node density, to show that, for instance, networks with over a million nodes can maintain connectivity with a probability exceeding 99% despite node failure probability exceeding 57%.