Abstract
In this paper we introduce the maximum lifetime sensor clustering (MLSC) protocol for calculating the upper bound on the lifetime of a sensor network. The new protocol can maximize the K-of-N network lifetime. Also, a novel genetic clustering algorithm is introduced to form optimal clusters. Simulation results show that our model can extend the sensor network lifetime to five times over that of existing approaches.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: Energy-Efficient Communication Protocols for Wireless Microsensor Networks. In: Proc. of the Hawaiian Int’l Conf. on Systems Science (January 2000)
Lindsey, S., Raghavendra, C.S.: PEGASIS: Power Efficient GAthering in Sensor Information Systems. In: 2002 IEEE Aerospace Conference, March 2002, pp. 1–6 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qin, M., Zimmermann, R. (2005). Studying Upper Bounds on Sensor Network Lifetime by Genetic Clustering. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds) Distributed Computing in Sensor Systems. DCOSS 2005. Lecture Notes in Computer Science, vol 3560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11502593_40
Download citation
DOI: https://doi.org/10.1007/11502593_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26422-4
Online ISBN: 978-3-540-31671-8
eBook Packages: Computer ScienceComputer Science (R0)