Abstract
Since data communications consume the most energy of sensor networks, it is reasonable to take efficient traffic balancing to prolong the lifetime. In addition, the traffic aggregation is a main characteristic that distinguish sensor networks from others e.g. Internet and MANET. Therefore, an optimal traffic distribution will maximize the network lifetime. Furthermore, sensor networks are generally developed for special applications. If different sensor networks deployed in the same region can cooperate with each other in data transmission, their lifetimes can be improved remarkably. In this paper, we propose a genetic algorithm to achieve optimal traffic distribution on multi-sensor networks and show its efficiency by experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhardwaj, M., Chandrakasan, A., Garnett, T.: Upper Bounds on the Lifetime of Sensor Networks. In: IEEE International Conference on Communications, Helsinki (June 2001)
Bhardwaj, M., Chandrakasan, A.: Bounding the Lifetime of Sensor Networks Via Optimal Role Assignments. In: IEEE INFOCOM (2002)
Duarte-Melo, E.J., Liu, M., Misra, A.: A Modeling Framework for Computing Lifetime and Information Capacity in Wireless Sensor Networks. Modeling and Optimization in Mobile. In: Ad Hoc and Wireless Networks, Cambridge, UK (March 2004)
Rai, V., Mahapatra, R.N.: Lifetime Modeling of a Sensor Network. In: Design, Automation and Test in Europe, Munich, Germany (March 2005)
Chang, J.-H., Tassiulas, L.: Routing for Maximum System Lifetime in Wireless Ad-hoc Networks. In: 37th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL (September 1999)
Chang, J.-H., Tassiulas, L.: Energy conserving routing in wireless ad-hoc networks. In: IEEE INFOCOM 2000 (2000)
Sankar, Z.L.: Maximum Lifetime Routing in Wireless Ad-hoc Networks. In: INFOCOM 2004 (2004)
Dasgupta, K., Kalpakis, K., Namjoshi, P.: Efficient Algorithms for Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks. Computer Networks 42 (2003)
Madan, R., Lall, S.: Distributed Algorithms for Maximum Lifetime Routing in Wireless Sensor Networks. In: Global Telecommunications Conference, November 2004, vol. 2, IEEE, Los Alamitos (2004)
Xue, Y., Cui, Y., Nahrstedt, K.: Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks, http://cairo.cs.uiuc.edu/publications/paper-files/xue-monet.pdf
Estrin, D., Srivastava, M.: Wireless Sensor Networks (Tutorial). In: Proceedings of ACM MobiCom 2002, Atlanta, Georgia, USA (2002)
Garcia-Luna-Aceves, J.J., Fullmer, C.L., Madruga, E.: Wireless mobile internetworking (Manuscript)
Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D., Anderson, J.: Wireless Sensor Networks for Habitat Monitoring. In: ACM International Workshop on Wireless Sensor Networks and Applications (2002)
Winter, G., Periaux, J., Galan, M.: Genetic Algorithms in Engineering and Computer Science. John Wiley & Son Ltd., Chichester (1995)
Darrell Whitley, L., Vose, M.D.: Foundations of Genetic Algorithms, vol. 3. Morgan Kaufmann Publishers Inc., San Francisco (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pan, Y., Peng, W., Lu, X. (2006). A Genetic Algorithm on Multi-sensor Networks Lifetime Optimization. In: Cheng, X., Li, W., Znati, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2006. Lecture Notes in Computer Science, vol 4138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814856_29
Download citation
DOI: https://doi.org/10.1007/11814856_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37189-2
Online ISBN: 978-3-540-37190-8
eBook Packages: Computer ScienceComputer Science (R0)