IEEE Computer and Communications Societies, Annual Joint Conference of the (1995)
Apr. 2, 1995 to Apr. 6, 1995
S. Dolev , Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
D.K. Pradham , Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
J.K. Welch , Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
Suggests a new data structure for location management in mobile networks. The data structure is based on the tree location database structure. The authors 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 they use a set-ary butterfly network, which is a generalization of the well-known k-ary butterfly. They also suggest modifying the lowest level of the tree in order to reflect neighboring 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.
tree data structures; computer network management; data communication; land mobile radio; tracking; location management; mobile environments; modified tree structure; data structure; tree location database structure; root; search requests; set-ary butterfly network; k-ary butterfly; neighboring geographical regions; location data management; handoffs; transient faults
S. Dolev, D. Pradham and J. Welch, "Modified tree structure for location management in mobile environments," IEEE Computer and Communications Societies, Annual Joint Conference of the(INFOCOM), Boston, Massachusetts, 1995, pp. 530.