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 d atabase structure. We suggest replacing the root and some of the highe r levels of the tree with another structure that balances the average load of search requests. For this modification we use a set-ary butter fly network, which is a generalization of the well-known k-ary butterf ly. We also suggest modifying the lowest level of the tree to reflect neighbouring geographical regions more accurately, and to support simp le location data management. The modification of the lowest level also supports simple handoffs. The update of the proposed location databas e ensures correct location data following any number of transient faul ts that corrupt the location database information, and thus is self-st abilizing.