Ant Colony Based Routing Algorithm Research Articles

Energy efficient multipath ant colony based routing algorithm for mobile ad hoc networks

This paper describes the novel wireless routing protocol made for mobile ad hoc networks or wireless sensor networks using the bio-inspired technique. Bio-inspired algorithms include the routing capabilities taken from the social behavior of ant colonies, bird flocking, honey bee dancing, etc and promises to be capable of catering to the challenges posed by wireless sensors. Some of the challenges of wireless sensor networks are limited bandwidth, limited battery life, low memory, etc. An energy-efficient multipath routing algorithm based on the foraging nature of ants is proposed including many meta-heuristic impact factors to provide good robust paths from source to destination to overcome the challenges faced by resource-constrained sensors. Analysis of individual impact factor is represented which justifies their importance in routing performance. The multi-path routing feature is claimed by showing energy analysis as well as statistical analysis in-depth to the readers. The proposed routing algorithm is analyzed by considering various performance metrics such as throughput, delay, packet loss, network lifetime, etc. Finally, the comparison is done against AODV routing protocol by considering performance metrics where the proposed routing algorithm shows a 49% improvement in network lifetime.

A Routing Algorithm Based an Ant Colony, Local Search and Fuzzy Inference to Improve Energy Consumption in Wireless Sensor Networks

Wireless sensor network is a new generation of networks in which the main aim is to collect data from the surrounding environment of network sensors. The major differences of wireless sensor networks with other networks are limited energy resources and relatively low processing capabilities. Therefore, managing power and reducing energy consumption are of great importance in these networks. In this paper, there was presented a mechanism for Wireless sensor network routing which can be more effective regarding the criteria of route length, end–to–end delay and network node energy for the quality of mechanism service. The proposed method used ant colony–based routing algorithm and local enquiry to find optimal routes. Also, a fuzzy inference system was used to determine the route quality which showed better performance compared with equation of route quality. The results of simulating mechanism showed that energy consumption and network efficiency had improved compared with those of previous methods. DOI: http://dx.doi.org/10.11591/ijece.v3i5.3628

Congestion-aware ant colony based routing algorithms for efficient application execution on Network-on-Chip platform

Networks-on-Chip (NoC) is an interesting option in design of communication infrastructures for embedded systems. It provides a scalable structure and balanced communication between the cores. Parallel applications that take advantage of the NoC architectures, are usually are communication-intensive. Thus, a big deal of data packets is transmitted simultaneously through the network. In order to avoid congestion delays that deteriorate the execution time of the implemented applications, an efficient routing strategy must be thought of carefully. In this paper, the ant colony optimization paradigm is explored to find and optimize routes in a mesh-based NoC. The proposed routing algorithms are simple yet efficient. The routing optimization is driven by the minimization of total latency during packets transmission between the tasks that compose the application. The presented performance evaluation is threefold: first, the impact of well-known synthetic traffic patterns is assessed; second, randomly generated applications are mapped into the NoC infrastructure and some synthetic communication traffics, that follow known patterns, are used to simulate real situations; third, sixteen real-world applications of the E3S and one specific application for digital image processing are mapped and their execution time evaluated. In both cases, the obtained results are compared to those obtained with known general purpose algorithms for deadlock free routing. The comparison avers the effectiveness and superiority of the ant colony inspired routing.

Energy-Efficient Ant-Colony-Based Routing Algorithm for the MANETs

Routing in MANET is a challenging problem as a result of highly dynamic topology as well as bandwidth and energy constraints. Many researchers have developed different routing protocols at network layer which have considered transmission power, residual battery capacity and self-organization while routing data packets to the destination. Swarm intelligence such as ants can find a shortest path when they work collectively as a group. The main focus of this work is to develop an energy-efficient swarm routing algorithm called Energy-efficient Ant-colony- based Routing Algorithm (EARA) for the MANETs. We have compared traditional Ad hoc On-Demand Distance Vector (AODV) with EARA in terms of the node lifetime and throughput. The simulation results show that EARA has around 7% increase in average packet delivery ratio than AODV under different mobility speed indicating that it explores other optimal routes to improve the total efficiency.

BeesAnts: a new nature-inspired routing algorithm

In this paper, we have introduced a new multi-agent nature-inspired routing algorithm. The algorithm is referred to as the BeesAnts algorithm. It is a combination of the ant colony-based routing algorithm (ARA) and the BeeHive-based routing algorithm. The proposed routing algorithm works effectively on networks consisting of two parts; one is a fixed network and the other is a mobile ad hoc network (MANET). It applies the ARA routing algorithm on the mobile part and the BeeHive routing algorithm on the fixed part. The experimental results and the statistical analysis have demonstrated that the BeesAnts routing algorithm outperforms its ancestor, the ARA routing algorithm, in terms of the propagation delay, the queue delay, and the number of hops.

ACO Based Routing for MANETs

Mobile ad hoc network (MANET) is a collection of wireless mobile nodes. It dynamically forms a temporary network without using any pre existing network infrastructure or centralized administration i.e. with minimal prior planning. All nodes have routing capabilities and forward data packets to other nodes in multi-hop fashion. As the network is dynamic, the network topology continuously experiences alterations during deployment. The biggest challenge in MANETs is to find a path between communicating nodes. The considerations of the MANET environment and the nature of the mobile nodes create further complications which results in the need to develop special routing algorithms to meet these challenges. Swarm intelligence, a bio-inspired technique, which has proven to be very adaptable in other problem domains, has been applied to the MANET routing problem as it forms a good fit to the problem. In ant societies the activities of the individuals are not regulated by any explicit form of centralized control but are the result of self-organizing dynamics driven by local interactions and communications among a number of relatively simple individuals. This unique characteristic has made ant societies an attractive and inspiring model for building new algorithms and new multi-agent systems. In this paper, we have studied and reviewed Ant Colony based routing algorithms and its variants. Finally, a performance evaluation of the original ARA and the EARA is carried out with respect to each other.

Pipelining and Optimal Routing Techniques for Improving the Performance of Wireless Networks

this thesis, a cross layer network design approach using effective MAC layer and optimal Network layer design has been proposed and implemented to improve the performance of the wireless networks. For this purpose, new MAC design principles have been proposed for effective scheduling and channel allocation where pipelining techniques proposed for improving the channel utilization. In addition, a new bandwidth allocation technique using partitioning has been proposed in this paper which allows varying the amount of traffic dynamically by increasing or decreasing the window size depending on the traffic. Finally, an ant colony based routing algorithm which uses cluster based routing has been proposed and implemented to match the newly designed MAC layer.

A new ant colony-based routing algorithm with unidirectional link in UV mesh communication wireless network

Aiming at the unidirectional links coming from nodes with different transmitting power and the obstacle blocking in UV mesh wireless communication network and the traditional ant colony algorithm only supporting bidirectional links, a new ant colony based routing algorithm with unidirectional link in UV mesh communication wireless network is proposed. The simulation results show that the proposed algorithm can improve the overall network connectivity and the survivability by supporting the combination of unidirectional link and bidirectional link.