CN101321114A - Uplink packet scheduling method and system in enhanced dedicated channel - Google Patents

Abstract

The invention provides an uplink packet scheduling method and system in E-DCH. The method includes steps: the network node receives the uplink data sent by the user terminal, and processes the uplink data; judges according to the processing result whether the scheduling information in the uplink data is the latest scheduling information; if the judgment result is yes , then the network node performs uplink packet scheduling according to the scheduling information. Through the present invention, the network node can perform E-DCH uplink packet scheduling according to the latest scheduling information SI, thereby avoiding the possibility that the new scheduling information SI may be covered by the old scheduling information SI due to the retransmission of the scheduling information SI question.

Description

Uplink packet scheduling method and system in enhanced dedicated channel

technical field

The invention relates to a communication network system, in particular to an uplink packet scheduling method and system in an enhanced dedicated channel (E-DCH).

Background technique

FIG. 1 is a schematic diagram of the architecture of the Universal Mobile Telecommunications System UMTS. As shown in Figure 1, the Universal Mobile Telecommunication System (UMTS: Universal Mobile Telecommunication system) is currently one of the major third-generation mobile communication (3G: The Third Generation) systems in the world. The Universal Mobile Telecommunications System UMTS consists of three parts, namely the Core Network (CN: Core Network) 101, the Universal Mobile Telecommunications System Terrestrial Radio Access Network (UTRAN: UMTS Terrestrial Radio Access Network) 102 and the User Equipment (UE: User Equipment) 103 composition. The interface between the core network CN101 and the UTRAN102 is defined as an Iu interface, and the interface between the UTRAN102 and the UE103 is defined as a Uu interface.

The earliest protocol version of the Universal Mobile Telecommunications System UMTS is R99. In this version, both uplink and downlink services are carried based on dedicated channels, and the achievable data transmission rate is 384Kbps. However, as users' demand for high-speed data transmission is getting higher and higher, the Universal Mobile Communication System UMTS standard-setting organization successively launched three-stage protocol specifications of R4, R5, and R6, and introduced high-speed downlink packet access (HSDPA: High Speed Downlink Packet Access) technology and High Speed Uplink Packet Access (HSUPA: High Speed Uplink Packet Access) technology can provide peak rates up to 14.4Mbps and 5.76Mbps respectively, and also greatly improve spectrum efficiency.

In order to support high-speed uplink packet access HSUPA technology, two sublayers of enhanced media access control MAC-e and MAC-es are introduced in MAC: Medium Access Control to support hybrid automatic repeat request (HARQ: Hybrid Automatic Repeat Request) and fast dispatch. At the same time, the MAC-e Protocol Data Unit (MAC-e PDU: MAC-e Protocol Data Unit) can be used to carry signaling and the signaling can be read out at the MAC-e layer of the base station. When forming a MAC-e PDU in the MAC-e sublayer, the signaling MAC-es PDU can be multiplexed, that is, multiple MAC-esPDUs are integrated into a MAC-e PDU. MAC-e and MAC-es are between the physical layer and MAC-d (d means dedicated).

MAC-e PDU includes a header and a payload, and its structure is shown in Figure 2. The payload part of the MAC-e PDU includes multiple MAC-es PDUs, and may also include 18-bit scheduling information (SI: Scheduling Information) and possible padding fields for uplink fast packet scheduling, and the scheduling information SI and The padding field is used to make the length of the MAC-e PDU equal to the specified Enhanced-Dedicated Channel (E-DCH: Enhanced-Dedicated Channel) transport block length. The header of the MAC-e PDU is composed of the corresponding parameter data type indication (DDI: Data Description Indicator) field and the N field of each MAC-es PDU. The length of these two fields is 6 bits. In addition, the MAC-e PDU The header may also include a DDI ₀ field.

According to whether to transmit SI and the number of remaining bits D, the format of MAC-e PDU can be divided into the following four types (a) to (d):

(a) The MAC-e PDU of the SI is separately transmitted, and the MAC-e PDU is composed of the 18-bit long SI;

(b) When the number of remaining bits D is less than 18 bits, the SI is not transmitted and the remaining bits are stuffing bits;

(c) When the number of remaining bits D is equal to or greater than 18 bits, but less than 24 bits, the SI is directly concatenated at the end of the MAC-es PDU, and the remaining bits are filling bits (0-5 bits);

(d) When the number of remaining bits D is equal to or greater than 24 bits, then concatenate the SI at the end of the MAC-es PDU, and attach a special DDI at the end of the MAC-e PDU header, that is, DDI ₀ = "111111", The remaining bits are padding bits.

The above-mentioned number of remaining bits D is the length of the E-DCH transport block minus the length of the n MAC-es PDUs contained in the MAC-e PDU, and the corresponding n DDIs and N The number of bits remaining for the length of the field.

Since the scheduling information SI is the measurement information that the E-DCH relies on for the uplink fast packet scheduling based on the base station node, the E-DCH supports two SI reporting methods based on periodic triggering and event triggering.

