Location query based on moving behaviors.

Information Systems (Impact Factor: 1.24). 05/2007; 32:385-401. DOI: 10.1016/
Source: DBLP

ABSTRACT The importance of location prediction is rapidly increasing with the current trend of database applications in mobile computing environment. However, current personal communication services network could only provide currently maintained location information of non-idle mobile terminals. Pertinent researches predict the future location based on tangent velocity approaches, which require mobile terminals to spend lots of precious electronic power to sense and then measure a sequence of positions for predicting the future tangent velocity, and the prediction is effective only within a short range of time. In this study, we propose an approach to predict future locations of mobile terminals based on the moving behaviors mined from their long-term moving history. Location prediction based on moving behavior requires no power consumption for position measurement, and the prediction results are effective for a long time without requiring the queried clients to be non-idle. With the help of moving behavior, we propose several location prediction operators for location query. Finally, we demonstrate the accuracy of the location query operators through simulation statistics. The experimental results show that the predictions are accurate enough for regular moving mobile terminals.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In Cellular networks, number of users increase in an exponential manner. As a result of this exponential growth of users, overloading of the system takes place. Besides this, unacceptable delays and high computational cost create a strong prerequisite for efficient location management techniques. Motivated by this fact, a novel user profile based (UPB) scheme is proposed in this paper to track the location of the mobile users. There are a number of user mobility prediction algorithms in the literature and the proposed scheme is also one of them but unique in its own way. This scheme deals with the overloading of Visitor location register (VLR) which results in the congestion of mobile network. First of all, the proposed UPB scheme makes use of historical information of user's movement to generate a probability transition matrix (PTM) which corresponds to user transition from one cell to another cell. After this, a steady state value of each cell is obtained from PTM. Now the PTM is added with other required information of each user in a separate database known as wVLR (weightage factor based VLR). This separate database will play a vital role in the event of congestion of network or main VLR failure. The above proposed scheme is compared with a widely implemented general profile based (GPB) scheme in which user has equal probability of staying in each cell. It was found that the proposed UPB scheme reduces the number of searches as compared to GPB scheme. Also a significant improvement is obtained in terms of average waiting time of user, average time spent by the user in a system and reduction in call dropping when the system is overloaded.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: La mobilité des unités a connu un fort essor depuis quelques années. Une des conséquences directes dans le domaine des bases de données est l'apparition de nouveaux types de requêtes tels que les Requêtes Dépendant de la Localisation (RDL) (e.g. un ambulancier demande l'hôpital le plus proche de sa position). Ces requêtes soulèvent des problèmes qui font depuis quelques années l'objet de plusieurs recherches. En dépit de l'abondance des travaux liés à ce domaine, les différents types de requêtes étudiés jusqu'ici ne répondent pas à tous les besoins applicatifs. En effet, des nouveaux besoins donnent naissance à des requêtes mobiles avec des contraintes de temps réel. La prise en compte à la fois des contraintes de temps réel et de mobilité lors du traitement des requêtes est un problème important à résoudre. Ainsi, notre principal objectif est de proposer une solution pour le traitement des requêtes RDL avec des contraintes de temps réel. D'abord, nous proposons un langage permettant d'exprimer différents types de requêtes RDL. Ensuite, nous concevons une architecture permettant de traiter des requêtes RDL avec des contraintes de temps réel. Les modules conçus sont destinés à être implantés au-dessus de SGBD existants (e.g. Oracle). Dans le cadre de cette architecture, nous proposons des méthodes permettant de tenir compte de la localisation du client et de son déplacement après l'envoi de la requête. Nous proposons aussi des méthodes permettant de maximiser le taux de requêtes respectant leurs échéances. Enfin, nous validons nos propositions par une mise en œuvre et des évaluations des performances des méthodes proposées.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Mobile computing systems usually express a user movement trajectory as a sequence of areas that capture the user movement trace. Given a set of user movement trajectories, user movement patterns refer to the sequences of areas through which a user frequently travels. In an attempt to obtain user movement patterns for mobile applications, prior studies explore the problem of mining user movement patterns from the movement logs of mobile users. These movement logs generate a data record whenever a mobile user crosses base station coverage areas. However, this type of movement log does not exist in the system and thus generates extra overheads. By exploiting an existing log, namely, call detail records, this article proposes a Regression-based approach for mining User Movement Patterns (abbreviated as RUMP). This approach views call detail records as random sample trajectory data, and thus, user movement patterns are represented as movement functions in this article. We propose algorithm LS (standing for Large Sequence) to extract the call detail records that capture frequent user movement behaviors. By exploring the spatio-temporal locality of continuous movements (i.e., a mobile user is likely to be in nearby areas if the time interval between consecutive calls is small), we develop algorithm TC (standing for Time Clustering) to cluster call detail records. Then, by utilizing regression analysis, we develop algorithm MF (standing for Movement Function) to derive movement functions. Experimental studies involving both synthetic and real datasets show that RUMP is able to derive user movement functions close to the frequent movement behaviors of mobile users.
    Data & Knowledge Engineering 01/2011; 70(1-70):1-20. DOI:10.1016/j.datak.2010.07.010 · 1.49 Impact Factor