CN112399615A

CN112399615A - Scheduling method and device

Info

Publication number: CN112399615A
Application number: CN201910750392.6A
Authority: CN
Inventors: 阚春秀
Original assignee: Datang Mobile Communications Equipment Co Ltd
Current assignee: Datang Mobile Communications Equipment Co Ltd
Priority date: 2019-08-14
Filing date: 2019-08-14
Publication date: 2021-02-23
Anticipated expiration: 2039-08-14
Also published as: CN112399615B; WO2021027438A1

Abstract

The application discloses a scheduling method and a scheduling device, which are used for dynamically scheduling MSG2 and MSG3 based on time slots, so that the access success rate of a terminal is increased. The scheduling method provided by the embodiment of the application comprises the following steps: determining a first time slot, wherein the first time slot is the time for receiving a first message sent by a terminal; according to the first time slot, selecting a parameter K2 from a preset parameter set, and selecting a downlink time slot corresponding to the parameter K2 as a second time slot, so that a third time slot determined by the sum of the second time slot, K2 and a preset offset value is an uplink time slot; and if the second time slot and other downlink time slots which can not be shared have no resource collision, determining to schedule a second message according to the second time slot and schedule a third message according to the third time slot.

Description

Scheduling method and device

Technical Field

The present application relates to the field of communications technologies, and in particular, to a scheduling method and apparatus.

Background

As shown in fig. 1, in the initial random access procedure, after sending a Message (MSG)1, the terminal detects whether there is an MSG2 in a preset time (Timer), and if the MSG2 is not received in the time interval, it is considered that the MSG2 super-window access fails, and the terminal re-initiates random access.

38.211, the MSG2 and MSG3 require that the air interface time relationship between MSG2_ slot + K2+ delta-MSG 3_ slot, and the time interval between MSG2 and MSG3 should not be less than a preset value N. The parameter K2 is a field in the PUSCH-Time Domain Resource Allocation in the protocol, and is used to indicate the Time interval between the PUSCH and the PDCCH that schedules the PUSCH slot, and the slot is taken as a unit. The values of the parameter K2 and the offset (delta) are preset values. MSG2_ slot represents the downlink slot for the network side base station to transmit MSG2, and similarly, MSG3_ slot represents the uplink slot for the terminal side to transmit MSG 3.

When the subcarrier spacing μ of a Physical Downlink Shared Channel (PDSCH) in the system is fixed, delta is a fixed value, and the corresponding relationship is as follows:

table-PDSCH subcarrier spacing and delta mapping relationship

μ	0	1	2	3
					delta	2	3	4	6

The value of K2 is limited by the number and size in the protocol 38.331, the value range is a natural number between 0 and 32, the total number of configurations cannot exceed maxNrofUL-Allocations (16), for example, the number is n _ max, that is, the value of K2 has at most n _ max, and n _ max is a preset value.

And the scheduling time of the MSG2 and the MSG3 is set to meet the time requirement of uplink and downlink scheduling of the base station.

After the scheduling time of the MSG1 is determined by combining the above conditions, the number of selectable scheduling time points of the MSG2 and the MSG3 is limited, and the base station side can make a static scheduling time sequence to process the time point problem in the random access scheduling for simplifying the implementation. One or several K2 values are selected to formulate a static table to handle scheduling timing. For example, the K2 value range (LIST) allocated to the terminal on the base station side is {1,2,3,4,5,6,7,8,9,12 }.

Referring to fig. 2, taking a scheduling timing with a 5ms frame structure as an example, when the subcarrier interval μ of the PDSCH channel is 1, a static scheduling table is formulated as shown in table two:

static scheduling Table two

Current time slot (slot)	0	1	2	3	4	5	6	7	8	9
											Slot in MSG2_ half frame	6	6	7	2	2	2	2	3	2	6
MSG2_ current field offset	0	0	0	1	1	1	1	1	2	1
											Slot in MSG3_ half frame	8	8	9	9	9	9	9	9	8	8
MSG3_ current field offset	1	1	1	1	1	1	1	1	2	2
											K2	9	9	9	4	4	4	4	3	3	9

