A Scalable Correlation Aware Aggregation Strategy For Wireless Sensor Networks


Sensors-to-sink data in wireless sensor networks (WSNs) are typically characterized by correlation along the spatial, semantic, and/or temporal dimensions. Exploiting such correlation when performing data aggregation can result in considerable improvements in the bandwidth and energy performance of WSNs. In this paper, we first identify that most of the existing upstream routing approaches in WSNs can be translated to a correlation-unaware data aggregation structure - the shortest-path tree. Although by using a shortest-path tree, some implicit benefits due to correlation are possible, we show that explicitly constructing a correlation-aware structure can result in considerable performance improvement. Toward this end, we present a simple, scalable and distributed correlation-aware aggregation structure that addresses the practical challenges in the context of aggregation in WSNs. Through simulations and analysis, we evaluate the performance of the proposed approach with centralized and distributed correlation-aware and -unaware structures. © 2006 Elsevier B.V. All rights reserved.


Computer Science

Keywords and Phrases

Correlation; Data aggregation; Data gathering; Information fusion; Sensor networks

International Standard Serial Number (ISSN)


Document Type

Article - Journal

Document Version


File Type





© 2024 Elsevier, All rights reserved.

Publication Date

01 Jul 2008