Research Article
Robustness and Performance Analysis of a Dynamic Sensor Network Scheduling Algorithm
@INPROCEEDINGS{10.4108/ICST.QSHINE2008.4091, author={Mikl\^{o}s Moln\^{a}r and Gyula Simon and L\^{a}szl\^{o} G\o{}nczy}, title={Robustness and Performance Analysis of a Dynamic Sensor Network Scheduling Algorithm}, proceedings={1st International ICST Workshop on Future Trends on Design and Analysis of Dynamic Networks}, publisher={ACM}, proceedings_a={FTDA-DN}, year={2010}, month={5}, keywords={sensor networks energy conservation coverage}, doi={10.4108/ICST.QSHINE2008.4091} }- Miklós Molnár
Gyula Simon
László Gönczy
Year: 2010
Robustness and Performance Analysis of a Dynamic Sensor Network Scheduling Algorithm
FTDA-DN
ICST
DOI: 10.4108/ICST.QSHINE2008.4091
Abstract
This paper presents the robustness and performance analysis 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 improve performance characteristics, and how this algorithm ensures graceful degradation (i.e., how the network will provide less accurate measurement data as sensors become unavailable). 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.
