This Article 
 Bibliographic References 
 Add to: 
When In-Network Processing Meets Time: Complexity and Effects of Joint Optimization in Wireless Sensor Networks
October 2011 (vol. 10 no. 10)
pp. 1488-1502
Qiao Xiang, Wayne State University, Detroit
Hongwei Zhang, Wayne State University, Detroit
Jinhong Xu, Indiana University
Xiaohui Liu, Wayne State University, Detroit
Loren J. Rittle, Content and Context-aware Solutions group, Applied Research, Motorola Mobility, Schaumburg
As sensornets are increasingly being deployed in mission-critical applications, it becomes imperative that we consider application QoS requirements in in-network processing (INP). Toward 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 reaggregation 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 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 and considering real-world aggregation constraints 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] S. Madden, M. Franklin, and J. Hellerstein, "TinyDB: An Acquisitional Query Processing System for Sensor Networks," ACM Trans. Database Systems, vol. 30, pp. 122-173, 2005.
[2] R. Kumar, M. Wolenetz, B. Agarwalla, J. Shin, P. Hutto, A. Paul, and U. Ramachandran, "DFuse: A Framework for Distributed Data Fusion," Proc. ACM Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), 2003.
[3] L. Becchetti, P. Korteweg, A. Marchetti-Spaccamela, M. Skuttella, L. Stougie, and A. Vitaletti, "Latency Constrained Aggregation in Sensor Networks," Proc. European Symp. Algorithms (ESA '06), 2006.
[4] Y.A. Oswald, S. Schmid, and R. Wattenhofer, "Tight Bounds for Delay-Sensitive Aggregation," Proc. ACM Symp. Principles of Distributed Computing (PODC '08), 2008.
[5] T. He, B.M. Blum, J.A. Stankovic, and T. Abdelzaher, "AIDA: Adaptive Application Independent Data Aggregation in Wireless Sensor Networks," ACM Trans. Embedded Computing System, vol. 3, pp. 426-457, May 2004.
[6] K. Lu, D. Wu, Y. Qian, Y. Fang, and R.C. Qiu, "Performance of an Aggregation-Based MAC Protocol for High-Data-Rate Ultrawideband Ad Hoc Networks," IEEE Trans. Vehicular Technology, vol. 56, no. 1, pp. 312-321, 2007.
[7] A. Arora et al., "A Line in the Sand: A Wireless Sensor Network for Target Detection, Classification, and Tracking," Computer Networks, vol. 46, no. 5, pp. 605-634, 2004.
[8] "IPv6 over Low power WPAN (6LoWPAN)," IETF working group, html , 2011.
[9] "Routing Over Low Power and Lossy Networks (ROLL)," IETF working group, html , 2011.
[10] G. Finke, V. Jost, M. Queyranne, and A. Sebo, "Batch Processing with Interval Graph Compatibilities between Tasks," Discrete Applied Math., vol. 156, pp. 556-568, 2008.
[11] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company, 1979.
[12] Q. Xiang, J. Xu, X. Liu, H. Zhang, and L.J. Rittle, "When In-Network Processing Meets Time: Complexity and Effects of Joint Optimization in Wireless Sensor Networks," technical report, Wayne State Univ., DNC-TR-09-01.pdf, 2009.
[13] D.S. Hochbaum, Approximation Algorithms for NP-Hard Problems. PWS, 1997.
[14] P. Wang, J. Zheng, and C. Li, "Data Aggregation Using Distributed Lossy Source Coding in Wireless Sensor Networks," Proc. IEEE Global Telecomm. Conf. (GlobeCom), 2007.
[15] H. Gabow, "An Efficient Implementation of Edmonds' Algorithm for Maximum Matchings on Graphs," J. ACM, vol. 23, pp. 221-234, 1975.
[16] "NetEye Testbed," php , 2011.
[17] O. Gnawali, R. Fonseca, K. Jamieson, D. Moss, and P. Levis, "Collection Tree Protocol," Proc. ACM Conf. Embedded Networked Sensor Systems, 2009.
[18] "Iowa's TimeSync Component," http://tinyos.cvs.sourceforge. net/viewvc/ tinyos/tinyos-2.x-contrib/iowaT2.tsync , 2011.
[19] "TinyOS," http:/, 2011.
[20] R. Jain, The Art of Computer Systems Performance Analysis. John Wiley & Sons, 1991.
[21] "An Event Traffic Trace for Sensor Networks," http://www.cs. Lites-trace.txt, 2010.
[22] A. Jain, M. Gruteser, M. Neufeld, and D. Grunwald, "Benefits of Packet Aggregation in Ad-Hoc Wireless Network," Technical Report CU-CS-960-03, Univ. of Colorado at Boulder, 2003.
[23] T. Li, Q. Ni, D. Malone, D. Leith, Y. Xiao, and T. Turletti, "Aggregation with Fragment Retransmission for Very High-Speed WLANs," IEEE/ACM Trans. Networking, vol. 17, no. 2, pp. 591-604, Apr. 2009.
[24] M. Li, H. Zhu, Y. Xiao, I. Chlamtac, and B. Prabhakaran, "Adaptive Frame Concatenation Mechanisms for QoS in Multi-Rate Wireless Ad Hoc Networks," Proc. IEEE INFOCOM, 2008.
[25] D. Kliazovich and F. Granelli, "Packet Concatenation at the IP Level for Performance Enhancement in Wireless Local Area Networks," Wireless Networks, vol. 14, pp. 519-529, 2008.
[26] R. Saket and N. Navet, "Frame Packing Algorithms for Automotive Applications," J. Embedded Computing, vol. 2, pp. 93-102, 2006.
[27] T. Nonner and A. Souza, "Latency Constrained Data Aggregation in Chain Networks Admits a PTAS," Proc. Int'l Conf. Algorithmic Aspects in Information and Management (AAIM '09), 2009.
[28] P. Korteweg, A. Marchetti-Spaccamela, L. Stougie, and A. Vitaletti, "Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs," Theoretical Computer Science, vol. 410, no. 14, pp. 1346-1354, 2009.
[29] I. Solis and K. Obraczka, "The Impact of Timing in Data Aggregation for Sensor Networks," Proc. IEEE Int'l Conf. Comm., 2004.
[30] A.R. Karlin, C. Kenyon, and D. Randall, "Dynamic TCP Acknowledgement and Other Stories about ${e\over e-1}$ ," Proc. ACM Symp. Theory of Computing (STOC '01), 2001.
[31] Z. Ye, A.A. Abouzeid, and J. Ai, "Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2007.
[32] Y. Yu, V. Prasanna, and B. Krishnamachari, "Energy Minimization for Real-Time Data Gathering in Wireless Sensor Networks," IEEE Trans. Wireless Comm., vol. 5, no. 11, pp. 3087-3096, Nov. 2006.

Index Terms:
Wireless network, sensor network, real-time, packet packing, in-network processing.
Qiao Xiang, Hongwei Zhang, Jinhong Xu, Xiaohui Liu, Loren J. Rittle, "When In-Network Processing Meets Time: Complexity and Effects of Joint Optimization in Wireless Sensor Networks," IEEE Transactions on Mobile Computing, vol. 10, no. 10, pp. 1488-1502, Oct. 2011, doi:10.1109/TMC.2011.81
Usage of this product signifies your acceptance of the Terms of Use.