A hierarchical energy-efficient framework for data aggregation in wireless sensor networks

A network of sensors can be used to obtain state-based data from the area in which they are deployed. To reduce costs, the data, sent via intermediate sensors to a sink, are often aggregated (or compressed). This compression is done by a subset of the sensors called "aggregators." Inasmuch as sensors are usually equipped with small and unreplenishable energy reserves, a critical issue is to strategically deploy an appropriate number of aggregators so as to minimize the amount of energy consumed by transporting and aggregating the data. In this paper, the authors first study single-level aggregation and propose an Energy-Efficient Protocol for Aggregator Selection (EPAS) protocol. Then, they generalize it to an aggregation hierarchy and extend EPAS to Hierarchical EPAS. The optimal number of aggregators with generalized compression and power-consumption models was derived, and fully distributed algorithms for aggregator selection were presented. Simulation results show that the algorithms significantly reduce the energy consumption for data collection in wireless sensor networks. Moreover, the algorithms do not rely on particular routing protocols and are thus applicable to a broad spectrum of application environments

[1]  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).

[2]  Leonidas J. Guibas,et al.  Wireless sensor networks - an information processing approach , 2004, The Morgan Kaufmann series in networking.

[3]  R. Rajaraman,et al.  An efficient distributed algorithm for constructing small dominating sets , 2002 .

[4]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[5]  Patrick Th. Eugster,et al.  Pilot: probabilistic lightweight group communication system for ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[6]  R. Kershner.  The Number of Circles Covering a Set , 1939 .

[7]  Lui Sha,et al.  Dynamic clustering for acoustic target tracking in wireless sensor networks , 2003, IEEE Transactions on Mobile Computing.

[8]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[9]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[10]  D. Marco,et al.  Reliability vs. efficiency in distributed source coding for field-gathering sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[11]  Arthur L. Liestman,et al.  CLUSTERING ALGORITHMS FOR AD HOC WIRELESS NETWORKS , 2004 .

[12]  A. Blokhuis.  SPHERE PACKINGS, LATTICES AND GROUPS (Grundlehren der mathematischen Wissenschaften 290) , 1989 .

[13]  Jie Wu,et al.  Extended multipoint relays to determine connected dominating sets in MANETs , 2006, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[14]  Xiuzhen Cheng,et al.  Connected Dominating Set in Sensor Networks and MANETs , 2004 .

[15]  Krishnendu Chakrabarty,et al.  Location-aided flooding: an energy-efficient data dissemination protocol for wireless-sensor networks , 2005, IEEE Transactions on Computers.

[16]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[17]  Songwu Lu,et al.  A Robust Data Delivery Protocol for Large Scale Sensor Networks , 2003, IPSN.

[18]  Anantha Chandrakasan,et al.  Upper bounds on the lifetime of sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[19]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[20]  Wendi B. Heinzelman,et al.  Prolonging the lifetime of wireless sensor networks via unequal clustering , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[21]  Mohamed F. Younis,et al.  A survey on routing protocols for wireless sensor networks , 2005, Ad Hoc Networks.

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

[23]  Arthur L. Liestman,et al.  Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks , 2002, MobiHoc '02.

[24]  Nael B. Abu-Ghazaleh,et al.  A taxonomy of wireless micro-sensor network models , 2002, MOCO.

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

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

[27]  Kannan Ramchandran,et al.  A distributed and adaptive signal processing approach to reducing energy consumption in sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).