According to the prior art, when the user equipment UE is in a state where it is not allowed to send data, that is, when the service authorization parameter is a special value "Zero_Grant" or all HARQ processes are in an inactive state, if the original data buffer of the user equipment UE is changed from Zero becomes greater than zero, that is to say, the user equipment UE changes from no data transmission to data transmission, or although there is data in the original data buffer (sending is not allowed due to resource scheduling of the base station node), there is a new high-priority When the data arrives, the user equipment UE needs to periodically send SI to the base station node on the Enhanced Dedicated Physical Data Channel (E-DPDCH: Enhanced-Dedicated Physical Data Channel), until finally obtaining the service authorization of the base station node, where the SI report triggers The period is controlled by the parameter "Periodicity for Schedul-ing Info-no grant" configured by the Radio Resource Control (RRC: Radio Resource Control) layer.

Even if the user equipment UE is in the state of allowing data to be sent, that is, the service grant parameter is not equal to "Zero_Grant" and at least one HARQ process is active, when the E-DCH serving cell changes and the new E-DCH serving cell is not in the original When the service is in the E-DCH radio link set, or when the timing period specified by the parameter "Periodicity for Scheduling Info-grant" configured by RRC is reached, it will also trigger the sending of the SI report on the E-DPDCH.

In addition, when the scheduling information SI is transmitted together with the data in the MAC-e PDU, if the HARQ entity cannot correctly transmit the MAC-e PDU to the radio link set containing the E-DCH serving cell, a new SI will also be triggered Report.

At present, there are two ways to transmit the scheduling information SI on the E-DPDCH. One is to transmit the SI alone by the MAC-e PDU. In this case, the entire MAC-e PDU is composed of the 18-bit SI, such as As shown in Figure 3; the other is the way that SI and data are transmitted together in the MAC-e PDU. In this case, the scheduling information SI is placed at the end of each MAC-es PDU, as shown in Figure 2.

Since the E-DPDCH adopts the HARQ operation, the transmission of the scheduling information SI also supports the HARQ operation. According to the prior art, when SI is transmitted alone, the maximum number of retransmissions is fixed at 8 times; when the scheduling information SI and data are transmitted together in the MAC-e PDU, the maximum number of retransmissions is determined by the MAC-e The HARQ configuration parameter of the E-DCH MAC-d flow in the data part transmitted simultaneously with the SI in the PDU is determined by the maximum number of retransmissions of the E-DCH MAC-d flow of the RRC information element (IE: Information Element) (E-DCH MAC-d flow maximum number of retransmission) is given, and its value range is 0-15 times.

The HARQ operation in E-DCH adopts a synchronous method, that is, the initial transmission and retransmission of a certain HARQ process always occur at a fixed time, so for the 2ms transmission time interval (TTI: Trans-mission Time Interval) mode, there are a total of 8 There are four parallel HARQ processes in total for the 10ms TTI mode. Therefore, the retransmission time of the HARQ process in the E-DCH (that is, the user equipment UE sends a MAC-e PDU from a certain TTI until the user equipment UE receives the non-received response message NACK sent by the base station node, and thus Time to send retransmission data), for 2ms TTI mode, it is 8×2ms or 16ms; for 10ms TTI mode, it is 4×10ms or 40ms.

When the event specified in the SI report trigger mechanism occurs in the user terminal, the period specified in the SI report trigger mechanism is reached, or the remaining bit number D of a MAC-e PDU of a certain TTI is equal to or greater than 18, the user terminal needs to send a message to the base station node. New SI report. Moreover, SI transmission has a very high priority, even in the HARQ process whose service grant parameter is a special value "Zero_Grant" and the HARQ process that is in an inactive state, the transmission of scheduling information SI is allowed. Therefore, in a certain SI report During the HARQ retransmission of , the user terminal probably needs to send a new SI to the base station node.

As shown in Figure 4, since in the HARQ process where the old SI report is retransmitted, other HARQ processes may transmit new SI reports, and before the retransmission of the old SI report is completed, if the new SI report has is successfully received by the base station node, then when the old SI report is successfully transmitted, the new SI report will be overwritten, resulting in the base station node not obtaining the latest SI report, which greatly reduces the uplink packet scheduling. performance.

Contents of the invention

The purpose of the embodiments of the present invention is to provide an enhanced dedicated channel (E-DCH) uplink packet scheduling method and system. Through the embodiments of the present invention, the network node can perform E-DCH uplink packet scheduling according to the latest scheduling information SI, thereby avoiding that the new scheduling information SI report caused by the retransmission of the scheduling information SI may be replaced by the old scheduling information SI Issues covered by the report.

An embodiment of the present invention provides an uplink packet scheduling method, the method comprising steps:

The network node receives the uplink data sent by the user terminal;

Processing the uplink data, and judging whether the scheduling information in the uplink data is the latest scheduling information according to the processing result;

