Area query processing based on gray code in wireless sensor networks

被引：0
作者：
Ai, Chunyu [1 ]
Duan, Yueming [2 ]
Yan, Mingyuan [2 ]
He, Jing [3 ]
机构：
[1] Department of Computer Science, Troy University, Troy
[2] Department of Computer Science, Georgia State University, Atlanta
[3] Department of Computer Science, Kennesaw State University, Kennesaw
来源：
Tsinghua Science and Technology | 2012年 / 17卷 / 05期
关键词：
area query; area query processing; gray code; wireless sensor networks;
D O I：
10.1109/TST.2012.6314527
中图分类号：
学科分类号：
摘要：
Area query processing is significant for various applications of wireless sensor networks since it can request information of particular areas in the monitored environment. Existing query processing techniques cannot solve area queries. Intuitively centralized processing on Base Station can accomplish area queries via collecting information from all sensor nodes. However, this method is not suitable for wireless sensor networks with limited energy since a large amount of energy is wasted for reporting useless data. This motivates us to propose an energy-efficient in-network area query processing scheme. In our scheme, the monitored area is partitioned into grids, and a unique gray code number is used to represent a Grid ID (GID), which is also an effective way to describe an area. Furthermore, a reporting tree is constructed to process area merging and data aggregations. Based on the properties of GIDs, subareas can be merged easily and useless data can be discarded as early as possible to reduce energy consumption. For energy-efficiently answering continuous queries, we also design an incremental update method to continuously generate query results. In essence, all of these strategies are pivots to conserve energy consumption. With a thorough simulation study, it is shown that our scheme is effective and energy-efficient. © 1996-2012 Tsinghua University Press.
引用
收藏
页码：499 / 511
页数：12
相关论文
共 14 条
  • [1] Chu D., Deshpande A., Hellerstein J.M., Hong W., Approximate data collection in sensor networks using probabilistic models, Proceedings of the 22nd International Conference on Data Engineering, 48, (2006)
  • [2] Silberstein A., Braynard R., Filpus G., Puggioni G., Gelfand A., Munagala K., Yang J., Data-driven processing in sensor networks, Proceedings of the 3rd Biennial Conference on Innovative Data Systems Research, (2007)
  • [3] Wang D., Xu J., Liu J., Wang F., Mobile filter: Exploring migration of filters for error-bounded data collection in sensor networks, Proceedings of IEEE 24th International Conference on Data Engineering, pp. 1483-1485, (2008)
  • [4] Wang C., Ma H., He Y., Xiong S., Approximate data collection for wireless sensor networks, Proceedings of 2010 IEEE 16th International Conference on Parallel and Distributed Systems (ICPADS), pp. 164-171, (2010)
  • [5] Madden S., Franklin M.J., Hellerstein J.M., Hong W., Tag: A tiny aggregation service for ad-hoc sensor networks, SIGOPS Oper. Syst. Rev., 36, SI, pp. 131-146, (2002)
  • [6] Sharaf A., Beaver J., Labrinidis A., Chrysanthis K., Balancing energy efficiency and quality of aggregate data in sensor networks, The VLDB Journal, 13, 4, pp. 384-403, (2004)
  • [7] Silberstein A., Yang J., Many-to-many aggregation for sensor networks, Proceedings of IEEE 23rd International Conference on Data Engineering, pp. 986-995, (2007)
  • [8] Goldin D., Faster in-network evaluation of spatial aggregationin sensor networks, Proceedings of the 22nd International Conference on Data Engineering, 148, (2006)
  • [9] Yao Y., Gehrke J., The cougar approach to in-network queryprocessinginsensornetworks, SIGMODRec., 31, 3, pp. 9-18, (2002)
  • [10] Madden S.R., Franklin M.J., Hellerstein J.M., Hong W., Tinydb: An acquisitional query processing system for sensor networks, ACM Trans. Database Syst., 30, 1, pp. 122-173, (2005)
12