ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Energy-Efficient Distributed Spatial Join Processing in Wireless Sensor Networks
Cited 3 time in scopus Download 3 time Share share facebook twitter linkedin kakaostory
저자
김민수, 손진현, 김주완, 김명호
발행일
201006
출처
IEICE Transactions on Information and Systems, v.E93.D no.6, pp.1447-1458
ISSN
0916-8532
출판사
일본, 전자정보통신학회 (IEICE)
DOI
https://dx.doi.org/10.1587/transinf.E93.D.1447
초록
In the area of wireless sensor networks, the efficient spatial query processing based on the locations of sensor nodes is required. Especially, spatial queries on two sensor networks need a distributed spatial join processing among the sensor networks. Because the distributed spatial join processing causes lots of wireless transmissions in accessing sensor nodes of two sensor networks, our goal of this paper is to reduce the wireless transmissions for the energy efficiency of sensor nodes. In this paper, we propose an energy-efficient distributed spatial join algorithm on two heterogeneous sensor networks, which performs in-network spatial join processing. To optimize the in-network processing, we also propose a Grid-based Rectangle tree (GR-tree) and a grid-based approximation function. The GR-tree reduces the wireless transmissions by supporting a distributed spatial search for sensor nodes. The grid-based approximation function reduces the wireless transmissions by reducing the volume of spatial query objects which should be pushed down to sensor nodes. Finally, we compare na챦ve and existing approaches through extensive experiments and clarify our approach's distinguished features. Copyright © 2010 The Institute of Electronics, Information and Communication Engineers.
KSP 제안 키워드
Approximation function, Energy Efficiency, Existing Approaches, Grid-based, Heterogeneous Sensor Networks, In-Network Processing, Information and communication, Join algorithm, Join processing, Sensor node, Spatial join