A load balancing algorithm based on probabilistic multi-tree for wireless sensor networks

To extend the lifetime of a large wireless sensor network, it is important to spread the inevitable energy consumption (loads) across the network, and thus reduce hot spots. This article introduces a two-step solution to this issue based on the AODV tier allocation with multiple paths to disperse loads from hot spots. After the allocation, paths for nodes to transmit data back to the sink are decided through a probabilistic approach. By computer simulation, it is shown with various indexes that the performance of the proposed algorithm is better than that of deterministic approaches after network deployment, and an appropriate state can be reached in reasonable time.