Robust κ-coverage algorithms for sensor networks

G. Simon, Miklós Molnár, László Gönczy, Bernard Cousin

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Robustness, fault tolerance, and a long lifetime are key requirements of sensor networks used in real-world applications. Dense sensor networks with high sensor redundancy offer the possibility of redundant sensing and low duty-cycle operation at the same time; thus, the required robust sensing services can be provided along with an elongated lifetime. In this paper, the controlled greedy sleep algorithm is analyzed. With low local communication overhead, the proposed algorithm is able to solve the κ -coverage sensing problem while it effectively preserves energy in the network. In addition, it can adapt to dynamic changes in the network, such as node failures. The quality of service (networkwide κ-coverage) is guaranteed independently of communication errors in the network (as long as it is physically possible); message losses affect only the network lifetime. Node failures may cause a temporary decrease in the coverage service. The robustness of the algorithm is proven, and its behavior is illustrated by simulation examples.

Original languageEnglish
Pages (from-to)1741-1748
Number of pages8
JournalIEEE Transactions on Instrumentation and Measurement
Volume57
Issue number8
DOIs
Publication statusPublished - Aug 2008

Fingerprint

Sensor networks
sensors
Communication
Fault tolerance
life (durability)
Redundancy
Quality of service
communication
fault tolerance
sleep
Sensors
redundancy
messages
requirements
cycles
causes
simulation
Sleep
energy

Keywords

  • Distributed algorithms
  • Energy conservation
  • Fault tolerance
  • Protocols
  • Scheduling
  • Sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Instrumentation

Cite this

Robust κ-coverage algorithms for sensor networks. / Simon, G.; Molnár, Miklós; Gönczy, László; Cousin, Bernard.

In: IEEE Transactions on Instrumentation and Measurement, Vol. 57, No. 8, 08.2008, p. 1741-1748.

Research output: Contribution to journalArticle

Simon, G. ; Molnár, Miklós ; Gönczy, László ; Cousin, Bernard. / Robust κ-coverage algorithms for sensor networks. In: IEEE Transactions on Instrumentation and Measurement. 2008 ; Vol. 57, No. 8. pp. 1741-1748.
@article{92dc1bea97a046f1b6f306b704493084,
title = "Robust κ-coverage algorithms for sensor networks",
abstract = "Robustness, fault tolerance, and a long lifetime are key requirements of sensor networks used in real-world applications. Dense sensor networks with high sensor redundancy offer the possibility of redundant sensing and low duty-cycle operation at the same time; thus, the required robust sensing services can be provided along with an elongated lifetime. In this paper, the controlled greedy sleep algorithm is analyzed. With low local communication overhead, the proposed algorithm is able to solve the κ -coverage sensing problem while it effectively preserves energy in the network. In addition, it can adapt to dynamic changes in the network, such as node failures. The quality of service (networkwide κ-coverage) is guaranteed independently of communication errors in the network (as long as it is physically possible); message losses affect only the network lifetime. Node failures may cause a temporary decrease in the coverage service. The robustness of the algorithm is proven, and its behavior is illustrated by simulation examples.",
keywords = "Distributed algorithms, Energy conservation, Fault tolerance, Protocols, Scheduling, Sensor networks",
author = "G. Simon and Mikl{\'o}s Moln{\'a}r and L{\'a}szl{\'o} G{\"o}nczy and Bernard Cousin",
year = "2008",
month = "8",
doi = "10.1109/TIM.2008.922072",
language = "English",
volume = "57",
pages = "1741--1748",
journal = "IEEE Transactions on Instrumentation and Measurement",
issn = "0018-9456",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - Robust κ-coverage algorithms for sensor networks

AU - Simon, G.

AU - Molnár, Miklós

AU - Gönczy, László

AU - Cousin, Bernard

PY - 2008/8

Y1 - 2008/8

N2 - Robustness, fault tolerance, and a long lifetime are key requirements of sensor networks used in real-world applications. Dense sensor networks with high sensor redundancy offer the possibility of redundant sensing and low duty-cycle operation at the same time; thus, the required robust sensing services can be provided along with an elongated lifetime. In this paper, the controlled greedy sleep algorithm is analyzed. With low local communication overhead, the proposed algorithm is able to solve the κ -coverage sensing problem while it effectively preserves energy in the network. In addition, it can adapt to dynamic changes in the network, such as node failures. The quality of service (networkwide κ-coverage) is guaranteed independently of communication errors in the network (as long as it is physically possible); message losses affect only the network lifetime. Node failures may cause a temporary decrease in the coverage service. The robustness of the algorithm is proven, and its behavior is illustrated by simulation examples.

AB - Robustness, fault tolerance, and a long lifetime are key requirements of sensor networks used in real-world applications. Dense sensor networks with high sensor redundancy offer the possibility of redundant sensing and low duty-cycle operation at the same time; thus, the required robust sensing services can be provided along with an elongated lifetime. In this paper, the controlled greedy sleep algorithm is analyzed. With low local communication overhead, the proposed algorithm is able to solve the κ -coverage sensing problem while it effectively preserves energy in the network. In addition, it can adapt to dynamic changes in the network, such as node failures. The quality of service (networkwide κ-coverage) is guaranteed independently of communication errors in the network (as long as it is physically possible); message losses affect only the network lifetime. Node failures may cause a temporary decrease in the coverage service. The robustness of the algorithm is proven, and its behavior is illustrated by simulation examples.

KW - Distributed algorithms

KW - Energy conservation

KW - Fault tolerance

KW - Protocols

KW - Scheduling

KW - Sensor networks

UR - http://www.scopus.com/inward/record.url?scp=48749125336&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=48749125336&partnerID=8YFLogxK

U2 - 10.1109/TIM.2008.922072

DO - 10.1109/TIM.2008.922072

M3 - Article

AN - SCOPUS:48749125336

VL - 57

SP - 1741

EP - 1748

JO - IEEE Transactions on Instrumentation and Measurement

JF - IEEE Transactions on Instrumentation and Measurement

SN - 0018-9456

IS - 8

ER -