Research on MANET Routing Algorithm Based on Ant Colony Algorithm

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.

scholarly journals Reliable Ant Colony Routing Algorithm for Dual-Channel Mobile Ad Hoc Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
YongQiang Li ◽  
Zhong Wang ◽  
QingWen Wang ◽  
QingGang Fan ◽  
BaiSong Chen
Keyword(s):  
Ad Hoc Networks ◽  
Ant Colony Algorithm ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Path Selection ◽  
Ant Colony ◽  
Network Bandwidth ◽  
Dual Channel ◽  
Hoc Networks ◽  
Reliable Path

For the problem of poor link reliability caused by high-speed dynamic changes and congestion owing to low network bandwidth in ad hoc networks, an ant colony routing algorithm, based on reliable path under dual-channel condition (DSAR), is proposed. First, dual-channel communication mode is used to improve network bandwidth, and a hierarchical network model is proposed to optimize the dual-layer network. Thus, we reduce network congestion and communication delay. Second, a comprehensive reliable path selection strategy is designed, and the reliable path is selected ahead of time to reduce the probability of routing restart. Finally, the ant colony algorithm is used to improve the adaptability of the routing algorithm to changes of network topology. Simulation results show that DSAR improves the reliability of routing, packet delivery, and throughput.

scholarly journals ANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET)

2013 ◽  
pp. 218-223
Author(s):  
DWEEPNA GARG ◽  
PARTH GOHIL
Keyword(s):  
Swarm Intelligence ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Ant Colony Algorithms ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using centralized access points, infrastructure, or centralized administration. Routing means the act of moving information across an internet work from a source to a destination. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence. Ant colony algorithms are a subset of swarm intelligence and consider the ability of simple ants to solve complex problems by cooperation. The introduced routing protocol is well adaptive, efficient and scalable. The main goal in the design of the protocol is to reduce the overhead for routing. We refer to the protocol as the Ant Colony Optimization Routing (ACOR).

scholarly journals Optimized AODV Routing Algorithm in MANET for Maximizing the Network Lifetime

2019 ◽  
Vol 8 (2) ◽  
pp. 4054-4059
Keyword(s):  
Network Lifetime ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Experimental Phase ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Selection For ◽  
Hoc Networks ◽  
Optimal Cluster

In present scenario, Mobile Ad-hoc Networks (MANETs) is the emerging research topic in the applications like disaster situations (battle fields, earthquake, etc). The utility of MANET is increased by combining with the internet. The conventional techniques in MANET have a few issues like less infrastructure, standalone networks, and dynamic or complex topology. In order to address these issues, an efficient clustering and channeling algorithm (Hybrid K-means, Particle Swarm Optimization (PSO) based Ad-hoc On-demand Distance Vector (AODV) channeling algorithm) is developed for maximizing the network lifetime. The proposed algorithm finds the optimal cluster head selection for discovering the shortest path among the cluster heads. The Hybrid-K-means-PSO-AODV technique is applied to increase the Network Lifetime (NL), alive nodes, total packet send, throughput, and also to minimizes the dead nodes and energy consumption in a network. In the experimental phase, the proposed approach reduced the emery consumption up to 170 joules related to the existing approaches: PSO-PSO- MANETs and PSO-GSO- MANETs.

Research and Improvement of Clustering Routing Algorithm in Ad Hoc Network

2013 ◽  
Vol 834-836 ◽  
pp. 1087-1090
Author(s):  
Ping Zong ◽  
Jun Qin
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ant Colony Algorithm ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Routing Overhead ◽  
End To End Delay ◽  
The Impact ◽  
Network Scalability

With the expansion of the network, especially in the case of the nodes frequently moving, clustering routing protocol can reduce the impact of the changed topology on routing protocols, and improve the network scalability and reduce routing overhead. Based on the analysis of the problems of CBRP clustering routing protocol, this paper presents a CRBAC clustering routing algorithm based on ant colony algorithm. The simulation results show that, in the circumstance that the algorithm doesnt significantly increase the routing overhead, improved clustering routing protocol CRBAC get better performance than CBRP. They reflect on the clusters structure more reasonable and stable, the average end-to-end delay and network lifetime significantly improved.

Wireless Sensor Network Mobile Agent Routing Based on the Improved Ant Colony Algorithm

2014 ◽  
Vol 587-589 ◽  
pp. 2339-2345
Author(s):  
Jia Yan Li ◽  
Jun Ping Wang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Mobile Agent ◽  
Large Scale ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Redundant Data

This paper proposes a new wireless sensor routing algorithm by combining the ant colony algorithm with the mobile agent technology. This algorithm considers the distance and path energy overhead among nodes and residual node energy, equalizes the energy overhead in the network, improves the update rule of the ant colony information elements and speeds up convergence of the ant colony algorithm to get the optimal values. The simulation results indicate that this algorithm can improve the globalization and convergence speed, effectively reduce redundant data transmission and communication overhead, extend the network lifecycle and be very suitable for a large-scale wireless sensor network compared to other mobile agent routing algorithms.

Sign in / Sign up

Export Citation Format

Share Document