When a Media Access Control (MAC) entity receives MSG1 in slot 2(slot2), according to a static table, MSG2 is scheduled at slot7 of a current half frame, MSG3 is scheduled at slot9 of a next half frame, K2 is 9, if slot7 has downlink elements such as Channel State Information (CSI) which cannot share a slot with MSG2, MSG2 and MSG3 are scheduled to be delayed by one slot, a scheduling table of current slot3 is used, MSG2 is scheduled at slot2 of the next half frame, and MSG3 is scheduled at slot9 of the next half frame, so that MSG2 is delayed by 5 slots backwards, and a condition exceeding an out-window is easily generated.

In summary, the static scheduling timing does not fully utilize the K2 value supported by the terminal, thereby artificially reducing the number of scheduling timings meeting the protocol; the static time sequence table is dead, and the energy difference is adjusted for the occasionally occurring conflict situation; the situation that the scheduling exceeds the Timer is easy to occur, so that the access is failed; the static scheduling table needs to make different tables according to different current subcarrier intervals, and compatibility is poor.

Disclosure of Invention

The embodiment of the application provides a scheduling method and a scheduling device, which are used for dynamically scheduling MSG2 and MSG3 based on time slots, so that the access success rate of a terminal is increased.

The scheduling method provided by the embodiment of the application comprises the following steps:

determining a first time slot, wherein the first time slot is the time for receiving a first message sent by a terminal;

according to the first time slot, selecting a parameter K2 from a preset parameter set, and selecting a downlink time slot corresponding to the parameter K2 as a second time slot, so that a third time slot determined by the sum of the second time slot, K2 and a preset offset value is an uplink time slot;

and if the second time slot and other downlink time slots which can not be shared have no resource collision, determining to schedule a second message according to the second time slot and schedule a third message according to the third time slot.

Optionally, the schedulable downlink time slot closest to the first time slot is selected as the second time slot.

Optionally, a time interval between the second time slot and the first time slot does not exceed a preset time duration.

Optionally, the third time slot is determined specifically by the following method:

selecting a parameter value K2_ N from a plurality of preset K2 values, wherein each K2 value in the plurality of K2 values meets K2> N, N is greater than or equal to zero and less than or equal to N _ max, N _ max is a preset value greater than zero, and N is a preset value greater than or equal to zero;

judging whether the MSG3_ slot is an uplink slot, wherein the MSG3_ slot is MSG2_ slot + K2_ n + delta, the MSG3_ slot is a third slot, the MSG2_ slot is a second slot, and the delta is a preset offset value; otherwise, the parameter value K2_ n is reselected and the third time slot is redetermined.

Optionally, if none of the plurality of K2 values is such that the determined third slot is the K2 — n of the upstream slot, then the second slot is reselected.

Optionally, if the time interval between the selected second time slot and the first time slot exceeds a preset time length, determining the first message scheduling identification, and releasing the first message.

Correspondingly, the scheduling apparatus provided in the embodiment of the present application includes:

a memory for storing program instructions;

a processor for calling the program instructions stored in the memory and executing according to the obtained program:

Another scheduling apparatus provided in an embodiment of the present application includes:

a first unit, configured to determine a first time slot, where the first time slot is a time when a first message sent by a terminal is received;

a second unit, configured to select a parameter K2 from a preset parameter set according to the first timeslot, and select a downlink timeslot corresponding to the parameter K2 as a second timeslot, so that a third timeslot determined by a sum of the second timeslot, the K2, and a preset offset value is an uplink timeslot;

a third unit, configured to determine to schedule the second message according to the second time slot and schedule a third message according to the third time slot if the second time slot and the other downlink time slots that are not sharable do not have resource collision.

Another embodiment of the present application provides a computing device, which includes a memory and a processor, wherein the memory is used for storing program instructions, and the processor is used for calling the program instructions stored in the memory and executing any one of the above methods according to the obtained program.

Another embodiment of the present application provides a computer storage medium having stored thereon computer-executable instructions for causing a computer to perform any one of the methods described above.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

Fig. 1 is a schematic diagram of an initial random access procedure in the prior art;

FIG. 2 is a diagram of a 5ms field structure in the prior art;

fig. 3 is a schematic flow chart of dynamically determining a scheduling timing according to an embodiment of the present application;

fig. 4 is a schematic flowchart of a scheduling method according to an embodiment of the present application;

fig. 5 is a schematic structural diagram of a scheduling apparatus according to an embodiment of the present application;

