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

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.

Download Full-text

A Novel Approach to Comparative Analysis of Legacy and Nature Inspired Ant Colony Optimization based Routing Protocol in MANET

Journal of Southwest Jiaotong University ◽

10.35741/issn.0258-2724.54.4.18 ◽

2019 ◽

Vol 54 (4) ◽

Cited By ~ 1

Author(s):

Ibrahim Ahmed Alameri

Keyword(s):

Ant Colony Optimization ◽

Routing Protocols ◽

Large Scale ◽

Ad Hoc ◽

Mobile Ad Hoc Network ◽

Ant Colony ◽

Novel Approach ◽

Manet Routing ◽

Mobile Ad Hoc ◽

Hoc Networks

Performance, scalability, Quality of Service (QoS), users’ response, etc. of any network depends upon the efficient network design and communication technologies being exploited. Mobile Ad hoc Networks (MANETs) have become widespread due to their zero-configuration requirements, scalability, maintenance and adaptable nature to cater varying requirements. The core process of any network is routing which is performed by routing protocols. Routing protocols play a crucial role to enhance and improve the performance indicators of any network. Traditional MANET routing protocols have been failed to address growing demands of wireless mobile ad hoc network. In this paper we study and compare a nature inspired Ant Colony Optimization (ACO) algorithm with legacy of MANET protocols. Simulation results show that ACO algorithm has high potential to be used in large scale MANET or other wireless networks. We compared ACO with proactive and reactive routing protocols because despite of their weaknesses these types of protocols are still being used in different and same wireless arrangements.

Download Full-text

Ant colony optimization applied in Ad Hoc network routing

Journal of Computer Applications ◽

10.3724/sp.j.1087.2011.00332 ◽

2011 ◽

Vol 31 (2) ◽

pp. 332-334

Author(s):

Shao-qiong ZHOU ◽

Yi XU ◽

Li JIANG ◽

Rui WANG

Keyword(s):

Ant Colony Optimization ◽

Ad Hoc Network ◽

Ad Hoc ◽

Network Routing ◽

Ant Colony

Download Full-text

Research on MANET Routing Algorithm Based on Ant Colony Algorithm

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.135-136.781 ◽

2011 ◽

Vol 135-136 ◽

pp. 781-787

Author(s):

Yong Feng Ju ◽

Hui Chen

Keyword(s):

Network Lifetime ◽

Ant Colony Algorithm ◽

Ad Hoc ◽

Routing Algorithm ◽

Packet Transmission ◽

Ant Colony ◽

Dynamic Allocation ◽

Routing Table ◽

Manet Routing ◽

Rate Dynamic

This paper proposed a new Ad Hoc dynamic routing algorithm, which based on ant-colony algorithm in order to reasonably extend the dynamic allocation of network traffic and network lifetime. The Algorithm choose path according transmission latency, path of the energy rate, congestion rate, dynamic rate. The Algorithm update the routing table by dynamic collection of path information after path established. The analyse shows that algorithm increases the network throughput, reduces the average end-to-end packet transmission latency, and extends the network lifetime, achieves an improving performance.

Download Full-text

Hybrid ant colony optimization for capacitated multiple-allocation cluster hub location problem

Artificial intelligence for engineering design analysis and manufacturing ◽

10.1017/s0890060417000221 ◽

2017 ◽

Vol 32 (1) ◽

pp. 44-58 ◽

Cited By ~ 3

Author(s):

Mohammad Mirabi ◽

Parya Seddighi

Keyword(s):

Ant Colony Optimization ◽

Location Problem ◽

Demand Management ◽

Telecommunication Networks ◽

Ant Colony ◽

Hub Location ◽

Hub Location Problem ◽

Total Cost ◽

Wide Range ◽

Cost Of Transportation

AbstractThe hub location problems involve locating facilities and designing hub networks to minimize the total cost of transportation (as a function of distance) between hubs, establishing facilities and demand management. In this paper, we consider the capacitated cluster hub location problem because of its wide range of applications in real-world cases, especially in transportation and telecommunication networks. In this regard, a mathematical model is presented to address this problem under capacity constraints imposed on hubs and transportation lines. Then, a new hybrid algorithm based on simulated annealing and ant colony optimization is proposed to solve the presented problem. Finally, the computational experiments demonstrate that the proposed heuristic algorithm is both effective and efficient.

Download Full-text