If the judgment result is yes, the network node performs uplink packet scheduling according to the scheduling information.

The embodiment of the present invention also provides a network system for realizing uplink packet scheduling, the system includes network nodes; wherein,

The network node is used to receive uplink data and process the uplink data; judge whether the scheduling information in the uplink data is the latest scheduling information according to the processing result; if the judgment result is yes, the network node Uplink packet scheduling is performed according to the scheduling information.

The present invention also provides a network node, which at least includes a receiving unit, a processing unit, and a scheduling unit; wherein,

The receiving unit is configured to receive uplink data and transmit the uplink data to the processing unit;

The processing unit processes the uplink data, and judges whether the scheduling information in the uplink data is the latest scheduling information according to the processing result, and transmits the scheduling information and the judgment result to the scheduling unit;

The scheduling unit receives the scheduling information transmitted by the processing unit and the judgment result, and when the judgment result is that the scheduling information is the latest scheduling information, the scheduling unit performs uplink packet scheduling according to the scheduling information.

The beneficial effect of the embodiment of the present invention is that, by judging whether the received scheduling information SI is the latest scheduling information SI sent by the user terminal through the network node, it is ensured that the network node can obtain the latest scheduling information SI from the user terminal in time, avoiding the The new scheduling information SI caused by the retransmission of the information SI may be covered by the old scheduling information SI, thereby improving the performance of E-DCH uplink packet scheduling.

Description of drawings

The drawings described here are used to provide further understanding of the present invention, constitute a part of the application, and do not limit the present invention. In the attached picture:

FIG. 1 is a schematic diagram of the architecture of the Universal Mobile Telecommunications System UMTS;

Fig. 2 is a schematic diagram of the structure of a MAC-e PDU including a header and a payload part;

FIG. 3 is a schematic diagram of a MAC-e PDU for separately transmitting scheduling information SI;

FIG. 4 is a schematic diagram of multiple HARQ process SI scheduling transmissions;

FIG. 5A is a schematic diagram of a network system for realizing uplink packet scheduling according to an embodiment of the present invention;

FIG. 5B is a schematic diagram of a network system for realizing uplink packet scheduling according to another embodiment of the present invention;

FIG. 5C is a schematic diagram of a network system for realizing uplink packet scheduling according to another embodiment of the present invention;

Fig. 6 is a flowchart of an uplink packet scheduling method according to an embodiment of the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the embodiments of the present invention more clear, the embodiments of the present invention will be further described in detail below in conjunction with the embodiments and the accompanying drawings. Here, the exemplary embodiments and descriptions of the present invention are used to explain the present invention, but not to limit the present invention.

Embodiments of the present invention provide an enhanced uplink packet scheduling method and system in a dedicated channel. The present invention will be described in detail below in conjunction with the accompanying drawings.

Embodiment one

An embodiment of the present invention provides a network system for implementing uplink packet scheduling in an enhanced dedicated channel, including at least network nodes; wherein,

The network node is used to receive uplink data and process the uplink data; judge whether the scheduling information SI in the uplink data is the latest scheduling information SI according to the processing result; Information SI performs uplink packet scheduling.

Through the above-mentioned embodiment, the network node judges whether the received scheduling information SI is the latest scheduling information SI sent by the user terminal UE, so as to ensure that the network node can obtain the latest scheduling information SI from the user terminal in time, avoiding the scheduling information SI due to The new scheduling information SI caused by retransmission may be covered by the old scheduling information SI, thus ensuring the performance of E-DCH uplink packet scheduling.

FIG. 5A is a schematic diagram of a network system for implementing uplink packet scheduling according to an embodiment of the present invention. As shown in FIG. 5A, the network node includes at least a receiving unit 501, a processing unit 502, and a scheduling unit 503; wherein,

The receiving unit 501 is configured to receive uplink data, and transmit the uplink data to the processing unit 502; the processing unit 502 processes the received uplink data, and judges whether the scheduling information SI in the uplink data is the latest according to the processing result scheduling information SI, and transmit the scheduling information SI and the judgment result to the scheduling unit 503; the scheduling unit 503 receives the scheduling information SI and the judgment result transmitted by the processing unit 502, and when the judgment result is that the scheduling information SI in the uplink data is the latest When scheduling information, the scheduling unit 503 performs uplink packet scheduling according to the scheduling information.

In this embodiment, as shown in FIG. 5B, the processing unit 502 may include a first processing unit 502a and a first judging unit 502b; wherein,

The first processing unit 502a processes the received uplink data, and transmits the processing result and the scheduling information SI in the uplink data to the first judging unit 502b;

The first judgment unit 502b judges whether the scheduling information SI in the uplink data is the latest scheduling information according to the processing result of the first processing unit 502a, and transmits the scheduling information SI and the judgment result to the scheduling unit 503 .

In addition, the above-mentioned processing unit 502 can also adopt the following configuration, as shown in FIG. 5C, the processing unit 502 includes a second processing unit 502c and a second judging unit 502d; wherein,

