JIPS (한국정보처리학회)
Current Result Document :
| 한글제목(Korean Title) |
Spatial Query Processing Based on Minimum Bounding in Wireless Sensor Networks |
| 영문제목(English Title) |
Spatial Query Processing Based on Minimum Bounding in Wireless Sensor Networks |
| 저자(Author) |
Sun Ok Yang
SungSuk Kim
|
| 원문수록처(Citation) |
VOL 05 NO. 04 PP. 0229 ~ 0236 (2009. 12) |
한글내용
(Korean Abstract) |
|
영문내용
(English 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. |
| 키워드(Keyword) |
Notification Message
Parent Selection Message
Spatial Query Process
Minimum Bounding Area
|
| 파일첨부 |
|
