Clustering mobile trajectories for resource allocation in mobile environments

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

Abstract

The recent developments in computer and communication technologies gave rise to Personal Communication Systems. Due to the nature of the PCS, the bandwidth allocation problem arises, which is based on the notion of bandwidth-on-demand. We deal with the problem of how to predict the position of a mobile client. We propose a new algorithm, called DCP, to discover user mobility patterns from collections of recorded mobile trajectories and use them for the prediction of movements and dynamic allocation of resources. The performance of the proposed algorithm is examined against two baseline algorithms. The simulation results illustrate that the proposed algorithm achieves recall that is comparable to that of the baseline algorithms and substantial improvement in precision. This improvement guarantees very good predictions for resource allocation with the advantage of very low resource consumption. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Katsaros, D., Nanopoulos, A., Karakaya, M., Yavas, G., Ulusoy, Ö., & Manolopoulos, Y. (2003). Clustering mobile trajectories for resource allocation in mobile environments. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2810, 319–329. https://doi.org/10.1007/978-3-540-45231-7_30

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