The second processing unit 502c processes the uplink data, sends the processing result to the second judging unit 502d, and sends the scheduling information in the uplink data to the scheduling unit 503;

The second judging unit 502d judges whether the scheduling information SI in the uplink data is the latest scheduling information according to the processing result of the second processing unit 502c, and transmits the judging result to the scheduling unit 503 .

In the above embodiment, processing the uplink data by the first processing unit 502a and the second processing unit 502c refers to:

Judging whether the uplink data is received correctly; if the judgment result is correct reception, then judging whether the uplink data contains scheduling information SI; if the judging result is containing scheduling information SI, then calculating the time when the scheduling information is first transmitted to the network to obtain processing result. Wherein, in this embodiment, the following method may be adopted for judging whether the uplink data is received correctly: the received uplink data is decoded, and if the decoding is correct, the uplink data is correctly received data.

In this embodiment, the first judging unit 502b and the second judging unit 502d judge whether the scheduling information SI in the received uplink data is the latest scheduling information SI according to the processing result, that is, the time when the first transmission of the scheduling information arrives at the network. refer to:

Compare the time when the first transmission of scheduling information SI reaches the network with the time when the latest pre-stored scheduling information SI arrives at the network, and judge whether the time when the first transmission of scheduling information SI arrives at the network is later than the time when the latest pre-stored current scheduling information SI arrives at the network time; if the judgment result is yes, then the scheduling information SI is the latest scheduling information SI.

In addition, as shown in Figures 5B and 5C, the network node further includes an updating unit 504, which is connected to the first judging unit 502b and the second judging unit 502d for storing the time when the latest scheduling information SI arrives at the network, and When the first judging unit 502b and the second judging unit 502d judge that the scheduling information SI of the received uplink data is the latest scheduling information SI, update the time when the latest scheduling information SI arrives at the network as the scheduling information in the uplink data The time when the first SI transmission arrives at the network.

It can be known from the above embodiments that when the first judging unit 502b and the second judging unit 502d judge that the scheduling information SI of the received uplink data is the latest scheduling information SI, on the one hand, the scheduling unit 503 is triggered to perform scheduling; Unit 504 updates the time when the latest scheduling information SI arrives at the network to the time when the first transmission of the scheduling information SI of the received uplink data arrives at the network. At this time, the time when the first transmission of the scheduling information SI arrives at the network is network time.

In this embodiment, the time when the scheduling information SI of the uplink data arrives at the network for the first time may be the connection frame number (CFN), and the time when the current latest scheduling information SI arrives at the network may be the connection frame number (CFN) when the current latest scheduling information SI arrives at the network. CFN), for example, the above method can be adopted when the transmission time interval (TTI) is 10ms. The first processing unit 502a and the second processing unit 502c can obtain the time when the first transmission of the scheduling information SI arrives at the network in the following manner: according to the retransmission sequence number (RSN) and the transmission time interval (TTI) number, calculate the time in the uplink data The connection frame number (CFN) at which the scheduling information SI first arrives at the network.

Therefore, in this embodiment, it can be judged that the initial transmission of the scheduling information SI in the uplink data reaches the network according to whether the connection frame number (CFN) of the scheduling information SI in the uplink data is greater than the connection frame number (CFN) of the latest scheduling information SI. Whether the time of SI is later than the time when the latest scheduling information SI arrives at the network. If the judgment result is that the connection frame number (CFN) of the scheduling information SI in the uplink data is greater than the connection frame number (CFN) of the current latest scheduling information SI, the time when the first transmission of the scheduling information SI in the uplink data arrives at the network is later than the current latest SI. The time when the scheduling information SI arrives at the network indicates that the scheduling information SI is newer than the current latest scheduling information SI, so the stored record of the current latest scheduling information SI needs to be updated; otherwise, it is older than the current latest scheduling information SI, and the stored record does not need to be updated. A record of the latest scheduling information SI.

In this embodiment, the time when the scheduling information SI of the uplink data arrives at the network for the first time can also be the connection frame number (CFN) and the subframe number (Subframe) of the network when the first transmission arrives; the time when the latest scheduling information SI arrives at the network can also be The connection frame number (CFN) and subframe number (Subframe) of the current latest scheduling information SI arriving at the network. Therefore, in this embodiment, the first processing unit 502a and the second processing unit 502c can obtain the time when the first transmission of the scheduling information SI arrives at the network in the following manner: according to the retransmission sequence number (RSN) and transmission time interval (TTI) number , calculating the connection frame number (CFN) and subframe number (Subframe) when the scheduling information SI in the uplink data first arrives at the network.

In this way, if the connection frame number (CFN) of the scheduling information SI in the uplink data is different from the connection frame number (CFN) of the latest scheduling information SI, it only needs to be judged according to the connection frame number (CNF); if the above When the connection frame number (CFN) of the scheduling information SI of the uplink data is equal to the connection frame number (CFN) of the latest scheduling information SI, at this time, the subframe number (Subframe) corresponding to the connection frame number (CFN) should be further performed. further judgment.

