Reducing the location query cost based on behavior-based strategy

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In a location query process the most expensive procedure is maintaining the location information of mobiles. To reduce the expensive cost, we adopt the profile-based approach to design a behavior-based strategy (BBS) based on the moving behavior of each mobile generated by long-term collection of its moving history. We use a data mining technique to mine the moving behavior of each mobile and then estimate the probability that each mobile stays in each location at each time region given the last known location from its moving behavior. To reduce unnecessary computation, we consider the location tracking and computational cost and then derive a cost model. A greedy heuristic is proposed to minimize the cost model through finding the appropriate checkpoints. The experimental results show our strategy outperforms fixed paging area strategy currently used in GSM or IS-54 system and time-based strategy for highly regular moving mobiles.

Cite

CITATION STYLE

APA

Jin, M. H., Horng, J. T., Wu, H. K., & Liu, B. J. (2000). Reducing the location query cost based on behavior-based strategy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1873, pp. 397–406). Springer Verlag. https://doi.org/10.1007/3-540-44469-6_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free