Ant Colony Optimization (ACO) Based MANET Routing Protocols: A Comprehensive Review | Zendy

Ahmad Khader Habboush | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Ant Colony Optimization (ACO) Based MANET Routing Protocols: A Comprehensive Review

Author(s) -

Ahmad Khader Habboush

Publication year - 2019

Publication title -

computer and information science

Language(s) - English

Resource type - Journals

eISSN - 1913-8997

pISSN - 1913-8989

DOI - 10.5539/cis.v12n1p82

Subject(s) - computer science , bottleneck , mobile ad hoc network , computer network , network packet , ant colony optimization algorithms , routing protocol , field (mathematics) , routing (electronic design automation) , link state routing protocol , popularity , distributed computing , artificial intelligence , embedded system , psychology , social psychology , mathematics , pure mathematics

Application of mobile ad hoc networks (MANETs) has gained significant popularity among researchers in the field of data communication networks. However, a MANET operating in a wireless environment imposes a number of challenges for the implementers so far as routing of packets across it is concerned. There is a wide range of research contributions are available in the literature wherein authors propose various solutions to overcome the problems and bottleneck related to routing in MANET. Especially soft computing techniques and Ant Colony Optimization (ACO) in particular has been significantly popular among the researchers to resolve MANET routing issues. This technique plays a vital role in route discovery in particular. In this paper, we have conducted a comprehensive review of this technique applied to routing in MANET with respect to various criteria. Hopefully this paper serves to a perfect document for researchers in this field.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research