Skip Navigation

The Computer Journal 2001 44(2):75-91; doi:10.1093/comjnl/44.2.75
© 2001 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pitoura, E.
Right arrow Articles by Fudos, I.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Distributed Location Databases for Tracking Highly Mobile Objects

Evaggelia Pitoura1 and Ioannis Fudos1

1 Department of Computer Science, University of Ioannina, GR 45110 Ioannina, Greece Email: pitoura@cs.uoi.gr

In current distributed systems, the notion of mobility is emerging in many forms and applications. Increasingly many users are not tied to a fixed access point but instead use wireless communications or dial-up services to access data independent of their physical location. Furthermore, mobile software, a popular example being mobile agents, is frequently used as a new form of building distributed network-centric applications. Tracking mobile objects, i.e. identifying their current location, is central to such settings. In this paper, we exploit the use of hierarchical distributed location databases, where each database site covers a specific geographical region and contains location information about all objects residing in it. For highly mobile objects, a scheme based on forwarding pointers enhanced with auxiliary caching techniques is presented, to reduce the cost of the overall network and database traffic generated by frequent location updates. The scheme is extended to support concurrency and failure recovery. Performance is demonstrated through a number of simulation experiments for a range of call to mobility ratios and for a variety of moving and calling behaviors.

Received 30 June, 1999. Revised 9 October, 2000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.