Spatial Query Processing Based on Minimum Bounding in Wireless Sensor Networks

Sun Ok Yang and SungSuk Kim
Volume: 5, No: 4, Page: 229 ~ 236, Year: 2009
10.3745/JIPS.2009.5.4.229
Keywords: Notification Message, Parent Selection Message, Spatial Query Process, Minimum Bounding Area
Full Text:

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.

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
Sun Ok Yang and SungSuk Kim, "Spatial Query Processing Based on Minimum Bounding in Wireless Sensor Networks," Journal of Information Processing Systems, vol. 5, no. 4, pp. 229~236, 2009. DOI: 10.3745/JIPS.2009.5.4.229.

ACM Style
Sun Ok Yang and SungSuk Kim, "Spatial Query Processing Based on Minimum Bounding in Wireless Sensor Networks," Journal of Information Processing Systems, 5, 4, (2009), 229~236. DOI: 10.3745/JIPS.2009.5.4.229.