fig. 6 is a schematic structural diagram of another scheduling apparatus according to an embodiment of the present application.

Detailed Description

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

The method and the device are based on the same application concept, and because the principles of solving the problems of the method and the device are similar, the implementation of the device and the method can be mutually referred, and repeated parts are not repeated.

The technical scheme provided by the embodiment of the application can be suitable for various systems, particularly 5G systems. For example, the applicable system may be a global system for mobile communication (GSM) system, a Code Division Multiple Access (CDMA) system, a Wideband Code Division Multiple Access (WCDMA) General Packet Radio Service (GPRS) system, a Long Term Evolution (LTE) system, an LTE Frequency Division Duplex (FDD) system, an LTE Time Division Duplex (TDD), a Universal Mobile Telecommunications System (UMTS), a universal microwave Access (WiMAX) system, a 5G NR system, and the like. These various systems include terminal devices and network devices.

The network device according to the embodiment of the present application may be a base station, and the base station may include a plurality of cells. A base station may also be referred to as an access point, or a device in an access network that communicates over the air-interface, through one or more sectors, with wireless terminal devices, or by other names, depending on the particular application. The network device may be configured to interconvert received air frames with Internet Protocol (IP) packets as a router between the wireless terminal device and the rest of the access network, which may include an Internet Protocol (IP) communication network. The network device may also coordinate attribute management for the air interface. For example, the network device according to the embodiment of the present application may be a Base Transceiver Station (BTS) in a global system for mobile communications (GSM) or a Code Division Multiple Access (CDMA), may also be a network device (NodeB) in a Wideband Code Division Multiple Access (WCDMA), may also be an evolved network device (eNB or e-NodeB) in a Long Term Evolution (LTE) system, a 5G base station in a 5G network architecture (next generation system), and may also be a home evolved node B (HeNB), a relay node (relay node), a home base station (femto), a pico base station (pico), and the like, which are not limited in the embodiments of the present application.

Various embodiments of the present application will be described in detail below with reference to the accompanying drawings. It should be noted that the display sequence of the embodiment of the present application only represents the sequence of the embodiment, and does not represent the merits of the technical solutions provided by the embodiments.

The NR protocol provides for more frame structures and configurations, making it flexible to accommodate more communication scenarios. And the PRACH channel and the PDSCH channel are independently configured, and the two channels have independent frame structures. According to different subcarrier interval configurations, the number of slots (slots) contained in each subframe corresponding to two channels is also different. This involves adjusting the correspondence in time between the PRACH channel receiving MSG1 and the PDSCH transmitting MSG 2.

The embodiment of the application determines the scheduling time points of the MSG2 and the MSG3 based on the time slot granularity. At present, the base station side determines the time points (slots) for scheduling MSG2 and MSG3 according to the time points (slots) of reporting MSG1 to MAC by the physical layer. The base station side allocates the timing in a static mode, namely for each slot of the MAC which can receive the MSG1, the corresponding MSG2 and MSG3 scheduling time is fixed, and the MSG2 and MSG3 interval correlation value-K2 used by the whole static table is also fixed. And when the dispatched MSG2 collides with other downlink elements of the non-shareable time slot, selecting the static time sequence corresponding to the next slot to continue dispatching. The strategy does not fully utilize all effective values in the K2LIST supported by the terminal, and when a scheduling time sequence corresponding to the next slot is selected when a conflict occurs, the earliest available uplink MSG3 time point is easily missed, so that the time consumption of access is prolonged, even the corresponding MSG2 super window is exceeded, and random access fails.

The embodiment of the application uses the method for determining dynamic scheduling MSG2 and MSG3 based on the time slot, can make full use of the K2 value supported by the terminal and increases the access success probability.

The embodiment of the application provides that all K2 values which are supported by a terminal and meet the requirement of a protocol are utilized to dynamically determine the scheduling time sequence.

For example, referring to fig. 3, a scheduling method provided in the embodiment of the present application specifically includes the following steps:

1. the time when the base station receives the first message (MSG1) is the first time slot (MSG1_ slot), and the schedulable downlink slot closest to the MSG1_ slot is selected as the second time slot (MSG2_ slot).

2. And if the interval between the MSG2_ slot and the MSG1_ slot does not exceed the preset time length (Timer), the step 3 is carried out, otherwise, the step 9 is carried out.

