Probability criterion paging area planning in future mobile communications systems

Kazantzakis, Michael G.; Koukoutsidis, Ioannis; Demestichas, Panagiotis; Theologou, M.

doi:10.1016/j.comcom.2003.12.003

Cited by 4 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the problem is analogous to that presented in Ref. 14 and analytically solvable as it is shown in Appendix III. However, this analytical model presents two main problems: high complexity, since it would require a matrix exponentiation (which implies a matrix diagonalization) at each paging, and its restricted use, as it is only applicable if the dwell time follows an exponential distribution, when it has been shown that other distributions (Gamma, Weibull, Pareto, Lognormal) better fit this variable 15.…”

Section: Paging Algorithmsmentioning

confidence: 97%

“…One of the key problems 3 to implement any of these approaches lies in obtaining the values for the probabilities for all of the PAs in the macro‐area of a specific user r . A first possibility is to define an analytical model 14 where, when a search must be performed, given a particular macro‐LA and a time since the last location update, taking advantage of the transition probabilities between LAs obtained in the training period, and the statistics of the time spent at each of these LAs (dwell time), these probabilities can be obtained. A second possibility to obtain these probabilities, more general and with lower complexity, lies in developing a training mechanism based on observation as it is explained below.…”

Section: Paging Algorithmsmentioning

confidence: 99%

“…The analytical modeling can be tackled from the perspective of Markov chains in continuous time, as described in Ref. 14 and summarized in Appendix III. In our general Markov chain (Figure 1), covering the whole network, each state represents being in a LA i with a previous stay in a different LA j .…”

Section: Paging Algorithmsmentioning

confidence: 99%

See 2 more Smart Citations

Adaptive paging schemes for group calls in mobile broadband cellular systems

Gállego

Canales

Hernández-Solana

2010

Wireless Communications

View full text Add to dashboard Cite

In this paper, we analyze the problem of efficient paging for group call searches under realistic mobility patterns. Taking as a basis a location update scheme, based on the definition of an adaptive macro-location area, adapted to the mobility pattern of the terminals, we characterize the residence probabilities in each location area of a generic macro-area. With this information, we propose and evaluate different sequential group paging strategies, also taking into account their computational cost. Results show the suitability of some of the proposals (semiadaptive and hybrid schemes) and its applicability to new packet-based broadband cellular systems. Adaptive paging schemes for group calls J. R. Gállego et al. Adaptive paging schemes for group calls J. R. Gállego et al. Adaptive paging schemes for group calls J. R. Gállego et al. J. R. Gállego et al. Adaptive paging schemes for group calls

show abstract

Section: Paging Algorithmsmentioning

confidence: 97%

Section: Paging Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive paging schemes for group calls in mobile broadband cellular systems

Gállego

Canales

Hernández-Solana

2010

Wireless Communications

View full text Add to dashboard Cite

show abstract

Optimal decision strategies for paging in mobile cellular networks

Koukoutsidis¹,

Demestichas²,

Papaioannou³

et al. 2006

Wireless Communications

View full text Add to dashboard Cite

A high‐level technical survey of paging in mobile cellular communication networks is presented in this paper. We view paging as an optimal decision problem and explore different strategies based on sequential decisions. The examined schemes concentrate on different perspectives of the problem, depending on the type of decisions and the amount of information available or exploitable by the system. This approach provides a useful categorization and an easy conceptual basis for their theoretical investigation, necessary for the deployment of advanced paging algorithms. Because of its suggested generality, the discussed framework is also laid as reference for further research. As modern networks evolve, more emphasis will be given towards optimization in all aspects of a network system. The schemes presented greatly reduce paging costs and can be used in cooperation with known location update strategies to make part of a real network location management system. Copyright © 2006 John Wiley & Sons, Ltd.

show abstract