Method for 5G MAC uplink multi-carrier grant scheduling

Abstract

The present application discloses a method for managing scheduling services (e.g., uplink medium access control (MAC) grants) for communications. The method includes: (i) determining a score for each of a plurality of service grants from a plurality of cells based on a scoring function, wherein the scoring function includes one or more wireless channel conditions associated with the plurality of service grants; (ii) prioritizing the plurality of service grants based on the determined scores; and (iii) allocating scheduling opportunities to the plurality of service grants in a geometrically decreasing manner based on the determined scores of the plurality of cells.

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims the benefit of priority to U.S. Provisional Patent Application No. 63 / 009,825, filed April 14, 2020, which is incorporated herein by reference in its entirety. Technical Field

[0003] The present application relates to the field of communications, and more specifically, to wireless communication methods and devices. Background Art

[0004] The rapid development of computing technology is creating greater demand for data communications. The growing demand, in turn, is driving further growth in communication technology, which often requires additional features, enhanced processing power, and / or increased resources within a given space. This growth often brings new challenges. Traditionally, when multiple service grants are received from multiple cells in a time slot, each service grant is served one by one as it arrives in that time slot. Challenges in 5G (the fifth generation technology standard for broadband cellular networks) systems include that the system may have to serve multiple grants from multiple cells in a multi-carrier aggregation configuration. For example, the system may be connected to two or more media access control (MAC) entities, and each MAC entity is connected to a base station (NodeB) of multiple carriers with different bandwidths, resources, and wireless channel conditions. Traditional methods of serving multiple logical channel data packets are inefficient and time consuming. Summary of the Invention

[0005] Embodiments of the present disclosure provide a method for managing scheduling services in a wireless communication system. A scoring function is provided to determine a score for each of a plurality of service authorizations from a plurality of cells. Based on the determined scores of the plurality of service authorizations, the service authorizations may be prioritized and different scheduling opportunities may be allocated to the service authorizations in a "geometric decreasing" manner. For example, data packets of a low-priority service authorization may be intermittently transmitted between data packets of a high-priority service authorization among the plurality of service authorizations. In some embodiments, a data packet of the low-priority service authorization may be transmitted once for every two (or other number) data packets of the high-priority service authorization among the plurality of service authorizations (see Figure 4 ).

[0006] The scoring function considers one or more radio channel conditions for the multiple serving grants. The radio channel conditions may include a delay indicator (e.g., a slot offset value, K2), a start symbol of a slot transmission boundary (S), a physical uplink shared channel (PUSCH) slot transmission duration (T), received power (P), subcarrier spacing (SCS), grant size (G), interference level (I), or spectral efficiency (M). In some embodiments, each of the radio channel conditions may have a parameter or weighting factor (f) so that a system administrator can adjust the weight of each of the radio channel conditions in various types of operations.

[0007] One aspect of the present disclosure includes a method for scheduling uplink MAC serving grants. The method includes, for example, (i) determining a score for each of a plurality of serving grants from a plurality of cells based on a scoring function; (ii) prioritizing the plurality of serving grants based on the determined scores; and (iii) allocating scheduling opportunities to the plurality of serving grants in a geometrically decreasing manner based on the determined scores of the plurality of cells.

[0008] Another aspect of the present disclosure includes a method for managing a scheduling service. The method includes: (a) determining a score for each of a plurality of serving grants from a plurality of cells based on a scoring function; (b) determining a low-priority serving grant and a high-priority serving grant from the plurality of serving grants based on the determined scores; and (c) transmitting a data packet of the low-priority serving grant once for every two data packets of the high-priority serving grant.

[0009] In some embodiments, the present method may be implemented via a tangible, non-transitory computer-readable medium having processor instructions stored thereon that, when executed by one or more processors, cause the one or more processors to perform one or more aspects / features of the method described herein. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] In order to more clearly describe the technical solutions in the embodiments of the present disclosure, the following is a brief description of the accompanying drawings. The accompanying drawings only illustrate some aspects or embodiments of the present disclosure, and those skilled in the art can deduce other drawings from these drawings without creative work.

[0011] Figure 1 is a schematic diagram of a wireless communication system according to one or more embodiments of the present disclosure.

[0012] Figure 2A and 2B is a schematic diagram illustrating a delay indicator K2 according to one or more embodiments of the present disclosure.

[0013] Figure 3 is a schematic diagram illustrating a service authorization scheduling process according to one or more embodiments of the present disclosure.

[0014] Figure 4 is a schematic diagram illustrating a scheduling algorithm according to one or more embodiments of the present disclosure.

[0015] Figure 5 is a flow chart illustrating a service authorization scheduling process according to one or more embodiments of the present disclosure.

[0016] Figure 6 is a flowchart of an example method according to one or more embodiments of the present disclosure.

[0017] Figure 7 is a flowchart of an example method according to one or more embodiments of the present disclosure.

[0018] Figure 8 is a schematic block diagram of a terminal device according to one or more embodiments of the present disclosure. Specific embodiments

