KR20060118000A - Scheduler, base station, and scheduling method - Google Patents

Abstract

A scheduling method comprises a wireless resource allocation step of allocating a wireless resource to all or a part of mobile stations in a cell according to handover information (TRUE, FALSE) on each mobile station indicating that the mobile station is in a processing for handover. For example, a scheduler (12), as a processing in the wireless allocation step, executes wireless resource allocation for a mobile station on which the information indicates "a state (FALSE) that the mobile station is not in a processing for handover".

Description

Scheduler, base station and scheduling method {SCHEDULER, BASE STATION, AND SCHEDULING METHOD}

The present invention relates to a scheduler for controlling radio resources, and more particularly, to a scheduler for adaptively allocating radio resources according to a communication environment, a base station having the scheduler, and a scheduling method thereof.

The conventional scheduler will be described below.

In a wireless communication system, it is required to effectively use any radio resource to increase the system capacity (the number of users that can be accommodated in the system). In particular, in the wireless environment, since the link quality varies from user to user and varies dynamically, the packet scheduler that controls the radio resource in accordance with the link quality greatly influences the quality of service (QoS) and system capacity. Therefore, in general, in a wireless communication system, wireless resources are adaptively controlled based on link quality and required service quality.

As a conventional scheduler for controlling the radio resources, for example, a packet scheduler in the case of assuming high-speed downlink packet access (HSDPA) defined in 3GPP is proposed (Non-Patent Document 1, Non-Patent Document). 2). In addition, Non-Patent Document 1 describes a technique related to a carrier to interference ratio (C / I) scheduler and a round robin scheduler as a packet scheduler. In addition, Non-Patent Document 2 describes moving the scheduler function from the RNC (radio network controller) to the base station NodeB.

Therefore, in the wireless communication system using the above-mentioned document, when the C / I scheduler is used, for example, the NodeB is a CQI (Channel Quality Indicator) corresponding to the C / I sent from the mobile station UE at a predetermined timing. The radio resources (the number of transport blocks, the modulation method, the number of codes, etc.) are controlled based on the value and the amount of data to be transmitted (the amount of data stored in the transmission buffer for each UE). Specifically, for example, the NodeB rearranges the priority of the UE accumulating the amount of transmission data of a predetermined amount or more in the order of the high CQI, and performs radio resource allocation control in the order of this priority. . In the case where the CQIs are equal, the priority is randomly determined. In addition, transmission data is allocated with the upper limit of the data amount according to CQI. In addition, when there is a lack of radio resources, radio resource allocation control is not performed for UEs with low priority.

Non Patent Literature 1

3GPP TR25.848 V4.0.0 (2001-03) A.3.5 Packet scheduler

Non Patent Literature 2

3GPP TS25.308 V5.4.0 (2003-03) 6.2.3 Details of MAC-hs

However, in the above-described conventional scheduler, since the priority of each UE in the cell is determined based on the CQI, for example, the UE which should be originally set to have a high priority (example: UE existing near NodeB). ) Is set lower than the priority of UEs (such as UEs requiring handover) that exist near the boundary of the cell's cover range due to temporary deterioration of quality due to a shield or the like. . In this case, despite the high possibility of quality recovery in recent years, radio resources are preferentially allocated to UEs located near the boundary of the cell coverage range, and radio resources are not allocated to UEs located near the NodeB. There was a problem that there was a possibility.

SUMMARY OF THE INVENTION The present invention has been made in view of the above, and provides a scheduler capable of adaptively controlling radio resources in consideration of the presence of a UE which is temporarily deteriorated in accordance with a dynamically changing radio environment. It is aimed at.

Disclosure of the Invention

In the scheduler according to the present invention, as a scheduler for allocating radio resources to mobile stations in a cell in a base station, for example, all or all of the mobile stations in a cell based on handover information on a mobile station basis indicating whether or not a handover is being performed. It is characterized by allocating radio resources for some.

According to the present invention, radio resource allocation control is also performed for a mobile station whose quality deteriorates temporarily. As a result, the effective use of radio resources becomes possible, resulting in increased throughput.

1 is a diagram showing the configuration of a base station having a scheduler according to the present invention;

2 is a flowchart showing a scheduling method according to the first embodiment,

3 is a flowchart showing a scheduling method of Embodiment 2;

4 is a flowchart showing a scheduling method according to the third embodiment;

5 is a flowchart showing a scheduling method according to the fourth embodiment,

6 is a flowchart showing a scheduling method according to the fifth embodiment;

7 is a flowchart showing a scheduling method according to the sixth embodiment;

8 is a flowchart showing a scheduling method according to the seventh embodiment;

9 is a flowchart showing a scheduling method according to the eighth embodiment;

10 is a flowchart showing a scheduling method of Example 9,

11 is a flowchart showing a scheduling method of Embodiment 10,

12 is a flowchart showing a scheduling method of the eleventh embodiment.

To practice the invention  Best form for

EMBODIMENT OF THE INVENTION Below, the Example of the scheduler, base station, and scheduling method which concerns on this invention is described in detail based on drawing. In addition, this invention is not limited by this Example.