3. Traversing all the K2 values satisfying the parameter K2> N, selecting K2_ N, where the initial N is the first value satisfying the condition, i.e. N is 0, if N < ═ N _ max, then entering step 4, otherwise entering step 8.

Where N is related to a frame structure of a current base station configuration, and N is a fixed constant and does not change when the base station configuration is determined, for example, when a PUSCH channel is a 30kHz subcarrier interval, N + delta needs to be 4, and N is 1.

Alternatively, N may be a value satisfying the following condition: n + delta > -the minimum separation between MSG2 and MSG3 under the current frame structure.

Wherein n _ max is maxNrofUL-Allocations (16) in the prior art.

4. And determining that the third time slot (MSG3_ slot) is MSG2_ slot + K2_ n + delta, and judging whether the MSG3_ slot is an uplink time slot, if so, entering the step 5, and otherwise, entering the step 6.

Wherein, the value range of delta is shown in the table one.

5. It is determined whether the MSG2_ slot collides with other non-sharable downlink slot elements (i.e. the slot resources overlap), and if the collision proceeds to step 6, the non-collision proceeds to step 7.

6. Let n be n +1, reselect K2_ n to calculate a new MSG3_ slot, and then go to step 4.

7. And determining that the current scheduling is successful, scheduling the corresponding second message (MSG2) and third message (MSG3) according to the current MSG2_ slot and MSG3_ slot, and exiting.

8. And selecting the next downlink time slot as the MSG2_ slot, and entering the step 2.

9. And if the corresponding scheduling of the MSG1 fails, releasing the MSG1 and exiting.

By the method, for example, when MSG2 of the scheduling slot7 conflicts, a dynamic scheduling mode is used for selecting the latest downlink slot10 to schedule MSG2, the corresponding K2 takes 5, the corresponding MSG3 is slot18, the scheduling of MSG2 and MSG3 is completed in advance, the time consumption of scheduling is reduced, and the time interval between MSG1 and MSG2 is reduced.

In summary, referring to fig. 4, a scheduling method provided in the embodiment of the present application includes:

s101, determining a first time slot, wherein the first time slot is the time for receiving a first message sent by a terminal;

s102, according to the first time slot, selecting a parameter K2 from a preset parameter set, and selecting a downlink time slot corresponding to the parameter K2 as a second time slot, so that a third time slot determined by the sum of the second time slot, K2 and a preset offset value is an uplink time slot;

s103, if the second time slot and other downlink time slots which can not be shared have no resource collision, determining to schedule a second message according to the second time slot and schedule a third message according to the third time slot.

Correspondingly, referring to fig. 5, an embodiment of the present application provides a scheduling apparatus, including:

a memory 520 for storing program instructions;

a processor 500 for calling the program instructions stored in the memory, and executing, according to the obtained program:

A transceiver 510 for receiving and transmitting data under the control of the processor 500.

Wherein in fig. 5, the bus architecture may include any number of interconnected buses and bridges, with one or more processors, represented by processor 500, and various circuits, represented by memory 520, being linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The transceiver 510 may be a number of elements, including a transmitter and a transceiver, providing a means for communicating with various other apparatus over a transmission medium. The processor 500 is responsible for managing the bus architecture and general processing, and the memory 520 may store data used by the processor 500 in performing operations.

The processor 500 may be a Central Processing Unit (CPU), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), or a Complex Programmable Logic Device (CPLD).

Referring to fig. 6, another scheduling apparatus provided in the embodiment of the present application includes:

a first unit 11, configured to determine a first time slot, where the first time slot is a time when a first message sent by a terminal is received;

a second unit 12, configured to select a parameter K2 from a preset parameter set according to the first timeslot, and select a downlink timeslot corresponding to the parameter K2 as a second timeslot, so that a third timeslot determined by a sum of the second timeslot, the K2, and a preset offset value is an uplink timeslot;

a third unit 13, configured to determine to schedule the second message according to the second time slot and schedule the third message according to the third time slot if the resource collision does not occur between the second time slot and another downlink time slot that is not sharable.

It should be noted that the division of the unit in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation. In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.

