Ant Colony System Based Dynamic Routing In A Network
Nimish Singh2013
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
There has been a lot of research on the application of Swarm Intelligence to the problem of adaptive routing in telecommunications networks in the recent past. A large number of algorithms have been proposed for different types of networks, including wired networks and wireless ad hoc networks. In this paper we focus on the application of Swarm Intelligence design to one particular class of optimization problems, namely adaptive routing in telecommunications networks .We discuss both the principles underlying the research and the practical applications that have been proposed. Then we present Ant Colony Routing Algorithm which is used for evaluating minimum cost function for a given network which is adaptive.
Related papers
Principles and applications of swarm intelligence for adaptive routing in telecommunications networks
In the past few years there has been a lot of research on the application of swarm intelligence to the problem of adaptive routing in telecommunications networks. A large number of algorithms have been proposed for different types of networks, including wired networks and wireless ad hoc networks. In this paper we give an overview of this research area. We address both the principles underlying the research and the practical applications that have been proposed. We start by giving a detailed description of the challenges in this problem domain, and we investigate how swarm intelligence can be used to address them. We identify typical building blocks of swarm intelligence systems and we show how they are used to solve routing problems. Then, we present Ant Colony Routing, a general framework in which most swarm intelligence routing algorithms can be placed. After that, we give an extensive overview of existing algorithms, discussing for each of them their contributions and their relative place in this research area. We conclude with an overview of future research directions that we consider important for the further development of this field.
Ant Colony Optimization and its application to adaptive routing in telecommunication networks
In ant societies, and, more in general, in insect societies, the activities of the individuals, as well as of the society as a whole, are not regulated by any explicit form of centralized control. On the other hand, adaptive and robust behaviors transcending the behavioral repertoire of the single individual can be easily observed at society level. These complex global behaviors are the result of self-organizing dynamics driven by local interactions and communications among a number of relatively simple individuals. The simultaneous presence of these and other fascinating and unique characteristics have made ant societies an attractive and inspiring model for building new algorithms and new multi-agent systems. In the last decade, ant societies have been taken as a reference for an ever growing body of scientific work, mostly in the fields of robotics, operations research, and telecommunications.
Theory and practice of Ant Colony Optimization for routing in dynamic telecommunications networks
2007
Telecommunications networks are becoming increasingly large, dynamic, and heterogeneous. The global Internet is rapidly evolving toward a highly complex system which comprises and integrates a number of wired and wireless networks covering the needs of different community of users and ranging from small body area networks to global satellite networks.
Swarm intelligence based approach for routing in mobile Ad Hoc networks
2011
Mobile Ad Hoc Networks (MANETs) are built up of a collection of mobile nodes which have no fixed infrastructure. The nodes communicate through wireless network and there is no central control. Routing is the task of directing data packets from a source node to a given destination. This task is particularly complex due to the dynamic topology, limited process and storing capability, bandwidth constraints and lack of the central control. Ants routing resembles basic mechanisms from distributed Swarm Intelligence (SI) in biological systems and turns out to become an appealing solution when routing becomes a crucial problem in a complex network scenario, where traditional routing techniques either fail completely or at least face intractable complexity. Ants based routing is gaining more popularity because of its adaptive and dynamic nature. A number of Swarm Intelligence (SI) based, more specially Ant Colony Optimization (ACO) based routing algorithms are proposed by researchers. In this paper, we discuss the basic routing technique of biological insects like ants and present an overview of all the ACO based proposed routing algorithms.
Ant Colony Optimization for Dynamic Routing in Wireless Computer Networks for Improvement in Quality of Services
International Journal of Computer Applications, 2013
Dynamic Routing Assignment (DRA) is a key problem in intelligent optical computer networks. Mathematicians & Computer Scientists started researching the behavior of ants in the early 1990's to find new routing algorithms. The most efficient & widest AI techniques like Swarm particle optimization and Ant colony optimization (ACO) are used to find out solutions for dynamic problems. Ant Colony Optimization (ACO) and in the case of well implemented ACO techniques, optimal performance is comparative to existing top-performing routing algorithms. Such a research has yielded ways to minimize the number of nodes that are taken to get to the destination, techniques for quickly resolving an efficient path, and ways to avoid having loops within a routing scheme. Simulation shows that the modified algorithm decreases the blocking probability and increases the resources utilization comparing with the traditional algorithms.
Enhanced ant colony based algorithm for routing in mobile ad hoc network
Proceedings of World Academy of …, 2008
Mobile Ad hoc network consists of a set of mobile nodes. It is a dynamic network which does not have fixed topology. This network does not have any infrastructure or central administration, hence it is called infrastructure-less network. The change in topology makes the route from source to destination as dynamic fixed and changes with respect to time. The nature of network requires the algorithm to perform route discovery, maintain route and detect failure along the path between two nodes [1]. This paper presents the enhancements of ARA [2] to improve the performance of routing algorithm. ARA [2] finds route between nodes in mobile ad-hoc network. The algorithm is on-demand source initiated routing algorithm. This is based on the principles of swarm intelligence. The algorithm is adaptive, scalable and favors load balancing. The improvements suggested in this paper are handling of loss ants and resource reservation.
A survey paper on Ant Colony Optimization Routing algorithm for selecting Multiple Feasible Paths for Packet Switched Networks
ACO algorithms for datagram networks was given by Di Caro & Dorigo, in year 1996. Basic mechanisms in typical ACO routing algorithms is Ant-like agents are proactively generated at the nodes to find/check paths toward assigned destinations Ants move hop-by-hop according to a exploratory routing policy based on the local routing .After reaching their destination, ants retrace their path and update nodes routing information according to the quality of the path. Routing information is statistical estimates of the time-to-go to the destination maintained in pheromone arrays. Data are probabilistically spread over the paths according to their estimated quality as stored in the pheromone variables.
Enhanced Routing System for Packet-Switched Network Using Ant Colony Optimization Algorithm
IJCAT - International Journal of Computing and Technology, 2020
Network communication is a process that involves the technique of routing for delivering the packet by choosing an optimal path from one network to another. One of the major challenges that require attention in network communication is the problem of finding the optimal routing path for packets movement. The problem usually arises in a packet-switched network as the size of the network increases, thereby making routing becomes more complex due to the number of nodes in the network. Thus there is need to develop a better routing algorithm to provide effective traffic routing system that can update their path by finding the optimal network nodes that will allow effective and fast access to the network within a real-time interval. This paper developed an improved routing system by application of a natured inspired metaheuristic algorithm to reduce the routing congestion problems. Experimental results showed that the shortest path (1-2-3-4) had the lowest average delay time of 2.03s with packet size of 56mb, while the 64mb with the shortest path (1-2-4-5-3-6) gave the lowest path congestion ratio of 43.
OPTANT-Optimized Ant Colony Routing For Mobile Ad-Hoc Networks
Mobile Ad hoc Network is a dynamic network where the nodes move frequently over time. Since they are mobile in nature they do not possess any standard topology. Communication between nodes happen hop-based. There may be single hop or multi hop communications. Due to non-centralized nature, the nodes in the network are prone to various difficulties. While there are various protocols that promise Routing in MANET, finding a path that satisfy user's Quality of Service requirement remain a challenge. This paper study the use of Swarm based algorithms and propose an algorithm OPTANT that is inspired by Ant Colony Optimization. The proposed algorithm is compared with other bio-inspired existing algorithms and the results are found favorable.
ARA - The Ant-Colony Based Routing Algorithm for MANETs
2002
A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kind of networks are very flexible, thus they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. 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.
Related topics
Related papers
Ant-Hoc: A swarm intelligence-based routing protocol for Ad Hoc networks
A mobile ad hoc network (MANET) is a collection of wireless mobile nodes communicating with each other using multi-hop wireless links without any existing network infrastructure or centralized administration. One of the main challenges MANET is the design of robust routing algorithms that adapt to the frequent and randomly changing network topology. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs. In this paper, we propose a new routing protocol for MANETs called Ant-Hoc which based on ACO, proactive and reactive routing protocol capability. Using the simulation model with a dynamic network size and an invariable pause time which should be zero under weakest case because a longer pause time of the node may be insignificant for MANET with frequently and fast moving nodes. Furthermore, based on the QoS, routing load and the connectivity, this paper systematically discuses the performance evaluation and comparison of Ant-Hoc and three typical routing protocols of MANETs with the different simulation model and metrics. Results indicate that Ant-Hoc effectively improve the connectivity, packet delivery ratio and reduce the end-to-end delay as compared with the AntNet, AODV and DSDV routing protocols.
A Survey of Ant Colony Optimization Based Routing Protocols for Mobile Ad Hoc Networks
IEEE Access
Developing highly efficient routing protocols for Mobile Ad hoc NETworks (MANETs) is a challenging task. In order to fulfill multiple routing requirements, such as low packet delay, high packet delivery rate, and effective adaptation to network topology changes with low control overhead, and so on, new ways to approximate solutions to the known NP-hard optimization problem of routing in MANETs have to be investigated. Swarm intelligence (SI)-inspired algorithms have attracted a lot of attention, because they can offer possible optimized solutions ensuring high robustness, flexibility, and low cost. Moreover, they can solve large-scale sophisticated problems without a centralized control entity. A successful example in the SI field is the ant colony optimization (ACO) meta-heuristic. It presents a common framework for approximating solutions to NP-hard optimization problems. ACO has been successfully applied to balance the various routing related requirements in dynamic MANETs. This paper presents a comprehensive survey and comparison of various ACO-based routing protocols in MANETs. The main contributions of this survey include: 1) introducing the ACO principles as applied in routing protocols for MANETs; 2) classifying ACO-based routing approaches reviewed in this paper into five main categories; 3) surveying and comparing the selected routing protocols from the perspective of design and simulation parameters; and 4) discussing open issues and future possible design directions of ACO-based routing protocols. INDEX TERMS ACO, ACO based routing, swarm intelligence, MANETs.
Swarm intelligence for routing in mobile ad hoc networks
2005
Mobile ad hoc networks are communication networks built up of a collection of mobile devices, which can communicate through wireless connections. Routing is the task of directing data packets from a source node to a given destination. This task is particularly hard in mobile ad hoc networks: due to the mobility of the network elements and the lack of central control, routing algorithms should be robust, adaptive, and work in a decentralized and self-organizing way. In this paper, we describe an algorithm, which draws inspiration from swarm intelligence to obtain these characteristics. More specifically, we borrow ideas from ant colonies and from the ant colony optimization framework. In an extensive set of simulation tests, we compare our routing algorithm with a state-of-the-art algorithm, and show that it gets better performance over a wide range of different scenarios and for a number of different evaluation measures. In particular, we show that it scales better with the number of nodes in the network.
SWARM INTELLIGENCE BASED DYNAMIC SOURCE ROUTING FOR IMPROVED QUALITY OF SERVICE
Ad hoc networks are wireless mobile hosts collections forming a temporary network without any infrastructure/centralized administration. So a mobile host is required to enlist the help of other hosts to forward packets to destination because of each mobile host's limited range of wireless transmission. The paper presents a protocol for routing in ad hoc networks using Dynamic Source Routing (DSR) and Swarm Intelligence based on Ant Colony Optimization (ACO) to optimize the node pause time. The simulation results shows that the improved performance of routing in the network.
Swarm Based Intelligence Routing Algorithm(Ant Colony
The basis of the algorithm Swarm Intelligence (SI) Protocol, gives idea to difficult and intelligent characteristic through simple, non centralized and unsupervised interactions between a large sheer of autonomous swarm intelligent members. The algorithm ant colony optimization algorithm is popular due to its dynamic and adaptive nature in the real time system. It is concerened mainly with ants which find the shortest routing path to food by secreting a substance called pheromone. All the other ants follow the initial ant which took the shortest path from source to destination. When a obstacle or disturbance is faced by any other ant, further finds a new shortest path from source to destination and all other ants follow the new ant.
A Survey of Various Ant Colony Optimization based Routing Protocols for Mobile Ad hoc Networks
International Journal of Computer Applications, 2019
Routing in MANET (Mobile Ad hoc Network) is a challenging task because of the mobile nature of the nodes in a network and topology changes very often and developing effective routing protocols for MANET is also a highly challenging task. To fulfil the multiple routing requirements as low control overhead, low packet delay, high packet delivery rate and adapting effectively to network topology changes and so on, are the issues which are emerging. Amidst lots of problems which are found to be NP-hard in routing, new ways to find approximate solutions have to be investigated. A lot of attention was attracted by Swarm intelligence inspired algorithms which are based on the Ant Colony Optimization meta heuristic technique because they can offer optimized solutions ensuring low control overhead, robustness etc. and presents framework for approximating solutions to NP-hard problems. This paper includes 1) Introducing the ACO technique and its principles 2) Various ACO based routing protocols 3) summary and conclusion.
A Review of Ant Colony based Routing Algorithm in Wireless Ad-hoc Networks
2013
mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kinds of networks are very flexible, thus they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. 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 on-demand routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence and especially on the ant colony based meta heuristic. These approaches try to map the solution capability of swarms to mathematical and engineering problems. The introduced routing protocol is highly adaptive, efficient and scalable. The main goal in the design of the protocol was to reduce the overhead for routing. We refer to the protocol as the Ant-Colony-Based Routing Algorithm (ARA). Keywords—Power, ...
Ant colonies for adaptive routing in packet-switched communications networks
Parallel Problem Solving from NaturePPSN V, 1998
In this paper we present AntNet, a novel adaptive approach to routing tables learning in packet-switched communications networks. AntNet is inspired by the stigmergy model of communication observed in ant colonies. We present compelling evidence that AntNet, when measuring performance by standard measures such as network throughput and average packet delay, outperforms the current Internet routing algorithm (OSPF), some old Internet routing algorithms (SPF and distributed adaptive Bellman-Ford), and recently proposed forms of asynchronous online Bellman-Ford (Q-routing and Predictive Q-routing).
Performance Evaluation of Ant Colony Optimization Based Routing Algorithms for Mobile Ad Hoc Networks
Mobile Ad Hoc Network is a collection of autonomous mobile nodes that communicate with each other over wireless links without any fixed infrastructure. The nodes use the service of other nodes in the network to transmit packets to destinations that are out of their range. Such networks are expected to play increasingly important role in future organizations, University, Civilian and Military settings, being useful for providing communication support where no fixed infrastructure exists. Also, in case of disaster or natural calamities, the deployment of a fixed infrastructure is neither feasible nor economically profitable for establishing communication among the rescue members. In order to accomplish this, a number of routing protocols are being proposed by researchers. Ants based routing is gaining more popularity because of its adaptive and dynamic nature. A number of Swarm Intelligence (SI) based, more specially Ant Colony Optimization (ACO) based routing algorithms are proposed by researchers. Each one is based on different characteristics and properties. In this paper, we take up three ACO based algorithms and simulate the proposed algorithms using NS-2 and compare the performance matrices as Packet Delivery Fraction (PDF), throughput and routing overhead for varying simulation time.
A Survey of Ant Colony Based Routing Algorithms for Manet
European Scientific Journal, 2014
A Mobile ad hoc network (MANET) is a collection of wireless mobile nodes which dynamically join the network and cooperate with each other for multi-hop communication in absence of infrastructure or centralized administration. Routing in MANET is specially challenging due to the variation of network characteristic like traffic load and topology may vary in stochastic and time varying manner. Swarm Intelligence (SI) based techniques such as Ant Colony Optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for ad hoc networks. Ant based routing algorithms are based on the foraging behaviour of ants. In recent years several ant colony optimization based algorithms were introduced to solve multi constraint QoS routing problems of ad hoc network. They are more robust, reliable and scalable compared to the conventional routing algorithms available in ad hoc network. In this paper, survey of various ant based routing algorithms is done and have been summarize with various attributes to provide a status of research work done in this field.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.