Performance Analysis of CGS, a k-Coverage Algorithm Based on One-Hop Neighboring Knowledge

Alexandre Pocquet (1, 2) , Bernard Cousin (3, 1) , Miklos Molnar (4, 1) , Patrice Parraud (2)

1 ATNET - Advanced Technolgy in Networking
2 MACCLIA - Laboratoire Méthodes Algébriques pour la Construction de Connaissances, les Logiques et l’Intelligence Artificielle [Guer]
3 UR - Université de Rennes
4 INSA Rennes - Institut National des Sciences Appliquées - Rennes

Controlled Greedy Sleep (CGS) is a recent k-coverage algorithm based on one-hop neighboring knowledge. This paper presents the Controlled Greedy Sleep algorithm and highlights its best use cases thanks to performance analysis. Studies have been performed within a ring topology. This specific topology enables CGS validation and the design of an energetic model. They are used to compare CGS performance results with the maximal performances that could be expected. The ring topology allows us to determine analytically the minimum, maximum and relative values of our performances criteria which are: the quality, the cost and the duration of the k-coverage. According to the previous criteria we show in this paper that CGS is before anything designed to guarantee the maximum quality of coverage. We prove the CGS robustness when there are message losses. We show that CGS relative performances are improved when the overdosing and the communication cost increase. This is mostly because sensors just need to send at most three CGS messages per period and only need to know their one-hop neighbors.

Mots clés: sensor network; coverage algorithm; energy consumption

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

Alexandre Pocquet, Bernard Cousin, Miklos Molnar, Patrice Parraud. Performance Analysis of CGS, a k-Coverage Algorithm Based on One-Hop Neighboring Knowledge. Second International Conference Sensor Technologies and Applications (SENSORCOMM '08), Aug 2008, Cap-Esterel, France. pp.115-122, ⟨10.1109/SENSORCOMM.2008.115⟩. ⟨hal-01184146⟩