First, the scheduler and scheduling method of the first embodiment will be described. Fig. 1 is a diagram showing the configuration of a base station (NodeB) having a scheduler according to the present invention. The base station 1 is a C / I (instantaneous C / I) from the mobile stations UE # 1 to #N, respectively. Receivers 11-1, 11-2, 11-3 which receive CQI (channel quality information) such as 11-N), the scheduler 12 which performs radio resource allocation control based on handover information sent from a radio network controller (RNC) and the scheduler 12, Transmitters 13-1, 13-2, 13-3, ... 13-N for allocating radio resources. In addition, instantaneous C / I represents information transmitted from the mobile station at one time, and average C / I represents information after performing averaging process of instantaneous C / I at the base station.

The handover information is defined as "3GPP TSG-Ran WG1 # 1l NYC, USA, 25-29 August, 2003 Tdoc Rl-030902, Title: LS on NodeB behavior during subsequent RL synchronization" as a handover indicator. Information indicating whether handover is in progress, which is transmitted from the network to the NodeB. In addition, TFRC (Transport Format Resource Combination) shown shows a transport block size, a modulation method, and the number of codes.

Here, the scheduling method of this embodiment will be described in detail with reference to the drawings. 2 is a flowchart showing the scheduling method of the first embodiment. In the present embodiment, the case where the handover indicator is applied to the round robin scheduling method, which is a method of using one resource in order, will be described.

First, in the base station 1, the scheduler 12 monitors the handover indicators # 1 to #N corresponding to the mobile stations # 1 to #N in the cell (step S1), for example, "TRUE (handover). Medium), the mobile station is excluded from the mobile station to be scheduled (step S2).

In the scheduler 12, the handover indicator is targeted to all mobile stations of "FALSE (no handover)" (steps S1, Yes), and the scheduling by the round robin method (hereinafter referred to as round robin scheduling). (Step S3).

Specifically, for example, when the number of mobile stations whose handover indicator is "FALSE" is set to P, and identifiers 1 to P are individually applied to each mobile station, the scheduler 12 firstly sets the identifier to "PALSE". Radio resource allocation control is performed for the mobile station of "1" (at this time, if there is no data to be transmitted to the mobile station whose identifier is "1", radio resource allocation control is not performed for this mobile station, and then the identifier is ""). Radio resource allocation control is performed for the mobile station of 2 ".). Subsequently, the scheduler 12 performs the same operation (round robin scheduling) until a predetermined radio resource is consumed for the mobile stations whose identifiers are "2", "3", ... that are not performing handover. Is executed continuously. For example, here, wireless resource allocation control is performed for K mobile stations in the P mobile stations (1? K? P) (step S3).

Then, the scheduler 12 checks whether the handover indicator has been updated (step S5) after a predetermined time (for example: 2 ms) has elapsed since starting the round robin scheduling (step S5). For example, If it is not updated (step S5, No), step S3 is executed again in order from the mobile station whose identifier is "K + 1", and radio resource allocation control is performed until the predetermined radio resource is consumed. On the other hand, when the handover indicator is updated in step S5 (steps S5 and Yes), the scheduler 12 does not perform radio resource allocation control for the mobile station whose identifier is " K + 1 " The process from S1 is executed. The handover indicator is updated on a regular basis independently of the round robin scheduling (step S3), and a new identifier (P + 1, P + 2, ...) is assigned to the mobile station which is newly " FALSE ". In addition, the mobile station newly added as "TRUE" is excluded from the scheduling object.

In this manner, in round robin scheduling, radio resource allocation control is performed in order for each mobile station, and once allocation is performed, the next allocation opportunity is not obtained until the order returns. That is, equal scheduling is performed for all target mobile stations. Further, as the predetermined radio resource, a radio resource of 15 codes is assumed, for example, 7 codes are assigned to a mobile station having an identifier of "1", and 5 codes are assigned to a mobile station having an identifier of "2". When three codes are assigned to the mobile station having the identifier "3" (the total number of codes is 15), the scheduler 12 performs radio resource allocation control for the mobile station having the identifier "4" or later (an example). 2ms or later).

As described above, in the present embodiment, round robin scheduling (radio resource allocation control) is performed for the mobile station that is not performing the handover. As a result, radio resource allocation control is not performed on the mobile station under handover, and radio resource allocation control is surely performed on the mobile station whose quality is temporarily deteriorated. In other words, the effective use of radio resources is enabled, resulting in increased throughput.

In this embodiment, C / I may be used as a limitation of radio resource allocation. In this case, it is assumed that C / I does not affect the priority (order to be assigned) of the mobile station to be scheduled.

Subsequently, the scheduler and the scheduling method of the second embodiment will be described. In addition, about the structure of a scheduler, since it is the same as that of FIG. 1 of Example 1 mentioned above, the same code | symbol is attached | subjected and the description is abbreviate | omitted.

Hereinafter, the scheduling method of the second embodiment will be described in detail with reference to the drawings. 3 is a flowchart showing a scheduling method of the second embodiment. In the present embodiment, an example in the case where the priority by the handover indicator is set in the scheduling method of the first embodiment described above will be described. In addition, only the process different from Example 1 mentioned above is demonstrated here.

