Aggregation tree based data aggregation algorithm in wireless sensor networks

1Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

In wireless sensor networks, efficient and effective data aggregation algorithms can prolong the network lifecycle by reducing communication of redundant data and improve the security of the networks. Tradition data aggregation algorithms in wireless sensor networks mainly aim to improve the energy utilization, and ignore the security and lifecycle. In order to get a good trade-off between these requirements, we proposed a data aggregation algorithm based on constructing a data aggregation tree. After give a formalism description of the problem, we proposed a data aggregation tree constructing algorithm. By minimize the maximal energy consumption of nodes, the algorithm can prolong the lifecycle. In data aggregation scheduling algorithm, we select the number of communications carefully to get the trade-off between low weighted delay and high network lifecycle. The simulation experiments show that, the proposed data aggregation algorithm consumes less energy while aggregating data from sensor nodes, and thus can prolong the network lifecycle.

Cite

CITATION STYLE

APA

Yanhua, H., & Xincai, Z. (2016). Aggregation tree based data aggregation algorithm in wireless sensor networks. International Journal of Online Engineering, 12(6), 10–15. https://doi.org/10.3991/ijoe.v12i06.5408

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free