Spatial Query Processing Based on Minimum Bounding in Wireless Sensor Networks
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Sensors are deployed to gather physical, environmental data in sensor networks. Depending on scenarios, it is often assumed that it is difficult for batteries to be recharged or exchanged in sensors. Thus, sensors should be able to process users’ queries in an energy-efficient manner. This paper proposes a spatial query processing scheme- Minimum Bounding Area Based Scheme. This scheme has a purpose to decrease the number of outgoing messages during query processing. To do that, each sensor has to maintain some partial information locally about the locations of descendent nodes. In the initial setup phase, the routing path is established. Each child node delivers to its parent node the location information including itself and all of its descendent nodes. A parent node has to maintain several minimum bounding boxes per child node. This scheme can reduce unnecessary message propagations for query processing. Finally, the experimental results show the effectiveness of the proposed scheme.
Abstract
Sensors are deployed to gather physical, environmental data in sensor networks. Depending on scenarios, it is often assumed that it is difficult for batteries to be recharged or exchanged in sensors. Thus, sensors should be able to process users’ queries in an energy-efficient manner. This paper proposes a spatial query processing scheme- Minimum Bounding Area Based Scheme. This scheme has a purpose to decrease the number of outgoing messages during query processing. To do that, each sensor has to maintain some partial information locally about the locations of descendent nodes. In the initial setup phase, the routing path is established. Each child node delivers to its parent node the location information including itself and all of its descendent nodes. A parent node has to maintain several minimum bounding boxes per child node. This scheme can reduce unnecessary message propagations for query processing. Finally, the experimental results show the effectiveness of the proposed scheme.
참고문헌 (14)
- A. Mainwaring, "Wireless sensor networks for habitat monitoring", ACM Int'l Workshop on Wireless Sensor Networks and Applications, pp.88~97 (2002)
- I.F. Akyildiz, "A Survey on Sensor Networks", IEEE Communications Magazine, pp.102~114 (2002)
- D.H. Chae, "Trend and Technology of Sensor Network", Journal of Korea Information Science, 22(12), pp.5~12 (2004)
- A.Gutmann, "R-Trees-A dynamic index structure for Spatial Searching", ACM SIGMOD, pp.47~57 (1984)
- A. Soheile, "Spatial Queries in Sensor Networks", ACM Symp.on Advances in Geographic Information Systems(GIS), pp.61~70 (2005)
- S. Madden, "Tag:A Tiny Aggregation Service for ad-hoc Sensor Networks", Proc.Of OSDI, pp.131~146 (2002)
- S. Madden, "TinyDB:An Acquisitional Query Processing System for Sensor Network", Journal of ACM Tran.on Database Systems, 30(1), pp.122~173 (2005)
- C. Guestrin, "Distributed regression: an efficient framework for modeling sensor network data", International Workshop on Information Processing in Sensor Networks (IPSN), pp.415~418 (2004)
- S. Nath, "Synopsis diffusion for robust aggregation in sensor networks", international conference on Embedded networked sensor systems (SenSys '04), pp.313~320 (2004)
- J. Hellerstein, "Optimization of innetwork data reduction", international workshop on Data management for sensor networks:in conjunction with VLDB 2004(DMSN '04), pp.321~332 (2002)
- D. Chu, "Approximate Data Collection in Sensor Networks using Probabilistic Models", International Conference on Data Engineering(ICDE), pp.48~ (2006)
- H. Jin, "An Approximate Query Processing Method based on Data Correlation in Sensor Networks", International Conference on Embedded Software and Systems(ICESS), pp.13~18 (2008)
- A. Deligiannakis, "Hierarchical in Network Data Aggregation with Quality Guarantees", Proc. Of EDBT, pp.658~675 (2004)
- X. Yang, "In- Network Execution of Monitoring Queries in Sensor Networks", ACM SIGMOD, pp.61~70 (2007)