Therefore, in this embodiment, the scheduling in the uplink data can be judged according to whether the connection frame number (CFN) and the subframe number (Subframe) of the scheduling information SI in the uplink data are greater than the connection frame number and the subframe number of the current latest scheduling information SI Whether the time when the first transmission of information SI arrives at the network is later than the time when the latest scheduling information SI arrives at the network. in,

If the connection frame number (CFN) of the scheduling information SI in the uplink data is different from the connection frame number (CFN) of the latest scheduling information SI, the judging method is similar to using the connection frame number alone, and will not be repeated here. If the connection frame number (CFN) of the scheduling information SI in the uplink data is the same as the connection frame number (CFN) of the current latest scheduling information SI, then judge according to the subframe number (Subframe) corresponding to the connection frame number, if If the judgment result is that the subframe number (Subframe) of the scheduling information SI in the uplink data is greater than the subframe number (Sub-frame) of the latest scheduling information SI, then the time when the first transmission of the scheduling information SI in the uplink data arrives at the network is later than the current The time when the latest scheduling information SI arrives at the network indicates that the scheduling information SI is newer than the current latest scheduling information SI, so the stored record of the current latest scheduling information SI needs to be updated; otherwise, it is older than the current latest scheduling information SI, and does not need to be updated and stored The record of the current latest scheduling information SI.

In addition, the time when the first transmission of the scheduling information SI of the uplink data arrives at the network may also be a Transmission Time Interval (TTI).

In this embodiment, if the record of the latest scheduling information SI is updated, the previously stored record of the latest scheduling information SI is deleted, and the record of the latest scheduling information SI is kept.

In addition, when the network node does not receive any user's scheduling information SI, such as when the user has just established a connection with the network, the initial value of the time when the latest scheduling information SI arrives at the network in the updating unit 504 can be set to zero. When the user sends uplink data to the network node, the update unit 504 receives and stores the scheduling information SI in the uplink data through the processing unit 502 and stores the time when the first transmission of the scheduling information SI in the uplink data arrives at the network, and then the processing unit 502 Judgment is made, and the update unit 504 also updates the time when the latest scheduling information SI arrives at the network according to the judgment result of the processing unit 502 .

In this embodiment, the network node may be a base station node, but is not limited thereto, and may also be a base station controller or other nodes in the core network.

Embodiment two

The embodiment of the present invention also provides an enhanced uplink packet scheduling method in a dedicated channel. The method includes: the network node receives the uplink data sent by the user terminal UE, and processes the uplink data; judges whether the scheduling information in the uplink data is the latest scheduling information according to the processing result; if the judgment result is yes, then the The network node performs uplink packet scheduling according to the scheduling information.

Through the above-mentioned embodiment, the network node judges whether the received scheduling information SI is the latest scheduling information SI sent by the user terminal UE, so as to ensure that the network node can obtain the latest scheduling information SI from the user terminal in time, avoiding the scheduling information SI due to The new scheduling information SI caused by retransmission may be covered by the old scheduling information SI, thus ensuring the performance of E-DCH uplink packet scheduling.

In this embodiment, the network node can process the uplink data in the following manner: judge whether the uplink data is received correctly; if the judgment result is correct reception, then judge whether the uplink data contains scheduling information SI; SI, calculate the time when the first transmission of the scheduling information SI arrives at the network. Wherein, in this embodiment, judging whether the uplink data is received correctly is realized by the following method: decoding the received uplink data, if the decoding is correct, the uplink data is correctly received data.

In this embodiment, according to the processing result, that is, according to the time when the scheduling information SI is transmitted to the network for the first time to determine whether the scheduling information SI is the latest scheduling information SI, the following methods can be adopted:

Compare the time when the scheduling information SI in the received uplink data arrives at the network for the first time and the time when the latest scheduling information SI arrives at the network stored in advance; determine whether the time when the scheduling information SI is first transmitted and arrives at the network is later than the pre-stored The time when the latest scheduling information SI arrives at the network; if the judgment result is yes, then the scheduling information SI is the latest scheduling information SI.

In this embodiment, the time when the scheduling information SI of the uplink data arrives at the network for the first time may be the connection frame number (CFN) of the network when the first transmission arrives; the time when the current latest scheduling information SI arrives at the network may be The connection frame number (CFN). The method of judging by using the connection frame number (CFN) is similar to the first embodiment, and will not be repeated here.

The time when the scheduling information SI of uplink data reaches the network for the first time is also the connection frame number (CFN) and subframe number (Subframe) of the network when the first transmission arrives; the time when the latest scheduling information SI arrives at the network is the time when the latest scheduling information SI arrives at the network The connection frame number (CFN) and subframe number (Subframe). The method of judging by using the connection frame number (CFN) and the subframe number (Subframe) is similar to the first embodiment, and will not be repeated here.

