The Community for Technology Leaders
RSS Icon
Issue No.10 - October (2011 vol.23)
pp: 1513-1525
Baljeet Malhotra , University of Alberta, Edmonton
Mario A. Nascimento , University of Alberta, Edmonton
Ioanis Nikolaidis , University of Alberta, Edmonton
In this paper, we consider the exact top-k query problem in wireless sensor networks, i.e., where one seeks to find the k highest reported values as well as the complete set of nodes that reported them. Our primary contribution in this context is EXTOK, a provably correct and topology-independent new filtering-based algorithm for processing exact top-k queries. As a secondary contribution we confirm a previous result of ours by showing that the efficiency of top-k query processing algorithms, including EXTOK, can be further improved by simply choosing a proper underlying logical tree topology. We examine EXTOK's performance with respect to a number of parameters and different logical tree topologies while using both synthetic and real data sets. Our simulation reveal that EXTOK consistently outperforms the current state-of-the-art algorithm by a very significant margin and regardless of the underlying logical tree topology.
Wireless sensor networks, top-k query processing, in-network query processing, energy efficiency.
Baljeet Malhotra, Mario A. Nascimento, Ioanis Nikolaidis, "Exact Top-K Queries in Wireless Sensor Networks", IEEE Transactions on Knowledge & Data Engineering, vol.23, no. 10, pp. 1513-1525, October 2011, doi:10.1109/TKDE.2010.186
[1] S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, "The Design of an Acquisitional Query Processor for Sensor Networks," Proc. ACM Int'l Conf. Management of Data (SIGMOD '03), pp. 491-502, 2003.
[2] 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.
[3] B. Babcock and C. Olston, "Distributed Top-K Monitoring," Proc. ACM Conf. Management of Data (SIGMOD '03), pp. 28-39, 2003.
[4] B. Malhotra, M.A. Nascimento, and I. Nikolaidis, "Better Tree-Better Fruits: Using Dominating Set Trees for MAX Queries," Proc. Fifth Workshop Data Management for Sensor Networks (DMSN '08), pp. 1-7, 2008.
[5] S. 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), vol. 36, pp. 131-146, 2002.
[6] A. Silberstein, K. Munagala, and J. Yang, "Energy-Efficient Monitoring of Extreme Values in Sensor Networks," Proc. ACM Int'l Conf. Management of Data (SIGMOD '06), pp. 169-180, 2006.
[7] W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-Efficient Communication Protocol for Wireless Microsensor Networks," Proc. 33rd Ann. Hawaii Int'l Conf. System Sciences, vol. 2, pp. 1-10, 2000.
[8] C. Olston, B. Loo, and J. Widom, "Adaptive Precision Setting for Cached Approximate Values," Proc. ACM Int'l Conf. Management of Data (SIGMOD '01), pp. 355-366, 2001.
[9] A. Silberstein, R. Braynard, and J. Yang, "Constraint-Chaining: On Energy-Efficient Continuous Monitoring in Sensor Networks," Proc. ACM Int'l Conf. Management of Data (SIGMOD '06), pp. 157-168, 2006.
[10] R. Fagin, A. Lotem, and M. Naor, "Optimal Aggregation Algorithms for Middleware," J. Computer and System Sciences, vol. 66, no. 4, pp. 614-656, 2003.
[11] D. Zeinalipour-Yazti, Z. Vagena, D. Gunopulos, V. Kalogeraki, and V. Tsotras, "The Threshold Join Algorithm for Top-K Queries in Distributed Sensor Networks," Proc. Second Int'l Workshop Data Management for Sensor Networks (DMSN '05), pp. 61-66, 2005.
[12] 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 IEEE Int'l Conf. Data Eng. (ICDE '06), pp. 68-78, 2006.
[13] Y. Cho, J. Son, and Y.D. Chung, "POT: An Efficient Top-K Monitoring Method for Spatially Correlated Sensor Readings," Proc. Fifth Workshop Data Management for Sensor Networks (DMSN '08), pp. 8-13, 2008.
[14] C.R. Lin and M. Gerla, "Adaptive Clustering for Mobile Wireless Networks," IEEE J. Selected Areas in Comm., vol. 15, no. 7, pp. 1265-1275, Sept. 1997.
[15] J. Blum, M. Ding, A. Thaeler, and X. Cheng, "Handbook of Combinatorial Optimization," Connected Dominating Set in Sensor Networks and Manets, D.-Z. Du, and P. Pardalos, eds., pp. 329-369, Birkhäuser, 2005.
[16] P.J. Wan, K.M. Alzoubi, and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks," Mobile Networks and Applications - Discrete Algorithms and Methods for Mobile Computing and Comm., vol. 9, no. 2, pp. 141-149, 2004.
[17] S. Ramanathan and E.L. Lloyd, "Scheduling Algorithms for Multihop Radio Networks," IEEE/ACM Trans. Networking, vol. 1, no. 2, pp. 166-177, Apr. 1993.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool