Efficient indexing methods of continuously moving object in wireless networks

The advances of wireless communication technologies, personal locator technology, and global positioning systems enable a wide range of services in real time environments. To enable the services, a number of spatiotemporal access methods have been proposed for handling timestamp and time interval queries. However, the performance of the existing methods of a single index structure quickly degrades as time progresses. To overcome the problem, we propose to employ spatio-temporal based time partitioning on the R-tree called SPR-Tree). The proposed scheme employs a new insertion policy to reduce the height of the tree and a time grouping method in order to minimize the search time of various queries. Extensive computer simulation reveals that the proposed scheme significantly outperforms the existing schemes.