An Energy-Efficient Ant-Based Routing Algorithm for Wireless Sensor Networks

Abstract

Abstract. Wireless Sensor Networks are characterized by having specific requirements such as limited energy availability, low memory and reduced processing power. On the other hand, these networks have enormous potential applicability, e.g., habitat monitoring, medical care, military surveillance or traffic control. Many protocols have been developed for Wireless Sensor Networks that try to overcome the constraints that characterize this type of networks. Antbased routing protocols can add a significant contribution to assist in the maximisation of the network life-time, but this is only possible by means of an adaptable and balanced algorithm that takes into account the Wireless Sensor Networks main restrictions. This paper presents a new Wireless Sensor Network routing protocol, which is based on the Ant Colony Optimization metaheuristic. The protocol was studied by simulation for several Wireless Sensor Network scenarios and the results clearly show that it minimises communication load and maximises energy savings.

Ant Colony Optimization Approaches in Wireless Sensor Network: Performance Evaluation

“…This is the result of ACO behavior that is able to construct optimal routing path from source node to destination node which eventually improves the energy efficiency, energy consumption and reduces delay. ACO algorithm is easily adapted to static, dynamic and mobile environments (Camilo et al, 2006). In static WSN environment, the source node and destination node are always in a fixed position while in mobile WSN environment, the destination node will move during simulation process to be allocated at the area that has high energy sensor nodes.…”

“…In large WSN environment where each ant needs to move long distance by using multi hop technique, sufficient memory is needed to store all information between hops. Since memory is very limited, Camilo et al (2006) proposed an ant to only carry previous two visited nodes information while sensor nodes store pheromone value, energy and ID of each visited ants. This approach was proven to be able to preserve the routing path constructed by ant with very low memory utilization.…”

Optimization of Ant based Cluster Head Election Algorithm in Wireless Sensor Networks

“…EEABR [7] is based on Ant Colony Optimization (ACO) technique. In this protocol, each node in the network launches a forward ant at regular intervals with the aim of inventing a route to the base station.…”

A Routing Optimization Based on Ant Colony for Wireless Multimedia Sensor Networks (WMSNs)

“…The routing protocol in the Wireless Sensor Networks (WSNs) can be classified into four main schemes, namely: Network Structure, Communication Model, Topology, and Reliable Routing [4,5]. The new communication protocol for the WSN called EnergyEfficient Ant-Based Routing Algorithm (EEABR) [6] is proposed that the protocol is based on the Ant Colony Optimization (ACO). Improved Energy Efficient Ant-Based Routing (IEEABR) [7] protocols are used to improve the energy efficiency of the WSNs.…”

“…However, this routing protocol that is implemented and investigated only uses constant bit rate (CBR) traffic in the simulation program [12]. The ACO for routing protocol has been implemented in the WSN [13]. The QoS requirements in wireless networks have been discussed in [14].…”