[0019] The following describes technical solutions in one or more embodiments of the present disclosure. The present disclosure provides methods and systems for managing multiple service grants from multiple cells. The multiple service grants are evaluated, rated, graded, scored, and / or prioritized based on a scoring function that considers multiple wireless channel conditions associated with the multiple grants. Embodiments of the scoring function are discussed in detail with reference to equations (A), (B), and (C) below.

[0020] Once the plurality of service authorizations are scored or prioritized, different scheduling opportunities are assigned to the plurality of service authorizations based on the scores or priorities of the plurality of service authorizations. The present disclosure provides a scheduling algorithm to assign scheduling opportunities. For example, data packets of a low-priority service authorization may be transmitted intermittently between data packets of a high-priority service authorization in the plurality of service authorizations. In some embodiments, a data packet of a low-priority service authorization may be transmitted once after every two (or other number) data packets of a high-priority service authorization in the plurality of service authorizations are transmitted. Figure 4 An embodiment of the scheduling algorithm is discussed in detail.

[0021] Communication environment

[0022] Figure 1FIG is a schematic diagram of a wireless communication system 100 according to one or more embodiments of the present disclosure. The present method may be implemented to facilitate service grant scheduling in the wireless communication system 100. Figure 1 As shown, wireless communication system 100 may include network device 101. Examples of network device 101 include a base transceiver station (BTS), a node B (NB), an evolved node B (eNB or eNodeB), a next-generation base station (gNB or gNodeB), and a wireless fidelity (Wi-Fi) access point (AP). In some embodiments, network device 101 may include a relay station, an access point, a vehicle-mounted device, a wearable device, etc. The network device 101 may include a wireless connection device for a communication network, such as a Global System for Mobile Communications (GSM) network, a Code Division Multiple Access (CDMA) network, a Wideband CDMA (WCDMA) network, a Long Term Evolution (LTE) network, a Cloud Radio Access Network (CRAN), a network based on the Institute of Electrical and Electronics Engineers (IEEE) 802.11 (e.g., a Wi-Fi network), an Internet of Things (IoT) network, a Device-to-Device (D2D) network, a next-generation network (e.g., a 5G network), a future evolved Public Land Mobile Network (PLMN), etc. A 5G system or network may be referred to as a New Radio (NR) system or network.

[0023] like Figure 1 As shown, the wireless communication system 100 also includes a terminal device 103. The terminal device 103 can be a terminal user device configured to facilitate wireless communication. The terminal device 103 can be configured to be wirelessly connected to the network device 101 according to one or more corresponding communication protocols / standards (via, for example, a wireless channel 105). The terminal device 103 can be mobile or fixed. The terminal device 103 can be a user equipment (UE), an access terminal, a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent or a user device. Examples of the terminal device 103 include a modem, a cellular phone, a smart phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device, an IoT device, a terminal device in a future 5G network, a terminal device in a future evolved PLMN, etc.

[0024] For illustration purposes, Figure 1Only one network device 101 and one terminal device 103 are shown in the wireless communication system 100. However, it should be understood that in some instances, the wireless communication system 100 may include additional / other devices, such as additional instances of the network device 101 and / or the terminal device 103, a network controller, a mobility management entity / device, etc.

[0025] Service authorization scheduling

[0026] According to the IEEE 802 local area network (LAN) / metropolitan area network (MAN) standard, the MAC layer controls the hardware responsible for interacting with the wireless transmission medium. The MAC layer provides flow control and multiplexing for the wireless transmission medium. During the uplink (UL) process, the UL MAC layer of the user equipment (UE) receives an UL grant resource allocation from the Physical Downlink Common Control Channel (PDCCH) (for example, in the Downlink Control Indicator (DCI)) at the beginning of the time slot. The UL grant resource allocation notifies the UE to transmit the UL MAC protocol data unit (PDU) at a time delay of "K2" time slots from the current time slot. "K2" can be named a delay indicator, which indicates the time slot offset between the UL grant and the corresponding UL transmission.

[0027] The delay indicator K2 can have different values to indicate different delay requirements. For example, when K2 is equal to "1", it indicates that the PDCCH is "K2" time slots away from the transmission start symbol S (ie, the time slot boundary of the MAC PDU). Figure 2A An embodiment is shown in which the delay indicator K2 is greater than or equal to "1". Figure 2A As shown, the transmission start symbol S is at least "K2" slots away from the PDCCH (located at time slot "n"). As shown in the figure, the MAC PDU can be transmitted in a transport block (TB) with a length of "L" symbols. In other words, the PDCCH and MAC PDU are not transmitted in the same time slot.

[0028] Figure 2B An embodiment is shown in which the delay indicator K2 is less than "1". When the delay indicator K2 is less than "1" (e.g., K2 = "0"), it indicates that the authorization will serve data with low delay requirements (e.g., data that needs to be processed as quickly as possible). In other words, Figure 2B As shown, the PDCCH and the transmission start symbol S (i.e., the time slot boundary of the MAC PDU) are located in the same time slot. In this case, the data in the logical channel (LC) can be pulled into the grant. proc, 2″ is the processing time for authorization, which can be calculated according to the following equation (1).

