Mobility prediction is one of the most essential issues that need to be explored for mobility management in mobile computing systems. In this paper, we propose a new algorithm for predicting the next intercell movement of a mobile user in a Personal Communication Systems network. In the first phase of our three-phase algorithm, user mobility patterns are mined from the history of mobile user trajectories. In the second phase, mobility rules are extracted from these patterns, and in the last phase, mobility predictions are accomplished by using these rules. The performance of the proposed algorithm is evaluated through simulation as compared to two other prediction methods. The performance results obtained in terms of Precision and Recall indicate that our method can make more accurate predictions than the other methods.

/pdf/a-data-mining-approach-for-location-prediction-in-mobile-2am1ds3yhy.pdf

A data mining approach for location prediction in mobile environments

The continuous development of wireless networks and mobile devices has motivated an intense research in mobile data services. Some of these services provide the user with context-aware information. Specifically, location-based services and location-dependent queries have attracted a lot of interest.In this article, the existing literature in the field of location-dependent query processing is reviewed. The technological context (mobile computing) and support middleware (such as moving object databases and data stream technology) are described, location-based services and location-dependent queries are defined and classified, and different query processing approaches are reviewed and compared.

https://webdiis.unizar.es/~silarri/PUBLICATIONS/acmSurvLDQP09.pdf

Location-dependent query processing: Where we are and where we are heading

A method is presented in this paper for answering location-dependent queries in a mobile computing environment. We investigate a common scenario where data objects (e.g., restaurants and gas stations) are stationary while clients that issue queries about the data objects are mobile. Our proposed technique constructs a Voronoi Diagram (VD) on the data objects to serve as an index for them. A VD defines, for each data object d, the region within which d is the nearest point to any mobile client within that region. As such, the VD can be used to answer nearest-neighbor queries directly. Furthermore, the area within which the answer is valid can be computed. Based on the VD, we develop a semantic caching scheme that records a cached item as well as its valid range. A simulation is conducted to study the performance of the proposed semantic cache in comparison with the traditional cache and the baseline case where no cache is used. We show that the semantic cache has a much better performance than the other two methods.

/pdf/semantic-caching-in-location-dependent-query-processing-1eudj7co7x.pdf

Semantic Caching in Location-Dependent Query Processing

The description, composition, and execution of even logically simple scientific workflows are often complicated by the need to deal with "messy" issues like heterogeneous storage formats and ad-hoc file system structures. We show how these difficulties can be overcome via a typed, compositional workflow notation within which issues of physical representation are cleanly separated from logical typing, and by the implementation of this notation within the context of a powerful runtime system that supports distributed execution. The resulting notation and system are capable both of expressing complex workflows in a simple, compact form, and of enacting those workflows in distributed environments. We apply our technique to cognitive neuroscience workflows that analyze functional MRI image data, and demonstrate significant reductions in code size relative to other approaches.

/pdf/a-notation-and-system-for-expressing-and-executing-cleanly-525x9gpvq2.pdf

A notation and system for expressing and executing cleanly typed workflows on messy scientific data

With the current advances of mobile computing technology, we are witnessing an explosion in the development of applications that provide mobile users with a wide range of services. In this paper, we present a system that supports distributed processing of continuous location-dependent queries in mobile environments. The system that we propose presents the following main advantages: 1) it is a general solution for the processing of location-dependent queries in scenarios where not only the users issuing queries, but also other interesting objects can move; 2) it performs an efficient processing of these queries in a continuous way; 3) it is especially well adapted to environments where location data are distributed in a network and processing tasks can be performed in parallel, allowing a high scalability; and 4) it optimizes wireless communications. We use mobile agents to carry the processing tasks wherever they are needed. Thus, agents are in charge of tracking the location of interesting moving objects and refreshing the answer to a query efficiently. We evaluate the usefulness of the presented proposal showing that the system achieves a good precision and scales up well

Hüseyin Gökmen Gök

Papers

Transmission of continuous query results in mobile computing systems