A measurement-based prioritization scheme for handovers in mobile cellular networks

Tekinay, S.; Jabbari, Bijan

doi:10.1109/49.166761

Cited by 270 publications

(115 citation statements)

References 2 publications

Supporting

Mentioning

113

Contrasting

Unclassified

Order By: Relevance

“…The term gives the probability of handover failure for a first-priority handover call in the queue given the handover call joined the queue as the call. This is found as (11) where is the probability of a successful handover request in the first-priority handover queue given it joined the queue as the call, i.e., the handover request gets served or finishes its call before it gets service or before its is dropped. After some algebra, one gets [12], [24] (12)…”

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…It is shown that the proposed scheme, which is called measurement-based priority scheme (MBPS), outperforms FIFO queueing scheme under all traffic conditions [11]. However, the study in [11] does not take into account the dynamics of user motion. In [1] and [2], Ebersman and Tonguz investigate the dynamic queueing of handover calls using a signal prediction priority queueing (SPPQ) discipline, where the order of handover calls is not only based on the received signal strength (RSS), but also on the rate of change of RSS.…”

Section: Introductionmentioning

confidence: 99%

“…Tekinay and Jabbari in [11] study via simulations the performance of nonpreemptive priority queueing for handover calls, where, if a channel is released, then the handover call in the queue that has the lowest received signal strength gets served. It is shown that the proposed scheme, which is called measurement-based priority scheme (MBPS), outperforms FIFO queueing scheme under all traffic conditions [11].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Dynamic Priority Queueing of Handover Calls in Wireless Networks: An Analytical Framework

Xhafa

Tonguz

2004

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-In this paper, we present an analytical framework for dynamic priority queueing of handover calls in wireless networks. The framework employs a queueing discipline with two classes of priority for handover calls. Two queues, first priority and second priority, are employed for the two priority classes of handover calls. The priority of queued handover calls is not based only on the received signal strength, but also on the remaining time in the overlap region between two cells. We also incorporate a priority transition between handover calls in the queue; specifically, a second-priority handover call in the second-priority queue, based on certain criteria, can become a first-priority handover call and join the first-priority handover queue. In addition, the event that a handover call could finish its call while waiting in the queue is taken into account in the analysis. This event was not taken into consideration in previous related studies and, as a result, these previous studies overestimate handover failure probability.Our results also show that the predictions of the analytical framework developed in this paper are in very good agreement with simulation results. The developed analytical framework is comprehensive and can also cope with several priority schemes proposed by other researchers in the literature. For example, it is shown that, under certain conditions, the proposed framework converges to first-in-first-out queueing of handover calls. One can easily modify the proposed framework to incorporate priority schemes that use guard channels for handover calls. It is also shown that one could potentially use the framework developed in this paper in integrated voice/data networks, as well as for handover between different network types.The proposed analytical framework is anticipated to be a very useful tool in evaluating performance of present and future wireless networks employing dynamic priority queueing for handovers and in designing more efficient handover algorithms.Index Terms-Dynamic priority queueing, handover, wireless networks.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Dynamic Priority Queueing of Handover Calls in Wireless Networks: An Analytical Framework

Xhafa

Tonguz

2004

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…In this section, we introduce nonpriority, priority, and queuing handoff schemes for a single traffic system such as either a voice or a data system [6][7][8][9][10][11][12][13][14]. Before introducing these schemes, we assume that a system has many cells, with each having S channels.…”

Section: Handoff Schemes In Single Traffic Systemsmentioning

confidence: 99%