Skip to main content

Advertisement

Springer Nature Link
Log in

Overlapping particle swarms for energy-efficient routing in sensor networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Sensor networks are traditionally built using battery-powered, collaborative devices. These sensor nodes do not rely on dedicated infrastructure services (e.g., routers) to relay data. Rather, a communal effort is employed where the sensor nodes both generate data as well as forward data for other nodes. A routing protocol is needed in order for the sensors to determine viable paths through the network, but routing protocols designed for wired networks and even ad hoc networks are not sufficient given the energy overhead needed to operate them. We propose an energy-aware routing protocol, based on overlapping swarms of particles, that offers reliable path selection while reducing the energy consumption for the route selection process. Our particle-based routing with overlapping swarms for energy-efficiency algorithm shows promise in extending the life of battery-powered networks while still providing robust routing functionality to maintain network reliability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Akkaya, K., & Younis, M. (2005). A survey on routing protocols for wireless sensor networks. Ad Hoc Networks, 3(3), 325–349.

    Article  Google Scholar 

  2. Al-Karaki, J. N., & Kamal, A. E. (2004). Routing techniques in wireless sensor networks: A survey. IEEE Wireless Communications, 11(6), 6–28.

    Article  Google Scholar 

  3. Beyens, P., Peeters, M., Steenhaut, K., & Nowe, A. (2005). Routing with compression in wireless sensor networks: A q-learning approach. In Proceedings of the fifth symposium on adaptive agents and multi-agent systems. AAMAS: Paris, France.

  4. Blum, B., He, T., Son, S., & Stankovic, J. (2003). Igf: A state-free robust communications protocol for wireless sensor networks. Tech. report, University of Virginia.

  5. Brits, R., Engelbrecht, A. P., & van den Bergh, F. (2007). Locating multiple optima using particle swarm optimization. Applied Mathematics and Computation, 189, 1859–1883.

    Article  MathSciNet  MATH  Google Scholar 

  6. Brown, T. X. (2000). Low power wireless communication via reinforcement learning. Advances in Neural Information Processing Systems (NIPS), 12, 893–899.

    Google Scholar 

  7. Di Caro, G., & Dorigo, M. (1998). Antnet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research, 9, 316–365.

    Google Scholar 

  8. Di Caro, G., Ducatelle, F., & Gambardella, L. M. (2005). Swarm intelligence for routing in mobile ad hoc networks. Proceedings of the 2005 IEEE Swarm Intelligence Symposium, SIS 2005, pp. 76–83.

  9. Dorigo, M., & Stützle, T. (2004). Ant colony optimization. Cambridge: The MIT Press.

    Book  MATH  Google Scholar 

  10. GhasemAghaei, R., Rahman, A., Gueaieb, W., & El Saddik, A. (2007). Ant colony-based reinforcement learning algorithm for routing in wireless sensor networks. Proceedings of the 2007 IEEE instrumentation and measurement technology conference, IMTC 2007, pp. 1–6, May 2007.

  11. Heissenbüttel, M., Braun, T., Bernoulli, T., & Wälchli, M. (2004). Blr: Beacon-less routing algorithm for mobile ad hoc networks. Computer Communications, 27(11), 1076–1086.

    Article  Google Scholar 

  12. Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., & Silva, F. (2003). Directed diffusion for wireless sensor networking. IEEE/ACM Transactions on Networking, 11(1), 2–16.

    Article  Google Scholar 

  13. Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, 4, 1942–1948.

    Article  Google Scholar 

  14. Littman, M., & Boyan, J. (1993). A distributed reinforcement learning scheme for network routing. In Proceedings of the international workshop on applications of neural networks to telecommunications (pp. 45–51). Hillsdale, NJ.: Lawrence Erlbaum Associates.

  15. Melo, A., & Coello, J. M. A. (2000). Packet scheduling based on learning in the next generation internet architectures. Fifth IEEE symposium on computers and communications, ISCC 2000, 00:773.

  16. Nie, N., & Comaniciu, C. (2006). Energy efficient aodv routing in cdma ad hoc networks using beamforming. EURASIP Journal on Wireless Communications and Networking, 2, 14–14.

    Google Scholar 

  17. Pappa, K., Athanasopoulos, A., Topalis, E., & Koubias, S. (2007). Implementation of power aware features in aodv for ad hoc sensor networks. A simulation study. IEEE conference on emerging technologies and factory automation, ETFA, pp. 1372–1375, Sept. 2007.

  18. Perkins, C. E., & Royer, E. M. (1999). Ad-hoc on-demand distance vector routing. Proceedings of the second IEEE workshop on mobile computing systems and applications, WMCSA ’99, pp. 90–100.

  19. Peshkin, L., & Savova, V. (2002). Reinforcement learning for adaptive routing. Proceedings of the International Joint Conference on Neural Networks, IJCNN ’02, 2, 1825–1830

  20. Shah, R. C., & Rabaey, J. M. (2002). Energy aware routing for low energy ad hoc sensor networks. 2002 IEEE Wireless Communications and Networking Conference, WCNC ’02, 1, 350–355 vol.1.

  21. Tumer, K., & Wolpert, D. (2000). Collective intelligence and braess’ paradox. In Proceedings of the AAAI conference on innovative applications of artificial intelligence, pp. 104–109.

  22. USC/ISI. (2007). The network simulator ns-2. URL http://www.isi.edu/nsnam/ns/.

  23. Wang, P., & Wang, T. (2006). Adaptive routing for sensor networks using reinforcement learning. Sixth IEEE international conference on computer and information technology, CIT’06, 0:219.

  24. Wang, X., Wang, S., & Ma, J. -J. (2007). An improved co-evolutionary particle swarm optimization for wireless sensor networks with dynamic deployment. Sensors, 7(3), 354–370.

    Article  Google Scholar 

  25. Watkins, C. (1989). Learning from delayed rewards. Ph. D thesis, Cambridge: King’s College.

  26. Xue, Y., Lee, H. S., Yang, M., Kumarawadu, P., Ghenniwa, H. H., & Shen, W. (2007). Performance evaluation of ns-2 simulator for wireless sensor networks. 2007 Canadian conference on electrical and computer engineering, CCECE 2007, pp. 1372–1375.

  27. Zhang, H., & Shen, H. (2010). Energy-efficient beaconless geographic routing in wireless sensor networks. IEEE transactions on parallel and distributed systems, 21, 881–896. ISSN 1045-9219. doi:http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.98.

  28. Zhang, X. & Xu, W. (2006). QoS based routing in wireless sensor network with particle swarm optimization, Vol. 4088/2006 (pp. 602–607). Berlin/Heidelberg: Springer.

    Google Scholar 

Download references

Acknowledgment

We would like to thank Steve Butcher, Ben Mitchell, Ian Nowland, Chuck Robertson, Pat Donnelly, Omar Zaidan, and the anonymous reviewers for their feedback and suggestions that greatly improved the initial version of this work.

Author information

Authors and Affiliations

  1. Department of Computer Science, The Johns Hopkins University, 3400 N. Charles Street, Baltimore, MD, 21218, USA

    Brian K. Haberman

  2. Department of Computer Science, Montana State University, 357 EPS Building, Bozeman, MT, 59717, USA

    John W. Sheppard

Authors
  1. Brian K. Haberman
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. John W. Sheppard
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Brian K. Haberman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haberman, B.K., Sheppard, J.W. Overlapping particle swarms for energy-efficient routing in sensor networks. Wireless Netw 18, 351–363 (2012). https://doi.org/10.1007/s11276-011-0404-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-011-0404-1

Keywords