[0029] T proc,2 =max((N2+d 2,1 )(2048+144)·K2 -μ ·T c ,d 2,2 ) Equation (1)

[0030] In equation (1), “N2” is the physical uplink shared channel (PUSCH) preparation time. The parameter “d 2,1 ” and “d 2,2 " is the demodulation reference signal (DMRS) parameter. "T c ” is the time reference parameter. The parameter “μ” corresponds to “N2” and represents the carrier spacing.

[0031] In some embodiments, a Logical Channel Prioritization (LCP) method may be used to schedule packets from a LC based on the allocated grant bytes within the configured maximum bucket size setting. In a UE configuration with Carrier Aggregation (CA), there are multiple Component Carriers (CCs) aggregated for transmission. Thus, a UE may receive multiple grants simultaneously, e.g., one grant from each CC and each cell. As discussed herein (e.g., Figure 3-8 ), the present disclosure provides a UE UL MAC scheduling algorithm or method that can provide services for these multiple grants arriving at the same time.

[0032] Figure 3 3 is a diagram illustrating a service authorization scheduling process 300 according to one or more embodiments of the present disclosure. In step 301 , a plurality of service authorizations dynamically arriving from various LCs are evaluated, rated, ranked, scored, and / or prioritized based on a scoring function 31 .

[0033] Scoring function 31 includes one or more radio channel conditions associated with a plurality of service grants, and is configured to evaluate the "grant value" of each of the plurality of service grants. Examples of radio channel conditions include a delay indicator (e.g., a slot offset value, K2), a start symbol of a slot transmission boundary (S), a physical uplink shared channel (PUSCH) slot transmission duration (T), received power (P), subcarrier spacing (SCS) (C), grant size (G), interference level (I), or spectrum efficiency (M). In some embodiments, the scoring function may be represented by the following equation (A).

[0034] Grant_Score = function (K2, S, T, P, C, G, I, M) equation (A)

[0035] It is worth noting that in different embodiments, scoring function 31 can take various forms. In some embodiments, each wireless channel condition can have a parameter or weighting factor (f), so that a system administrator can adjust the weight of each wireless channel condition in various types of operations. In such an embodiment, the scoring function can be represented by the following equations (B) and (C).

[0036] Authorization_score = [(f4)(P) + (f5)(C) – (f2)(S) – (f6)(G) – (f7)(I) – (f8)(M)] / [(f1)(K2) + (f3)(T)] Equation (B)

[0037] Authorization_score = [(f4)(P)+(f5)(C)–(f6)(G)–(f7)(I)–(f8)(M)] / [(f1)(K2)+(f2)(S)+(f3)(T)] Equation (C)

[0038] Equation (B) applies to the case where the delay indicator K2 is greater than or equal to "1" (i.e., a relatively high delay requirement). Equation (C) applies to the case where the delay indicator K2 is less than "1" (i.e., a relatively low delay requirement). It is noteworthy that the start symbol (S) condition is arranged differently in Equation (B) and Equation (C). With this configuration, the scoring function can consider the relative importance of the start symbol (S) condition of each grant and reflect this relative importance in the score of the grant determined by the scoring function (e.g., "grant_score" in Equations (A), (B), and (C)).

