Modified tree structure for location management in mobile environments

In this paper we suggest a new data structure for location management in mobile networks. The data structure is based on the tree location database structure. We suggest replacing the root and some of the higher levels of the tree with another structure that balances the average load of search requests. For this modification we use a set-ary butterfly network, which is a generalization of the well-known k-ary butterfly. We also suggest modifying the lowest level of the tree to reflect neighbouring geographical regions more accurately, and to support simple location data management. The modification of the lowest level also supports simple handoffs. The update of the proposed location database ensures correct location data following any number of transient faults that corrupt the location database information, and thus is self-stabilizing.

[1]  Gerald Q. Maguire,et al.  The Design and Implementation of a Mobile Internetworking Architecture , 1993, USENIX Winter.

[2]  Xian Zhou,et al.  Locating Strategies for Personal Communication Networks: A Novel Tracking Strategy , 1997, IEEE J. Sel. Areas Commun..

[3]  Charles E. Perkins,et al.  Providing Continuous Network Access to Mobile Hosts Using TCP/IP , 1993, Comput. Networks ISDN Syst..

[4]  Shlomi Dolev Optimal Time Self Stabilization in Dynamic Systems (Preliminary Version) , 1993, WDAG.

[5]  Mike Spreitzer,et al.  Providing Location Information in a Ubiquitous Computing Environment , 1994, Mobidata.

[6]  Baruch Awerbuch,et al.  Concurrent online tracking of mobile users , 1991, SIGCOMM 1991.

[7]  Jean-Paul M. G. Linnartz,et al.  Narrowband land-mobile radio networks , 1993 .

[8]  Tomasz Imielinski,et al.  Mobile Wireless Computing: Solutions and Challenges in Data Management , 1993 .

[9]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[10]  Robert G. Gallager,et al.  Event driven topology broadcast without sequence numbers , 1989, IEEE Trans. Commun..

[11]  Brian N. Bershad,et al.  Local Area Mobile Computing on Stock Hardware and Mostly Stock Software , 1993, Symposium on Mobile and Location-Independent Computing.

[12]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[13]  Amos Israeli,et al.  Resource bounds for self stabilizing message driven protocols , 1991, PODC '91.

[14]  Srinivasan Seshan,et al.  Providing Connection-Oriented Network Services to Mobile Hosts , 1993, Symposium on Mobile and Location-Independent Computing.

[15]  Baruch Awerbuch,et al.  Concurrent Online Tracking of Mobile Users , 1991, SIGCOMM.

[16]  Frank Thomson Leighton Introduction to parallel algorithms and architectures: arrays , 1992 .

[17]  Gerald Q. Maguire,et al.  IP-Based Protocols for Mobile Internetworking , 1991, SIGCOMM.

[18]  S. F. Wu,et al.  Caching location data in mobile networking , 1993, Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems.

[19]  Charles E. Perkins,et al.  A mobile networking system based on Internet protocol , 1993, IEEE Personal Communications.

[20]  Fumio Teraoka,et al.  A Network Architecture Providing Host Migration Transparency , 1991, SIGCOMM.

[21]  B. R. Badrinath,et al.  Checkpointing distributed applications on mobile computers , 1994, Proceedings of 3rd International Conference on Parallel and Distributed Information Systems.

[22]  Robert J. Fowler,et al.  The complexity of using forwarding addresses for decentralized object finding , 1986, PODC '86.

[23]  Dhiraj K. Pradhan,et al.  Recovery in distributed mobile environments , 1993, Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems.