AntNet Algorithm Research Articles

Packets routing and bandwidth sensing in a network traffic: Ant colony optimization tactic.

Packets routing and bandwidth sensing in a network platform remains an integral part of the study of signal flow.The algorithm to route packets in a network link called the AntNet algorithm was inspired by the behavior of real ant colonies. At each node in the network, a forward ant deposits some amount of pheromones at different links that responds to the node’s queue length. In this paper, we propose the inclusion of the computation of paths to adapt with the Depth Search Ant Explorer Network (DS-ANTENet) algorithm for discrete problems as an IP based mechanism. This method is tested and the efficiency is compared to the original AntNet algorithm and the Link-State algorithm to check the transmission of computing traffic flows between the nodes. We then made comparison with the algorithms proposed in the literature. The protocols were sorted out in terms of average number of lost packets ranging from the higher priority queue to the lower priority queue which then resulted to the fact that; First, AntNetBW (loss ratios reduction of 9.6% when compared to the AntNet and the Link-State algorithm respectively. Secondly, SANTENetBW (loss ratios reduction of 8.3% and 36.7% when compared to the AntNet and the Link-State algorithm respectively. Finally, DS-ANTENet (loss ratios reduction 0.7% and 33.2% when compared to the AntNet and the Link- State algorithm respectively.Keywords: Packets Routing, Bandwidth Sensing, Network Traffic, Ant Colony Optimization Algorithm, AntNet

ACO-based biology inspired routing protocol for ad hoc networks

The task of routing packets is hard in ad hoc networks because there is no central control over the network elements. In any network, the data packets have to be routed to the destination with minimum data loss, minimum delay and maximum packet delivery ratio. Therefore, there must be an efficient algorithm which satisfies all these qualities of service requirements. In this paper, we propose a biology-inspired ant routing protocol based on ant colony optimisation (ACO) called as optimised AntNet with location awareness functionality (OANTLOC). In this technique, the distance between the current node and neighbouring node is calculated using the range difference technique to transmit the packets, hence overcomes the drawbacks of AntNet algorithm which considers only cumulative probability for packet transmission. Our proposed algorithm also outperforms primitives reactive routing protocols in terms of the average end to end delay, average throughput, packet delivery ratio and route cost.

Performance Analysis of AntNet-LA Protocol for Ad-hoc Networks based on Disaster Area Mobility Model

Availability of cheap positioning instruments like GPS receivers makes it possible for routing algorithms to use the position of nodes in an ad hoc mobile network. Regular position based routing algorithms fail to find a route from a source to a destination in some cases when the network contains nodes with irregular transmission ranges or they find a route that is much longer than the shortest path. On the other hand routing algorithms based on Ant Colony Optimization (ACO) find routing paths that are close to the shortest paths even if the nodes in the network have different transmission ranges. The drawback of these algorithms is the large number of messages that needs to be sent or the long delay before the routes are established. In this paper, we propose a novel protocol AntNet-LA which combines the idea of ACO with information about position of all nodes. In this technique the distance between the nodes is considered to transmit the packets, hence overcomes the drawbacks of AntNet algorithm which considers only cumulative probability for packet transmission. We compare performance of AntNet-LA with AntNet, Ad-hoc On Demand Distance Vector (AODV), Ad-hoc On Demand Multipath Distance Vector (AOMDV), Dynamic Source Routing (DSR) and Destination-Sequenced Distance-Vector Routing (DSDV) protocols. We also compare performance of AntNet-LA with distance-aware protocols such as Location Aided Routing (LAR), Geographical AODV GeoAODV and Position Based ANT colony optimization (PBANT).

Simulation of Route Optimization with load balancing Using AntNet System

This paper is based on analysis of the performance of load balancing and route optimization in computerized networks. The complete system model shows the scenario of Packet distribution between nodes, and if congestion occurs due to traffic then Packet to be failed. The model used the AntNet system for simulate the network. The simulation runs on the ant's behavior for the load balancing of the network. The ants travel across the network between alternative chosen pairs of nodes; as they travel they deposit pheromones from their source node, collect the information of the route and the traffic congestion encountered on their journey. They select their path at each next node according the distribution of pheromones at each node. Packets between nodes are routed of the pheromone distributions at each next node. The performance of the network is proportional to packets which are failed. This model also shows the adaptivity of the system; the nodes are removed from the network, system finds the alternative chosen paths without system degradation and controls the performance of routing. Keywords- AntNet Algorithm, Ant Colony Optimization (ACO), Routing, Load Balancing, Dynamic, Adaptive, Simulation, Communication Networks.

An efficient innovative method to decrease routing table size in packet switched networks

Appropriate routing for supporting the requirements of various high quality applications emerged in current communication networks is a challenging problem that can lead to improved routing algorithms. Taking into consideration the highly distributed character of networks, numerous multi-agent based algorithms, and particularly ant colony based algorithms, have been proposed in recent years. However, considering the need for decreasing overhead and increasing the scalability of these algorithms remains an elusive challenge. Our goal here is to reduce the overhead and the process complexity in nodes by decreasing the size of routing tables of network nodes in an innovative manner. More specifically, data routing tables which are established in the AntNet algorithm and keep the information of all destination nodes in network convert to tables that only keep the information of popular destinations of network. The resulting algorithm, the ‘‘D-T-SAntNet,’’ is then simulated via Omnet++ onUUNET network topology. The network performance is evaluated under various node-failure and node added conditions. Statistical analysis of results confirms that the new method can significantly reduce the average packet delivery time and rate of convergence to the optimal route when compared with standard AntNet.

Threshold based AntNet algorithm for dynamic traffic routing of road networks

Dynamic routing algorithms play an important role in road traffic routing to avoid congestion and to direct vehicles to better routes. AntNet routing algorithms have been applied, extensively and successfully, in data communication network. However, its application for dynamic routing on road networks is still considerably limited. This paper presents a modified version of the AntNet routing algorithm, called “Threshold based AntNet”, that has the ability to efficiently utilize a priori information of dynamic traffic routing, especially, for road networks. The modification exploits the practical and pre-known information for most road traffic networks, namely, the good travel times between sources and destinations. The values of those good travel times are manipulated as threshold values. This approach has proven to conserve tracking of good routes. According to the dynamic nature of the problem, the presented approach guards the agility of rediscovering a good route. Attaining the thresholds (good reported travel times), of a given source to destination route, permits for a better utilization of the computational resources, that, leads to better accommodation for the network changes. The presented algorithm introduces a new type of ants called “check ants”. It assists in preserving good routes and, better yet, exposes and discards the degraded ones. The threshold AntNet algorithm presents a new strategy for updating the routing information, supported by the backward ants.

The effect of AntNet parameters on its performance

AntNet is a routing algorithm which takes advantage of the way ants help each other to find food sources faster. Ants’ communication in this respect is indirect by leaving pheromone trails as they move. The richness and thickness of the trail is proportional to the number of ants that have passed. This method of indirect courtesy guidance by affecting the environment is called stigmergy. Many network parameters that affect the performance of AntNet algorithm. However, there is little works on AntNet parameter analysis. In this paper we examine the effect of AntNet parameters on its performance. Simulation is used to estimate performance measures. Results show that changing one specific parameter may not lead to an improvement in performance unless other parameters are also changed, accordingly. Key words: Routing algorithm, AntNet, AntNet performance parameter, agent.

Link State Generation Using Antnet Algorithm

Link State Generation Using Antnet Algorithm

Secure Antnet Routing Algorithm for Scalable Adhoc Networks Using Elliptic Curve Cryptography

The secure end-to-end route discovery in the decentralized Mobile Adhoc Networks (MANETs) should have to meet the requirements of prevention of DoS attacks on data traffic, should be adaptive and fault tolerant and must have high speed, low energy overhead and scalability for future development. In this research a secure routing using antnet mechanism and mutual authentication using Elliptic Curve Cryptography (ECC) has been proposed to meet the above requirements. The common perception of public key cryptography is that it is not well suited for adhoc networks as they are very complex and slow. Against this popular belief, this research implements Elliptic Curve Cryptography -a public key cryptography scheme. ECC provides a similar level of security to conventional integer-based public-key algorithms, but with much shorter keys. Because of the shorter keys ECC algorithms run faster, require less space and consume less energy. These advantages make ECC a better choice of public key cryptography, especially for a resource constrained systems like MANETs. Using the antnet routing algorithm, the highly trustable route will be selected for data transfer and each Mobile Node (MN) in MANET maintains the trust value of its one-hop neighbors. The mutual authentication between source and destination is done by master key exchange using Elliptic Curve Cryptography (ECC). v

Performance analysis of the AntNet algorithm

A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks . However, there has been little work on the performance analysis of ant-routing algorithms. In this paper, we compare the performance of AntNet, an ant-routing algorithm, with Dijkstra’s shortest path algorithm . Our simulations show that the performance of AntNet is comparable to Dijkstra’s shortest path algorithm. Moreover, under varying traffic loads, AntNet adapts to the changing traffic and performs better than shortest path routing .

Helping ants for adaptive network routing

Appropriate routing in data transfer is a challenging problem that can lead to improved performance of networks in terms of lower delay in delivery of packets and higher throughput. Considering the highly distributed nature of networks, several multi-agent based algorithms, and in particular ant colony based algorithms, have been suggested in recent years. However, considering the need for quick optimization and adaptation to network changes, improving the relative slow convergence of these algorithms remains an elusive challenge. Our goal here is to reduce the time needed for convergence and to accelerate the routing algorithm's response to network failures and/or changes by imitating pheromone propagation in natural ant colonies. More specifically, information exchange among neighboring nodes is facilitated by proposing a new type of ant (helping ants) to the AntNet algorithm. The resulting algorithm, the “modified AntNet,” is then simulated via NS2 on NSF network topology. The network performance is evaluated under various node-failure and node-added conditions. Statistical analysis of results confirms that the new method can significantly reduce the average packet delivery time and rate of convergence to the optimal route when compared with standard AntNet.

Adding more intelligence to the network routing problem: AntNet and Ga-agents

AntNet and GA-agent algorithms are benchmarked against a series of dynamic network routing problems. Performance is characterized using multiple performance metrics on the Japanese backbone (NTTNET). NTTNET is used on account of the elongated topology presenting a more challenging routing problem than in the case of the American backbone, which is basically square. The AntNet scheme is found to provide the best routing ability providing global information is available and network security is not a factor. The GA-agent algorithm is shown to provide routing performance between the AntNet algorithm with global information and that without, whilst avoiding global information requirements and satisfying typical models of network security.

Improved AntNet routing

AntNet is a new algorithm for packet routing in communication networks. In AntNet, a group of mobile agents (artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging data to update routing tables.This work, based in a previous work of the author [3], analyzes AntNet algorithms and proposes improvements, comparing their performance with respect to the original AntNet and other commercial algorithms. Simulation results indicate a better throughput of the improved proposals. So, AntNet and its variant here proposed are promising options for routing in large public networks such as Intemet.