Self- distributed query region covering in sensor networks

In this paper, we design self-* novel solutions to the minimal connected sensor cover problem. The concept of self-* is used to include fault-tolerant properties like self-configuring, self-reconfiguring/self-healing, etc. We present two self-stabilizing, fully distributed, strictly localized, and s...

Full description

Saved in:
Bibliographic Details
Main Authors: Datta, A.K., Gradinariu, M., Linga, P., Raipin-Parvedy, P.
Format: Conference Proceeding
Language:English
Subjects:
Batteries
Computer science
Computer vision
Fault tolerance
Intelligent networks
Military computing
Personal digital assistants
Pervasive computing
Ubiquitous computing
Wireless sensor networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we design self-* novel solutions to the minimal connected sensor cover problem. The concept of self-* is used to include fault-tolerant properties like self-configuring, self-reconfiguring/self-healing, etc. We present two self-stabilizing, fully distributed, strictly localized, and scalable solutions, and show that these solutions are both self-configuring and self-healing. The proposed solutions are space optimal in terms of the number of states used per node. Another feature of the proposed algorithms is that the faults are contained only within the neighborhood of the faulty nodes. This paper also includes a comparison of the performance of the two proposed solutions in terms of the stabilization time, cover size metrics, and ability to cope with transient and permanent faults.
ISSN:1060-9857
2575-8462
DOI:10.1109/RELDIS.2005.27