2016
DOI: 10.1007/s11276-016-1268-1
|View full text |Cite
|
Sign up to set email alerts
|

Historical based location management strategies for PCS networks

Abstract: Due to the current popularity of wireless communication, personal communication service networks have attracted a lot of attention. As mobile terminals (MTs) in such networks have the ability to communicate on the move, location management (LM) is a critical issue that should be handled carefully. Managing MTs locations is to simultaneously perform two main operations, which are; location update and paging. A good LM strategy maintains both operations with the minimum time and signaling penalties. Although sev… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 32 publications
0
5
0
Order By: Relevance
“…The queue length for a arrival per second is a little more than 1, where as for 7 arrivals per second the queue length is about 2.5. This is because queue length is directly proportional to λ, as given in Equation 15. On the other hand, we find that the sojourn time decreases with arrival as shown in Figure 6.…”
Section: Graphical Analysis Of Modelmentioning
confidence: 62%
See 2 more Smart Citations
“…The queue length for a arrival per second is a little more than 1, where as for 7 arrivals per second the queue length is about 2.5. This is because queue length is directly proportional to λ, as given in Equation 15. On the other hand, we find that the sojourn time decreases with arrival as shown in Figure 6.…”
Section: Graphical Analysis Of Modelmentioning
confidence: 62%
“…The LBS privacy schemes that we have seen so far assume that the adversary can acquire a single request, the so called snapshot case. Historical attacks [14,15,16,17] assume that the adversary is able to link a set of requests fired by a user. One solution to this problem is the application of Hilbert Cloaking algorithm [16,17] which basically exploit the Hilbert space filling curve to find a total order among the user's various locations.…”
Section: K-anonymitymentioning
confidence: 99%
See 1 more Smart Citation
“…Generally, the best trade-off exists between the registration and paging costs, which lead to optimal usage of the radio resources. [4][5][6] The numerous LR schemes have been proposed so far: zone-based, 4,5 movement-based, [7][8][9][10][11] timerbased, 8,11,12 distance-based, [13][14][15][16] and tracking area list (TAL)-based [17][18][19] registrations. In zone-based registration, UE registers a new location area on the network whenever it moves to a new zone.…”
Section: Introductionmentioning
confidence: 99%
“…Many studies have been published on various location registration schemes, and there have been studies on distancebased registration [3,4], movement-based registration [3,[5][6][7], time-based registration, and so on [8,9]. However, most studies on mobility management have considered or included zone-based registration (ZBR) [10][11][12][13][14][15][16] because it is widely adopted by most mobile cellular networks.…”
Section: Introductionmentioning
confidence: 99%