ETC: Energy-Driven Tree Construction in Wireless Sensor Networks

Authors:
P. Andreou;A. Pamboris;D. Zeinalipour-Yazti;P. K. Chrysanthis;G. Samaras
Affiliations:
-;-;-;-;-
Venue:
MDM '09 Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware
Year:
2009

Citing 0
Cited 3

Minimum-hot-spot query trees for wireless sensor networks

Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
A novel distributed framework for optimizing query routing trees in wireless sensor networks via optimal operator placement

Journal of Computer and System Sciences
DECOR: Distributed construction of load balanced routing trees for many to one sensor networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Continuous queries in Wireless Sensor Networks (WSNs) are founded on the premise of Query Routing Tree structures (denoted as T), which provide sensors with a path to the querying node. Predominant data acquisition systems for WSNs construct such structures in an ad-hoc manner and therefore there is no guarantee that a given query workload will be distributed equally among all sensors. That leads to data collisions which represent a major source of energy waste. In this paper we present the Energy-driven Tree Construction (ETC) algorithm, which balances the workload among nodes and minimizes data collisions, thus reducing energy consumption, during data acquisition in WSNs. We show through real micro-benchmarks on the CC2420 radio chip and trace-driven experimentation with real datasets from Intel Research and UC-Berkeley that ETC can provide significant energy reductions under a variety of conditions prolonging the longevity of a wireless sensor network.