A scalable correlation aware aggregation strategy for wireless sensor networks

Sensors-to-sink data in wireless sensor networks (WSNs) are typically correlated with each other. Exploiting such correlation when performing data aggregation can result in considerable improvements in the bandwidth and energy performance of WSNs. In order to exploit such correlation, we present a 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.

[1]  Vlado Handziski,et al.  Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering , 2004, EWSN.

[2]  Edward J. Coyle,et al.  An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Catherine Rosenberg,et al.  Design guidelines for wireless sensor networks: communication, clustering and aggregation , 2004, Ad Hoc Networks.

[4]  Satish K. Tripathi,et al.  Synchronization of multiple levels of data fusion in wireless sensor networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[5]  Haiyun Luo,et al.  TTDD: Two-tier Data Dissemination in Large-scale Sensor Networks , 2002, MobiCom 2002.

[6]  Martin Vetterli,et al.  Power efficient gathering of correlated data: optimization, NP-completeness and heuristics , 2003, MOCO.

[7]  Imrich Chlamtac,et al.  A new approach to the design and analysis of peer‐to‐peer mobile networks , 1999, Wirel. Networks.

[8]  David R. Karger,et al.  Building Steiner trees with incomplete global knowledge , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[9]  Mario Gerla,et al.  Efficient flooding with Passive Clustering (PC) in ad hoc networks , 2002, CCRV.

[10]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[11]  Baltasar Beferull-Lozano,et al.  On network correlated data gathering , 2004, IEEE INFOCOM 2004.

[12]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[13]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[14]  Haiyun Luo,et al.  A two-tier data dissemination model for large-scale wireless sensor networks , 2002, MobiCom '02.

[15]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[16]  R. Ravi,et al.  Boosted sampling: approximation algorithms for stochastic optimization , 2004, STOC '04.

[17]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[18]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[19]  Deborah Estrin,et al.  Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk , 2003, SODA '03.