Fast track article: Reliable networks with unreliable sensors

Authors:
Srikanth Sastry;Tsvetomira Radeva;Jianer Chen;Jennifer L. Welch
Affiliations:
Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139, USA;Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139, USA;Department of Computer Science and Engineering, Texas A&M University, College Station, TX 77840, USA;Department of Computer Science and Engineering, Texas A&M University, College Station, TX 77840, USA
Venue:
Pervasive and Mobile Computing
Year:
2013

Citing 18
Cited 0

Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

Wireless Networks
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Naps: scalable, robust topology management in wireless ad hoc networks

Proceedings of the 3rd international symposium on Information processing in sensor networks
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies

IEEE Transactions on Mobile Computing
Partial Clustering: Maintaining Connectivity in a Low Duty-Cycled Dense Wireless Sensor Network

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
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
Topology control with Hexagonal Tessellation

International Journal of Sensor Networks
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
Deterministic Collision Free Communication Despite Continuous Motion

Algorithmic Aspects of Wireless Sensor Networks

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 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 95% despite node failure probability exceeding 53%.