Abstract
The network lifetime is a fundamental criterion for evaluating WSNs. Receiving and sending data packets consume energy so judicious routing strategies can effectively extend operational time. The ant colony optimization algorithm, known as ACO, is a probabilistic technique for solving computational problems. In this paper, an ACO-based routing algorithm called PACO is proposed. We take three factors into consideration. First of all, the hops are to be minimized. Additionally, energy distance is defined and needs minimizing. We also define the popularity of the sensors given the necessity to avoid those nodes that are used too often while routing. The definition of the lifetime and energy model is discussed as well. By conducting the simulation, it is proved that PACO outperforms other ACO routing algorithms, indicating that PACO is a promising routing algorithm for prolonging the lifetime of WSNs.
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
Simon, G., Maroti, M., Ledeczi, A., Balogh, G., Kusy, B., Nadas, A., Pap, G., Sallai, J., Frampton, K.: Sensor network-based countersniper system. In: Proceedings of the Second International Conference on Embedded Networked Sensor Systems (Sensys), Baltimore, MD (2004)
Dorigo, M., Birattari, M., Stutzle, T.: Ant Colony Optimization. IEEE Computational Intelligence Magazine, 28–39 (November 2006)
Saleh, S., et al.: A survey on energy awareness mechanisms in routing protocols for wireless sensor networks using optimization methods. Transactions on Emerging Telecommunications Technologies (2013)
Ok, C.-S., et al.: Distributed energy balanced routing for wireless sensor networks. Computers & Industrial Engineering 57(1), 125–135 (2009)
Tang, X., et al.: Energy - efficient multicast routing scheme for wireless sensor networks. Transactions on Emerging Telecommunications Technologies (2013)
Saleem, M., Di Caro, G.A., Farooq, M.: Swarm intelligence based routing protocol for wireless sensor networks: Survey and future directions. Information Sciences 181(20), 4597–4624 (2011)
Di Caro, G., Ducatelle, F., Gambardella, L.M.: AntHocNet: an adaptive nature inspired algorithm for routing in mobile ad hoc networks. European Transactions on Telecommunications 16(2) (2005)
Camilo, T., Carreto, C., Silva, J., Boavida, F.: An Energy-Efficient Ant-Based Routing Algorithm for Wireless Sensor Networks. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 49–59. Springer, Heidelberg (2006)
Lin, Y., et al.: An ant colony optimization approach for maximizing the lifetime of heterogeneous wireless sensor networks. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 42(3), 408–420 (2012)
Zhong, J., Hu, X., Gu, M., Zhang, J.: Comparison of performance between different selection strategies on simple genetic algorithms. IEEE Computational Intelligence 2 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Su, Y., Li, J., Qin, Z., Wang, L., Zhang, W. (2014). Maximizing the Network Lifetime by Using PACO Routing Algorithm in Wireless Sensor Networks. In: Sun, L., Ma, H., Hong, F. (eds) Advances in Wireless Sensor Networks. CWSN 2013. Communications in Computer and Information Science, vol 418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54522-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-54522-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54521-4
Online ISBN: 978-3-642-54522-1
eBook Packages: Computer ScienceComputer Science (R0)