Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Computer Networksarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Computer Networks
Article . 2006 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
DBLP
Article . 2006
Data sources: DBLP
versions View all 2 versions
addClaim

Location management for GPRS

Authors: Ning Chai; Boon Sain Yeo; Yong Huat Chew;

Location management for GPRS

Abstract

In cellular wireless networks, location management is an important mechanism that enables network to discover the current attachment point of a mobile so as to facilitate successful information delivery. Although the design of optimal location management has been studied extensively for GSM, it is surprising that little, or possibly no, attention has been given to the consideration of location management design for General Packet Radio Service (GPRS), given that it is fast becoming a de facto system. Unlike GSM, the tracking of mobiles (MS) in the GPRS is made through routing area (RA) and location area (LA). For the first time, the mode of operation of MS, mobility management of MS and the network operation mode are considered as part of the proposed location management design model. The objective of the paper is to study in detail the impacts of the various varying parameters have on the performance of location management in GPRS. Two schemes, namely, greedy algorithm and optimal algorithm, are proposed and the mathematical models are developed in this paper. Comparative studies of the two schemes are carried out and discussed.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    7
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
7
Average
Top 10%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!