A preemptive priority queuing scheme for handovers in TETRA networks

Chang Liu, Hai Li, Lingyun Li

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

As a key element in wireless cellular networks, handover procedure has a significant impact on the system's performance. In this paper, we present a preemptive priority queuing method to provide better Quality of Service (QoS) by decreasing handover failure probability in Terrestrial Trunked Radio (TETRA) networks. As a specialty of TETRA systems, the priority criteria should be satisfied when bringing in a new method and it makes the algorithm more complex. Considering different levels of users' priority and call status, the proposed algorithm uses a computable hybrid priority to evaluate different calls. The major characters of this method, which simulated in a typical scenario of TETRA networks, are compared with some other algorithms. The result shows that this new scheme can reduce probability of handover failure effectively and provide stable service quality for higher priority users even in extremely high cell load condition.

Original languageEnglish
Title of host publicationProceedings of 2012 IEEE 14th International Conference on Communication Technology, ICCT 2012
Pages133-137
Number of pages5
DOIs
Publication statusPublished - 2012
Event2012 IEEE 14th International Conference on Communication Technology, ICCT 2012 - Chengdu, China
Duration: 9 Nov 201211 Nov 2012

Publication series

NameInternational Conference on Communication Technology Proceedings, ICCT

Conference

Conference2012 IEEE 14th International Conference on Communication Technology, ICCT 2012
Country/TerritoryChina
CityChengdu
Period9/11/1211/11/12

Keywords

  • TETRA system
  • handover
  • hybrid priority
  • preemptive policy
  • queuing method

Fingerprint

Dive into the research topics of 'A preemptive priority queuing scheme for handovers in TETRA networks'. Together they form a unique fingerprint.

Cite this