[0039] The following description further discusses the wireless channel conditions and their meanings in the scoring function. Figure 2A and Figure 2B As discussed, the delay indicator K2 indicates the delay time from the time slot transmission boundary of the serving grant (i.e., the start symbol S). When the delay indicator K2 is "0", it indicates that the grant requires immediate attention. In these cases, the start symbol S has a direct or strong impact on the score (see Equation C) because the start symbol S reflects the urgency of the grant (e.g., Figure 2A and Figure 2B Therefore, when the delay indicator K2 is greater than or equal to "1", the starting symbol S has less influence on the score (Equation B).

[0040] The PUSCH timeslot transmission duration T of a serving grant is proportional to the processing time allowed by its UL MAC multiplexing function. For low-latency grants, a small duration is usually given so that the UL MAC can quickly turn around and service the data packet. Therefore, a small "T" can reflect a higher score, allowing the grant to be served with higher priority.

[0041] In some embodiments, weight factors f1, f2, and f3 "scale up" the effects of "K2," "S," and "T" compared to the remaining weight factors F4 through F8. On the cell carrier side, the cell's received power P indicates the radio link strength of that channel. Factor f4 of received power P can also be considered a relatively strong factor compared to factors f5 through f8.

[0042] In some embodiments, the authorized subcarrier spacing C (indirectly) indicates the available bandwidth and time slot resolution of the corresponding cell. A high value of the authorized subcarrier spacing C (e.g., 120 kHz) may indicate that a "0.125 ms" time slot is available for low-latency applications, and thus this high value may help achieve a higher score.

[0043] The grant size G of the grant will reduce the score, because a large grant will take a lot of processing time to dequeue the corresponding process. Therefore, the factor f6 can be considered as a "penalty" factor that reduces the score.

[0044] The interference level I of a cell will also reduce the score. This is because a high interference level indicates that the radio channel conditions of the transmission channel are not optimal. Therefore, the factor f7 can also be considered as a "penalty" factor that reduces the score.

[0045] The spectral efficiency, M, is the product of the "modulation order" and the "target code rate" in the assigned modulation and coding scheme (MCS) table for the transmission grant. The factor f8 of the spectral efficiency, M, can also be a "penalty" factor, because high-throughput applications (high-throughput applications have high spectral efficiency, allowing larger data packets to be transmitted in a time slot grant) will consume a lot of processing time and resources.

[0046] Once the multiple service authorizations are scored, they can be prioritized and stored for further processing. In step 303, the multiple service authorizations can be divided into three buckets 33a to 33c based on their delay indicators K2. Bucket 33a is used for authorizations with a delay indicator "K2<1". Bucket 33b is used for authorizations with a delay indicator "K2=1". Bucket 33c is used for authorizations with a delay indicator "K2>1". Generally speaking, the processing of authorizations in bucket 33a precedes the processing of authorizations in buckets 33b and 33c. The processing of authorizations in bucket 33b precedes the processing of authorizations in bucket 33c.

[0047] In some embodiments, grants in the same bucket can be placed in the same queue. As shown in step 305 in the illustrated embodiment, bucket 33a may have a "K2 < 1" or "low latency" queue 35a; bucket 33b may have a "K2 = 1" or "regular" queue; and bucket 33c may have a "K2 > 1" or "high throughput" queue. The "K2 < 1" queue is serviced first, followed by the "K2 = 1" queue, and finally the "K2 > 1" queue.

[0048] Within each queue, the service grant with the highest score is served first (this gives it the highest chance of being scheduled to have its packets dequeued from the associated LC). Then the grant with the next highest score is served, and so on. Thus, as the process progresses, the chances of having packets dequeued from the LC decrease.

[0049] In some embodiments, one or more of the queues may be further processed based on a scheduling algorithm to further enhance the overall transmission efficiency. Figure 4 The “geometric decreasing” scheduling algorithm described in

[0045] serves the “K2<1” or “low latency” queue 35a first.

[0050] like Figure 4 As shown, the low latency queue 41 includes serving grants from three cells or component carriers CC1, CC2, and CC3. Based on the score of each serving grant determined based on the scoring function, CC1 has the highest score, CC2 has the second highest score, and CC3 has the lowest score. Although the serving grant associated with CC1 will still be processed first, followed by the serving grant associated with CC2, and then the serving grant associated with CC3, this can be done in a geometrically decreasing manner. More specifically, data packets from CC1 to CC3 can be served intermittently. For example, Figure 4As shown, first, two packets from CC1 are served. Then, one packet from CC2 can be served. After repeating this process twice, one packet from CC3 can be served. In other words, after serving two packets from CC1, one packet from CC2 is served or transmitted. Similarly, after serving two packets from CC2, one packet from CC3 is served or transmitted.

[0051] Figure 5 is a flow chart illustrating a service grant scheduling process 500 according to one or more embodiments of the present disclosure. At block 501, multiple time slot grants arrive for scheduling. At block 502, process 500 prepares two or more scoring functions for generating a score for each of the multiple grants. At decision block 503, process 500 first places the multiple grants into three queues, namely, "K2<1," "K2=1," and "K2>1," based on their respective delay indicators "K2."

[0052] In the process flow 504 for the “K2<1” queue (eg Figure 5 In block 504a through 504d of FIGURE 5, a first scoring function is used (e.g., see Equation C above). At block 504a, the first scoring function is used to calculate a score for each grant in the "K2<1" queue. At block 504b, grants are enqueued and sorted in order of decreasing scores. At block 504c, multiple grants in the "K2<1" queue are served with geometrically decreasing probabilities (see, e.g., Figure 4 At block 504d, a grant in the “K2<1” queue is dequeued and a data packet is pushed to the physical (PHY) layer.

[0053] At decision block 507, process 500 determines whether any additional "K2<1" grants have arrived. If it is determined that additional "K2<1" grants have arrived, process 500 returns to the beginning. If it is determined that no additional "K2<1" grants have arrived, process 500 proceeds to decision block 508 to determine whether all grants in the "K2<1" queue have been serviced. If it is determined that all grants in the "K2<1" queue have not been serviced, process 500 returns to block 504d. If it is determined that all grants in the "K2<1" queue have been serviced, process 500 proceeds to block 510.

[0054] In the process flow 505 for the "K2=1" queue (eg Figure 5In block 505a through 505d of the preceding instructions, a second scoring function is used (e.g., see Equation B above). At block 505a, the second scoring function is used to calculate a score for each grant in the "K2=1" queue. At block 505b, the grants are queued and sorted in order of decreasing scores. At block 505c, the plurality of grants in the "K2=1" queue are served with geometrically decreasing probabilities (see, e.g., Figure 4 ). Also at block 505c, process 500 may check the "transmit" queue for the next time slot (see also block 506d) and push the "transmit queue" to the PHY layer. At block 505d, a grant in the "K2=1" queue is dequeued and a data packet is pushed to the PHY layer.

[0055] At decision block 509, process 500 determines whether any additional "K2=1" grants have arrived. If it is determined that additional "K2=1" grants have arrived, process 500 returns to the beginning. If it is determined that no additional "K2=1" grants have arrived, process 500 proceeds to decision block 510 to determine whether all grants in the "K2=1" queue have been serviced. If it is determined that all grants in the "K2=1" queue have not been serviced, process 500 returns to block 505d. If it is determined that all grants in the "K2=1" queue have been serviced, process 500 proceeds to block 512.

[0056] In the process flow 506 for the "K2>1" queue (eg Figure 5 506a through 506d), at block 506a, a second scoring function (e.g., see Equation B above) is selected and used to calculate a score for each grant in the "K2>1" queue. At block 506b, the grants are enqueued and sorted in order of decreasing score. At block 506c, the grants in the "K2>1" queue are serviced with decreasing probability. At block 506d, one grant in the "K2>1" queue is dequeued, and one packet is saved to the transmit queue (see block 505c).

[0057] At decision block 511, process 500 determines whether any additional "K2>1" grants have arrived. If it is determined that additional "K2>1" grants have arrived, process 500 returns to the beginning. If it is determined that no additional "K2>1" grants have arrived, process 500 proceeds to decision block 512 to determine whether all grants in the "K2>1" queue have been serviced. If it is determined that all grants in the "K2>1" queue have not been serviced, process 500 returns to block 506d. If it is determined that all grants in the "K2>1" queue have been serviced, process 500 stops or returns for further processing.

[0058] Figure 66 is a flow chart of a method 600 according to one or more embodiments of the present disclosure. At block 601, the method 600 includes determining a score for each of a plurality of serving grants from a plurality of cells based on a scoring function. In some embodiments, the scoring function includes (e.g., equations (A), (B), and (C) discussed above) one or more wireless channel conditions associated with the plurality of serving grants.

[0059] At block 603, method 600 includes prioritizing the plurality of serving grants based on the determined scores. At block 605, method 600 includes allocating scheduling opportunities to the plurality of serving grants in a geometrically decreasing manner based on the determined scores of the plurality of cells. For example, a data packet of a low-priority serving grant from the plurality of serving grants may be transmitted once after every two data packets of a high-priority serving grant from the plurality of serving grants.

[0060] In some embodiments, scheduling opportunities may be allocated to the plurality of serving grants in a decreasing score manner based on the determined scores (eg, grants with higher scores are processed first).

[0061] Figure 7 7 is a flow chart of a method 700 according to one or more embodiments of the present disclosure. At block 701, the method 700 includes determining a score for each of a plurality of serving grants from a plurality of cells based on a scoring function. In some embodiments, the scoring function includes (e.g., equations (A), (B), and (C) discussed above) one or more wireless channel conditions associated with the plurality of serving grants.

[0062] At block 703, method 700 includes determining a low-priority service authorization and a high-priority service authorization from among the plurality of service authorizations based on the determined scores. At block 705, method 700 includes transmitting a data packet of the low-priority service authorization once for every two data packets of the high-priority service authorization transmitted. For example, a data packet of the low-priority service authorization from among the plurality of service authorizations may be transmitted once for every two data packets of the high-priority service authorization from among the plurality of service authorizations transmitted.

[0063] Example devices and systems

[0064] Figure 8 is a terminal device 800 (eg, Figure 1 Schematic block diagram of an example of a terminal device 103). Figure 8As shown, the terminal device 800 includes a processing unit 810 (e.g., a digital signal processor (DSP), a central processing unit (CPU), a graphics processing unit (GPU), etc.) and a memory 820. The processing unit 810 can be configured to implement instructions corresponding to the method and / or other aspects of the above-mentioned embodiments.

[0065] It should be understood that the processor in the embodiments of the present technology can be an integrated circuit chip and have signal processing capabilities. During implementation, the steps in the above method can be implemented using the integrated logic circuit of the processor hardware or using instructions in the form of software. The processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, and a discrete hardware component. The methods, steps, and logic block diagrams disclosed in the embodiments of the present technology can be implemented or executed. The general-purpose processor can be a microprocessor, or the processor can alternatively be any conventional processor. The steps in the methods disclosed with reference to the embodiments of the present technology can be directly executed or completed by a decoding processor implemented as hardware, or by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium mature in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps in the above method in combination with its hardware.

[0066] It should be understood that the memory in the embodiments of the present technology can be a volatile memory or a non-volatile memory, or can include both a volatile memory and a non-volatile memory. The non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of RAM can be used, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct memory bus random access memory (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0067] The above-mentioned specific description of the example of the disclosed technology is not intended to be exhaustive or to limit the disclosed technology to the precise form disclosed above. Although the specific example of the disclosed technology is described above for illustrative purposes, as those skilled in the relevant art will recognize, various equivalent modifications are possible within the scope of the described technology. For example, although the process or frame is presented in a given order, an alternative embodiment can perform a routine with steps or use a system with frames in a different order, and some processes or frames can be deleted, moved, added, subdivided, combined and / or modified to provide an alternative embodiment or sub-combination. Each of these processes or frames can be implemented in various different ways. In addition, although the process or frame is shown as being executed in series over time, it can be performed or implemented in parallel instead, or it can be performed at different times. In addition, any specific numbers mentioned herein are only examples, and alternative embodiments can use different values or ranges.

[0068] In the specific embodiments described above, many specific details are set forth to provide a thorough understanding of the technology currently described. In other embodiments, the technology described herein can be practiced without these specific details. In other instances, well-known features such as specific functions or routines are not described in detail to avoid unnecessarily obscuring the present disclosure. In this specification, references to "an embodiment," "one embodiment," etc. mean that the specific features, structures, materials, or characteristics described are included in at least one embodiment of the technology described. Therefore, the appearance of such phrases in this specification does not necessarily refer to the same embodiment. On the other hand, such references are not necessarily mutually exclusive. In addition, specific features, structures, materials, or characteristics can be combined in any suitable manner in one or more embodiments. It should be understood that the various embodiments shown in the figures are merely illustrative representations and are not necessarily drawn to scale.

[0069] For the sake of clarity, some details of the structures or processes that are well known and commonly associated with communication systems and subsystems, but that may unnecessarily obscure some important aspects of the disclosed technology, are not described herein. In addition, although the following disclosure describes several embodiments of different aspects of the present disclosure, other embodiments may have different configurations or different components than those described in this section. Therefore, the disclosed technology may have other embodiments with additional elements or without many of the elements described below.

[0070] Many embodiments or aspects of the technology described herein can take the form of computer or processor executable instructions, including routines performed by programmable computers or processors. Those skilled in the relevant art will understand that the technology described can be implemented on computers or processor systems other than those shown and described below. The technology described herein can be implemented in a special-purpose computer or data processor, which is specially programmed, configured or constructed to perform one or more of the computer-executable instructions described below. Therefore, the terms "computer" and "processor" generally used herein refer to any data processor. Information processed by these computers and processors can be presented on any suitable display medium. Instructions for performing computer or processor executable tasks can be stored in or on any suitable computer-readable medium (including hardware, firmware or a combination of hardware and firmware). The instruction can be contained in any suitable memory device, including, for example, a flash drive and / or other suitable media.

[0071] The terms "coupled" and "connected", as well as their derivatives, can be used to describe the structural relationship between components. It should be understood that these terms are intended to be synonyms for each other. On the contrary, in a specific embodiment, "connected" can be used to indicate that two or more elements are in direct contact with each other. Unless otherwise clearly indicated in the context, the term "coupled" can be used to indicate that two or more elements are in direct or indirect contact with each other (with other intervening elements between them), or to indicate that two or more elements cooperate or interact with each other (for example, as in a causal relationship, such as for signal transmission / reception or for function calls), or both. "And / or" in this specification simply describes the association relationship of associated objects and indicates that three relationships can exist. For example, A and / or B can represent the following three situations: A exists alone, A and B both exist, and B exists alone.

[0072] These and other changes can be made to the disclosed technology in light of the above-described specific embodiments. Although the above-described specific embodiments describe certain examples of the disclosed technology and the best mode contemplated, no matter how detailed the above-described embodiments are presented in text, the disclosed technology can be practiced in a variety of ways. The details of the system can vary considerably in its specific embodiments and still be included in the technology disclosed herein. As described above, specific terms used when describing certain features or aspects of the disclosed technology should not be understood to imply that the term is redefined herein to limit any specific characteristics, features, or aspects of the disclosed technology associated with the term. Therefore, the present invention is not limited except by the appended claims. Generally speaking, unless such terms are expressly defined in the above detailed description section, the terms used in the following claims should not be interpreted as limiting the disclosed technology to the specific examples disclosed in the specification.

[0073] Those skilled in the art will appreciate that, in conjunction with the examples described in the embodiments disclosed in this specification, the units and algorithm steps can be implemented by electronic hardware or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art may use different methods to implement the described functions for each specific application, but should not be considered to exceed the scope of this application.

[0074] Although aspects of the invention are presented below in a number of claim forms, the applicants contemplate presenting the various aspects of the invention in any number of claim forms. Accordingly, the applicants reserve the right to seek additional claims after filing this application to pursue such additional claim forms in this or a subsequent application.

Claims

1. A method for managing a scheduling service, the method comprising: Determining a score for each of a plurality of service authorizations based on a scoring function, wherein the scoring function includes one or more wireless channel conditions associated with the plurality of service authorizations, each of the one or more wireless channel conditions of the scoring function having a weighting factor (f); the scoring function comprising the following equation: Authorization_score = [(f4)(P)+(f5)(C)–(f2)(S)–(f6)(G)–(f7)(I)–(f8)(M)] / [(f1)(K2)+(f3)(T)], where K2 is the delay indicator, S is the start symbol of the timeslot transmission boundary, T is the physical uplink shared channel (PUSCH) timeslot transmission duration, P is the received power, C is the subcarrier spacing (SCS), G is the grant size, I is the interference level, and M is the spectrum efficiency; prioritizing the plurality of service authorizations based on the determined scores; and allocating scheduling opportunities to the plurality of serving grants in a geometrically decreasing manner based on the determined scores of the plurality of serving grants, Wherein, in the geometric decreasing manner, every time two data packets of the high-priority service authorization among the multiple service authorizations are transmitted, a data packet of the low-priority service authorization among the multiple service authorizations is transmitted once.

2. The method according to claim 1, characterized in that The scheduling service is an uplink medium access control (MAC) grant scheduling service.

3. The method according to claim 1, characterized in that The delay indicator K2 is a time slot offset value, and wherein the time slot offset value is greater than or equal to 1.

4. A method for managing a scheduling service, the method comprising: Determining a score for each of a plurality of service authorizations based on a scoring function, wherein the scoring function includes one or more wireless channel conditions associated with the plurality of service authorizations, each of the one or more wireless channel conditions of the scoring function having a weighting factor (f); the scoring function comprising the following equation: Authorization_score = [(f4)(P)+(f5)(C)–(f6)(G)–(f7)(I)–(f8)(M)] / [(f1)(K2)+(f2)(S)+(f3)(T)], where K2 is the delay indicator, S is the start symbol of the timeslot transmission boundary, T is the physical uplink shared channel (PUSCH) timeslot transmission duration, P is the received power, C is the subcarrier spacing (SCS), G is the grant size, I is the interference level, and M is the spectrum efficiency; prioritizing the plurality of service authorizations based on the determined scores; and allocating scheduling opportunities to the plurality of serving grants in a geometrically decreasing manner based on the determined scores of the plurality of serving grants, Wherein, in the geometric decreasing manner, every time two data packets of the high-priority service authorization among the multiple service authorizations are transmitted, a data packet of the low-priority service authorization among the multiple service authorizations is transmitted once.

5. The method according to claim 4, characterized in that The scheduling service is an uplink medium access control (MAC) grant scheduling service.

6. The method according to claim 4, characterized in that The delay indicator K2 is a time slot offset value, and wherein the time slot offset value is less than 1.

7. A method for managing a scheduling service, the method comprising: Determining a score for each of a plurality of serving grants from a plurality of cells based on a scoring function, wherein the scoring function includes one or more radio channel conditions associated with the plurality of serving grants, each of the one or more radio channel conditions of the scoring function having a weighting factor (f); the scoring function comprising the following equation: Authorization_score = [(f4)(P)+(f5)(C)–(f2)(S)–(f6)(G)–(f7)(I)–(f8)(M)] / [(f1)(K2)+(f3)(T)], where K2 is the delay indicator, S is the start symbol of the timeslot transmission boundary, T is the physical uplink shared channel (PUSCH) timeslot transmission duration, P is the received power, C is the subcarrier spacing (SCS), G is the grant size, I is the interference level, and M is the spectrum efficiency; determining a low-priority service authorization and a high-priority service authorization among the plurality of service authorizations based on the determined scores; and Every time two data packets authorized by the high-priority service are transmitted, a data packet authorized by the low-priority service is transmitted.

8. The method according to claim 7, characterized in that The scheduling service is an uplink medium access control (MAC) grant scheduling service.

9. The method according to claim 7, characterized in that The delay indicator K2 is a time slot offset value, and wherein the time slot offset value is greater than or equal to 1.

10. A method for managing a scheduling service, the method comprising: Determining a score for each of a plurality of serving grants from a plurality of cells based on a scoring function, wherein the scoring function includes one or more radio channel conditions associated with the plurality of serving grants, each of the one or more radio channel conditions of the scoring function having a weighting factor (f); the scoring function comprising the following equation: Authorization_score = [(f4)(P)+(f5)(C)–(f6)(G)–(f7)(I)–(f8)(M)] / [(f1)(K2)+(f2)(S)+(f3)(T)], where K2 is the delay indicator, S is the start symbol of the timeslot transmission boundary, T is the physical uplink shared channel (PUSCH) timeslot transmission duration, P is the received power, C is the subcarrier spacing (SCS), G is the grant size, I is the interference level, and M is the spectrum efficiency; determining a low-priority service authorization and a high-priority service authorization among the plurality of service authorizations based on the determined scores; and Every time two data packets authorized by the high-priority service are transmitted, a data packet authorized by the low-priority service is transmitted.

11. The method according to claim 10, characterized in that The scheduling service is an uplink medium access control (MAC) grant scheduling service.

12. The method according to claim 10, characterized in that The delay indicator K2 is a time slot offset value, and wherein the time slot offset value is less than 1.

13. A terminal device for managing a scheduling service, comprising: The processing unit is configured as follows: Determining a score for each of a plurality of service authorizations based on a scoring function, wherein the scoring function includes one or more wireless channel conditions associated with the plurality of service authorizations, each of the one or more wireless channel conditions of the scoring function having a weighting factor (f); the scoring function comprising the following equation: Authorization_score = [(f4)(P)+(f5)(C)–(f2)(S)–(f6)(G)–(f7)(I)–(f8)(M)] / [(f1)(K2)+(f3)(T)], where K2 is the delay indicator, S is the start symbol of the timeslot transmission boundary, T is the physical uplink shared channel (PUSCH) timeslot transmission duration, P is the received power, C is the subcarrier spacing (SCS), G is the grant size, I is the interference level, and M is the spectrum efficiency; prioritizing the plurality of service authorizations based on the determined scores; and allocating scheduling opportunities to the plurality of serving grants in a geometrically decreasing manner based on the determined scores of the plurality of serving grants, Wherein, in the geometric decreasing manner, every time two data packets of the high-priority service authorization among the multiple service authorizations are transmitted, a data packet of the low-priority service authorization among the multiple service authorizations is transmitted once.

14. The terminal device according to claim 13, characterized in that The scheduling service is an uplink medium access control (MAC) grant scheduling service.

15. The terminal device according to claim 13, characterized in that The delay indicator K2 is a time slot offset value, and wherein the time slot offset value is less than 1.

16. A terminal device for managing a scheduling service, comprising: The processing unit is configured as follows: Determining a score for each of a plurality of service authorizations based on a scoring function, wherein the scoring function includes one or more wireless channel conditions associated with the plurality of service authorizations, each of the one or more wireless channel conditions of the scoring function having a weighting factor (f); the scoring function comprising the following equation: Authorization_score = [(f4)(P)+(f5)(C)–(f6)(G)–(f7)(I)–(f8)(M)] / [(f1)(K2)+(f2)(S)+(f3)(T)], where K2 is the delay indicator, S is the start symbol of the timeslot transmission boundary, T is the physical uplink shared channel (PUSCH) timeslot transmission duration, P is the received power, C is the subcarrier spacing (SCS), G is the grant size, I is the interference level, and M is the spectrum efficiency; prioritizing the plurality of service authorizations based on the determined scores; and allocating scheduling opportunities to the plurality of serving grants in a geometrically decreasing manner based on the determined scores of the plurality of serving grants, Wherein, in the geometric decreasing manner, every time two data packets of the high-priority service authorization among the multiple service authorizations are transmitted, a data packet of the low-priority service authorization among the multiple service authorizations is transmitted once.

17. The terminal device according to claim 16, characterized in that The scheduling service is an uplink medium access control (MAC) grant scheduling service.

18. The terminal device according to claim 16, characterized in that The delay indicator K2 is a time slot offset value, and wherein the time slot offset value is less than 1.

19. A terminal device for managing a scheduling service, comprising: The processing unit is configured as follows: Determining a score for each of a plurality of serving grants from a plurality of cells based on a scoring function, wherein the scoring function includes one or more radio channel conditions associated with the plurality of serving grants, each of the one or more radio channel conditions of the scoring function having a weighting factor (f); the scoring function comprising the following equation: Authorization_score = [(f4)(P)+(f5)(C)–(f2)(S)–(f6)(G)–(f7)(I)–(f8)(M)] / [(f1)(K2)+(f3)(T)], where K2 is the delay indicator, S is the start symbol of the timeslot transmission boundary, T is the physical uplink shared channel (PUSCH) timeslot transmission duration, P is the received power, C is the subcarrier spacing (SCS), G is the grant size, I is the interference level, and M is the spectrum efficiency; determining a low-priority service authorization and a high-priority service authorization among the plurality of service authorizations based on the determined scores; and Every time two data packets authorized by the high-priority service are transmitted, a data packet authorized by the low-priority service is transmitted.

20. The terminal device according to claim 19, characterized in that The scheduling service is an uplink medium access control (MAC) grant scheduling service.

21. The terminal device according to claim 19, characterized in that The delay indicator K2 is a time slot offset value, and wherein the time slot offset value is less than 1.

22. A terminal device for managing a scheduling service, comprising: The processing unit is configured as follows: Determining a score for each of a plurality of serving grants from a plurality of cells based on a scoring function, wherein the scoring function includes one or more radio channel conditions associated with the plurality of serving grants, each of the one or more radio channel conditions of the scoring function having a weighting factor (f); the scoring function comprising the following equation: Authorization_score = [(f4)(P)+(f5)(C)-(f6)(G)-(f7)(I)-(f8)(M)] / [(f1)(K2)+(f2)(S)+(f3)(T)], where K2 is the delay indicator, S is the start symbol of the timeslot transmission boundary, T is the physical uplink shared channel (PUSCH) timeslot transmission duration, P is the received power, C is the subcarrier spacing (SCS), G is the grant size, I is the interference level, and M is the spectrum efficiency; determining a low-priority service authorization and a high-priority service authorization among the plurality of service authorizations based on the determined scores; and Every time two data packets authorized by the high-priority service are transmitted, a data packet authorized by the low-priority service is transmitted.

23. The terminal device according to claim 22, characterized in that The scheduling service is an uplink medium access control (MAC) grant scheduling service.

24. The terminal device according to claim 22, characterized in that The delay indicator K2 is a time slot offset value, and wherein the time slot offset value is less than 1.

25. A computer-readable medium having instructions stored thereon that, when executed by one or more processors, cause the one or more processors to execute the instructions to perform the method of any one of claims 1-3, the method of any one of claims 4-6, the method of any one of claims 7-9, or the method of any one of claims 10-12.

Images