Performance analysis of routing algorithms based on intelligent optimization algorithms in cluster Ad Hoc network

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

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 Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 209, pp. 129–137). Springer Verlag. https://doi.org/10.1007/978-3-319-66625-9_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free