Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks

Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this paper, we study the time complexity, message complexity (number of messages used by all nodes), and energy cost complexity (total energy used by all nodes for transmitting messages) of some tasks, such as data collection (collecting raw data of all nodes to a sink), data aggregation (computing the aggregated value of data of all nodes), and queries for a multihop wireless sensor network of n nodes. We first present a lower bound on the complexity for the optimal methods, and then, for most of the tasks studied in this paper, we provide an (asymptotically matching) upper bound on the complexity by presenting efficient distributed algorithms to solve these problems.

[1]  Suman Nath,et al.  Tributaries and deltas: efficient and robust aggregation in sensor network streams , 2005, SIGMOD '05.

[2]  Shaojie Tang,et al.  A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[3]  P. R. Kumar,et al.  Critical power for asymptotic connectivity , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[4]  Christopher Olston,et al.  Distributed top-k monitoring , 2003, SIGMOD '03.

[5]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[6]  Boaz Patt-Shamir,et al.  Approximate Top-k Queries in Sensor Networks , 2006, SIROCCO.

[7]  Dariusz R. Kowalski,et al.  Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks , 2005, Second Annual Conference on Wireless On-demand Network Systems and Services.

[8]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[9]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[10]  Graham Cormode,et al.  Communication-efficient distributed monitoring of thresholded counts , 2006, SIGMOD Conference.

[11]  Francis Y. L. Chin,et al.  An improved algorithm for finding the median distributively , 2005, Algorithmica.

[12]  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 .

[13]  Michael Rodeh,et al.  Finding the Median Distributively , 1982, J. Comput. Syst. Sci..

[14]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[15]  Michalis Faloutsos,et al.  Optimal distributed algorithm for minimum spanning trees revisited , 1995, PODC '95.

[16]  Johannes Gehrke,et al.  Query Processing in Sensor Networks , 2003, CIDR.

[17]  Wei Hong,et al.  Approximate Data Collection in Sensor Networks using Probabilistic Models , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[18]  Andrew Chi-Chih Yao,et al.  An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..

[19]  Srinivasan Seshan,et al.  Synopsis diffusion for robust aggregation in sensor networks , 2004, SenSys '04.

[20]  Ying Zhang,et al.  Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[21]  Jeffrey Considine,et al.  Approximate aggregation techniques for sensor databases , 2004, Proceedings. 20th International Conference on Data Engineering.

[22]  Rajeev Rastogi,et al.  Efficient gossip-based aggregate computation , 2006, PODS.

[23]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[24]  Sandeep S. Kulkarni,et al.  TRADEOFF BETWEEN ENERGY AND LATENCY FOR CONVERGECAST , 2005 .

[25]  Christoph Ambühl,et al.  An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks , 2005, ICALP.

[26]  Divyakant Agrawal,et al.  Medians and beyond: new aggregation techniques for sensor networks , 2004, SenSys '04.

[27]  Nicola Santoro,et al.  Efficient Distributed Selection with Bounded Messages , 1997, IEEE Trans. Parallel Distributed Syst..

[28]  Ying Zhang,et al.  Coordinated convergecast in wireless sensor networks , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[29]  Roger Wattenhofer,et al.  Tight bounds for distributed selection , 2007, SPAA '07.

[30]  Boaz Patt-Shamir.  A note on efficient aggregate queries in sensor networks , 2004, PODC '04.

[31]  Graham Cormode,et al.  Holistic aggregates in a networked world: distributed tracking of approximate quantiles , 2005, SIGMOD '05.

[32]  Assaf Schuster,et al.  A geometric approach to monitoring threshold functions over distributed data streams , 2006, Ubiquitous Knowledge Discovery.

[33]  Wei Hong,et al.  The design of an acquisitional query processor for sensor networks , 2003, SIGMOD '03.

[34]  Sandeep K. S. Gupta,et al.  A low-latency and energy-efficient algorithm for convergecast in wireless sensor networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).