A dynamic routing tree scheme based on data aggregation income for wireless sensor networks
A dynamic routing tree scheme based on data aggregation income for wireless sensor networks is proposed, considering the relay nodes'aggregation proceeds, residual energy and the distance to SINK when the node choosing its best path. And then propose a novel scheme named DRDAI which is a distributed-based aggregation proceeds. Theoretical analysis and simulation show that aggregation income-based dynamic routing tree algorithm can reduce the load for each node as well as reduce the number of the data packets, improve the energy efficiency of the network and prolong the network lifetime. Finally, through the simulation of different scenarios to verify the proposed protocol has a good scalability.
Author's Name: Chen, J., Qi, X., Zhang, Z.
Volume: Volume 8
Issues: Issue 2
Keywords: Aggregation income, Data aggregation, Dynamic routing, Wireless sensor networks