In addition, the time when the first transmission of the scheduling information SI of the uplink data arrives at the network may also be a Transmission Time Interval (TTI).

In this embodiment, when the network node has not received any user's scheduling information SI, such as when the user has just established a connection with the network, the initial transmission time of the scheduling information SI to the network may be initialized to a minimum value of 0. When the user sends uplink data to the network node, the update unit 504 receives and stores the scheduling information SI in the uplink data through the processing unit 502 and stores the time when the first transmission of the scheduling information SI in the uplink data arrives at the network, and then the processing unit 502 Judgment is made, and the update unit 504 also updates the time when the latest scheduling information SI arrives at the network according to the judgment result of the processing unit 502 .

In this embodiment, the network node may be a base station node, but is not limited thereto, and may also be a base station controller or other nodes of the core network.

The uplink packet scheduling method according to the embodiment of the present invention will be described in detail below with reference to FIG. 5B and FIG. 6 and taking a network system implementing uplink packet scheduling as an example and taking a network node as a base station node as an example.

As shown in Figure 6, the uplink packet scheduling method in the embodiment of the present invention may adopt the following steps:

In the initial step, when the base station node has not received any user's scheduling information SI, such as when the user has just established a connection with the network, the time when the first transmission of the scheduling information SI arrives at the network can be initialized to a minimum value of 0, and the variable arrival_time and the connection time can be set. The frame number (CFN) corresponds to the subframe number (Subframe), and initializes the time when the initial transmission of the scheduling information SI arrives at the network, that is, arrival_time is 0. At this time, the arrival_time of the current latest scheduling information SI stored in the update unit 504 arriving at the network is 0.

The user terminal UE sends uplink data to the base station node on the E-DPDCH; the receiving unit 501 of the base station node receives the uplink data (see step 601), and transmits the uplink data to the processing unit 502;

Then, the processing unit 502 processes the uplink data, and judges whether the scheduling information SI in the uplink data is the latest scheduling information SI according to the processing result, wherein the processing method can be as shown in Figs. 5A, 5B and 5C. In the following, FIG. 5B is taken as an example for description.

First, the first processing unit 502a decodes the uplink data, and judges whether the decoding is correct (see step 602); if the judgment result is that the decoding is correct, then judges whether the uplink data contains scheduling information SI (see step 603); if When the judging result is that the uplink data contains the scheduling information SI, then calculate the time when the first transmission of the scheduling information SI in the uplink data reaches the network (see step 604); in this embodiment, the first processing unit 502a according to the retransmission sequence number ( RSN) and transmission time interval (TTI) number, calculate the connection frame number (CFN) and subframe number (Subframe) of the first transmission of the scheduling information SI in the uplink data and arrive at the network;

Then the first processing unit 502a transmits the scheduling information, as well as the connection frame number (CFN) and subframe number (Subframe) of the scheduling information SI firstly transmitted to the network to the first judging unit 502b, and the first judging unit 502b according to the received uplink Whether the scheduling information SI in the data is transmitted to the network for the first time to determine whether the scheduling information SI in the uplink data is the latest scheduling information SI (see step 605); wherein, the following methods can be used:

First, the first judging unit 502b compares the time when the scheduling information SI in the received uplink data arrives at the network for the first time and the time when the latest scheduling information SI pre-stored in the updating unit 504 arrives at the network;

Then, it is judged whether the time when the scheduling information SI in the uplink data arrives at the network for the first time is later than the time when the latest scheduling information SI arrives at the network; in this embodiment, according to the connection frame number (CFN) of the scheduling information SI in the uplink data and whether the subframe number (Subframe) is greater than the connection frame number (CFN) and subframe number (Subframe) of the current latest scheduling information SI to determine whether the initial transmission of the scheduling information SI in the uplink data arrives at the network later than the arrival of the current latest scheduling information SI network time. The specific judgment method is as shown in Embodiment 1, and will not be repeated here;

Therefore, the judgment result received by the first judging unit 502b is: when the scheduling information SI is the latest scheduling information, the scheduling unit 503 can schedule the uplink packet according to the scheduling information SI (see step 606), that is, perform resource allocation, Such as frequency, power, channel code and other resource allocation. For example, after receiving the scheduling information SI of different users, the base station node determines the grant value to send to the user according to the content of the scheduling information SI, such as the amount of data and the priority of the service, that is, the value required for the user to send data in the next TTI. power.

In addition, the update unit 504 updates the stored time when the latest scheduling information SI arrives at the network to the time when the first transmission of the received uplink data scheduling information SI arrives at the network (see step 606 ).

In the above embodiment, in step 602, if the judging result is that the received uplink data has not been correctly decoded, then return to step 601.

In step 603, if the judging result is that the received uplink data does not contain scheduling information SI, then end.

