Multi-dimensional markov chain-based analysis of conflict probability for spectrum resource sharing

In this paper, we consider the optimal problem of channels sharing with heterogeneous 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 derived. Numerical results show that the proposed scheme can effectively reduce the forced termination probability, blocking probability and spectrum utilization.