Modified tree structure for location management in mobile environments

Authors:
Shlomi Dolev;Dhiraj K. Pradhan;Jennifer L. Welch
Affiliations:
Department of Mathematics and Computer Science, Ben-Gurion University, Beer-Sheva, 84105, Israel;Department of Computer Science, Texas A&M University, College Station, TX 77843, USA;Department of Computer Science, Texas A&M University, College Station, TX 77843, USA
Venue:
Computer Communications
Year:
1996

Citing 8
Cited 5

The complexity of using forwarding addresses for decentralized object finding

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Resource bounds for self stabilizing message driven protocols

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Concurrent online tracking of mobile users

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
IP-based protocols for mobile internetworking

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Optimal Time Self Stabilization in Dynamic Systems (Preliminary Version)

WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Providing connection-oriented network services to mobile hosts

MLCS Mobile & Location-Independent Computing Symposium on Mobile & Location-Independent Computing Symposium

Self-Stabilizing Agent Traversal

WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
A distributed database architecture for global roaming in next-generation mobile networks

IEEE/ACM Transactions on Networking (TON)
GeoQuorums: implementing atomic memory in mobile ad hoc networks

Distributed Computing - Special issue: DISC 03
Self-stabilizing mobile node location management and message routing

SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
On the design of a location and query management strategy for mobile and wireless environments

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

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.