In the base station 1, the scheduler 12 monitors a handover indicator corresponding to each of the mobile stations # 1 to #N in the cell (step S11).

Next, in the scheduler 12, round robin scheduling is performed based on the handover indicator corresponding to each mobile station (step S12). Specifically, in the scheduler 12, first, the mobile station whose handover indicator is "FALSE". If the number is P, the identifier of each mobile station is 1, 2, ... P. On the other hand, if the number of mobile stations whose handover indicator is "TRUE" is Q, the identifier of each mobile station is P + 1, P + 2. And ... N (N = P + Q), and the radio resource allocation control is started from the mobile station having the identifier "1" (at this time, there is no data to be transmitted to the mobile station having the identifier "1"). In this case, the radio resource allocation control is started from the mobile station whose identifier is "2" without performing the radio resource allocation control for this mobile station.) Then, in the scheduler 12, the identifiers are "2" and "3". Until the mobile station consumes a predetermined radio resource The same operation (round robin scheduling) is continuously executed, and for example, radio resource allocation control is performed for K mobile stations (1≤K≤N) of N mobile stations (step S12).

Moreover, said K may be 1 <= K <P, or P <= K <= N may be sufficient as it. Therefore, when K is 1 &lt; K &lt; P, the next round robin scheduling is performed (in the case of step S5, No), and the mobile station whose handover indicator is " FALSE " (the identifier corresponds to the mobile station of " K + 1 "). In the case where K is P≤K≤N, on the other hand, the next round robin scheduling (in the case of step S5, No), the mobile station (identifier is "TRUE") is performed. Equivalent to a mobile station of K + l "). In addition, in the present embodiment, the handover indicator is updated on a regular basis independently of the round robin scheduling (step S12) as in the first embodiment described above. There is no mobile station to be excluded, and a new identifier is assigned to both the mobile station of "FALSE" and the mobile station of "TRUE". At this time, an identifier of "P + 1", "P + 2", ... is assigned to the mobile station newly named "FALSE", and an identifier following the identifier of the mobile station of "FALSE" is given to the mobile station of "TRUE". Is given.

Thus, in this embodiment, the priority is set to each mobile station in accordance with the contents of the handover indicator.

As described above, in the present embodiment, the round robin scheduling is performed for the mobile station not performing the handover, and then the round robin scheduling is performed for the mobile station under the handover. As a result, the priority can be set according to the handover indicator, and radio resource allocation control is preferentially performed even for a mobile station whose quality is temporarily deteriorated. In other words, it is possible to effectively use radio resources while maintaining fairness of all mobile stations, resulting in increased throughput.

Next, the scheduler and the scheduling method of the third embodiment will be described. In addition, about the structure of a scheduler, since it is the same as that of FIG. 1 of Example 1 mentioned above, the same code | symbol is attached | subjected and the description is abbreviate | omitted.

Hereinafter, the scheduling method of the third embodiment will be described in detail with reference to the drawings. 4 is a flowchart showing a scheduling method of the third embodiment. In the present embodiment, an example in the case where the priority by the handover indicator is set in the scheduling method of the first embodiment described above will be described. In addition, only the process different from Example 1 or 2 demonstrated above is demonstrated here.

In the scheduler 12 of the present embodiment, round robin scheduling is performed on a basis different from the above-described second embodiment based on the handover indicator corresponding to each mobile station (step S21). Specifically, first, in the scheduler 12, when the number of mobile stations whose handover indicator is "FALSE" is P, the identifiers of the respective mobile stations are 1, 2, ... P, while the handover indicator is " If the number of mobile stations "TRUE" is Q, the identifier of each mobile station is set to P + 1, P + 2, N (N = P + Q). Then, radio resource allocation control is started from the mobile station having the identifier "1" (at this time, if there is no data to be transmitted to the mobile station having the identifier "l", radio resource allocation control is not performed for this mobile station, Radio resource allocation control is started from the mobile station having the identifier " 2 ". Subsequently, the scheduler 12 continuously executes the same operation (round robin scheduling) for the mobile stations whose identifiers are "2", "3", ... until the predetermined radio resource is consumed. For example, here, the radio resource allocation control is performed for K mobile stations (1≤K≤N) among N mobile stations (step S21).

Moreover, said K may be 1 <= K <P, or P <= K <= N may be sufficient as it. However, if K is P≤K≤N, the next round robin scheduling (in the case of step S5, No) is resumed from the mobile station having the identifier "1" whose handover indicator is "FALSE" and the K Is 1 &lt; K &lt; P, the next round robin scheduling is resumed from the mobile station with the identifier " K + 1 " whose handover indicator is " FALSE " (step S5, No). For example, when the next round robin scheduling is resumed from the mobile station having the handover indicator of "FALSE", radio resource allocation control for the mobile station of identifier "P" is ended, and then the identifier is Radio resource allocation control is performed for the mobile station having &quot; 1 &quot;, and then the next round robin scheduling (in the case of step S5, No) is executed only in the mobile station whose handover indicator is &quot; FALSE &quot;.

