Inspired from ants colony: Smart routing algorithm of wireless sensor network

Abstract

In brief, Wireless Sensor Networks (WSNs) are a set of limited power nodes, used for gathering the determined data of an area. Increasing the lifetime is the main challenge to optimize WSNs routing protocols, since the sensors' energy in most cases is limited. In this respect, this article introduces a novel smart routing algorithm of wireless sensor networks, consisting of stable nodes randomly dispersed, and this approach is inspired from ant colonies. The proposed algorithm takes into consideration the distance between two nodes, the chosen path length and the nodes' residual energy so as to update the choice probability of the next node among the neighbouring nodes, contrary to several routing algorithms; on the one hand, the nodes are aggregating data of their predecessors and sending to all to their successors; on the other hand, the source is almost always changed in each iteration. Consequently, the energy consumption is balanced between the nodes. Hence, the network lifetime will be increased. Detailed descriptions and a set of simulation using Matlab is provided to measure the network lifetime and the energy consumed by nodes of the proposed approach are presented. The replications' consequences of simulations prove the success of our future routing algorithm (SRA).