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-dimens...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 derived. Numerical results show that the proposed scheme can effectively reduce the forced termination probability, blocking probability and spectrum utilization.展开更多
基金supported in part by the National Natural Science Foundation of China(60972016,61231010)the Funds of Distinguished Young Scientists(2009CDA150)+1 种基金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 derived. Numerical results show that the proposed scheme can effectively reduce the forced termination probability, blocking probability and spectrum utilization.
