Reliable networks with unreliable sensors

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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%. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sastry, S., Radeva, T., Chen, J., & Welch, J. L. (2011). Reliable networks with unreliable sensors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6522 LNCS, pp. 281–292). https://doi.org/10.1007/978-3-642-17679-1_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free