Volume 37 Issue 4
Dec.  2017
Article Contents

JIANG Hong, LU Bin. A Novel implicit Deregistration Scheme in PCS Networks[J]. Journal of University of Electronic Science and Technology of China, 2008, 37(4): 515-518.
Citation: JIANG Hong, LU Bin. A Novel implicit Deregistration Scheme in PCS Networks[J]. Journal of University of Electronic Science and Technology of China, 2008, 37(4): 515-518.

A Novel implicit Deregistration Scheme in PCS Networks

  • Received Date: 2006-11-09
  • Rev Recd Date: 2007-09-13
  • Publish Date: 2008-08-15
  • Reducing location management signaling overhead is an important aspect in personal communication service (PCS) networks design. In implicit deregistration algorithms, the visitor location register (VLR) user previously visited does not perform deregistration. The traditional implicit deregistration algorithms have following disadvantages:(1) the system needs a large database since a record in VLR may be invalid; (2) the maintenance of VLR is difficult; (3) when a large number of users enter a full VLR, the system will create a mass of extra registration cost. Aiming at solving these problems in traditional implicit algorithms, we present a new implicit scheme in which a database periodically deletes invalid records. The proposed scheme can effectively limit the storage volume for invalid records. Simulation results and running experiences show that the proposed scheme is very feasible.
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Article Metrics

Article views(3523) PDF downloads(57) Cited by()

Related
Proportional views

A Novel implicit Deregistration Scheme in PCS Networks

Abstract: Reducing location management signaling overhead is an important aspect in personal communication service (PCS) networks design. In implicit deregistration algorithms, the visitor location register (VLR) user previously visited does not perform deregistration. The traditional implicit deregistration algorithms have following disadvantages:(1) the system needs a large database since a record in VLR may be invalid; (2) the maintenance of VLR is difficult; (3) when a large number of users enter a full VLR, the system will create a mass of extra registration cost. Aiming at solving these problems in traditional implicit algorithms, we present a new implicit scheme in which a database periodically deletes invalid records. The proposed scheme can effectively limit the storage volume for invalid records. Simulation results and running experiences show that the proposed scheme is very feasible.

JIANG Hong, LU Bin. A Novel implicit Deregistration Scheme in PCS Networks[J]. Journal of University of Electronic Science and Technology of China, 2008, 37(4): 515-518.
Citation: JIANG Hong, LU Bin. A Novel implicit Deregistration Scheme in PCS Networks[J]. Journal of University of Electronic Science and Technology of China, 2008, 37(4): 515-518.

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return