When In-Network Processing Meets Time: Complexity and Effects of Joint Optimization in Wireless Sensor Networks

As sensornets are increasingly being deployed in mission-critical applications, it becomes imperative that we consider application QoS requirements in in-network processing (INP). Towards understanding the complexity of joint QoS and INP optimization, we study the problem of jointly optimizing packet packing (i.e., aggregating shorter packets into longer ones) and the timeliness of data delivery. We identify the conditions under which the problem is strong NP-hard, and we find that the problem complexity heavily depends on aggregation constraints (in particular, maximum packet size and re-aggregation tolerance) instead of network and traffic properties. For cases when the problem is NP-hard, we show that there is no polynomial-time approximation scheme (PTAS); for cases when the problem can be solved in polynomial time, we design polynomial time, offline algorithms for finding the optimal packet packing schemes. To understand the impact of joint QoS and INP optimization on sensornet performance, we design a distributed, online protocol \emph{tPack} that schedules packet transmissions to maximize the local utility of packet packing at each node. Using a testbed of 130 TelosB motes, we experimentally evaluate the properties of tPack. We find that jointly optimizing data delivery timeliness and packet packing significantly improve network performance. Our findings shed light on the challenges, benefits, and solutions of joint QoS and INP optimization, and they also suggest open problems for future research.

[1]  Yong Yao,et al.  The cougar approach to in-network query processing in sensor networks , 2002, SGMD.

[2]  Wei Hong,et al.  TinyDB: an acquisitional query processing system for sensor networks , 2005, TODS.

[3]  Cheng Li,et al.  Data Aggregation Using Distributed Lossy Source Coding in Wireless Sensor Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[4]  Prasun Sinha,et al.  Scalable data aggregation for dynamic events in sensor networks , 2006, SenSys '06.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Katia Obraczka,et al.  The impact of timing in data aggregation for sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[7]  Stefan Schmid,et al.  Tight bounds for delay-sensitive aggregation , 2008, PODC '08.

[8]  Harold N. Gabow,et al.  An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.

[9]  Viktor K. Prasanna,et al.  Energy Minimization for Real-Time Data Gathering in Wireless Sensor Networks , 2006, IEEE Transactions on Wireless Communications.

[10]  Claire Mathieu,et al.  Dynamic TCP acknowledgement and other stories about e/(e-1) , 2001, STOC '01.

[11]  Cyrus Shahabi,et al.  The Clustered AGgregation (CAG) technique leveraging spatial and temporal correlations in wireless sensor networks , 2007, TOSN.

[12]  Wei Hong,et al.  Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.

[13]  Young-Jin Kim,et al.  Multi-dimensional range queries in sensor networks , 2003, SenSys '03.

[14]  Leen Stougie,et al.  Data aggregation in sensor networks: Balancing communication and delay costs , 2007, Theor. Comput. Sci..

[15]  Philip Levis,et al.  Collection tree protocol , 2009, SenSys '09.

[16]  Wei Hong,et al.  Exploiting correlated attributes in acquisitional query processing , 2005, 21st International Conference on Data Engineering (ICDE'05).

[17]  Dzmitry Kliazovich,et al.  Packet concatenation at the IP level for performance enhancement in wireless local area networks , 2008, Wirel. Networks.

[18]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[19]  Umakishore Ramachandran,et al.  DFuse: a framework for distributed data fusion , 2003, SenSys '03.

[20]  Nicolas Navet,et al.  Plasticity--Theory and Application , 1968 .

[21]  Donald F. Towsley,et al.  On optimal communication cost for gathering correlated data through wireless sensor networks , 2006, MobiCom '06.

[22]  Imrich Chlamtac,et al.  Adaptive Frame Concatenation Mechanisms for QoS in Multi-Rate Wireless Ad Hoc Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[23]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[24]  David Malone,et al.  Aggregation with fragment retransmission for very high-speed WLANs , 2009, TNET.

[25]  Qiao Xiang,et al.  When In-Network Processing Meets Time: Complexity and Effects of Joint Optimization in Wireless Sensor Networks , 2011, IEEE Trans. Mob. Comput..

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

[27]  Leen Stougie.  Latency Constrained Aggregation in Sensor Networks , 2006, ICTON 2006.

[28]  Gerd Finke,et al.  Batch processing with interval graph compatibilities between tasks , 2005, Discret. Appl. Math..

[29]  Dirk Grunwald,et al.  Benefits of Packet Aggregation in Ad-Hoc Wireless Network ; CU-CS-960-03 , 2003 .

[30]  Alexander Souza,et al.  Latency Constrained Aggregation in Chain Networks Admits a PTAS , 2009, AAIM.

[31]  Tarek F. Abdelzaher,et al.  AIDA: Adaptive application-independent data aggregation in wireless sensor networks , 2004, TECS.

[32]  Yuguang Fang,et al.  Performance of an Aggregation-Based MAC Protocol for High-Data-Rate Ultrawideband Ad Hoc Networks , 2007, IEEE Transactions on Vehicular Technology.

[33]  Alhussein A. Abouzeid,et al.  Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[34]  Vinayak S. Naik,et al.  A line in the sand: a wireless sensor network for target detection, classification, and tracking , 2004, Comput. Networks.

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

[36]  Gerard J. Chang,et al.  Total interval numbers of complete r-partite graphs , 2002, Discret. Appl. Math..

[37]  Ramesh Govindan,et al.  The impact of spatial correlation on routing with compression in wireless sensor networks , 2008, TOSN.

[38]  Wei Hong,et al.  Beyond Average: Toward Sophisticated Sensing with Queries , 2003, IPSN.

[39]  Leonidas J. Guibas,et al.  Lightweight sensing and communication protocols for target enumeration and aggregation , 2003, MobiHoc '03.