In step 605, if the judgment result is that the scheduling information SI in the uplink data is not the latest scheduling information, that is, the time when the scheduling information arrives at the network for the first time is earlier than the time when the latest scheduling information SI arrives at the network, discard the scheduling information SI ( See step 607).

The following example illustrates the above scheduling method:

Start steps: the base station initializes the variable Arrival_time to a minimum value of 0 when there is no storage of user scheduling information. This variable corresponds to the connection frame number and the subframe number. One wireless frame corresponds to one connection frame number, and each wireless frame has 5 subframes. frame, each subframe has a subframe number;

After the network receives the user's uplink data correctly, it detects whether the data contains scheduling information, and if so, calculates the connection frame number and subframe number when the uplink data arrives at the network for the first time according to the RSN and TTI (transmission time interval) parameters , because the connection frame number and subframe number increase with the increase of TTI, so when setting Arrival_time, you can comprehensively consider the size of the connection frame number and subframe number, and then set the Arrival_time value reasonably, such as with the connection frame The increase of number and subframe will automatically increase the value of Arrival_time;

The network compares the stored Arrival_time value with the received Arrival_time value. If the received value is greater than the stored value, it means that the scheduling information is new, and the Arrival_time value is updated, that is, the stored value is deleted, and the received value is stored. to the value; otherwise, it is not updated.

If the network receives the latest scheduling information, it will perform scheduling according to the scheduling information; otherwise, it will discard the scheduling information.

Through the above-mentioned embodiment, the base station node judges whether the received scheduling information SI is the latest scheduling information SI sent by the user terminal, so as to ensure that the base station node can obtain the latest scheduling information SI from the user terminal in time, and avoid the repetition of the scheduling information SI. The new scheduling information SI may be covered by the old scheduling information SI caused by transmission, thus ensuring the performance of E-DCH uplink packet scheduling.

The specific embodiments described above have further described the purpose, technical solutions and beneficial effects of the present invention in detail. It should be understood that the above descriptions are only specific embodiments of the present invention and are not intended to limit the scope of the present invention. Protection scope, within the spirit and principles of the present invention, any modification, equivalent replacement, improvement, etc., shall be included in the protection scope of the present invention.

Claims (20)

