A Distributed Multi-path Routing Algorithm to Balance Energy Consumption in Wireless Sensor Networks
Abstract
A large use of applications of Wireless Sensor Networks (WSNs) pushes researchers to design and improve protocols and algorithms against the encountered challenges. One of the main goals is data gathering and routing to the base station (through the sink nodes) with lack of acknowledgement and where each node has no information about the network. Unbalanced energy consumption during the data routing process is an inherent problem in WSNs due to the limited energy capacity of the sensor nodes. In fact, WSNs require load balancing algorithms that make judicious use of the limited energy resource to route the gathered data to the sink node. In this paper, we propose a balanced multi-path routing algorithm by focusing on the residual energy and the hop count of each node to discover the best routes and to insert them into the routing table. The main idea of this algorithm comes from Ant Colony Optimization (ACO) and automata network modelization. Hence, the potential performance of the proposed algorithm relies on the best route to be selected which should have the minimum number of hops, the maximum energy and weighted energy between participating nodes to extend the lifetime of the network.