Abstract
In this paper, a mobile cluster Ad Hoc network model is presented for scenarios with large nodes number and high mobility. Intelligent optimization algorithms perform better than traditional routing algorithms in such scenarios but papers about performance comparison of these algorithms are rare. So we pick the most widely used intelligent optimization algorithms ACO, PSO and GA and describe the routing search process of these three algorithms in detail. Then we analyze performance of them together with AODV for comparison. Simulation results show that ACO, PSO and GA algorithms perform better than AODV in average throughput, packet loss rate, success link rate and average link hop.
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
References
Xu, B., Hischke, S., Walke, B.: The role of Ad hoc networking in future wireless communications. In: Proceedings ICCT2003, pp. 1353–1358 (2003)
Sterbenz, J.P., Krishnan, R., Hain, R.R., et al.: Survivable mobile wireless networks: issues, challenges, and research directions. In: ACM International Conference on Proceedings of the 1st ACM Workshop on Wireless Security, pp. 31–40 (2002)
Baker, D., Ephremides, A.: The architectural organization of a mobile radio network via a distributed algorithm. Commun. IEEE Trans. 29(11), 1694–1701 (1981)
Yu, J., Chong, R.: A survey of clustering schemes for mobile ad hoc networks. IEEE Commun. Surv. Tutor. 7(1), 32–48 (2005)
Perkins, C., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: ACM SIGCOMM
RFC 3626. Optimized Link State Routing Protocol (OLSR). http://www.ietf.org/rfc/rfc3626.txt (2003)
Johnson, D., Maltz, D., Hu, Y.-C.: The dynamic source routing protocol for mobile Ad hoc networks (DSR). IETF Internet Draft, draft-ietf-manet-dsr-09.txt
Perkins, C., Belding-Royer, E., Das, S.: Ad hoc on-demand distance vector (AODV) Routing. IETF RFC 3561, July 2003
Barolli, A., Takizawa, M., Xhafa, F., et al.: Application of genetic algorithms for QoS routing in mobile Ad Hoc networks: a survey. In: 2010 International Conference on Broadband, Wireless Computing, Communication and Applications (2010)
Ping, Y., Ziyan, M., Minglai, Y.: Routing discovering based on ant colony algorithm in Ad Hoc networks. In: 2012 International Conference on Computer Science and Electronics Engineering (2012)
Hsiao, P.-C., Chiang, T.-C., Fu, L.-C.: Particle swarm optimization for the minimum energy broadcast problem in wireless Ad-Hoc networks. In: 2012 IEEE World Congress on Computational Intelligence (2012)
Acknowledgment
This work was supported by the National Science and Technology Major Specific Projects of China (Grant No. 2015ZX03004002-004) and the Fundamental Research Funds for the Central Universities (Grant No. HIT. NSRIF. 201616).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
He, C., Liang, T., Wei, S., Meng, W. (2018). Performance Analysis of Routing Algorithms Based on Intelligent Optimization Algorithms in Cluster Ad Hoc Network. In: Chen, Q., Meng, W., Zhao, L. (eds) Communications and Networking. ChinaCom 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 209. Springer, Cham. https://doi.org/10.1007/978-3-319-66625-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-66625-9_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66624-2
Online ISBN: 978-3-319-66625-9
eBook Packages: Computer ScienceComputer Science (R0)