This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A General Framework for Efficient Continuous Multidimensional Top-k Query Processing in Sensor Networks
Sept. 2012 (vol. 23 no. 9)
pp. 1668-1680
Hongbo Jiang, Huazhong University of Science and Technology, Wuhan
Jie Cheng, Huazhong University of Science and Technology, Wuhan
Dan Wang, Hong Kong Polytechnic University, Hong Kong
Chonggang Wang, NEC Laboratories America, Princeton
Guang Tan, Chinese Academy of Sciences, Shenzhen
Top-k query has long been a crucial problem in multiple fields of computer science, such as data processing and information retrieval. In emerging cyber-physical systems, where there can be a large number of users searching information directly into the physical world, many new challenges arise for top-k query processing. From the client's perspective, users may request different sets of information, with different priorities and at different times. Thus, top-k search should not only be multidimensional, but also be across time domain. From the system's perspective, data collection is usually carried out by small sensing devices. Unlike the data centers used for searching in the cyber-space, these devices are often extremely resource constrained and system efficiency is of paramount importance. In this paper, we develop a framework that can effectively satisfy demands from the two aspects. The sensor network maintains an efficient dominant graph data structure for data readings. A simple top-k extraction algorithm is used for user query processing and two schemes are proposed to further reduce communication cost. Our methods can be used for top-k query with any linear convex query function. The framework is adaptive enough to incorporate some advanced features; for example, we show how approximate queries and data aging can be applied. To the best of our knowledge, this is the first work for continuous multidimensional top-k query processing in sensor networks. Simulation results show that our schemes can reduce the total communication cost by up to 90 percent, compared with a centralized scheme or a straightforward extension from previous top-k algorithm on 1D sensor data.

