Simulation and analysis of Awerbuch–Peleg and GSM schemes for location tracking of mobile users

✍ Scribed by Ishan P. Weerakoon; Deepinder P. Sidhu

• Publisher: John Wiley and Sons
• Year: 2001
• Tongue: English
• Weight: 255 KB
• Volume: 14
• Category: Article
• ISSN: 1074-5351
• DOI: 10.1002/dac.439

✦ Synopsis

Abstract

Mobile users are increasingly demanding full access to networked communications while they are on the move. Several studies have shown that the overhead incurred by the network to keep track of the current location of mobile users is considerably high. The methods currently used for location tracking incur heavy unnecessary costs by requiring that users update locations in their home networks after each move regardless of the distance at which the move occurs, and that all search attempts for a mobile user are first routed to that user's home network. The Awerbuch–Peleg scheme presents a formal model for location tracking which attempts to minimize the cost of local operations—both move and find operations—through the construction of a regional hierarchy. In this paper we present a performance evaluation of the Awerbuch–Peleg scheme. We also compare its performance to that of the GSM‐based location tracking scheme. It is found that the Awerbuch–Peleg scheme in general results in higher costs than the GSM scheme. The reason for this is found to be some unexpected properties of the read and write sets which are key components of the Awerbuch–Peleg scheme. Copyright © 2001 John Wiley & Sons, Ltd.