Analysis of Opportunistic Spectrum Sharing with Markovian Arrivals and Phase-Type Service

被引:26
|
作者
Tang, Shensheng [1 ]
Mark, Brian L. [1 ]
机构
[1] George Mason Univ, Dept Elect & Comp Engn, Fairfax, VA 22030 USA
基金
美国国家科学基金会;
关键词
Opportunistic spectrum sharing (OSS); primary users; secondary users; multi-dimensional Markov process; MAP; PH distribution; PERFORMANCE; NETWORKS; RADIO;
D O I
10.1109/TWC.2009.081161
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We develop a general framework for analyzing the performance of an opportunistic spectrum sharing (OSS) wireless system at the session level with Markovian arrivals and phase-type service times. The OSS system consists of primary or licensed users of the spectrum and secondary users that sense the channel status and opportunistically share the spectrum resources with the primary users in a coverage area. When a secondary user with an active session detects an arrival of a primary session in its current channel, the secondary user leaves the channel quickly and switches to an idle channel, if one is available, to continue the session. Otherwise, the secondary session is preempted and moved to a preemption queue. The OSS system is modeled by a multi-dimensional Markov process. We derive explicit expressions for the related transition rate matrices using matrix-analytic methods. We also obtain expressions for several performance measures of interest, and present both analytic and simulation results in terms of these performance measures. The proposed OSS model encompasses a large class of specific models as special cases, and should be useful for modeling and performance evaluation of future opportunistic spectrum sharing systems.
引用
收藏
页码:3142 / 3150
页数:9
相关论文
共 50 条
  • [41] Corrected Phase-Type Approximations of Heavy-Tailed Queueing Models in a Markovian Environment
    Vatamidou, E.
    Adan, I. J. B. F.
    Vlasiou, M.
    Zwart, B.
    [J]. STOCHASTIC MODELS, 2014, 30 (04) : 598 - 638
  • [42] SOME EXPLICIT FORMULAS AND COMPUTATIONAL METHODS FOR INFINITE-SERVER QUEUES WITH PHASE-TYPE ARRIVALS
    RAMASWAMI, V
    NEUTS, MF
    [J]. JOURNAL OF APPLIED PROBABILITY, 1980, 17 (02) : 498 - 514
  • [43] Determining the moments of queue-length distribution of discriminatory processor-sharing systems with phase-type service requirements
    Leino, Juha
    Virtamo, Jorma
    [J]. 2007 NEXT GENERATION INTERNET NETWORKS, 2007, : 205 - +
  • [44] Analysis of Two-Server Queueing Model with Phase-Type Service Time Distribution and Common Phases of Service
    Kim, Chesoong
    Dudin, Alexander
    Dudin, Sergey
    Dudina, Olga
    [J]. DISTRIBUTED COMPUTER AND COMMUNICATION NETWORKS, 2016, 601 : 19 - 29
  • [45] QUEUEING PROBLEMS WITH ARRIVALS IN GENERAL STRESM AND PHASE TYPE SERVICE
    RANA, RK
    [J]. METRIKA, 1971, 18 (01) : 69 - 80
  • [46] Opportunistic Spectrum Sharing with Quality-of-Service Support in Cognitive Radio Networks
    Li, Xiaojun
    Li, Quanzhong
    Liu, Kai
    [J]. 2014 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE), 2014, : 1356 - 1361
  • [47] Capacity Analysis of an Opportunistic Scheduling System in a Spectrum Sharing Environment
    Ban, Tae Won
    Sung, Dan Keun
    Jung, Bang Chul
    Choi, Wan
    [J]. GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2008,
  • [48] Modelling service time distribution in cellular networks using phase-type service distributions
    Jayasuriya, A
    Green, D
    Asenstorfer, J
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, 2001, : 440 - 444
  • [49] Queueing Inventory Systems with Phase-type Service Distributions: A Literature Review
    Choi, Kyung Hwan
    Yoon, Bong Kyoo
    Moon, Seong Am
    [J]. INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2019, 18 (03): : 330 - 339
  • [50] Wavelength converter sharing in asynchronous optical packet/burst switching: An exact blocking analysis for Markovian arrivals
    Akar, Nail
    Karasan, Ezhan
    Dogan, Kaan
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (12) : 69 - 80