IDEAS home Printed from https://ideas.repec.org/a/igg/jitn00/v3y2011i2p1-30.html
   My bibliography  Save this article

Location Management in PCS Networks Using Base Areas (BAs) and 2 Level Paging (2LP) Schemes

Author

Listed:
  • Hesham A. Ali

    (Mansoura University, Egypt)

  • Ahmed I. Saleh

    (Mansoura University, Egypt)

  • Mohammed H. Ali

    (Mansoura University, Egypt)

Abstract

The main objective of PCS networks is to provide “anytime-anywhere” cellular services. Accordingly, lost calls as well as the network slow response have become the major problems that hardly degrade the network reliability. Those problems can be overcome by perfectly managing the Mobile Terminals (MTs) locations. In the existing location management (LM) scheme, Location Area (LA) is the smallest unit for registration. A MT must register itself when passing through its LA boundary to a neighboring one. Moreover, such registration takes place at the MTs’ master HLR (even though currently managed by another HLR), which increases communication costs. As a result, existing LM scheme suffers from; (1) excessive location registrations by MTs located around LA boundaries (ping-pong effect) and (2) requiring the network to poll all LA cells to locate the callee MT. In this paper, a novel LM strategy is introduced by restructuring LAs into smaller areas called Base Areas (BAs), which impacts the paging cost. The proposed LM strategy uses caching to reduce unwanted updates and 2LP to reduce paging cost. Experimental results show that the proposed scheme introduces a distinct improvement in network response and tracing process.

Suggested Citation

  • Hesham A. Ali & Ahmed I. Saleh & Mohammed H. Ali, 2011. "Location Management in PCS Networks Using Base Areas (BAs) and 2 Level Paging (2LP) Schemes," International Journal of Interdisciplinary Telecommunications and Networking (IJITN), IGI Global, vol. 3(2), pages 1-30, April.
  • Handle: RePEc:igg:jitn00:v:3:y:2011:i:2:p:1-30
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jitn.2011040101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jitn00:v:3:y:2011:i:2:p:1-30. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.