Distributed Self-Minimum Connected Covering of a Query Region in Sensor Networks

Authors:
Ajoy K. Datta;Rajesh Patel;Maria Gradinariu
Affiliations:
UNLV;UNLV;IRISA/Universite Rennes 1 France
Venue:
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Year:
2005

Citing 0
Cited 5

Self* minimum connected covers of query regions in sensor networks

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Minimum perimeter coverage of query regions in a heterogeneous wireless sensor network

Information Sciences: an International Journal
A family of simple distributed minimum connected dominating set-based topology construction algorithms

Journal of Network and Computer Applications
Mobility-assisted minimum connected cover in a wireless sensor network

Journal of Parallel and Distributed Computing
Minimum connected cover of a query region in heterogeneous wireless sensor networks

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless ad-hoc sensor networks are composed of a large number of tiny sensors that have limited resources and yet must form a connected network. A group of sensors is said to cover a certain region when the union of the sensing disks of these sensors completely cover this region. Given a query over a sensor network the minimum connected sensor cover problem is to select a minimum, or nearly minimum, set of sensors such that the selected sensors cover the query region and form a connected network. One proposed solution for the minimum connected sensor cover problem can be to first form a minimum connected dominating set (MCDS), and then to include all sensors in the MCDS in the final cover set. In this paper, we use this approach to present a fully distributed, strictly localized, scalable, self-solution to the minimum connected sensor cover problem.