A novel aggregation algorithm based on redundant nodes in wireless sensor networks

A novel redundant nodes aggregation tree algorithm (RNAT) is presented in consideration of the plentiful redundant nodes in some wireless sensor networks. Based on the clustering network structure, the redundant nodes are identified by checking whether the node's sensing area is completely covered or not, and then, the tree nodes are chosen according to the nodes' residual energy and distance parameters. The redundant nodes aggregation tree is set up via broadcasting messages in the network. In the algorithm, the in-cluster redundant nodes do some work instead of the cluster head. As a result, the energy consumption of the cluster head can be reduced and the energy load in the network can be balanced. For example, RNAT can improve the performance of HEED-M effectively. The network lifetime is prolonged by about 20%.