Load balancing and data aggregation tree routing algorithm in wireless sensor networks

Wireless sensor networks have received increasing attention in recent years and have proven their capability in dealing with problems occurring in wide areas with difficult access. In other types of sensor networks, the nodes can modify their position to better adapt to changes in the monitored phenomenon. Thus, routing is one of the important issues to be considered for a WSN. In this paper, a distributed algorithm is proposed to ensure that the mean square deviation of the number of member nodes within each cluster is as small as possible, thus effectively balancing the number of member nodes among each cluster. The cluster-based algorithms has proven to be better than multi-hop routing. In this paper, a novel, energy-efficient, cluster-based routing algorithm for a WSN is proposed. To evaluate the efficiency of the proposed algorithm, we studied its performance in a sensor network against other applied algorithms. The simulation results indicate that the network load balancing of the Node Local Density Load Balancing (NLDLB) algorithm is better than that of other join cluster models, and that the Load Balancing and Data Aggregation Tree Routing (LBDATR) algorithm can greatly reduce the energy consumption of a node, thus efficiently extending the lifecycle of the network and enhancing its robustness.