A scalable correlation aware aggregation strategy for wireless sensor networks

  • Authors:
  • Yujie Zhu;Ramanuja Vedantham;Seung-Jong Park;Raghupathy Sivakumar

  • Affiliations:
  • School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332, USA;School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332, USA;Department of Computer Science Louisiana State University, Baton Rouge, LA 70803, USA;School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332, USA

  • Venue:
  • Information Fusion
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.