Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01680400
Contributor : Miklos Molnar <>
Submitted on : Wednesday, January 10, 2018 - 4:26:48 PM
Last modification on : Tuesday, June 15, 2021 - 4:16:44 PM
Long-term archiving on: : Wednesday, May 23, 2018 - 5:09:46 PM

Identifiers

  • HAL Id : lirmm-01680400, version 1

Citation

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⟩

Share

Metrics

Record views

553

Files downloads

337