ACO Based QoS Routing Algorithm for Wireless Sensor Networks

  • Wenyu Cai
  • Xinyu Jin
  • Yu Zhang
  • Kangsheng Chen
  • Rui Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4159)


In this paper, we proposed an approach for Quality of Service (QoS) routing algorithm of Wireless Sensor Networks (WSNs) based on Ant Colony Optimization (ACO). The special characteristics of WSNs need to reduce the computational complexity and energy consumption of the QoS routing algorithm especially. We note that ACO algorithm using collective intelligence of artificial ants as intelligent agents is very appropriate to solve the combinatorial optimization problems in a fully distributed way, so in this paper we use modified ACO approach to solve Delay Constraint Maximum Energy Residual Ratio (DCMERR) QoS routing problem of WSNs. The QoS routing solution proposed in this manuscript, which is named as ACO based QoS routing algorithm (ACO-QoSR), searches for the best paths, which are satisfied with the QoS requirements with intelligent artificial ants. To overcome the problem of limited energy in WSNs, there are some modifications to enhance ACO’s convergence rate. ACO-QoSR algorithm is the tradeoff between a certain guaranteed QoS requirements and acceptable computational complexity. The simulation results verify that ACO-QoSR algorithm can reduce the selected paths’ delay and improve the selected paths’ normalized energy residual ratio at the similar levels of routing overhead.


Sensor Node Wireless Sensor Network Packet Delivery Ratio Route Discovery Acceptable Computational Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akyildiz, F., Su, W., Sankarasubramaniam, Y., et al.: A survey on sensor networks. IEEE communication Magazine, 102–114 (August 2002)Google Scholar
  2. 2.
    Zhang, B., Mouftah, H.T.: QoS routing for wireless ad hoc networks: problems, algorithms, and protocols. IEEE Communications Magazine 43(10), 110–117 (2005)CrossRefGoogle Scholar
  3. 3.
    Colorni, A., Dorigo, M., Maniezzo, V., et al.: Distributed optimization by ant colonies. In: Proceedings of ECAL 1991 (European Conference on Artificial Life), Paris, France, pp. 134–142 (1991)Google Scholar
  4. 4.
    Caro, G.D., Dorigo, M.: AntNet: A Mobile Agents Approach to Adaptive Routing. University Libre de Bruxelles, Belgium, Technical report IRIDIA/97-12 (1997)Google Scholar
  5. 5.
    Schoondenvoerd, R., Holland, O., Bruten, J., et al.: Ant-based load balancing in telecommunications networks. Adaptive Behavior, pp. 169–207 (May 1997)Google Scholar
  6. 6.
    Camap, D., Loureiro, A.A.F.: A GPS/Ant-Like Routing Algorithm for Ad Hoc Networks. In: IEEE Wireless Communications and Networking Conference (WCNC 2000), Chicago, IL (September 2000)Google Scholar
  7. 7.
    Marwaha, S., Tham, C.K., Srinivasan, D.: Mobile Agents based Routing Protocol for Mobile Ad hoc Networks. In: IEEE Global Telecommunications Conference (GLOBECOM 2002), Taipei, Taiwan, November 17-21 (2002)Google Scholar
  8. 8.
    Gunes, M., Sorges, U., Bouazizi, I.: ARA-The Ant-Colony Based Routing Algorithm for MANETs. In: International Conference on Parollel Processing Workshops (ICPPW 2002), Vancouver, B.C., Canada, pp. 79–85 (August 2002)Google Scholar
  9. 9.
    Guin, R., Orda, A.: QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms. In: Proceedings of the INFOCOM 1997. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, April 09-11, p. 75 (1997)Google Scholar
  10. 10.
    Feng, G., et al.: Performance Evaluation of Delay-Constrained Least-Cost Routing Algorithms Based on Linear and Nonlinear Lagrange Relaxation. In: Proc. of ICC 2002, New York (2002)Google Scholar
  11. 11.
    Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, London (1982)MATHGoogle Scholar
  12. 12.
    VINT: The Network Simulator ns-2 [CP/OL] (2003-06-10),
  13. 13.
    Perkins, C., Royer, E.: Ad-hoc On-Demand Distance Vector Routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (February 1999)Google Scholar
  14. 14.
    Perkins, C.E., Bhagwat, P.: Highly Dynamic Destination -Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In: Proc. of the SIGCOMM 1994 Conference on Communications, Architectures Protocols and Applications, August 1994, pp. 234–244 (1994)Google Scholar
  15. 15.
    Rappaport, T.S.: Wireless communication: Principles and Practice, pp. 69–122. Prentice-Hall, Englewood Cliffs (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Wenyu Cai
    • 1
  • Xinyu Jin
    • 1
  • Yu Zhang
    • 1
  • Kangsheng Chen
    • 1
  • Rui Wang
    • 1
  1. 1.Department of Information Science & Electronic Engineering, College of Information Science & EngineeringZhejiang UniversityHangzhouChina

Personalised recommendations