[1] http://db.lcs.mit.edu/labdatalabdata.html , 2012.
[2] P. Andreou, D. Zeinalipour-Yazti, M. Andreou, P.K. Chrysanthis, and G. Samaras, "Kspot: Effectively Monitoring the k Most Important Events in a Wireless Sensor Network," Proc. IEEE 25th Int'l Conf. Data Eng. (ICDE), 2009.
[3] B. Babcock and C. Olston, "Distributed Top-k Monitoring," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '03), 2003.
[4] M. Bhardwaj and A.P. Chandrakasan, "Bounding the Lifetime of Sensor Networks via Optimal Role Assignments," Proc. IEEE INFOCOM, 2002.
[5] S. Borzsonyi, D. Kossmann, and K. Stocker, "The Skyline Operator," Proc. 17th Int'l Conf. Data Eng., 2001.
[6] P. Cao and Z. Wang, "Efficient Top-k Query Calculation in Distributed Networks," Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing (PODC '04), 2004.
[7] B. Chen, W. Liang, and J.X. Yu, "Online Time Interval Top-k Queries in Wireless Sensor Networks," Proc. Int'l Conf. Mobile Data Management (MDM), 2010.
[8] W. Chen, J. Hou, and L. Sha, "Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks," IEEE Trans. Mobile Computing, vol. 3, no. 3, pp. 258-271, July-Aug. 2004.
[9] J. Cheng, H. Jiang, J. Liu, W. Liu, and C. Wang, "On Efficient Processing of Continuous Historical Top-k Queries in Wireless Sensor Networks," IEEE Trans. Vehicular Technology, vol. 60, no. 5, pp. 2363-2367, June 2011.
[10] R. Cohen and D. Peleg, "Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movement," SIAM J. Computing, vol. 38, pp. 276-302, 2008.
[11] T.H. Corment, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithm. The MIT Press, 2001.
[12] S. De, C. Qiao, and H. Wu, "Meshed Multipath Routing: An Efficient Strategy in Wireless Sensor Networks," Computer Networks, vol. 43, pp. 481-497, 2003.
[13] R. Fagin, A. Lotem, and M. Naor, "Optimal Aggregation Algorithms for Middleware," Proc. 20th ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS '01), 2001.
[14] W. Ge, J. Zhang, and G. Xue, "Joint Clustering and Optimal Cooperative Routing in Wireless Sensor Networks," Proc. IEEE Int'l Conf. Comm., 2008.
[15] H. Jiang, J. Cheng, D. Wang, C. Wang, and G. Tan, "Continuous Multi-Dimensional Top-k Query Processing in Sensor Networks," Proc. IEEE INFOCOM, 2011.
[16] H. Jiang, S. Jin, and C. Wang, "Parameter-Based Data Aggregation for Statistical Information Extraction in Wireless Sensor Networks," IEEE Trans. Vehicular Technology, vol. 59, no. 8, pp. 3992-4001, Oct. 2010.
[17] H. Jiang, S. Jin, and C. Wang, "Prediction or Not? an Energy-Efficient Framework for Clustering-Based Data Collection in Wireless Sensor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 6, pp. 1064-1071, June 2011.
[18] A. Kamra, V. Misra, and D. Rubenstein, "Counttorrent: Ubiquitous Access to Query Aggregates in Dynamic and Mobile Sensor Networks," Proc. Fifth Int'l Conf. Embedded Networked Sensor Systems (Sensys '07), 2007.
[19] M. Li and Y. Liu, "Underground Structure Monitoring with Wireless Sensor Networks," Proc. Sixth Int'l Conf. Information Processing in Sensor Networks (IPSN '07), 2007.
[20] C. Liu and G. Cao, "Minimizing the Cost of Mine Selection via Sensor Networks," Proc. IEEE INFOCOM, 2009.
[21] H. Liu, X. Jia, P. Wan, C. Yi, S. Makki, and N. Pissinou, "Maximizing Lifetime of Sensor Surveillance Systems," IEEE/ACM Trans. Networking, vol. 15, no. 2, pp. 334-345, Apr. 2007.
[22] L. Liu, X. Zhang, and H. Ma, "Dynamic Node Collaboration for Mobile Target Tracking in Wireless Camera Sensor Networks," Proc. IEEE INFOCOM, 2009.
[23] W. Liu, Y. Zhang, W. Lou, and Y. Fang, "A Robust and Energy-Efficient Data Dissemination Framework for Wireless Sensor Networks," Wireless Networks, vol. 12, pp. 465-479, 2006.
[24] X. Liu, J. Xu, and W.-C. Lee, "A Cross Pruning Framework for Top-k Data Collection in Wireless Sensor Networks," Proc. Int'l Conf. Mobile Data Management, 2010.
[25] S.R. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, "TAG: A Tiny Aggregation Service for Ad Hoc Sensor Networks," Proc. Fifth Symp. Operating Systems Design and Implementation (OSDI '02), 2002.
[26] S.R. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, "Tinydb: An Acquisitional Query Processing System for Sensor Networks," ACM Trans. Database Systems, vol. 30, no. 1, pp. 122-173, 2005.
[27] S. Michel, P. Triantafillou, and G. Weikum, "Klee: A Framework for Distributed Top-k Query Algorithms," Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), 2005.
[28] S. Misra, G. Xue, and D. Yang, "Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints," Proc. IEEE INFOCOM, 2009.
[29] K. Mouratidis, S. Bakiras, and D. Papadias, "Continous Monitoring of Top-k Query over Sliding Windows," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '06), 2006.
[30] A. Silberstein, R. Braynard, C. Ellis, K. Munagala, and J. Yang, "A Sampling-Based Approach to Optimizing Top-$k$ Queries in Sensor Networks," Proc. 22nd Int'l Conf. Data Eng. (ICDE '06), 2006.
[31] X. Tang and J. Xu, "Extending Network Lifetime for Precision-constrained Data Aggregation in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2006.
[32] D. Wang, J. Xu, J. Liu, and F. Wang, "Mobile Filtering for Error Bounded Data Collection in Sensor Networks," Proc. 28th Int'l Conf. Distributed Computing Systems (ICDCS '08), 2008.
[33] J. Widmer and J.-Y.L. Boudec, "Network Coding for Efficient Communication in Extreme Networks," Proc. ACM SIGCOMM Workshops Delay-Tolerant Networking (WDTN '05), 2005.
[34] M. Wu, J. Xu, X. Tang, and W.-C. Lee, "Top-$k$ Monitoring in Wireless Sensor Networks," IEEE Trans. Knowledge and Data Eng., vol. 19, no. 7, pp. 962-976, July 2007.
[35] H. Yu, H. Li, P. Wu, D. Agrawal, and A.E. Abbadi, "Efficient Processing of Distributed Top-k Queries," Proc. DEXA, 2005.
[36] D. Zeinalipour-Yazti, P. Andreou, P.K. Chrysanthis, and G. Samaras, "Mint Views: Materialized in-Network Top-k Views in Sensor Networks," Proc. Int'l Conf. Mobile Data Management, 2007.
[37] D. Zeinalipour-Yazti, S. Lin, and D. Gunopulos, "Distributed Spatio-Temporal Similarity Search," Proc. ACM 15th Conf. Information and Knowledge Management, 2006.
[38] D. Zeinalipour-Yazti, Z. Vagena, D. Gunopulos, V. Kalogeraki, V. Tsotras, M. Vlachos, N. Koudas, and D. Srivastava, "The Threshold Join Algorithm for Top-$k$ Queries in Distributed Sensor Networks," Proc. Workshop Data Management for Sensor Networks (DMSN), 2005.
[39] L. Zou and L. Chen, "Dominant Graph: An Efficient Indexing Structure to Answer Top-$k$ Queries," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE '08), 2008.

Index Terms:
Query processing,Routing,Algorithm design and analysis,Base stations,Data mining,Aggregates,Temperature sensors,algorithm/protocol design,Query processing,Routing,Algorithm design and analysis,Base stations,Data mining,Aggregates,Temperature sensors,top-k extraction.,Sensor networks
Citation:
Hongbo Jiang, Jie Cheng, Dan Wang, Chonggang Wang, Guang Tan, "A General Framework for Efficient Continuous Multidimensional Top-k Query Processing in Sensor Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 9, pp. 1668-1680, Sept. 2012, doi:10.1109/TPDS.2012.69
Usage of this product signifies your acceptance of the Terms of Use.