Affiliations:
College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China
Correspondence:
[*]
Corresponding author. Juan Luo, College of Computer Science and Electronic Engineering, Hunan University,
Changsha, Hunan 410082, China. Tel./Fax: +86 731 88822417; E-mail: [email protected].
Abstract: Environment monitoring is one of the typical application scenarios of the wireless sensor networks. As an energy limited system, most of the energy consumption is for the data transmission. As a well-known principle, the difference among the physical parameters of adjacent nodes is approximate a constant. Eliminating these data to be transmitted will lead to remarkable energy saving. A correlative pattern based data aggregation mechanism following this principle is proposed in this paper, which is named the Correlative Pattern based Data Aggregation (CPDA). CPDA mines the correlations of every adjacent nodes pair, and generates a correlation graph of the network, then builds an aggregation routing tree for each connected component of correlation graph based on the shortest path methodology. Following the CPDA algorithm, a node’s sensed data will be suppressed when the data and the children’s match the restriction that is defined by CPDA. When the aggregated data arrive at the Sink node, all the data can be recovered. The recovery error will be limited within a specified small error threshold based on the reversed mechanism. The simulations based on the data set of Berkeley lab show that CPDA has excellent performance in aggregation degree and average error. Further more, a real established temperature sensing experiment also gives the same conclusion.
Keywords: Constant correlation, data aggregation, shortest path, wireless sensor networks
