Back to Search
Start Over
FAST PURSUIT OF MOBILE NODES USING TPR TREES.
- Source :
-
International Journal of Foundations of Computer Science . Oct2004, Vol. 15 Issue 5, p753-772. 20p. - Publication Year :
- 2004
-
Abstract
- In this paper, we consider a set of mobile nodes, each of which moves with constant velocity. We present algorithms to determine which of these mobile nodes can be captured the soonest by a set of one or more pursuers. We use a time parameterized R-tree (TPR-tree) to index these moving points. We then develop algorithms that operate on the TPR-tree to answer three query variations: (1) a single pursuer that is faster than all of the mobile nodes, (2) a single pursuer that is slower than some of the mobile nodes and (3) multiple pursuers. Experimental results show that our algorithms are simpler and faster than other approaches to solve the problem. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01290541
- Volume :
- 15
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 14797464
- Full Text :
- https://doi.org/10.1142/S012905410400273X