Robustness and Performance Analysis of a Dynamic Sensor Network Scheduling Algorithm - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2008

Robustness and Performance Analysis of a Dynamic Sensor Network Scheduling Algorithm

Abstract

This paper presents the robustness and performance anal- ysis of the Controlled Greedy Sleep algorithm, which was designed to provide k-coverage in wireless sensor networks. The aim of this algorithm is to prolong network lifetime while ensuring QoS requirements in a dynamic manner. We investigated how the network can be strenghtened to im- prove performance characteristics, and how this algorithm ensures graceful degradation (i.e., how the network will pro- vide less accurate measurement data as sensors become un- available). We also test the robustness of the algorithm by measuring the effect of message loss due to communication errors. We compare the results to those of a very known and frequently used random algorithm. Our performance tests are based on simulations results.
Fichier principal
Vignette du fichier
FTDNA.pdf (232.68 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-01680400 , version 1 (10-01-2018)

Identifiers

  • HAL Id : lirmm-01680400 , version 1

Cite

Miklos Molnar, Gyula Simon, László Gönczy. Robustness and Performance Analysis of a Dynamic Sensor Network Scheduling Algorithm. FTDA-DN: Future Trends on Design and Analysis of Dynamic Networks, Jul 2008, Hong-Kong, China. ⟨lirmm-01680400⟩
438 View
216 Download

Share

Gmail Mastodon Facebook X LinkedIn More