Sensor density for complete information coverage in wireless sensor networks

Authors:
Bang Wang;Kee Chaing Chua;Vikram Srinivasan;Wei Wang
Affiliations:
Department of Electrical and Computer Engineering (ECE), National University of Singapore (NUS), Singapore;Department of Electrical and Computer Engineering (ECE), National University of Singapore (NUS), Singapore;Department of Electrical and Computer Engineering (ECE), National University of Singapore (NUS), Singapore;Department of Electrical and Computer Engineering (ECE), National University of Singapore (NUS), Singapore
Venue:
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Year:
2006

Citing 4
Cited 6

A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
On deriving the upper bound of α-lifetime for large sensor networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
On k-coverage in a mostly sleeping sensor network

Proceedings of the 10th annual international conference on Mobile computing and networking

Energy-efficient coverage for target detection in wireless sensor networks

Proceedings of the 6th international conference on Information processing in sensor networks
p-Percent Coverage in Wireless Sensor Networks

WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Sensor scheduling for p-percent coverage in wireless sensor networks

Cluster Computing
Coverage problems in sensor networks: A survey

ACM Computing Surveys (CSUR)
Maximizing Lifetime of Target Coverage in Wireless Sensor Networks Using Learning Automata

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor. This is a conservative definition of coverage and we have previously proposed a new notion of information coverage. Compared with the conventional definition of coverage, a point can still be information covered even if it is not within the sensing disk of any sensor. The density requirements for complete information coverage of a field are analyzed and simulated for a random sensor deployment. Our results show that significant savings in terms of sensor density can be achieved with information coverage.