1. A method for uplink packet scheduling, characterized in that the method comprises steps: The network node receives the uplink data sent by the user terminal; Processing the uplink data, and judging whether the scheduling information in the uplink data is the latest scheduling information according to the processing result; If the judgment result is yes, the network node performs uplink packet scheduling according to the scheduling information. 2. The uplink packet scheduling method according to claim 1, wherein the network node processes the uplink data, comprising the steps of: judging whether the uplink data is received correctly; If the judging result is correct reception, judging whether the uplink data contains scheduling information; If the judging result is that the scheduling information is included, calculate the time when the scheduling information is first transmitted and arrives at the network. 3. The uplink packet scheduling method according to claim 2, characterized in that: said judging whether said scheduling information is the latest scheduling information according to the result of processing comprises the steps of: Comparing the time when the scheduling information arrives at the network for the first time and the time when the latest scheduling information stored in advance arrives at the network; If the time when the first transmission of the scheduling information arrives at the network is later than the time when the latest pre-stored current scheduling information arrives at the network, the scheduling information is the latest scheduling information. 4. The uplink packet scheduling method according to claim 3, characterized in that: when the scheduling information is the latest scheduling information, further comprising the step of: updating the time when the current latest scheduling information arrives at the network to the scheduling information The time when the first transmission arrived on the network. 5. The uplink packet scheduling method according to claim 3, characterized in that: the time when the first transmission of the scheduling information arrives at the network is the connection frame number and subframe number, or the connection frame number, or Transmission time interval; the time when the current latest scheduling information arrives at the network is the connection frame number and subframe number, or the connection frame number, or the transmission time interval when the current latest scheduling information arrives at the network. 6. A network system for realizing uplink packet scheduling, characterized in that it includes network nodes; The network node is used to receive uplink data, process the uplink data, and judge whether the scheduling information in the uplink data is the latest scheduling information according to the processing result; if the judgment result is yes, the network The node performs uplink packet scheduling according to the scheduling information. 7. The network system for realizing uplink packet scheduling according to claim 6, characterized in that: said network node at least comprises a receiving unit, a processing unit and a scheduling unit; wherein, The receiving unit is configured to receive uplink data and transmit the uplink data to the processing unit; The processing unit processes the uplink data, and judges whether the scheduling information in the uplink data is the latest scheduling information according to the processing result, and transmits the scheduling information and the judgment result to the scheduling unit; The scheduling unit receives the scheduling information transmitted by the processing unit and the judgment result, and when the judgment result is that the scheduling information is the latest scheduling information, the scheduling unit performs uplink packet scheduling according to the scheduling information. 8. The network system for realizing uplink packet scheduling according to claim 7, characterized in that: the processing unit comprises a first processing unit and a first judging unit; wherein, The first processing unit processes the uplink data, and transmits the processing result and the scheduling information to the first judging unit; The first judging unit judges whether the scheduling information in the uplink data is the latest scheduling information according to the processing result, and transmits the scheduling information and the judging result to the scheduling unit. 9. The network system for realizing uplink packet scheduling according to claim 7, characterized in that: the processing unit includes a second processing unit and a second judging unit; wherein, The second processing unit processes the uplink data, transmits the processing result to the second judging unit, and transmits the scheduling information in the uplink data to the scheduling unit; The second judging unit judges whether the scheduling information in the uplink data is the latest scheduling information according to the processing result, and transmits the judging result to the scheduling unit. 10. The network system for realizing uplink packet scheduling according to claim 7, 8 or 9, characterized in that: processing the uplink data by the processing unit means: judging whether the uplink data is received correctly; if the judging result is correct reception, judging whether the uplink data contains scheduling information; if the judging result is containing scheduling information, calculating the time when the scheduling information arrives at the network for the first time, to obtain process result. 11. The network system for realizing uplink packet scheduling according to claim 10, characterized in that: the judging unit judges whether the scheduling information is the latest scheduling information according to the processing result means: Comparing the time when the first transmission of the scheduling information arrives at the network with the time when the pre-stored current latest scheduling information arrives at the network, if the time when the first transmission of the scheduling information arrives at the network is later than the time when the pre-stored current latest scheduling information arrives at the network ; If the judgment result is yes, the scheduling information is the latest scheduling information. 12. The network system for realizing uplink packet scheduling according to claim 11, characterized in that: said network node further comprises an updating unit connected to said processing unit for storing said current latest scheduling information The arrival time of the network, and when the scheduling information is the latest scheduling information, updating the arrival time of the latest scheduling information to the network arrival time of the first transmission of the scheduling information. 13. The network system for realizing uplink packet scheduling according to claim 11, characterized in that: the time when the first transmission of the scheduling information arrives at the network is the connection frame number and subframe number, or the connection frame number, or Transmission time interval; the time when the current latest scheduling information arrives at the network is the connection frame number and subframe number, or the connection frame number, or the transmission time interval when the current latest scheduling information arrives at the network. 14. A network node, characterized in that it includes at least a receiving unit, a processing unit, and a scheduling unit; wherein, The receiving unit is configured to receive uplink data and transmit the uplink data to the processing unit; The processing unit processes the uplink data, and judges whether the scheduling information in the uplink data is the latest scheduling information according to the processing result, and transmits the scheduling information and the judgment result to the scheduling unit; The scheduling unit receives the scheduling information transmitted by the processing unit and the judgment result, and when the judgment result is that the scheduling information is the latest scheduling information, the scheduling unit performs uplink packet scheduling according to the scheduling information. 15. The network node according to claim 14, characterized in that: the processing unit comprises a first processing unit and a first judging unit; wherein, The first processing unit processes the uplink data, and transmits the processing result and the scheduling information to the first judging unit; The first judging unit judges whether the scheduling information in the uplink data is the latest scheduling information according to the processing result, and transmits the scheduling information and the judging result to the scheduling unit. 16. The network node according to claim 14, characterized in that: the processing unit comprises a second processing unit and a second judging unit; wherein, The second processing unit processes the uplink data, transmits the processing result to the second judging unit, and transmits the scheduling information in the uplink data to the scheduling unit; The second judging unit judges whether the scheduling information in the uplink data is the latest scheduling information according to the processing result, and transmits the judging result to the scheduling unit. 17. The network node according to claim 14, 15 or 16, characterized in that: processing the uplink data by the processing unit means: judging whether the uplink data is received correctly; if the judging result is correct reception, judging whether the uplink data contains the scheduling information; If the judging result is that the scheduling information is included, calculate the time when the scheduling information is first transmitted to the network to obtain a processing result. 18. The network node according to claim 17, wherein the judging unit judging whether the scheduling information is the latest scheduling information according to the processing result means: Comparing the time when the first transmission of the scheduling information arrives at the network with the time at which the latest pre-stored current scheduling information arrives at the network, and judging whether the time at which the first transmission of the scheduling information arrives at the network is later than the time at which the latest current scheduling information stored in advance arrives at the network time; if the judgment result is yes, the scheduling information is the latest scheduling information. 19. The network node according to claim 18, further comprising an updating unit connected to the judging unit for storing the time when the latest scheduling information arrives at the network, and when the When the scheduling information is the latest scheduling information, update the stored time when the current latest scheduling information arrives at the network to the time when the first transmission of the scheduling information arrives at the network. 20. The network node according to claim 18, characterized in that: the time when the first transmission of the scheduling information arrives at the network is the connection frame number and subframe number, or the connection frame number, or the transmission time interval when the first transmission reaches the network; The time when the latest current scheduling information arrives at the network is the connection frame number and subframe number, or the connection frame number, or the transmission time interval when the current latest scheduling information arrives at the network.

Images