Robustness and performance analysis of a dynamic sensor network scheduling algorithm
Article No.: 52, Pages 1 - 6
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.
References
[1]
N. Ahmed, S. S. Kanhere, and S. Jha. The holes problem in wireless sensor networks: a survey. SIGMOBILE Mob. Comput. Commun. Rev., 9(2):4--18, 2005.
[2]
H. M. Ammari and S. K. Das. On computing conditional fault-tolerance measures for k-covered wireless sensor networks. In MSWiM '06: Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems, pages 309--316, New York, NY, USA, 2006. ACM Press.
[3]
G. Anastasi, A. Falchi, A. Passarella, M. Conti, and E. Gregori. Performance measurements of motes sensor networks. In MSWiM '04: Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems, pages 174--181, New York, NY, USA, 2004. ACM Press.
[4]
L. S. Brakmo, D. A. Wallach, and M. A. Viredaz. Sleep: a technique for reducing energy consumption in handheld devices. In MobiSys '04: Proceedings of the 2nd international conference on Mobile systems, applications, and services, pages 12--22, New York, NY, USA, 2004. ACM Press.
[5]
B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris. Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. Wirel. Netw., 8(5):481--494, 2002.
[6]
C.-F. Chiasserini and M. Garetto. Modeling the performance of wireless sensor networks. In INFOCOM, 2004.
[7]
A. S.-V. Farinaz Koushanfar, Miodrag Potkonjak. Fault tolerance in wireless ad-hoc sensor networks. In Proceedings of IEEE Sensors 2002, June 2002.
[8]
A. Ghosh and S. K. Das. Coverage and connectivity issues in wireless sensor networks. pages 221--256. John Wiley, 2006.
[9]
C. Huang and Y. Tseng. The coverage problem in a wireless sensor network. In WSNA '03: Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications, pages 115--121, New York, NY, USA, 2003. ACM Press.
[10]
R. Krashinsky and H. Balakrishnan. Minimizing energy for wireless web access with bounded slowdown. In MobiCom '02: Proceedings of the 8th annual international conference on Mobile computing and networking, pages 119--130, New York, NY, USA, 2002. ACM Press.
[11]
S. Kumar, T. H. Lai, and J. Balogh. On k-coverage in a mostly sleeping sensor network. In MobiCom '04: Proceedings of the 10th annual international conference on Mobile computing and networking, pages 144--158, New York, NY, USA, 2004. ACM Press.
[12]
B. Liu and D. Towsley. A study of the coverage of large-scale sensor networks. In Proceedings of the 1st IEEE Int. Conf. on Mobile Ad-hoc and Sensor Systems, MASS, 2004.
[13]
M. Liu and C. Hsin. Network coverage using low duty-cycled sensors: Random and coordinated sleep algorithms, 2004.
[14]
F. G. Nakamura, F. P. Quintao, G. C. Menezes, and G. R. Mateus. An optimal node scheduling for flat wireless sensor networks. In ICN 2005, LNCS 3420, pages 459--466, 2005.
[15]
G. Simon, M. Molnár, L. Gönczy, and B. Cousin. Robust k-coverage algorithms for sensor networks. Special Issue of the IEEE Transactions on Instrumentation and Measurement, August 2008.
[16]
G. Simon, P. Völgyesi, M. Maróti, and A. Lédeczi. Simulation-based optimization of communication protocols for large-scale wireless sensor networks. In IEEE Aerospace Conference, 2003.
[17]
G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill. Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Trans. Sen. Netw., 1(1):36--72, 2005.
Index Terms
- Robustness and performance analysis of a dynamic sensor network scheduling algorithm
Recommendations
Radius reconfiguration for energy conservation in sensor networks
The sensing range of a sensor node significantly affects its energy consumption. This study focuses on allowing each sensor to dynamically adjust its sensing radius so that the global coverage of the whole detecting area remains unchanged, while ...
TTS: a two-tiered scheduling mechanism for energy conservation in wireless sensor networks
In this paper, we present a two-tiered scheduling approach for effective energy conservation in wireless sensor networks. The effectiveness of this mechanism relies on dynamically updated two-tiered scheduling architecture. We aim to prolong network ...
Achieving long-term surveillance in VigilNet
Energy efficiency is a fundamental issue for outdoor sensor network systems. This article presents the design and implementation of multidimensional power management strategies in VigilNet, a major recent effort to support long-term surveillance using ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)
Brussels, Belgium
Publication History
Published: 28 July 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
QShine08
Sponsor:
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 113Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in