That is, the radio resource allocation control for the mobile station whose handover indicator is "TRUE" is to be executed only at the first round robin scheduling executed subsequent to step S1, and even at the time of the first round robin scheduling, the handover indicator is performed. Only when radio resources remain in the stage where radio resource allocation control for the mobile station with " FALSE " is completed, radio resource allocation control is performed for the mobile station with the handover indicator " TRUE ". However, if there is no mobile station with handover indicator "FALSE", round robin scheduling is performed for the mobile station with handover indicator "TRUE".

As described above, in the present embodiment, a different priority is set from the above-described second embodiment in accordance with the contents of the handover indicator.

As described above, in the present embodiment, the round robin scheduling is basically performed for the mobile station not performing the handover. However, if there is no mobile station to which handover is not performed, or if there are radio resources remaining at the stage where radio resource allocation control for all mobile stations not to be handed over is completed, the mobile station under handover is targeted. Then, round robin scheduling is performed. As a result, the priority can be set according to the handover indicator, and radio resource allocation control is preferentially performed even for a mobile station whose quality is temporarily deteriorated. In other words, the effective use of radio resources is enabled, resulting in increased throughput.

Next, the scheduler and the scheduling method of the fourth embodiment will be described. In addition, about the structure of a scheduler, since it is the same as that of FIG. 1 of Example 1 mentioned above, the same code | symbol is attached | subjected and the description is abbreviate | omitted.

Hereinafter, the scheduling method of the fourth embodiment will be described in detail with reference to the drawings. 5 is a flowchart showing a scheduling method of the fourth embodiment. In this case, the receivers 11-1 to 11-N receive instantaneous C / Is (for example: 2ms / 1 times) from the corresponding mobile stations # 1 to #N, respectively, and in addition, past instantaneous C / Is. Calculate the average C / I (example: average of the instantaneous C / I received in the past 20ms).

In the base station 1, the scheduler 12 periodically receives instantaneous C / I and average C / I from the receivers # 1 to #N (step S31), and further, handover indicators in units of mobile stations from the RNC. Is received (step S31).

Then, the scheduler 12 calculates the priority: Pr for each mobile station based on the following formula (1) (step S32). However, in the handover indicator of Equation 1, " 1 " for " FALSE (no handover) " and " 0 " for " TRUE (handover) " Assign. That is, in this embodiment, the mobile station in the handover is excluded from the radio resource allocation control object.

For example, in the case of "instant C / I> average C / I", the mobile station is considered to be approaching the base station 1, and is considered to be approaching at high speed as the difference becomes larger. On the other hand, in the case of "instant C / I <average C / I", the mobile station is considered to be far from the base station 1, and is considered to be far away at high speed as the difference becomes larger. Therefore, in the present embodiment, the priority of the radio resource allocation control is set high in order from the mobile stations with large instantaneous C / I / average C / I (proportional fairness type scheduler). Equivalent to).

Pr = ((Instant C / I) / (Average C / I)) × Handover Indicator

After that, the scheduler 12 performs radio resource allocation control in the order of high priority: Pr. Specifically, for example, when the number of mobile stations whose handover indicator is "FALSE" is N, the scheduler 12 first performs radio resource allocation control for the mobile station having the highest priority (n = 1). (Step S33, S34) (At this time, if there is no data to be transmitted to the mobile station having the highest priority, radio resource allocation control is not performed for this mobile station. Next, the high priority (n = 2) is performed. Radio resource allocation control is performed for the mobile station. The scheduler 12 then consumes a predetermined radio resource until, for example, the radio resource allocation control for the lowest priority (n = N) mobile station is completed (step S35, Yes). The radio resource allocation control is executed in order for the mobile stations with the second highest (n = 2), third (n = 3), ... until the step (step S36, No). S35, No, S36, Yes, S37).

Then, in the scheduler 12, after a predetermined time (e.g., 2 ms) has elapsed since the radio resource allocation control is started for the mobile station having the highest priority (n = 1) (step S38), the handover indicator and the instantaneous C / It is checked whether there has been an update of I or average C / I (step S39). For example, if it is not updated (step S39, No), the radio resource allocation control is performed when a predetermined time has elapsed. The processing after step S34 is executed again in order (step S37) from the mobile station having the highest priority (k + 1th) after the completed mobile station (kth: 1 < = k &lt; N). On the other hand, when the handover indicator, instantaneous C / I, or average C / I is updated in step S39 (step S39, Yes), the scheduler 12 executes the process after step S31 again.

That is, as the predetermined radio resource, a radio resource of 15 codes is assumed, for example, 7 codes are assigned to the mobile station having the highest priority, and 5 codes are assigned to the mobile station having the highest priority. When 3 codes are assigned to the third mobile station having the highest priority (the total number of codes is 15), the scheduler 12 performs radio resource allocation control for the fourth mobile station having the highest priority. Example: After 2ms).

