Modified tree structure for location management in mobile environments Academic Article

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.

authors

• Welch, Jennifer

published proceedings

• COMPUTER COMMUNICATIONS

author list (cited authors)

• Dolev, S., Pradhan, D. K., & Welch, J. L.

citation count

• 15

complete list of authors

• Dolev, S||Pradhan, DK||Welch, JL

publication date

• January 1996

publisher

• Elsevier  Publisher

published in

• Computer Communications  Journal

keywords

• Distributed Algorithms
• Fault-tolerance
• Handoff Management
• Location Management
• Self-stabilization

Digital Object Identifier (DOI)

• 10.1016/0140-3664(96)01071-7

start page

• 335

end page

• 345

volume

• 19

issue

• 4

URL

• http%3A%2F%2Fdx.doi.org%2F10.1016%2F0140-3664%2896%2901071-7