A Novel implicit Deregistration Scheme in PCS Networks
- Received Date: 2006-11-09
- Rev Recd Date: 2007-09-13
- Publish Date: 2008-08-15
-
Key words:
- cost /
- implicit deregistration /
- location management /
- VLR
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.
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. |