As described above, in the present embodiment, the radio resource allocation control is performed in the order of high priority for the mobile station which is not performing the handover. As a result, radio resource allocation control is performed for all mobile stations that are not being handed over, and radio resource allocation control is reliably performed even for mobile stations whose quality deteriorates temporarily. In other words, the effective use of radio resources is enabled, resulting in increased throughput.

Next, the scheduler and the scheduling method of the fifth embodiment will be described. In addition, about the structure of a scheduler, since it is the same as that of FIG. 1 of Example 1 mentioned above, the same code | symbol is attached | subjected and the description is abbreviate | omitted.

Hereinafter, the scheduling method of the fifth embodiment will be described in detail with reference to the drawings. 6 is a flowchart showing a scheduling method of the fifth embodiment. Here, only the processing different from the above-described fourth embodiment will be described.

For example, the scheduler 12 checks whether or not the handover indicator is "FALSE" for each mobile station, and for the mobile station of "FALSE" (steps S41, Yes), based on the following equation (2): : Pr is calculated (step S42). On the other hand, for the mobile station of "TRUE" (step S41, No), the priority: Pr is calculated based on the following formula (3) (step S43).

However, "0.8" is substituted into (alpha) in (2) and (3) below. That is, in this embodiment, the priority of the mobile station under handover is reduced. In addition, as long as the value of (alpha) is larger than "0.5", it may be other than "0.8".

Pr = ((Instant C / I) / (Average C / I)) × α

Pr = ((Instant C / I) / (Average C / I)) × (1-α)

As described above, in the present embodiment, radio resource allocation control is performed so that the priority of the mobile station that is not performing the handover is higher than the priority of the mobile station that is being handed over, and in order of high priority for all the mobile stations. Is done. As a result, the priority can be set for all mobile stations, and radio resource allocation control is surely performed even for mobile stations whose quality is temporarily deteriorated. In other words, the effective use of radio resources is enabled, resulting in increased throughput.

Next, the scheduler and the scheduling method of the sixth embodiment will be described. In addition, about the structure of a scheduler, since it is the same as that of FIG. 1 of Example 1 mentioned above, the same code | symbol is attached | subjected and the description is abbreviate | omitted.

Hereinafter, the scheduling method of the sixth embodiment will be described in detail with reference to the drawings. 7 is a flowchart showing a scheduling method of the sixth embodiment. Here, only the processing different from the above-described embodiment 4 or 5 will be described.

In the base station 1, the scheduler 12 periodically receives instantaneous C / I and average C / I from the receivers # 1 to #N (step S51), and further, handover indicator for each mobile station from the RNC. Is received (step S51), and the amount of transmission data (transmission data amount) recorded in the transmission buffer is received (step S51).

Then, the scheduler 12 calculates the priority: Pr for each mobile station based on the following equation (4) (step S52).

Pr = ((instantaneous C / I) / (average C / I)) × transmission data amount × handover indicator

In the scheduler 12 of the present embodiment, after a predetermined time (e.g. ms) has elapsed since the radio resource allocation control is started for the mobile station having the highest priority (n = 1) (step S38), the handover indicator, Check whether there has been an update of the instantaneous C / I, the average C / I, or the amount of transmission data (step S53). For example, if it is not updated (step S53, No), the predetermined time has elapsed. At this point, the processing after step S34 is performed in order (step S37) from the next highest mobile station (k + 1th) to which the radio resource allocation control is completed (kth: 1 < = k &lt; N). Run On the other hand, when the handover indicator, the instantaneous C / I, the average C / I, or the transmission data amount are updated in step S53 (step S53, Yes), the scheduler 12 again executes the process after step S51. Run

As described above, in this embodiment, the radio resource allocation control is performed in the order of high priority for the mobile station which is not performing the handover. At this time, the transmission data amount is reflected in the priority. As a result, radio resource allocation control is performed for all mobile stations that are not being handed over, and radio resource allocation control is surely performed even for mobile stations whose quality deteriorates temporarily. In other words, the effective use of radio resources is enabled, resulting in increased throughput.

Subsequently, the scheduler and the scheduling method of the seventh embodiment will be described. In addition, about the structure of a scheduler, since it is the same as that of FIG. 1 of Example 1 mentioned above, the same code | symbol is attached | subjected and the description is abbreviate | omitted.

Hereinafter, the scheduling method of the seventh embodiment will be described in detail with reference to the drawings. 8 is a flowchart showing a scheduling method of the seventh embodiment. Here, only the processing different from the above-described embodiments 4, 5 or 6 will be described.

For example, the scheduler 12 checks whether the handover indicator is "FALSE" for each mobile station, and for the mobile station of "FALSE" (steps S41, Yes), based on the following equation (5): : Pr is calculated (step S61). On the other hand, for the mobile station of "TRUE" (step S41, No), the priority: Pr is calculated based on the following formula (6) (step S62).

Pr = ((instantaneous C / I) / (average C / I)) × transmission data amount × α

Pr = ((instantaneous C / I) / (average C / I)) × transmission data amount × (1-α)

