A dynamic and semi-static joint scheduling method in LTE system

Abstract

The invention discloses a dynamic and semi-static combined dispatching method in an LTE system. The method comprises the steps that a base station obtains status information and parameters, so that whether service flows are retransmitted or not is determined, if not, whether the service flows are VoIP services is further determined, and a dynamic dispatching mechanism or a semi-static dispatching mechanism is carried out on the different service flows. Due to the fact that the semi-static dispatching mechanism and the dynamic dispatching mechanism are combined, the problem of service quality of real-time services and the throughput of non-real-time services are both considered, signaling resources are saved, and limited resources are fully utilized for achieving a better dispatching effect. Furthermore, on the basis of the dynamic dispatching mechanism, according to the improvement on an existing algorithm, calculation can be simplified on the premise that the real-time services and a bit rate are guaranteed, and secondary allocation on remaining resources is achieved. The dynamic and semi-static combined dispatching method in the LTE system can be widely applied in the field of wireless communication.

Description

technical field [0001] The invention relates to the field of wireless communication, in particular to a dynamic and semi-static joint scheduling method in an LTE system. Background technique [0002] Explanation of terms: [0003] LTE: Long Term Evolution (Long Term Evolution); [0004] 3GPP: The Third Generation Partnership Project (third generation partnership project); [0005] MAC: Medium Access Control (Media Access Control); [0006] TTI: Transmission Time Interval (transmission time interval); [0007] RB: Resource Block (resource block); [0008] IP: Internet Protocol (Internet Protocol); [0009] QoS: Quality of Service (Quality of Service); [0010] GBR: Guaranteed Bit Rate (guaranteed bit rate); [0011] MBR: Maximum Bit Rate (maximum bit rate); [0012] Max C / I: Maximum Carrier / Interference (maximum carrier-to-interference ratio algorithm); [0013] RR: Round Robin (polling algorithm); [0014] PF: Proportional Fair (proportional fair algorithm); [00...

AI Technical Summary

Problems solved by technology

[0028] Although the dynamic scheduling mechanism is more flexible, it requires a lot of control signaling, which may block the sending of data packets

Although the semi-persistent scheduling mechanism can effectively save the PDCCH resources used by the LTE system for scheduling instructions, it is only suitable for VoIP services with small packets and a certain sending cycle.

[0029] At present, the existing scheduling algorithms only aim at the dynamic scheduling mechanism, and cannot better meet the throughput and QoS requirements of the system in mixed business scenarios

Three classic scheduling algorithms: Max C / I, RR, and PF do not consider packet delay, and are not suitable for real-time services

The M-LWDF algorithm is suitable for high data rate services, considering the HOL delay and improving the performance of real-time services, but it is an unfair scheduling algorithm and is not suitable for non-real-time services

[0030] The feature of the static scheduling mechanism is that it does not consider the real-time status of the channel, and the resource allocation is fixed and continues for the entire business; the disadvantage is that the resource allocation is inflexible and the resource waste is serious

The characteristic of the dynamic scheduling mechanism is that each TTI dynamically performs resource scheduling according to the channel conditions fed back by users, and enjoys full diversity in the time-frequency domain of the channel; its disadvantage is that a large amount of control signaling is required, which may block the transmission of data packets

Images