Modified tree structure for location management in mobileenvironments

S. Dolev, D. K. Pradham, J. K. Welch

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

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

Original languageEnglish
Title of host publicationINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
Pages530-537
Number of pages8
DOIs
StatePublished - 1 Dec 1995
Externally publishedYes
EventINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies - Boston, MA, United States
Duration: 2 Apr 19956 Apr 1995

Publication series

NameProceedings - IEEE INFOCOM
Volume2
ISSN (Print)0743-166X

Conference

ConferenceINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
Country/TerritoryUnited States
CityBoston, MA
Period2/04/956/04/95

Fingerprint

Dive into the research topics of 'Modified tree structure for location management in mobileenvironments'. Together they form a unique fingerprint.

Cite this