As described above, in the present embodiment, radio resource allocation control is performed in order that the priority of the mobile station not being handed over is higher than the priority of the mobile station being handed over, and the priority is high for all mobile stations. Do it. However, since the amount of transmission data is reflected in the priority, there is a possibility that the priority of the mobile station being handed over becomes high. As a result, the priority can be set for all mobile stations, and radio resource allocation control is surely performed even for mobile stations whose quality deteriorates temporarily. In other words, the effective use of radio resources is enabled, resulting in increased throughput.

Next, the scheduler and the scheduling method of the eighth embodiment will be described. In addition, about the structure of a scheduler, since it is the same as that of FIG. 1 of Example 1 mentioned above, the same code | symbol is attached | subjected and the description is abbreviate | omitted.

Hereinafter, the scheduling method of Embodiment 8 will be described in detail with reference to the drawings. 9 is a flowchart showing a scheduling method of the eighth embodiment. In this example, the receivers 11-1 to 11-N receive instantaneous C / Is (for example: 2 ms / 1 times) from the corresponding mobile stations # 1 to #N, respectively. A case of outputting to (12) will be described. In addition, the present invention is not limited thereto. For example, an average C / r (for example: average of instantaneous C / I received in the past 20 ms) is calculated using the past instantaneous C / I, and the calculated result is calculated using a scheduler ( 12) may be output. Hereinafter, only the processing different from the above-described Examples 4 to 7 will be described.

In the base station 1, the scheduler 12 periodically receives instantaneous C / I from the receivers # 1 to #N (step S71), and also receives a handover indicator for each mobile station from the RNC (step). S71).

Then, the scheduler 12 calculates the priority: Pr for each mobile station based on the following equation (7) (step S72). In the present embodiment, the priority of the radio resource allocation control is set high in order from the mobile stations having a large instantaneous C / I (corresponding to the MAXC / I type scheduler).

Pr = (instantaneous C / I) × handover indicator

In addition, in the scheduler 12 of the present embodiment, after a predetermined time (e.g., 2ms) has elapsed since the radio resource allocation control is started for the mobile station having the highest priority (n = 1) (step S38), the handover indicator or It is checked whether or not there has been an update of the instantaneous C / I (step S73). For example, if it is not updated (step S73, No), the radio resource allocation control is completed when a predetermined time has elapsed. From the mobile station next to the mobile station (kth: 1 < = k &lt; N), the processing after step S34 is executed again in order (step S37). On the other hand, when the handover indicator or instantaneous C / I is updated in step S73 (step S73, Yes), the scheduler 12 executes the process after step S71 again.

As described above, in this embodiment, the radio resource allocation control is performed in the order of high priority for the mobile station which is not performing the handover. As a result, radio resource allocation control is performed for all mobile stations that are not being handed over, and radio resource allocation control is reliably performed even for mobile stations that temporarily deteriorate in quality. In other words, the effective use of radio resources is enabled, resulting in increased throughput.

Next, the scheduler and the scheduling method of the ninth embodiment will be described. In addition, about the structure of a scheduler, since it is the same as that of FIG. 1 of Example 1 mentioned above, the same code | symbol is attached | subjected and the description is abbreviate | omitted.

Hereinafter, the scheduling method of Embodiment 9 will be described in detail with reference to the drawings. 10 is a flowchart showing a scheduling method of the ninth embodiment. Here, only the processing different from the above-described Embodiments 4 to 8 will be described.

For example, in the scheduler 12, every mobile station. It is checked whether the handover indicator is "FALSE", and for the mobile station of "FALSE" (step S41, Yes), the priority: Pr is calculated based on the following formula (8) (step S81). On the other hand, for the mobile station of "TRUE" (step S41, No), the priority: Pr is calculated based on the following formula (9) (step S2).

Pr = (instantaneous C / I) × α

Pr = (instantaneous C / I) × (1-α)

As described above, in the present embodiment, radio resource allocation control is performed in order that the priority of the mobile station not being handed over is higher than the priority of the mobile station being handed over, and the priority is high for all mobile stations. Do it. As a result, the priority can be set for all mobile stations, and radio resource allocation control is surely performed even for mobile stations whose quality is temporarily deteriorated. In other words, the effective use of radio resources is enabled, resulting in increased throughput.

Next, the scheduler and the scheduling method of the tenth embodiment will be described. In addition, about the structure of a scheduler, since it is the same as that of FIG. 1 of Example 1 mentioned above, the same code | symbol is attached | subjected and the description is abbreviate | omitted.

Hereinafter, the scheduling method of the tenth embodiment will be described in detail with reference to the drawings. 11 is a flowchart showing a scheduling method of the tenth embodiment. Here, only the processing different from the above-described Examples 4 to 9 will be described.

In the base station 1, the scheduler 12 periodically receives instantaneous C / I from the receivers # 1 to #N (step S91), and further receives a mobile station unit handover indicator from the RNC (step S91). S91) and receives the amount of transmission data (transmission data amount) recorded in the transmission buffer (step S91).

Then, the scheduler 12 calculates the priority: Pr for each mobile station based on the following expression (10) (step S92).

Pr = (instantaneous C / I) × transmission data amount × handover indicator

