4.2 Article

Modeling and Performance Analysis of Channel Assembling Based on Ps-rc Strategy with Priority Queues in CRNs

期刊

出版社

WILEY-HINDAWI
DOI: 10.1155/2022/6384261

关键词

-

资金

  1. National Natural Science Foundation of China [61663024]
  2. Erasmus+ Programme of European Commission [573879-EPP-1-2016-1-FR-EPPKA2-CBHE-JP]
  3. Hongliu First Class Discipline Development Project of Lanzhou University of Technology, China

向作者/读者索取更多资源

This paper proposes a polling scheduling strategy with reserved channel for predefined priority services in cognitive radio networks. By dynamically adjusting the assembled channels of secondary users, the strategy improves the performance of the secondary network and enhances the service quality of high-priority services on the basis of providing fair scheduling.
Based on two types of priority queues, this paper proposes a polling scheduling strategy with reserved channel (Ps-rc strategy) for predefined priority services in cognitive radio networks (CRNs). Channel assembling (CA) technology and spectrum adaptation (SA) technology are adopted to dynamically adjust the assembled channels of secondary users (SUs) to improve the performance of the secondary network. Specifically, the SUs in CRNs are divided into two queues with different priorities; based on polling scheduling, a part of the idle channel is reserved for high-priority queue during the polling stage of the low-priority queue. The purpose is to increase the service quality (QoS) of high priority on the basis of providing fair scheduling. Furthermore, the CA-based channel access process of the proposed strategy is presented and modeled by continuous time Markov chain (CTMC). Then, the process of resource flow between users is mapped on CTMC, and the transition conditions and parameter sets of channel assembling covering all user activities of the system are derived. Finally, the system performance of the proposed CA-based Ps-rc scheduling strategy is simulated and evaluated, including network capacity, spectrum utilization, blocking probability, and forced termination probability. Numerical results show that the proposed strategy can improve the QoS of the predefined high-priority service without causing excessive starvation problem of low-priority service.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据