Resource scheduling method and base station

Abstract

The embodiment of the invention discloses a resource scheduling method ad a base station, wherein the method comprises a step that: the base station measures the movement speed of at least one user, divides the user to a speed grade corresponding to the movement speed of the user and determines users who are qualified to participate in scheduling in the corresponding speed grades within a scheduling updating period T(i and j) corresponding to the each speed grade, wherein the T(i and j) is less than or equal to a channel coherence time T(coh, i and j) of the corresponding speed grade; the T(coh, i and j) is determined by the corresponding speed grade and a carrier frequency point of a resource block to be distributed, wherein i is the speed grade, and j is the carrier frequency point of the resource block to be distributed; and resource block is distributed to the user having a highest priority level from all the determined users who are qualified to participate in scheduling; therefore, the proportional fair scheduling complexity is lowered effectively, and the scheduling time is shortened.

Description

technical field [0001] The present invention relates to the field of wireless communication, in particular to a resource scheduling method and a base station. Background technique [0002] In mobile communication systems, radio resource management is responsible for the control, adjustment and allocation of air interface resources. The main function of scheduling is how to reasonably allocate limited wireless resources, such as spectrum resources, time resources, code resources, power resources, storage resources, etc., to many users. It is at the core and dominant position in wireless resource management. [0003] Usually when evaluating the performance of a scheduling algorithm, the following main reference indicators are used: [0004] 1. System throughput: measured by the amount of data transmitted per unit time in the cell; [0005] 2. User fairness: Whether all users in the community can obtain certain service opportunities; [0006] 3. Algorithm execution complexit...

AI Technical Summary

Problems solved by technology

[0006] 3. Algorithm execution complexity: it limits the operation cycle of the scheduling algorithm

However, the calculation complexity of this algorithm is high. With the rapid development of mobile communication, the number of mobile users has also increased sharply, which will lead to an increase in the amount of calculation and slow down the scheduling execution speed.

Images