In addition, in the scheduler 12 of the present embodiment, after a predetermined time (for example: 2 ms) has elapsed since the radio resource allocation control is started for the mobile station having the highest priority (n = l) (step S38), the handover indicator, It is checked whether there has been an update of the instantaneous C / I or the transmission data amount (step S93), for example, if it is not updated (step S93, No), the radio resource allocation control at the time when a predetermined time has elapsed. Next, the processing after step S34 is executed in order (step S37) from the next highest mobile station (kth: 1? On the other hand, when the handover indicator, the instantaneous C / I or the transmission data amount is updated (step S93, Yes) in step S93, the scheduler 12 executes the process after step S91 again.

As described above, in this embodiment, the radio resource allocation control is performed in the order of high priority for the mobile station which is not performing the handover. At this time, the transmission data amount is reflected in the priority. As a result, radio resource allocation control is performed for all mobile stations that are not being handed over, and radio resource allocation control is surely performed even for mobile stations whose quality deteriorates temporarily. In other words, the effective use of radio resources is enabled, resulting in increased throughput.

Next, the scheduler and the scheduling method of the eleventh embodiment will be described. In addition, about the structure of a scheduler, since it is the same as that of FIG. 1 of Example 1 mentioned above, the same code | symbol is attached | subjected and the description is abbreviate | omitted.

Hereinafter, the scheduling method of the eleventh embodiment will be described in detail with reference to the drawings. 12 is a flowchart showing a scheduling method of the eleventh embodiment. Here, only the processing different from the above-described Embodiments 4 to 10 will be described.

For example, the scheduler 12 checks whether the handover indicator is "FALSE" for each mobile station, and, for the mobile station of "FALSE" (steps S41, Yes), based on the following equation (11): : Pr is calculated (step S101). On the other hand, for the mobile station of "TRUE" (step S41, No), the priority: Pr is calculated based on the following formula (1) (step S102).

Pr = (instantaneous C / I) × transmission data amount × α

Pr = (instantaneous C / I) × transmission data amount × (L-α)

As described above, in the present embodiment, radio resource allocation control is performed in order that the priority of the mobile station not being handed over is higher than the priority of the mobile station being handed over, and the priority is high for all mobile stations. Do it. However, since the amount of transmission data is reflected in the priority, there is a possibility that the priority of the mobile station being handed over becomes high. As a result, the priority can be set for all mobile stations, and radio resource allocation control is surely performed even for mobile stations whose quality is temporarily deteriorated. In other words, the effective use of radio resources is enabled, resulting in increased throughput.

In addition, in the scheduler 12 of the above-mentioned Examples 4 to 11, the transmission power value of the mobile station may be further reflected in the priority. In this case, the calculation of the priority is made so that the higher the transmission power value (the farther the mobile station is from the base station 1), the lower the priority will be.

In addition, in the scheduler l2 of the above-described embodiments 1 to 11, the radio resource allocation control may be preferentially performed for the mobile station which is being handed over. In this case, communication in handover can be continued.

In each of the above embodiments, the handover indicator is reflected in the round robin, professional fairness, or MAXC / I type scheduler. However, the scheduler is not limited to this, but the handover indicator is not limited thereto. It is applicable to all schedulers that can reflect this in the priority.

As described above, the scheduler and scheduling method according to the present invention are useful for radio channel allocation control in a wireless communication system, and are particularly suitable as a packet scheduler and scheduling method for adaptively allocating radio resources according to a communication environment. .

Claims (25)

A scheduler for allocating radio resources to mobile stations in a cell, within a base station, And allocating radio resources to all or part of the mobile stations in the cell, based on handover information on a mobile station indicating whether or not a handover is being performed. A base station for allocating radio resources to mobile stations in a cell, Scheduler means for allocating radio resources to all or part of mobile stations in a cell based on handover information on a mobile station basis indicating whether or not a handover is in progress The base station comprising a. The method of claim 2, The scheduler means, A base station characterized in that radio resource allocation is performed by a round robin system to a mobile station whose handover information indicates "state not performing handover." The method of claim 2, The scheduler means, A radio resource allocation by a round robin method is executed for a mobile station in which the handover information indicates a "state of no handover". Thereafter, the base station performs radio resource allocation in a round robin manner to the mobile station whose handover information indicates &quot; handover over. &Quot; The method of claim 2, The scheduler means, A radio resource allocation by a round robin method is executed for a mobile station in which the handover information indicates a "state of no handover". When there is no mobile station in which the handover information indicates "No handover" or when the radio resource allocation control for all mobile stations in the "No handover" state is completed, the radio resource is completed. If is left, the base station characterized in that the radio resource allocation by the round robin method is executed for the mobile station whose handover information indicates "in handover". The method of claim 2, The scheduler means, Based on the instantaneous channel quality information periodically received from the mobile station in the cell and the average channel quality information obtained by averaging the instantaneous channel quality information over a predetermined period of time, the handover information indicates "the state of no handover". Determine the priority of the mobile station A base station characterized in that radio resource allocation is performed in order from a mobile station having high priority. The method of claim 2, The scheduler means, Channel quality information at the time of regular reception from the mobile station in the cell such that the handover information indicates that the priority of the mobile station indicating "handover not performed" is higher than the priority of the mobile station indicating "handover". And based on the average channel quality information obtained by averaging the instantaneous channel quality information over a predetermined period of time, determining the priority of the mobile station. A base station characterized in that radio resource allocation is performed in order from a mobile station having high priority. The method of claim 6, The scheduler means, And the amount of transmission data stored in the transmission buffer of the corresponding mobile station is further reflected in the priority of each mobile station. The method of claim 7, wherein The scheduler means, And the amount of transmission data stored in the transmission buffer of the corresponding mobile station is further reflected in the priority of the mobile station. The method of claim 2, The scheduler means, Based on the instantaneous channel quality information periodically received from the mobile station in the cell or the average channel quality information obtained by averaging the instantaneous channel quality information over a predetermined period, the handover information indicates a "handover not performed" state. Determine the priority of all mobile stations A base station characterized by performing radio resource allocation in order from a mobile station having a high priority. The method of claim 2, The scheduler means, Channel quality at the time of regular reception from the mobile station in the cell such that the handover information indicates that the priority of the mobile station indicating "handover not performed" is higher than the priority of the mobile station indicating "handover". Based on the information or average channel quality information obtained by averaging the instantaneous channel quality information over a predetermined period of time, determining the priority of all mobile stations, A base station characterized in that radio resource allocation is performed in order from a mobile station having high priority. The method of claim 10, The scheduler means, And the amount of transmission data stored in the transmission buffer of the corresponding mobile station is further reflected in the priority of each mobile station. The method of claim 11, The scheduler means, And the amount of transmission data stored in the transmission buffer of the corresponding mobile station is further reflected in the priority of all the mobile stations. A scheduling method for a base station to allocate radio resources to mobile stations in a cell, Radio resource allocation step of allocating radio resources to all or part of mobile stations in a cell based on handover information on a mobile station indicating whether or not a handover is in progress Scheduling method comprising a. The method of claim 14, In the radio resource allocation step, A scheduling method characterized by performing radio resource allocation in a round robin manner to a mobile station in which the handover information indicates "state not performing handover." The method of claim 14, In the radio resource allocation step, A radio resource allocation by a round robin method is executed for a mobile station in which the handover information indicates a "state of no handover". Thereafter, a radio resource allocation by a round robin method is executed for the mobile station whose handover information indicates "during handover". The method of claim 14, In the radio resource allocation step, A radio resource allocation by a round robin method is executed for a mobile station in which the handover information indicates a "state of no handover". When there is no mobile station whose handover information indicates "No handover" or when the radio resource allocation control for all mobile stations in the "No handover is performed" is completed. Is assigned, the radio resource allocation by the round robin method is executed for the mobile station whose handover information indicates "in handover". The method of claim 14, In the radio resource allocation step, Based on the instantaneous channel quality information periodically received from the mobile station in the cell and the average channel quality information obtained by averaging the instantaneous channel quality information over a predetermined period of time, the handover information indicates "the state of no handover". Determine the priority of the mobile station A scheduling method characterized in that the radio resource allocation is executed in order from the mobile station having the high priority. The method of claim 14, In the radio resource allocation step, Channel quality at the time of regular reception from the mobile station in the cell such that the handover information indicates that the priority of the mobile station indicating "handover not performed" is higher than the priority of the mobile station indicating "handover". The priority of the mobile station is determined based on the information and average channel quality information obtained by averaging the instantaneous channel quality information over a predetermined period of time, A scheduling method characterized in that the radio resource allocation is executed in order from the mobile station having the high priority. The method of claim 18, In the radio resource allocation step, And the amount of transmission data stored in the transmission buffer of the corresponding mobile station is further reflected in the priority of each mobile station. The method of claim 19, In the radio resource allocation step, And the amount of transmission data stored in the transmission buffer of the corresponding mobile station is further reflected in the priority of the mobile station. The method of claim 14, In the radio resource allocation step, Based on the instantaneous channel quality information periodically received from the mobile station in the cell or the average channel quality information obtained by averaging the instantaneous channel quality information over a predetermined period, the handover information indicates a "handover not performed" state. Determine the priority of all mobile stations A scheduling method characterized by executing radio resource allocation in order from a mobile station having a high priority. The method of claim 14, In the radio resource allocation step, Channel quality at the time of regular reception from the mobile station in the cell such that the handover information indicates that the priority of the mobile station indicating "handover not performed" is higher than the priority of the mobile station indicating "handover". Based on the information or average channel quality information obtained by averaging the instantaneous channel quality information over a predetermined period of time, determining the priority of all mobile stations, A scheduling method characterized in that the radio resource allocation is executed in order from the mobile station having the high priority. The method of claim 22, In the radio resource allocation step, And the amount of transmission data stored in the transmission buffer of the corresponding mobile station is further reflected in the priority of each mobile station. The method of claim 23, wherein In the radio resource allocation step, And the amount of transmission data stored in the transmission buffer of the corresponding mobile station is further reflected in the priority of all the mobile stations.

Images