An improved delay priority resource scheduling algorithm with low packet loss rate for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.Real-time services in LTE...An improved delay priority resource scheduling algorithm with low packet loss rate for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.Real-time services in LTE systems require lower delay and packet loss rate.However,it is difficult to meet the QoS requirements of real-time services using the current MBMS resource scheduling algorithm.The proposed algorithm in this paper jointly considers user delay information and real-time channel conditions.By introducing the user delay information,the lower delay and fairness of users are guaranteed.Meanwhile,by considering the channel conditions of users,the packet loss rate can be effectively reduced,improving the system throughput.Simulation results show that under the premise of ensuring the delay requirements of real-time services,the proposed algorithm achieves a lower packet loss rate compared to other existing algorithms.Furthermore,it can achieve a good balance between system throughput and user fairness.展开更多
An improved spectrum-efficient and fair resource scheduling algorithm for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.By jointly considering the channel con...An improved spectrum-efficient and fair resource scheduling algorithm for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.By jointly considering the channel conditions of all the users,the average packet loss rate,and the fairness of users in the MBMS group,the transmission data rate of the MBMS group is first selected according to the link adaptation and the average packet loss rate of users.Then,the resource blocks are allocated to MBMS groups according to the scheduling priority.Such a resource scheduling algorithm further balances the system throughput and user fairness.Theoretical analysis and simulation results show that the proposed algorithm can achieve a good tradeoff between system throughput and user fairness in comparison with traditional scheduling algorithms.展开更多
基金Supported by the National Natural Science Foundation of China(61901027)。
文摘An improved delay priority resource scheduling algorithm with low packet loss rate for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.Real-time services in LTE systems require lower delay and packet loss rate.However,it is difficult to meet the QoS requirements of real-time services using the current MBMS resource scheduling algorithm.The proposed algorithm in this paper jointly considers user delay information and real-time channel conditions.By introducing the user delay information,the lower delay and fairness of users are guaranteed.Meanwhile,by considering the channel conditions of users,the packet loss rate can be effectively reduced,improving the system throughput.Simulation results show that under the premise of ensuring the delay requirements of real-time services,the proposed algorithm achieves a lower packet loss rate compared to other existing algorithms.Furthermore,it can achieve a good balance between system throughput and user fairness.
文摘An improved spectrum-efficient and fair resource scheduling algorithm for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.By jointly considering the channel conditions of all the users,the average packet loss rate,and the fairness of users in the MBMS group,the transmission data rate of the MBMS group is first selected according to the link adaptation and the average packet loss rate of users.Then,the resource blocks are allocated to MBMS groups according to the scheduling priority.Such a resource scheduling algorithm further balances the system throughput and user fairness.Theoretical analysis and simulation results show that the proposed algorithm can achieve a good tradeoff between system throughput and user fairness in comparison with traditional scheduling algorithms.
