Robustness and Performance Analysis of a Dynamic Sensor Network Scheduling Algorithm

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.