Dependable k-coverage algorithms for sensor networks

Simon Gyula (1, 2) , Miklos Molnar (3) , Laszlo Gonczy (2) , Bernard Cousin (3)

1 DCS - Department of Computer Science - University of Pannonia
2 DMIS - Deptartment of Measurement and Information Systems [Budapest]
3 IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires

Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same time high sensor redundancy offers the possibility of increasing network lifetime by scheduling sleep intervals for some sensors and still providing continuous service with help of the remaining active sensors. In this paper centralized and distributed algorithms are proposed to solve the k-coverage sensing problem and maximize network lifetime. When physically possible, the proposed robust Controlled Greedy Sleep Algorithm provides guaranteed service independently of node and communication errors in the network. The performance of the algorithm is illustrated and compared to results of a random solution by simulation examples.

Mots clés: dependable network; k-coverage; sensor network; sleep scheduling; network lifetime; fault tolerance

Domaines: Réseaux et télécommunications [cs.NI]

Simon Gyula, Miklos Molnar, Laszlo Gonczy, Bernard Cousin. Dependable k-coverage algorithms for sensor networks. IEEE Instrumentation and Measurement Technology Conference, May 2007, Varsovie, Poland. pp.ISSN: 1091-5281, ⟨10.1109/IMTC.2007.379153⟩. ⟨hal-00180768⟩