Abstract
The dynamic nature of mobile ad hoc networks makes it difficult to consider a specific model for their topology which might change in a short period of time. Using the knowledge about the location of nodes, several relatively efficient position based routing algorithms have been proposed but almost all of them are sensitive to the network topology. Ant colony optimization based routing algorithms form another family of routing algorithms that usually converge to optimum routes. In our previous work we proposed POSANT, a position based ant colony routing algorithm for mobile ad-hoc networks. Although POSANT outperforms other routing algorithms in most cases, there are network topologies in which POSANT does not perform well. In this paper we introduce HybNet, a hybrid ant colony optimization based routing algorithm for mobile ad hoc networks which adapts itself to different network topologies. We carry out an empirical analysis of the performance of our algorithm and compare it with other routing algorithms. Our results show that HybNet almost always performs efficiently, even in some complex and variable network topologies.
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.
Similar content being viewed by others
References
Bai, F., Helmy, A.: A survey of mobility modeling and analysis in wireless adhoc networks. In: Wireless Ad Hoc and Sensor Networks (2004)
Bose, P., Morin, P.: Competitive online routing in geometric graphs. Theoretical Computer Science, 273–288 (2004)
Camp, T., Boleng, J., Wilcox, L.: Location information services in mobile ad hoc networks. In: Proceedings of IEEE Conference on Communications, vol. 5, pp. 3318–3324 (2002)
Di Caro, G., Ducatelle, F., Gambardella, L.M.: Anthocnet: An adaptive nature-inspired algorithm for routing in mobile ad hoc networks. Special Issue on Self-Organisation in Mobile Networking 16, 443–455 (2005)
Di Caro, G., Dorigo, M.: Ant colonies for adaptive routing in packet-switched communications networks. In: Proceedings of the 5th ACM International Conference on Parallel Problem Solving from Nature, pp. 673–682 (1998)
Giordano, S., Stojmenovic, I., Blazevic, I.: Position based routing algorithms for ad hoc networks: A taxonomy. Ad Hoc Wireless Networking (2003)
Gunes, M., Sorges, U., Bouazizi, I.: Ara - the ant-colony based routing algorithm for manets. In: Proceedings of the 2002 International Conference on Parallel Processing Workshops, pp. 79–89 (2002)
Kamali, S., Opatrny, J.: Posant: a position based ant colony routing algorithm for mobile ad-hoc networks. In: ICWMC (2007)
Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: Proc. ACM/IEEE MobiCom conference, pp. 243–254 (2000)
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. of 11th Canadian Conference on Computational Geometry, August 1999, pp. 51–54 (1999)
Li, J., Jannotti, J., De Couto, D., Karger, D., Morris, R.: A scalable location service for geographic ad hoc routing. In: Proceedings of ACM/IEEE MOBICOM, pp. 120–130 (2000)
Yoo, J.-H., La, R., Makowski, A.: Convergence results for ant routing. In: Proceedings of CISS University of Princeton, Princeton, NJ (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Kamali, S., Opatrny, J. (2009). A Hybrid Ant-Colony Routing Algorithm for Mobile Ad-Hoc Networks. In: Zhou, J. (eds) Complex Sciences. Complex 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02469-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-02469-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02468-9
Online ISBN: 978-3-642-02469-6
eBook Packages: Computer ScienceComputer Science (R0)