The embodiment of the present application provides a computing device, which may specifically be a desktop computer, a portable computer, a smart phone, a tablet computer, a Personal Digital Assistant (PDA), and the like. The computing device may include a Central Processing Unit (CPU), memory, input/output devices, etc., the input devices may include a keyboard, mouse, touch screen, etc., and the output devices may include a Display device, such as a Liquid Crystal Display (LCD), a Cathode Ray Tube (CRT), etc.

The memory may include Read Only Memory (ROM) and Random Access Memory (RAM), and provides the processor with program instructions and data stored in the memory. In the embodiments of the present application, the memory may be used for storing a program of any one of the methods provided by the embodiments of the present application.

The processor is used for executing any one of the methods provided by the embodiment of the application according to the obtained program instructions by calling the program instructions stored in the memory.

Embodiments of the present application provide a computer storage medium for storing computer program instructions for an apparatus provided in the embodiments of the present application, which includes a program for executing any one of the methods provided in the embodiments of the present application.

The computer storage media may be any available media or data storage device that can be accessed by a computer, including, but not limited to, magnetic memory (e.g., floppy disks, hard disks, magnetic tape, magneto-optical disks (MOs), etc.), optical memory (e.g., CDs, DVDs, BDs, HVDs, etc.), and semiconductor memory (e.g., ROMs, EPROMs, EEPROMs, non-volatile memory (NAND FLASH), Solid State Disks (SSDs)), etc.

The method provided by the embodiment of the application can be applied to network equipment. A network device may be a base station (e.g., access point) that refers to a device in an access network that communicates over the air-interface, through one or more sectors, with wireless terminals. The base station may be configured to interconvert received air frames and IP packets as a router between the wireless terminal and the rest of the access network, which may include an Internet Protocol (IP) network. The base station may also coordinate management of attributes for the air interface. For example, the Base Station may be a Base Transceiver Station (BTS) in GSM or CDMA, a Base Station (NodeB) in WCDMA, an evolved Node B (NodeB or eNB or e-NodeB) in LTE, or a gNB in 5G system. The embodiments of the present application are not limited.

The above method process flow may be implemented by a software program, which may be stored in a storage medium, and when the stored software program is called, the above method steps are performed.

In summary, in the technical solution provided in the embodiment of the present application, the base station configures multiple K2 for the terminal, so as to reduce time consumption in the access process and avoid downlink elements that cannot share a time slot with MSG 2. The access success probability is increased, tables do not need to be made under the configuration of different frame structures, the same process is suitable for all the frame structure configurations, and the compatibility is strong. Compared with the prior art, the invention has the advantages that:

the value of K2 supported by the terminal is fully utilized, and selectable time sequence schemes are increased;

the robustness against collision is enhanced;

the possibility of access failure caused by a static table of fixed K2 values is reduced;

the same process is suitable for all subframe configurations, different static table adaptations do not need to be made, and compatibility is improved.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims

1. A method for scheduling, the method comprising:

2. The method according to claim 1, characterized by selecting as second time slot the schedulable downlink time slot closest to the first time slot.

3. The method of claim 1, wherein a time interval between the second time slot and the first time slot does not exceed a preset time duration.

4. The method of claim 1, wherein the third time slot is determined by:

5. The method of claim 4, wherein if none of the plurality of K2 values is such that the determined third slot is a K2_ n of an uplink slot, reselecting the second slot.

6. The method of claim 5, wherein the first message scheduling identity is determined and the first message is released if the time interval between the selected second time slot and the first time slot exceeds a predetermined time duration.

7. A scheduling apparatus, comprising:

a memory for storing program instructions;

8. The apparatus according to claim 7, characterized in that the schedulable downlink time slot closest to the first time slot is selected as the second time slot.

9. The apparatus of claim 7, wherein a time interval between the second time slot and the first time slot does not exceed a preset duration.

10. The apparatus of claim 7, wherein the third time slot is determined by:

11. The apparatus of claim 10, wherein the second slot is reselected if none of the plurality of K2 values results in the determined third slot being a K2_ n of an uplink slot.

12. The apparatus of claim 11, wherein the first message scheduling identification is determined to release the first message if the time interval between the selected second time slot and the first time slot exceeds a predetermined time duration.

13. A scheduling apparatus, comprising:

14. A computer storage medium having stored thereon computer-executable instructions for causing a computer to perform the method of any one of claims 1 to 6.