• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.11
• /
• pp.60-66
• /
• 2011

LTE (Long Term Evolution) supports QoS (Quality of Service) with several service classes. For each class of traffic, a big difference exists on BER (Bit Error Rate) requirement. This leads to a considerable difference in transmission power for various classes of traffic. In this paper, a novel scheduler is designed and proposed for LTE which supports CoS (Class of Service) with the consideration of priority as well as target BER. By the CQI (Channel Quality Indicator) and QCI (QoS Class Identifier), a minimum transmission power is assigned from the target BER for each class of traffic per each user. Hence, with the other information such as user's used rate in the past and the priority of traffic, the probability of occupying channels is determined. The simulation results of Service Class scheduling are compared with that of Maximum Rate and Proportional Fair. The results show that the service class-aided scheduling can improve the throughput of whole system significantly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.762-768
• /
• 2015

D2D communication as an underlaying LTE-Advanced network has proven to be efficient in improving the network performance and decreasing the traffic load of eNodeB(enhanced NodeB). However large amount of interference can be caused by sharing the resources between the cellular users and D2D pairs. So, a resource allocation for D2D communication to coordinate the interference is necessary. Related works for resource allocation that D2D can reuse the resources of more than one cellular user with best CQI(Channel Quality Indicator) have been proposed. D2D communications may still cause interference to the primary cellular network when radio resource are shared between them. To avoid this problem, we propose a radio resource allocation algorithm with low computational complexity for D2D communication in OFDM-based wireless cellular networks. Unlike the previous works, the proposed algorithm utilizes unused ones of the whole resource. The unused resource allocate to on D2D pair can be shared only with other D2D pairs. In other words, if the distance between the D2D pairs is sufficient, we allowed more than two D2D pairs to share the same resources. The simulation results have proven that the proposed algorithm has up to 11 times lower computational complexity than the compared one according to the number of D2D.