Journal of Engineering and Applied Sciences
ISSN: Online 1818-7803ISSN: Print 1816-949x
Abstract
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.
How to cite this article:
Jeong-Joon Kim. Dynamic Routing Algorithm for Spatio-Temporal Query Processing in
Sensor Networks.
DOI: https://doi.org/10.36478/jeasci.2019.4375.4386
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2019.4375.4386