By Topic

Reducing location management costs in hierarchical-based model of mobile and wireless computing systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Seung-yun Kim ; Electr. & Comput. Eng. Dept., Dayton Univ., OH, USA ; W. W. Smari

With the rapid growth in mobile and wireless computing technology, location management techniques become more challenging. Future personal communications systems (PCS) will support a huge user population and a network spanning a large geographical area. In such systems, the signaling traffic and processing overhead for locating mobile users is expected to increase dramatically. In a mobile computing environment, mobile hosts move from one place to another and need to access the information without interruption, regardless of their location. This is the reason why location management is one of the important issues in mobile computing environments. Several techniques have been proposed in order to optimally manage the location of mobile hosts. In this paper, we introduce a probability-based location management (PBLM) algorithm which is based on to previously introduced algorithm which is based on two previously introduced algorithms to locate a user optimally: FBFind and FVLF. The basic idea of using PBLM algorithm is to reduce the Signaling System No. 7(SS7) message traffic and database access traffic by maintaining a local database, which is called location information database (LID) and is to reuse the information of mobile hosts' mobility patterns. WE evaluate this algorithm and identify its optimal conditions as well as limitations. Results indicate that reusing mobile hosts' mobility information in local databases can save great deal of the updating costs.

Published in:

Information Reuse and Integration, 2003. IRI 2003. IEEE International Conference on

Date of Conference:

27-29 Oct. 2003