Clustering Mobile Trajectories for Resource Allocation in Mobile Environments

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.

• Type: Conference
• Year: 2003
• Where: IDA
• Authors: Dimitrios Katsaros, Alexandros Nanopoulos, Murat Karakaya, Gökhan Yavas, Özgür Ulusoy, Yannis Manolopoulos
• Keywords: Algorithm Achieves Recall, Allocation Problem Arises, Baseline Algorithms, IDA 2003