REA-WSN: Intercluster routing algorithm for energy optimization in wireless sensor networks

In the last years, wireless sensor networks (WSNs) have received an increasing attention from the research community since sensor nodes are generally battery-powered devices and one of their critical aspects is how to optimize energy expenditure of nodes to extend network lifetime. In this paper we propose a method for improving energy efficiency in a WSN with a homogeneous and hierarchical topology. The proposal is based in the integration of proposals funneling-MAC and LEACH-C with clusters and cluster heads routing data to the sink through an approach based on Dikjstra´s shortest path algorithm. The network is divided into two regions, non-intensity region (NIR) and intensity region (IR). In the NIR the medium access method is CSMA/CA and TDMA is used to optimize the communication between the cluster heads and the nodes within the RI. Between the cluster heads the routing is implemented using an adaptation of Dikjstra´s shortest path algorithm based on the residual energy in each node. The experimental results show a decrease in the average energy expenditure in the evaluated scenarios and a sharp advantage regarding the number of dead nodes, as well as an increase in the total network lifespan.