A simple coverage-evaluating approach for wireless sensor networks with arbitrary sensing areas

Authors:
GaoJun Fan;ShiYao Jin
Affiliations:
National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, ChangSha 410073, HuNan Province, PR China;National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, ChangSha 410073, HuNan Province, PR China
Venue:
Information Processing Letters
Year:
2008

Citing 3
Cited 2

The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Localized Sensor Area Coverage with Low Communication Overhead

PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications

An approach to finding weak regions for wireless sensor networks with arbitrary sensing areas

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Multiple coverage with controlled connectivity in wireless sensor networks

Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a simple and fast deterministic solution to the area coverage problem in wireless sensor networks. The task is to determine whether all points in a region are covered by a given set of sensors, where each sensor may have any arbitrary sensing shape. We transform the area coverage problem to the intersection points' coverage problem, which is simpler and more suitable for evaluating the area coverage problem than previous approaches in our view.