TY  - JOUR
T1  - Dynamic Routing Algorithm for Spatio-Temporal Query Processing in
Sensor Networks
AU - Kim, Jeong-Joon 
JO  - Journal of Engineering and Applied Sciences
VL  - 14
IS  - 13
SP  - 4375
EP  - 4386
PY  - 2019
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2019.4375.4386
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2019.4375.4386
KW  - MBR
KW  -R-tree
KW  -spatio-temporal
KW  -dynamic routing algorithm
KW  -Sensor networks
KW  -optimization
KW  -itinerary based R-tree
AB  - A GR-tree method and a query aggregation (Query Aggregation) method have been proposed for spatial
query processing with space query processing techniques for existing wireless sensor networks. However, such
a spatial query processing technique considered the optimization of spatial queries but it was not taken into
consideration about the question and answer of time and due to the increase of the index reorganization cost and
the communication cost of the parent sensor node. There is a problem that the energy consumption that requires
the most efficiency increases at the wireless sensor node. In this study, we solve the problem of such a spatial query
processing technique and investigate the IR-tree (Itinerary based R-tree) for the more efficient time space (Spatiotemporal)
Present.
ER  -