Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 25, 2001 | Submitted
Report Open

An Algorithm for Distributed Location Management in Networks of Mobile Computers

Abstract

In a network supporting mobile communication devices, a mechanism to find the location of a device, wherever it may be, is needed. In this paper, we present a distributed algorithm for this purpose along with its formal specification and proof sketch. Inspired by our experiences with Wang's algorithm [9], one goal of this paper is to demonstrate that the process of formalization together with careful attention to abstraction and presentation can yield significant benefits in algorithm design. In this case, we obtained a more regular, general, and robust algorithm with a clearer description. An incidental contribution is a useful theorem for proving progress properties in distributed algorithms that use tokens.

Additional Information

© 1996 California Institute of Technology. This work was supported in part by the AFOSR under grant number AFOSR-91-0070 and in part by the University of Florida.

Attached Files

Submitted - CStR1996.pdf

Submitted - postscript.ps

Files

CStR1996.pdf
Files (413.0 kB)
Name Size Download all
md5:b90cc032b36439dc5ce11eaae89376c2
206.7 kB Download
md5:4ffb8d5b2b068133542f00661079bd9a
206.3 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 24, 2023