Integrated Coverage and Connectivity in Wireless Sensor Networks: A Two-Dimensional Percolation Problem

Authors:
Habib M. Ammari;Sajal K. Das
Affiliations:
The University of Texas at Arlington, Arlington;The University of Texas at Arlington, Arlington
Venue:
IEEE Transactions on Computers
Year:
2008

Citing 0
Cited 8

Review: Coverage and connectivity issues in wireless sensor networks: A survey

Pervasive and Mobile Computing
Iterative maximum likelihood on networks

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Vector method based coverage hole recovery in wireless sensor networks

COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Review: From wireless sensor networks towards cyber physical systems

Pervasive and Mobile Computing
Limited mobility coverage and connectivity maintenance protocols for wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards a better understanding of large-scale network models

IEEE/ACM Transactions on Networking (TON)
On the optimal random deployment of wireless sensor networks in non-homogeneous scenarios

Ad Hoc Networks
First passage time and first passage percolation models for analysing network resilience and effective strategies in strategic information warfare research: a brief survey and perspective

International Journal of Information and Computer Security

Quantified Score

Hi-index	14.98

Visualization

Abstract

Abstract: While sensing coverage reflects the surveillance quality provided by a wireless sensor network (WSN), network connectivity enables data gathered by sensors to reach a central node, called the sink. Given an initially uncovered field and as more and more sensors are continuously added to a WSN, the size of partial covered areas increases. At some point, the situation abruptly changes from small fragmented covered areas to a single large covered area. We call this abrupt change as the sensing-coverage phase transition (SCPT). Also, given an originally disconnected WSN and as more and more sensors are added, the number of connected components changes such that the WSN suddenly becomes connected at some point. We call this sudden change as the network-connectivity phase transition (NCPT). The nature of such phase transitions is a central topic in percolation theory of Boolean models. In this paper, we propose a probabilistic approach to compute the covered area fraction at critical percolation for both of the SCPT and NCPT problems. Because sensing coverage and network connectivity are not totally orthogonal, we also propose a model for percolation in WSNs, called correlated disk model, which provides a basis for solving the SCPT and NCPT problems together.