Energy-efficient and location-aware ant colony based routing algorithms for Wireless Sensor Networks

In recent years, advances in miniaturization, low-power circuit design, simple, low power, yet reasonably efficient wireless communication equipment, and improved small-scale energy supplies have combined with reduced manufacturing costs to make a new technological vision possible, Wireless Sensor Networks (WSN). As WSN are still a young research field, much activity is still on-going to solve many open issues. One is the data routing problem. As the size of the network increases, this problem becomes more complex due the amount of sensor nodes in the network. The meta-heuristic Ant Colony Optimization (ACO) has been proposed to solve this issue. ACO based routing algorithms can add a significant contribution to assist in the maximisation of the network lifetime and in the minimisation of the latency in data transmissions, but this is only possible by means of an adaptable and balanced algorithm that takes into account the WSN main restrictions, for example, memory and power supply. A comparison of two ACO based routing algorithms for WSN is presented, taking into account current amounts of energy consumption under a WSN scenario proposed in this work. Furthermore, a new routing algorithm is defined.