数学物理学报(英文版) ›› 2015, Vol. 35 ›› Issue (1): 207-215.doi: 10.1016/S0252-9602(14)60152-1

• 论文 • 上一篇    下一篇

MULTI-DIMENSIONAL MARKOV CHAIN–BASED ANALYSIS OF CONFLICT PROBABILITY FOR SPECTRUM RESOURCE SHARING

张轶|喻莉|张利维   

  1. Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan National Laboratory for Optoelectronics, Wuhan 430074, China School of Mathematics and Statistics, Huazhong University of Science and Technology, Wuhan 430074, China
  • 收稿日期:2013-11-29 修回日期:2014-02-08 出版日期:2015-01-20 发布日期:2015-01-20
  • 基金资助:

    This work was supported in part by the Na- tional Natural Science Foundation of China (60972016, 61231010), the Funds of Distinguished Young Scientists (2009CDA150), and China-Finnish Cooperation Project (2010DFB10570), Specialized Research Fund for the Doctoral Program of Higher Education (20120142110015).

MULTI-DIMENSIONAL MARKOV CHAIN–BASED ANALYSIS OF CONFLICT PROBABILITY FOR SPECTRUM RESOURCE SHARING

ZHANG Yi,Yu Li, ZHANG Li Wei   

  1. Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan National Laboratory for Optoelectronics, Wuhan 430074, China School of Mathematics and Statistics, Huazhong University of Science and Technology, Wuhan 430074, China
  • Received:2013-11-29 Revised:2014-02-08 Online:2015-01-20 Published:2015-01-20
  • Supported by:

    This work was supported in part by the Na- tional Natural Science Foundation of China (60972016, 61231010), the Funds of Distinguished Young Scientists (2009CDA150), and China-Finnish Cooperation Project (2010DFB10570), Specialized Research Fund for the Doctoral Program of Higher Education (20120142110015).

摘要:

In this paper, we consider the optimal problem of channels sharing with het- erogeneous traffic (real-time service and non-real-time service) to reduce the data conflict probability of users. Moreover, a multi-dimensional Markov chain model is developed to analyze the performance of the proposed scheme. Meanwhile, performance metrics are de- rived. Numerical results show that the proposed scheme can effectively reduce the forced termination probability, blocking probability and spectrum utilization.

关键词: multi-dimensional Markov chain model, independent Poisson process, negative exponential distribution, forced termination probability, blocking probability

Abstract:

In this paper, we consider the optimal problem of channels sharing with het- erogeneous traffic (real-time service and non-real-time service) to reduce the data conflict probability of users. Moreover, a multi-dimensional Markov chain model is developed to analyze the performance of the proposed scheme. Meanwhile, performance metrics are de- rived. Numerical results show that the proposed scheme can effectively reduce the forced termination probability, blocking probability and spectrum utilization

Key words: multi-dimensional Markov chain model, independent Poisson process, negative exponential distribution, forced termination probability, blocking probability

中图分类号: 

  • 68Q87