Method and terminal device for wireless communication

Abstract

A method for wireless communication and a terminal device are provided. The method comprises: a terminal device determines a first parameter based on a resource allocation rate; the terminal device allocates a first radio resource to a first logical channel based on the first parameter; wherein the resource allocation rate is associated with the satisfaction of the first logical channel. According to the embodiment of the invention, in an LCP process, according to a resource allocation rate, such as a resource allocation rate associated with a satisfactory state of a logic channel, a parameter (namely a first parameter) for allocating wireless resources to the logic channel is determined, and then the wireless resources are allocated to the logic channel based on the first parameter. The fairness degree of the plurality of logic channels participating in the resource distribution in the satisfaction state is improved, or the number of the logic channels in the satisfaction state in the LCP process is improved.

Description

Method and terminal device for wireless communication Technical Field

[0001] The present application relates to the field of communication technology, and more specifically, to a method and terminal device for wireless communication. Background Art

[0002] In related technologies, a logical channel prioritization (LCP) process is used to allocate shared resource blocks to multiple logical channels. However, in the LCP process, such as the second round of the sub-process, only considering the logical channel priority can lead to unfair distribution of the status of multiple logical channels. For example, a logical channel with a high priority may be saturated, while a logical channel with a low priority may be in a low satisfaction state.

[0003] Summary of the Invention

[0004] The present application provides a method and terminal device for wireless communication. The following introduces various aspects of the present application.

[0005] In a first aspect, a method for wireless communication is provided, comprising: a terminal device determining a first parameter based on a resource allocation rate; the terminal device allocating a first wireless resource to a first logical channel based on the first parameter, wherein the resource allocation rate is associated with a satisfaction level of the first logical channel.

[0006] In the second aspect, a terminal device is provided, including: a determination unit for determining a first parameter based on a resource allocation rate, wherein the resource allocation rate is associated with the satisfaction level of the first logical channel; and an allocation unit for allocating a first wireless resource to the first logical channel based on the first parameter.

[0007] In a third aspect, a terminal device is provided, comprising a processor, a memory, and a communication interface, wherein the memory is used to store one or more computer programs, and the processor is used to call the computer program in the memory so that the terminal device executes part or all of the steps in the method of the first aspect.

[0008] In a fourth aspect, an embodiment of the present application provides a communication system, which includes the above-mentioned terminal device. In another possible design, the system may also include other devices that interact with the terminal device in the solution provided in the embodiment of the present application.

[0009] In a fifth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program enables a terminal to execute part or all of the steps in the method of the first aspect above.

[0010] In a sixth aspect, embodiments of the present application provide a computer program product, wherein the computer program product includes a non-transitory computer-readable storage medium storing a computer program, wherein the computer program is operable to cause a terminal to perform some or all of the steps of the method of the first aspect described above. In some implementations, the computer program product may be a software installation package.

[0011] In a seventh aspect, a computer program is provided, wherein the computer program enables a computer to execute the method as described in any one of the first aspects.

[0012] In an eighth aspect, an embodiment of the present application provides a chip comprising a memory and a processor, wherein the processor can call and run a computer program from the memory to implement some or all of the steps described in the method of the first aspect above.

[0013] In the LCP process of an embodiment of the present application, a parameter (i.e., a first parameter) for allocating wireless resources to a logical channel is determined based on a resource allocation rate, such as a resource allocation rate associated with a logical channel being in a satisfactory state, and then wireless resources are allocated to the logical channel based on the first parameter. This helps to improve the fairness of multiple logical channels participating in resource allocation in a satisfactory state, or helps to increase the number of logical channels in a satisfactory state in the LCP process. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] FIG1 is a wireless communication system 100 used in an embodiment of the present application.

[0015] FIG2 is a schematic diagram of rate ranges and satisfaction levels of logical channels.

[0016] FIG3 is a flow chart of a method for wireless communication provided in an embodiment of the present application.

[0017] FIG4 is a schematic diagram of a terminal device according to an embodiment of the present application.

[0018] FIG5 is a schematic structural diagram of a communication device according to an embodiment of the present application. DETAILED DESCRIPTION

[0019] The technical solutions in this application will be described below with reference to the accompanying drawings. To facilitate understanding of this application, the following describes a communication system applicable to an embodiment of this application with reference to FIG1 .

[0020] Figure 1 illustrates a wireless communication system 100 used in an embodiment of the present application. The wireless communication system 100 may include a network device 110 and a terminal device 120. The network device 110 may be a device that communicates with the terminal device 120. The network device 110 may provide communication coverage for a specific geographic area and may communicate with the terminal device 120 within the coverage area.

[0021] FIG1 exemplarily shows a network device and two terminals. Optionally, the wireless communication system 100 may include multiple network devices and each network device may include other numbers of terminal devices within its coverage area, which is not limited in the embodiments of the present application.

[0022] Optionally, the wireless communication system 100 may further include other network entities such as a network controller and a mobility management entity, which is not limited in the embodiment of the present application.

[0023] It should be understood that the technical solutions of the embodiments of the present application can be applied to various communication systems, such as: fifth generation (5G) system or new radio (NR), long term evolution (LTE) system, LTE frequency division duplex (FDD) system, LTE time division duplex (TDD), etc. The technical solutions provided in this application can also be applied to future communication systems, such as the sixth generation mobile communication system, satellite communication system, etc.

[0024] The terminal device in the embodiments of the present application may also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station (MS), mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device. The terminal device in the embodiments of the present application may refer to a device that provides voice and / or data connectivity to a user and can be used to connect people, objects and machines, such as a handheld device with wireless connection function, a vehicle-mounted device, etc. The terminal device in the embodiments of the present application can be a mobile phone, a tablet computer, a laptop computer, a PDA, a mobile internet device (MID), a wearable device, a virtual reality (VR) device, an augmented reality (AR) device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical surgery, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc. Optionally, the UE can be used to act as a base station. For example, the UE can act as a scheduling entity that provides sidelink signals between UEs in V2X or D2D, etc. For example, a cellular phone and a car communicate with each other using sidelink signals. The cellular phone and smart home devices communicate without relaying the communication signal through the base station.

[0025] The network device in the embodiments of the present application may be a device for communicating with a terminal device, and may also be referred to as an access network device or a radio access network device. For example, the network device may be a base station. The network device in the embodiments of the present application may refer to a radio access network (RAN) node (or device) that connects a terminal device to a wireless network. A base station can broadly cover various names as follows, or be replaced with the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmission point (TRP), transmission point (TP), master station MeNB, secondary station SeNB, multi-standard radio (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. A base station can be a macro base station, a micro base station, a relay node, a donor node or the like, or a combination thereof. A base station can also refer to a communication module, modem or chip used to be set in the aforementioned device or apparatus. The base station can also be a mobile switching center and a device that performs base station functions in device-to-device D2D, vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, a network-side device in a 6G network, or a device that performs base station functions in future communication systems. The base station can support networks with the same or different access technologies. The embodiments of this application do not limit the specific technology and specific device form used by the network equipment.

[0026] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move based on the location of the mobile base station. In other examples, a helicopter or drone can be configured to act as a device that communicates with another base station.

[0027] In some deployments, the network device in the embodiments of the present application may refer to a CU or a DU, or the network device may include a CU and a DU. The gNB may also include an AAU.

[0028] The network equipment and terminal devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; they can also be deployed in the air on aircraft, balloons, and satellites. The embodiments of this application do not limit the scenarios in which the network equipment and terminal devices are located.

[0029] It should be understood that all or part of the functions of the communication device in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (such as a cloud platform).

[0030] To facilitate understanding, the following introduces the relevant concepts and communication processes involved in the embodiments of the present application.

[0031] Token Bucket Algorithm

[0032] The token bucket algorithm is a flow control algorithm commonly used for flow control and rate limiting in network communications. This algorithm ensures that the sender sends data at a fixed rate and can handle a certain amount of data in bursty situations. The following describes the principles of the token bucket algorithm.

[0033] The token bucket algorithm typically includes two parameters: the rate and the token bucket size. A token bucket of fixed size (i.e., the token bucket size) generates tokens at a fixed rate. Each token corresponds to a fixed amount of data transmission rights, such as one token corresponding to the right to send one data packet. Without using tokens, the token bucket will accumulate over time. However, when the number of tokens exceeds the token bucket size, the remaining tokens are discarded. In other words, the number of tokens cannot exceed the token bucket size.

[0034] The number of tokens in the token bucket can be used to determine the amount of data that can be sent. When there is data to be sent, the sender must obtain tokens from the token bucket. If the amount of data to be sent is less than the number of tokens in the token bucket, all the data to be sent is sent, and the number of tokens in the token bucket is updated at the same time. That is, the updated number of tokens is equal to the initial number of tokens minus the number of tokens used to send the data. If the amount of data to be sent is greater than the number of tokens in the token bucket, part of the data is sent, the amount of data sent corresponds to the number of tokens in the token bucket, or the data is sent after the token bucket generates enough tokens. At the same time, the number of tokens in the token bucket is updated. That is, the updated number of tokens is equal to the initial number of tokens minus the number of tokens used to send the data.

[0035] The advantage of the token bucket algorithm is that it can limit the sending rate, preventing the sender from sending too much data and causing the receiver to be unable to process it. At the same time, the token bucket algorithm can handle sudden bursts because the token bucket has a certain number of tokens, allowing the sender to send a certain amount of data in a sudden burst.

[0036] The token bucket algorithm is widely used in practical applications, such as flow control in network equipment and request limiting in application program interfaces (APIs). By adjusting the rate at which tokens are generated and the size of the token bucket, different flow limiting effects can be achieved.

[0037] When a terminal device is scheduled in the uplink direction, if the number of scheduled logical channels exceeds one, resource blocks need to be shared between different logical channels for uplink data transmission. In the process of resource block sharing between different logical channels, the logical channel priority is a relatively important parameter.

[0038] In 3GPP (3rd Generation Partnership Project) 3G systems, such as WCDMA, logical channel priority is the only reference parameter. That is, shared resource blocks are allocated to multiple logical channels based solely on their logical channel priority. The following describes a method for allocating shared resource blocks to multiple logical channels based on their logical channel priority, using two logical channels (LCH_1 and LCH_2) as an example. (This method may include steps 1 through 3.)

[0039] Assume that the priorities of LCH_1 and LCH_2 are LCH1_P and LCH2_P respectively (LCH1_P is higher than LCH2_P), and at a certain moment, the buffers of data that LCH_1 and LCH_2 need to send are LCH1_Buf and LCH2_Buf respectively, and the size of the wireless resource block involved in the allocation is the serving grant (SG).

[0040] In step 1, logical channels are sorted according to priority, namely LCH_1 and LCH_2.

[0041] In step 2, wireless resources are allocated according to the priority of the logical channels, that is, wireless resources are allocated to LCH_1 first.

[0042] If SG<=LCH1_Buf, all SGs are allocated to LCH_1 and the resource allocation process ends; otherwise, execute step 3.

[0043] In step 3, the remaining radio resources (ie, SG-LCH1_Buf) are allocated to LCH_2.

[0044] When the number of logical channels in the shared resource block is greater than two, the above method can also be used for resource allocation, that is, wireless resources are allocated in order of logical channel priority until all wireless resources are allocated or the last logical channel is allocated.

[0045] However, the above method can lead to a "starvation" phenomenon. For example, when the SG is smaller than the total logical channel buffer, and high-priority logical channels always have buffers to send, low-priority logical channels may not be scheduled or may receive fewer radio resources. In this case, low-priority logical channels may not meet basic quality of service (QoS) requirements, resulting in starvation. In other words, low-priority logical channels may be in a starvation state.

[0046] For ease of understanding, the following will introduce various states of the logical channel in conjunction with Figure 2.

[0047] In the 3GPP system, there are two key parameters in the QoS parameters of the logical channel: the minimum rate (that is, the minimum rate required to complete the service) and the maximum rate (that is, the rate at which the service can achieve satisfactory performance).

[0048] Figure 2 is a diagram illustrating the rate range and satisfaction level of a logical channel. Referring to Figure 2, when the rate of a logical channel cannot reach the minimum rate, the logical channel is in a starvation state; when the rate of a logical channel exceeds the maximum rate, the logical channel is in a saturation state; and when the rate of a logical channel is between the minimum rate and the maximum rate, the logical channel is in a satisfaction state.

[0049] Continuing with Figure 2, the satisfaction level of a logical channel in a satisfactory state may vary. For example, when the rate of the logical channel approaches the minimum rate, the satisfaction level of the logical channel is low; when the rate of the logical channel approaches the maximum rate, the satisfaction level of the logical channel is high. In other words, for a logical channel in a satisfactory state, the higher the rate of the logical channel, the higher the satisfaction level of the logical channel.

[0050] In 3GPP's 4G and 5G systems, a logical channel prioritization (LCP) process can be used to allocate shared resource blocks to multiple logical channels. LCP employs a token bucket algorithm based on the logical channel priority bit rate (PBR) to address the aforementioned starvation phenomenon. Specifically, the logical channel priority bit rate is introduced as a rate parameter in the token bucket algorithm mentioned above to control the amount of resources allocated to logical channels.

[0051] As mentioned earlier, when the rate of a logical channel cannot reach the minimum rate, the logical channel is in a starvation state. Therefore, the logical channel priority bit rate can be determined based on the minimum rate, which helps the logical channels participating in resource allocation to reach the minimum rate, thereby helping to avoid the logical channel being in a starvation state.

[0052] In the LCP process, a PBR and a token bucket (token bucket size PBR_BS) can be set for each logical channel according to the minimum rate required by QoS, and a token variable Bj is set locally. Here, Bj = Bj + PBR × T, Bj = min(Bj, PBR_BS), that is, Bj accumulates at the PBR rate over time, but the maximum value of Bj does not exceed the token bucket size PBR_BS, and T is the time interval between two Bj calculations.

[0053] In some embodiments, the LCP process can be divided into two sub-processes, hereinafter referred to as step 1 and step 2. Still taking the above LCH_1 and LCH_2 as examples, the above LCP process using the token bucket algorithm is introduced.

[0054] In step 1, the first round of sub-process resource allocation is performed. In the resource allocation of this sub-process, resources are allocated to the logical channels based on the priority of the logical channels and in combination with the token variable associated with the PBR.

[0055] Allocate resources first to LCH_1 with higher priority using the following formula.

[0056] LCH1_ASG=min(SG, LCH1_Bj, LCH1_Buf), where LCH1_ASG is the wireless resource allocated to LCH_1; LCH1_Bj is the token variable corresponding to LCH_1; LCH1_Buf is the data buffer of LCH_1, which can indicate the amount of data to be transmitted by LCH_1.

[0057] Based on the resource allocation results, the allocated resource size, the amount of data to be transmitted on LCH_1, and the token variable corresponding to LCH_1 can be updated by subtracting the size of the allocated resources from each. For example, the allocated resource size, the amount of data to be transmitted on LCH_1, and the token variable corresponding to LCH_1 can be updated using the following formulas: SG = SG - LCH1_ASG; LCH1_Bj = LCH1_Bj - LCH1_ASG; LCH1_Buf = LCH1_Buf - LCH1_ASG.

[0058] At this time, if there is still some SG left, resources are allocated to LCH_2 according to the following formula.

[0059] LCH2_ASG=min(SG, LCH2_Bj, LCH2_Buf), where LCH2_ASG is the wireless resource allocated to LCH_2; LCH2_Bj is the token variable corresponding to LCH_2; LCH2_Buf is the data cache of LCH_2, which can indicate the amount of data to be transmitted by LCH_2.

[0060] Based on the resource allocation results, the allocated resource size, the amount of data to be transmitted on LCH_2, and the token variable corresponding to LCH_2 can be updated by subtracting the size of the allocated resources from each. For example, the allocated resource size, the amount of data to be transmitted on LCH_2, and the token variable corresponding to LCH_2 can be updated using the following formulas: SG = SG - LCH2_ASG; LCH2_Bj = LCH2_Bj - LCH2_ASG; LCH2_Buf = LCH2_Buf - LCH2_ASG.

[0061] At this time, if SG is still greater than 0, that is, there are remaining resources to be allocated, then step 2 is executed.

[0062] In step 2, resources are allocated to LCH1 and LCH2 according to the logical channel priority until the radio resources are allocated or LCH2 is also allocated resources. The resource allocation method in this step is the same as the resource allocation method based on logical channel priority in the 3G system mentioned above.

[0063] The above LCP process is also applicable to the case where the number of logical channels in the shared resource block is greater than two, that is, the above LCP process is applied to the resource allocation process of multiple logical channels according to the priority order of the logical channels.

[0064] As can be seen, in the above LCP process, the size of the radio resources that can be allocated to the logical channels is controlled by the token variable associated with the priority bit rate. For example, the size of the radio resources that can be allocated to high-priority logical channels is limited, thereby allowing low-priority logical channels to be allocated radio resources. In addition, because the priority bit rate is determined based on the minimum rate, controlling the resource allocation process of the logical channels through the token variable associated with the priority bit rate helps avoid logical channel starvation or helps reduce the number of logical channels in this state.

[0065] Although the LCP process described above overcomes the starvation problem mentioned above, considering only logical channel priority in the LCP process, such as the second round of the sub-process, can lead to unfair distribution of the states of multiple logical channels. For example, a high-priority logical channel may be saturated, while a low-priority logical channel may be less satisfied. This unfairness is described below.

[0066] 3GPP 3G systems only consider the priority of logical channels, which can lead to starvation, where low-priority logical channels may never reach the minimum rate. However, 4G and 5G systems consider both the priority of logical channels and the PBR corresponding to the minimum rate, largely avoiding starvation.

[0067] However, in step 2 of the LCP process described above, the remaining radio resources are allocated using the same algorithm as in 3G systems. That is, in step 2, the allocation of remaining radio resources only considers logical channel priority. This can lead to situations where high-priority logical channels (such as LCH_1 on the left in Figure 2) are already saturated, while low-priority logical channels (such as LCH_2 on the right in Figure 2) still have a low satisfaction level. This phenomenon is the "unfairness" mentioned above, or the unfairness of logical channel satisfaction.

[0068] Furthermore, the aforementioned "unfairness" phenomenon is independent of the number of logical channels participating in shared resource block allocation. This means that the aforementioned unfairness will also occur when the number of logical channels participating in shared resource block allocation exceeds two. The aforementioned unfairness may become more severe as the number of logical channels participating in shared resource block allocation increases.

[0069] To address the above-mentioned issues, an embodiment of the present application provides a method for wireless communication. In the LCP process, the method determines a parameter (i.e., a first parameter) for allocating wireless resources to a logical channel based on a resource allocation rate, such as a resource allocation rate associated with a satisfaction level of the logical channel. The method then allocates wireless resources to the logical channel based on the first parameter, thereby helping to improve the fairness of a plurality of logical channels participating in resource allocation being in a satisfied state, or in other words, helping to increase the number of logical channels in a satisfied state during the LCP process. The communication method of an embodiment of the present application is described below in conjunction with FIG3 .

[0070] Figure 3 is a flow chart of a method for wireless communication provided by an embodiment of the present application. The method shown in Figure 3 includes step S310 and step S320.

[0071] In step S310 , the terminal device determines a first parameter based on a resource allocation rate.

[0072] The resource allocation rate may be, for example, a resource allocation rate associated with the satisfaction level of the first logical channel, thereby helping to avoid the aforementioned problem of unfair satisfaction levels of logical channels. In some embodiments, the terminal device may receive the resource allocation rate sent or indicated by the network device.

[0073] Since the satisfaction level of a logical channel is related to the minimum rate and the maximum rate in the logical channel QoS parameters, the resource allocation rate may be associated with the minimum rate and / or the maximum rate.

[0074] In some embodiments, the resource allocation rate may include a satisfying bit rate (eg, a satisfying bit rate, SBR), which may be associated with the maximum rate and / or minimum rate mentioned above.

[0075] For example, the satisfactory bit rate can be determined based on the maximum rate. For example, the satisfactory bit rate can be the maximum rate. As previously mentioned, for a logical channel in a satisfactory state, the satisfaction level of the logical channel increases as the rate of the logical channel approaches the maximum rate. Therefore, determining the satisfactory bit rate based on the maximum rate helps improve the fairness of the satisfied state of multiple logical channels participating in resource allocation, while also helping to improve the satisfaction level of the multiple logical channels participating in resource allocation.

[0076] For another example, the satisfactory bit rate can be greater than the minimum rate and less than the maximum rate. In other words, the satisfactory bit rate is a value between the minimum rate and the maximum rate, thereby increasing resource allocation flexibility. The value of the satisfactory bit rate can be determined, for example, based on the size of the resources to be allocated, the size of the data to be transmitted on the logical channel, the priority of the logical channel, and the service type of the data to be transmitted on the logical channel.

[0077] In some embodiments, the resource allocation rate may include an incremental bit rate (e.g., delta_BR), which may be associated with one or more of the maximum rate, minimum rate, and priority bit rate mentioned above. For example, the resource allocation rate may be the difference between the maximum rate and the priority bit rate. In another example, the resource allocation rate may be the difference between a value between the maximum rate and the minimum rate and the priority bit rate. As an example, the incremental bit rate may be determined based on the satisfied bit rate and the priority bit rate, such as the incremental bit rate being the difference between the satisfied bit rate and the priority bit rate.

[0078] In some embodiments, a first parameter may be determined based on a resource allocation rate. The first parameter may be a parameter used for logical channel resource allocation. For example, the first parameter may be determined based on the resource allocation rate and the token bucket algorithm, such as the first parameter (updated value) = the first parameter (initial value) + the resource allocation rate * T. The first parameter may be a token variable in the token bucket algorithm (used to indicate the number of tokens in the token bucket), and the resource allocation rate is the rate parameter in the token bucket algorithm mentioned above. Since the token variable is periodically updated, the token variable may be calculated every period T, that is, T is the time interval between two calculations of the first parameter.

[0079] In step S320, the terminal device allocates a first wireless resource to the first logical channel based on the first parameter.

[0080] There are various methods for a terminal device to allocate radio resources to a first logical channel based on a first parameter. For example, the token bucket algorithm mentioned above can be used to allocate the first radio resource to the first logical channel. The first parameter can be, for example, a token variable in the token bucket algorithm, and the resource allocation rate can be a rate parameter in the token bucket algorithm. In the process of allocating radio resources using the token bucket algorithm, the first parameter can indicate the number of resources that can be allocated to the logical channel, or an upper limit on the number of resources that can be allocated to the logical channel.

[0081] In some embodiments, the terminal device allocates the first wireless resource to the first logical channel based on the first parameter, which can be applied to the LCP process mentioned above, such as the second round of the LCP process, that is, step 2 of the LCP process mentioned above. That is, in the second round of the LCP process, the terminal device can allocate the wireless resource to the first logical channel based on the first parameter.

[0082] It should be noted that the first logical channel may be one of the logical channels participating in resource allocation. For example, the first logical channel may be the LCH_1 mentioned above, or the LCH_2 mentioned above.

[0083] In an embodiment of the present application, a first parameter for allocating wireless resources to a logical channel is determined based on a resource allocation rate, such as a resource allocation rate associated with a satisfaction level of the logical channel, and wireless resources are allocated to the first logical channel based on the first parameter, thereby helping to improve the fairness of the logical channels participating in resource allocation being in a satisfied state. For example, when wireless resources are sufficient, this method helps ensure that all logical channels participating in resource allocation are in a satisfied state, or in other words, only after all logical channels participating in resource allocation are in a satisfied state are the logical channels allowed to enter a saturated state; when wireless resources are insufficient, this method helps to increase the number of logical channels participating in resource allocation that are in a satisfied state.

[0084] In some embodiments, the first parameter may include a first token variable. The first token variable may be determined based on the aforementioned satisfactory bit rate, for example. For example, the first token variable may be associated with one or more of the following: the satisfactory bit rate, the size of the first token bucket, and the time interval between two calculations of the first parameter (here, the first token variable). As an example, the first token variable satisfies the following formula: Bk=Bk+SBR×T, Bk=min(Bk,SBR_BS);

[0085] Wherein, Bk is the first token variable, SBR is the satisfied bit rate, SBR_BS is the size of the first token bucket, T is the time interval between two calculations of the first parameter, and min is the minimum value.

[0086] That is, the size of the first token variable Bk increases over time according to the satisfied bit rate SBR. However, the size of the first token variable Bk cannot exceed the size of the first token bucket SBR_BS. When the size of the first token variable Bk exceeds the size of the first token bucket SBR_BS, the first token variable Bk takes on the size of the first token bucket SBR_BS.

[0087] In some embodiments, the first radio resource may be associated with one or more of the allocatable radio resources, the amount of data to be transmitted on the first logical channel, and a first token variable. For example, the size of the first radio resource may be a minimum value among the allocatable radio resources, the amount of data to be transmitted on the first logical channel, and the first token variable.

[0088] As an example, the first radio resource may satisfy the following formula: LCH1_ASG1=min(SG, Bk, LCH1_Buf);

[0089] Among them, LCH1_ASG1 represents the first wireless resource, Bk is the first token variable, SG is the allocable wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, and min represents the minimum value.

[0090] That is, if allocable radio resources are sufficient, the size of the first radio resource cannot exceed the size of the first token variable. If the first token variable is smaller than the amount of data to be transmitted on the first logical channel, the size of the first radio resource is equal to the size of the first token variable. If allocable radio resources are insufficient, the size of the first radio resource cannot exceed the size of the allocable radio resources.

[0091] Determining the size of the first wireless resource based on the first token variable helps to keep the first logical channel in a satisfactory state, thereby helping to improve the fairness of multiple logical channels participating in resource allocation in a satisfactory state.

[0092] In some embodiments, after the terminal device allocates the first radio resource to the first logical channel based on the first parameter, the first token variable may be updated. For example, the first token variable may be updated according to the following formula: Bk = Bk - LCH1_ASG1, where LCH1_ASG1 represents the first radio resource. In other words, after the first radio resource is allocated to the first logical channel, the allocated first radio resource needs to be subtracted from the first token variable.

[0093] In some embodiments, after the terminal device allocates the first radio resource to the first logical channel based on the first parameter, the allocable radio resource and the amount of data to be transmitted on the first logical channel may be updated to facilitate the next resource allocation. For example, the amount of data to be transmitted on the first logical channel and the allocable radio resource may be updated according to the following formulas: LCH1_Buf = LCH1_Buf - LCH1_ASG1; SG = SG - LCH1_ASG1.

[0094] The above describes the wireless resource allocation method based on the satisfactory bit rate. The following describes the wireless resource allocation method based on the incremental bit rate.

[0095] In some embodiments, the first parameter may include a second token variable, wherein the second token variable may be determined based on an incremental bit rate, for example.

[0096] In some embodiments, the second token variable may be associated with one or more of the following: an incremental bit rate, a size of the second token bucket, and a time interval between two calculations of the first parameter (which may be referred to herein as the second token variable). For example, the second token variable satisfies the following formula: Bd=Bd+delta_BR×T, Bd=min(Bd,delta_BS);

[0097] Wherein, delta_BR is the incremental bit rate, delta_BS is the size of the second token bucket, T is the time interval between two calculations of the first parameter, and min indicates taking the minimum value.

[0098] That is, the size of the second token variable Bd increases over time at the incremental bit rate delta_BR. However, the size of the second token variable Bd cannot exceed the size of the second token bucket delta_BS. When the size of the second token variable Bd exceeds the size of the second token bucket delta_BS, the value of the second token variable Bd is the size of the second token bucket delta_BS.

[0099] In some embodiments, the first radio resource may be associated with one or more of the allocatable radio resources, the amount of data to be transmitted on the first logical channel, and the second token variable. For example, the size of the first radio resource may be the minimum value among the allocatable radio resources, the amount of data to be transmitted on the second logical channel, and the second token variable. For example, the first radio resource satisfies the following formula: LCH1_ASG1=min(SG,Bd,LCH1_Buf);

[0100] Among them, LCH1_ASG1 is the first wireless resource, Bd is the first token variable, SG is the allocable wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, and min represents the minimum value.

[0101] That is, if allocable radio resources are sufficient, the size of the first radio resource cannot exceed the size of the second token variable. If the second token variable is smaller than the amount of data to be transmitted on the first logical channel, the size of the first radio resource is equal to the size of the second token variable. If allocable radio resources are insufficient, the size of the first radio resource cannot exceed the size of the allocable radio resources.

[0102] In some embodiments, after the terminal device allocates the first radio resource to the first logical channel based on the first parameter, the second token variable may be updated. For example, the second token variable may be updated according to the following formula: Bd = Bd - LCH1_ASG1, where LCH1_ASG1 is the first radio resource. In other words, after the first radio resource is allocated to the first logical channel, the allocated first radio resource needs to be subtracted from the second token variable.

[0103] In some embodiments, after the terminal device allocates the first radio resource to the first logical channel based on the first parameter, the allocable radio resource and the amount of data to be transmitted on the first logical channel may be updated to facilitate the next resource allocation. For example, the amount of data to be transmitted on the first logical channel and the allocable radio resource may be updated according to the following formula: LCH1_Buf = LCH1_Buf - LCH1_ASG1; SG = SG - LCH1_ASG1;

[0104] Among them, LCH1_ASG1 is the first wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, and SG is the allocable wireless resource.

[0105] In some embodiments, before allocating radio resources to the first logical channel based on the first parameter, radio resources may be allocated to the logical channel based on the priority bit rate. For example, in the aforementioned LCP process including two rounds of sub-processes, the method provided in the embodiment of the present application may be applied to the second round of sub-processes. That is, before allocating radio resources to the first logical channel based on the first parameter, radio resources may be allocated to the logical channel through the first round of LCP sub-processes.

[0106] In other words, the first radio resource is a resource allocated by the terminal device to the first logical channel from the allocatable radio resources; wherein the allocatable radio resource is a radio resource remaining after the terminal device allocates radio resources to the multiple logical channels based on the priority bit rates of the multiple logical channels. The multiple logical channels include the first logical channel.

[0107] In this case, in the first LCP sub-process, after the terminal device allocates radio resources to multiple logical channels based on their prioritized bit rates, the relevant parameters in the resource allocation rate-based radio resource allocation method mentioned above need to be updated. The following describes the parameter update methods for resource allocation rates using the satisfactory bit rate and the incremental bit rate.

[0108] When the resource allocation process for a logical channel includes multiple allocation rounds, the satisfaction level of the logical channel is associated with the results of each of these allocation rounds. In other words, during the resource allocation process, the results of each of these allocation rounds jointly determine the satisfaction level of the logical channel. Therefore, when the resource allocation rate is the satisfactory bit rate, the first token variable needs to be updated during each of these allocation rounds. For example, the first token variable needs to be updated during both the first and second rounds of the LCP sub-process.

[0109] In some embodiments, taking the resource allocated by the terminal device to the first logical channel based on the priority bit rate as the second radio resource as an example, the first token variable can be updated according to the following formula: Bk = Bk - LCH1_ASG2; where Bk is the first token variable and LCH_ASG2 is the second radio resource. The second radio resource mentioned here can be, for example, the LCH1_ASG or LCH2_ASG mentioned above.

[0110] Since the incremental bit rate can be the difference between the satisfied bit rate and the priority bit rate, that is, the incremental bit rate is only for the current resource allocation process (such as the second round of LCP sub-process), therefore, when the resource allocation rate is the incremental bit rate, the second token variable does not need to be updated in the first round of LCP sub-process, but only needs to be updated in the second round of sub-process, thereby simplifying the implementation.

[0111] In some embodiments, in the first round of the LCP sub-process, the aforementioned allocatable radio resources and the amount of data to be transmitted on the first logical channel need to be updated. Still taking the example of the terminal device allocating the resources for the first logical channel based on the priority bit rate as the second radio resource, the amount of data to be transmitted on the first logical channel and the allocatable radio resources can be updated according to the following formulas: LCH1_Buf = LCH1_Buf - LCH1_ASG2; SG = SG - LCH1_ASG2;

[0112] Among them, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, SG is the allocatable wireless resource, and LCH1_ASG2 is the second wireless resource.

[0113] It should be noted that the first logical channel may be one of multiple logical channels participating in wireless resource allocation. When there are multiple logical channels participating in wireless resource allocation, wireless resources may be allocated in order of priority of the logical channels. For example, if the logical channels participating in wireless resource allocation include a first logical channel and a second logical channel, wireless resources are allocated to the first logical channel first, followed by the second logical channel, where the first logical channel has a higher priority than the second logical channel.

[0114] The following takes the above-mentioned method for wireless communication applied to the second round of the LCP process as an example, and combines it with the complete LCP process (which may include steps 1 to 3 below) to introduce the method provided in the embodiment of the present application.

[0115] Example 1

[0116] Embodiment 1 will introduce a method for allocating wireless resources to logical channels based on a satisfactory bit rate.

[0117] Assume that logical channels LCH_1 and LCH_2 participate in the allocation of radio resources SG, the priorities of LCH_1 and LCH_2 are LCH1_P and LCH2_P respectively (LCH1_P is higher than LCH2_P), and at a certain moment, the buffers of data that LCH_1 and LCH_2 need to send are LCH1_Buf and LCH2_Buf respectively.

[0118] In step 1, radio resources are allocated to LCH_1 and LCH_2 based on the priority bit rate.

[0119] First, based on the priority bit rate, the token bucket algorithm is used to allocate wireless resources to LCH_1 and update related parameters using the following formula. As mentioned above, the first token variable needs to be updated in the first round of the LCP sub-process. LCH1_ASG = min(SG, LCH1_Bj, LCH_Buf1); SG = SG - LCH1_ASG; LCH1_Bj = LCH1_Bj - LCH1_ASG; LCH1_Buf = LCH1_Buf - LCH1_ASG; LCH1_Bk = LCH1_Bk - LCH1_ASG;

[0120] Among them, LCH1_ASG is the wireless resource allocated to LCH_1 at this time; LCH1_Bj is the token variable corresponding to LCH_1, and is associated with the priority bit rate; LCH1_Buf is the data cache of LCH_1, which can indicate the amount of data to be transmitted by LCH_1; LCH1_Bk is the first token variable of LCH_1, which can be associated with the satisfactory bit rate of LCH_1.

[0121] Secondly, if SG still has remaining wireless resources, then the following formula is used to allocate wireless resources to LCH_2 and update related parameters. As mentioned above, the first token variable needs to be updated in the first round of LCP sub-process. LCH2_ASG = min(SG, LCH2_Bj, LCH_Buf2); SG = SG - LCH2_ASG; LCH2_Bj = LCH2_Bj - LCH2_ASG; LCH2_Buf = LCH2_Buf - LCH2_ASG; LCH2_Bk = LCH2_Bk - LCH2_ASG;

[0122] Among them, LCH2_ASG is the wireless resource allocated to LCH_2 at that time; LCH2_Bj is the token variable corresponding to LCH_2, and is associated with the priority bit rate; LCH2_Buf is the data cache of LCH_2, which can indicate the amount of data to be transmitted by LCH_2; LCH2_Bk is the first token variable of LCH_2, which can be associated with the satisfactory bit rate of LCH_2.

[0123] Finally, if the SG still has remaining wireless resources, execute step 2.

[0124] In step 2, radio resources are allocated to LCH_1 and LCH_2 based on the resource allocation rate.

[0125] First, based on the satisfactory bit rate, wireless resources are allocated to LCH_1 using the following formulas, and related parameters are updated: LCH1_ASG = min(SG, LCH1_Bk, LCH_Buf1); SG = SG - LCH1_ASG; LCH1_Buf = LCH1_Buf - LCH1_ASG; LCH1_Bk = LCH1_Bk - LCH1_ASG;

[0126] Among them, LCH1_ASG is the wireless resource allocated to LCH_1 at this time; LCH1_Buf is the data buffer of LCH_1, which can indicate the amount of data to be transmitted by LCH_1; LCH1_Bk is the first token variable of LCH_1, which can be associated with the satisfactory bit rate of LCH_1.

[0127] It should be noted that the relevant parameters used in the resource allocation process of this step are all the parameters updated in step 1. For example, SG is the remaining allocatable wireless resources after the resource allocation of the first round of sub-process (i.e., step 1) is completed; LCH1_Bk is the token variable after subtracting the wireless resources allocated in the first round of sub-process.

[0128] Secondly, if SG has remaining radio resources, then based on the satisfactory bit rate, radio resources are allocated to LCH_2 using the following formulas, and related parameters are updated: LCH2_ASG = min(SG, LCH2_Bk, LCH_Buf2); SG = SG - LCH2_ASG; LCH2_Buf = LCH2_Buf - LCH2_ASG; LCH2_Bk = LCH2_Bk - LCH2_ASG,;

[0129] Among them, LCH2_ASG is the wireless resource allocated to LCH_2 at that time; LCH2_Buf is the data buffer of LCH_2, which can indicate the amount of data to be transmitted by LCH_2; LCH2_Bk is the first token variable of LCH_2, which can be associated with the satisfactory bit rate of LCH_2.

[0130] It should be noted that in the resource allocation process of this step, the relevant parameters used are all the parameters updated in step 1. For example, SG is the remaining allocatable wireless resources after the resource allocation of the first round of sub-process (i.e., step 1) is completed, and LCH2_Bk is the token variable after subtracting the wireless resources allocated by the first round of sub-process.

[0131] Finally, if the SG still has remaining wireless resources, execute step 3.

[0132] In step 3, radio resources are allocated to LCH_1 and LCH_2 based on the logical channel priority until the radio resources SG are allocated completely or LCH2 is also allocated resources.

[0133] It can be seen that the first token variable, the amount of data to be transmitted, and the allocatable radio resources are updated each time radio resources are allocated to the first logical channel. For example, the first token variable, the amount of data to be transmitted, and the allocatable radio resources are updated in the first sub-process and the second sub-process, respectively. In other words, in response to allocating radio resources to the first logical channel, the first token variable, the amount of data to be transmitted, and the allocatable radio resources are updated.

[0134] Allocating wireless resources to logical channels by satisfying the bit rate helps resolve the unfairness mentioned above.

[0135] In related technologies, the LCP process also includes some principles, such as avoiding segmentation of radio link control (RLC) service data units (SDUs) as much as possible.

[0136] Taking the transmission of RLC SDUs on a logical channel as an example, when sufficient radio resources are available and the amount of data to be transmitted is larger than the token variable, according to the aforementioned related technologies, the size of the radio resources allocated to the logical channel should be the size of the first token variable. However, this will cause the RLC SDU to be segmented. Therefore, radio resources can be allocated to the logical channel based on the amount of data to be transmitted (e.g., the size of the RLC SDU). In other words, the logical channel obtains some surplus radio resources to multiplex the larger RLC SDU into a media access control (MAC) packet data unit (PDU), thereby avoiding the segmentation of the RLC SDU.

[0137] As a result, in step 1 above, after allocating radio resources to the logical channel, the updated value of its token variable (the token variable associated with the priority bit rate, such as Bj) may be less than 0. Since the first token variable is updated in the first round of the sub-process, and the second round of the sub-process allocates radio resources based on the updated first token variable, resource allocation based on the satisfactory bit rate can, to a certain extent, correct the problem caused by the updated value of the token variable (such as Bj) being less than 0.

[0138] Example 2

[0139] The second embodiment will introduce a method for allocating wireless resources to logical channels based on incremental bit rate.

[0140] Assume that logical channels LCH_1 and LCH_2 participate in the allocation of radio resources SG, the priorities of LCH_1 and LCH_2 are LCH1_P and LCH2_P respectively (LCH1_P is higher than LCH2_P), and at a certain moment, the buffers of data that LCH_1 and LCH_2 need to send are LCH1_Buf and LCH2_Buf respectively.

[0141] In step 1, radio resources are allocated to LCH_1 and LCH_2 based on the priority bit rate.

[0142] First, based on the priority bit rate, the token bucket algorithm is used to allocate radio resources to LCH_1 and update related parameters using the following formula: LCH1_ASG = min(SG, LCH1_Bj, LCH_Buf1); SG = SG - LCH1_ASG; LCH1_Bj = LCH1_Bj - LCH1_ASG; LCH1_Buf = LCH1_Buf - LCH1_ASG;

[0143] Among them, LCH1_ASG is the wireless resource allocated to LCH_1 at that time; LCH1_Bj is the token variable corresponding to LCH_1 and is associated with the priority bit rate; LCH1_Buf is the data buffer of LCH_1, which can indicate the amount of data to be transmitted by LCH_1.

[0144] Secondly, if SG has remaining radio resources, then the radio resources are allocated to LCH_2 and the relevant parameters are updated using the following formula: LCH2_ASG = min(SG, LCH2_Bj, LCH_Buf2); SG = SG - LCH2_ASG; LCH2_Bj = LCH2_Bj - LCH2_ASG; LCH2_Buf = LCH2_Buf - LCH2_ASG;

[0145] Among them, LCH2_ASG is the wireless resource allocated to LCH_2 at that time; LCH2_Bj is the token variable corresponding to LCH_2 and is associated with the priority bit rate; LCH2_Buf is the data buffer of LCH_2, which can indicate the amount of data to be transmitted by LCH_2.

[0146] Finally, if the SG still has remaining wireless resources, execute step 2.

[0147] In step 2, radio resources are allocated to LCH_1 and LCH_2 based on the resource allocation rate.

[0148] First, based on the incremental bit rate, radio resources are allocated to LCH_1 using the following formulas, and related parameters are updated: LCH1_ASG = min(SG, LCH1_Bd, LCH_Buf1); SG = SG - LCH1_ASG; LCH1_Buf = LCH1_Buf - LCH1_ASG; LCH1_Bd = LCH1_Bd - LCH1_ASG;

[0149] Among them, LCH1_ASG is the wireless resource allocated to LCH_1 at this time; LCH1_Buf is the data buffer of LCH_1, which can indicate the amount of data to be transmitted by LCH_1; LCH1_Bd is the second token variable of LCH_1, which can be associated with the incremental bit rate of LCH_1.

[0150] It should be noted that in the resource allocation process of this step, the relevant parameters used are all the parameters updated in step 1. For example, SG is the remaining allocatable wireless resources after the resource allocation of the first round of sub-process (ie, step 1) is completed.

[0151] Secondly, if there are remaining radio resources in SG, then based on the incremental bit rate, radio resources are allocated to LCH_2 using the following formulas, and related parameters are updated: LCH2_ASG = min(SG, LCH2_Bd, LCH_Buf2); SG = SG - LCH2_ASG; LCH2_Buf = LCH2_Buf - LCH2_ASG; LCH2_Bd = LCH2_Bd - LCH2_ASG;

[0152] Among them, LCH2_ASG is the wireless resource allocated to LCH_2 at that time; LCH2_Buf is the data buffer of LCH_2, which can indicate the amount of data to be transmitted by LCH_2; LCH2_Bd is the second token variable of LCH_2, which can be associated with the incremental bit rate of LCH_2.

[0153] It should be noted that in the resource allocation process of this step, the relevant parameters used are all the parameters updated in step 1. For example, SG is the remaining allocatable wireless resources after the resource allocation of the first round of sub-process (ie, step 1) is completed.

[0154] Finally, if the SG still has remaining wireless resources, execute step 3.

[0155] In step 3, radio resources are allocated to LCH_1 and LCH_2 based on the logical channel priority until the radio resources SG are allocated completely or LCH_2 is also allocated resources.

[0156] As can be seen, the amount of data to be transmitted and the available radio resources are updated each time radio resources are allocated to the first logical channel, but the second token variable is only updated in the second round of the sub-process. Allocating radio resources to logical channels using incremental bit rates helps address the aforementioned unfairness and is simple to implement.

[0157] The method embodiment of the present application is described in detail above in conjunction with Figures 1 to 3 . The device embodiment of the present application is described in detail below in conjunction with Figures 4 and 5 . It should be understood that the description of the method embodiment corresponds to the description of the device embodiment. Therefore, for parts not described in detail, reference can be made to the above method embodiment.

[0158] FIG4 is a schematic diagram of a terminal device according to an embodiment of the present application. The terminal device shown in FIG4 includes: a determining unit 410 and an allocating unit 420 .

[0159] The determining unit 410 is configured to determine a first parameter based on a resource allocation rate, where the resource allocation rate is associated with a satisfaction level of the first logical channel.

[0160] The allocating unit 420 is configured to allocate a first wireless resource to the first logical channel based on the first parameter.

[0161] In some embodiments, the resource allocation rate includes a satisfactory bit rate, the first parameter includes a first token variable, and the determination of the first parameter based on the resource allocation rate includes: the first token variable satisfies the following formula: Bk=Bk+SBR×T, Bk=min(Bk,SBR_BS); wherein Bk is the first token variable, SBR is the satisfactory bit rate, SBR_BS is the size of the first token bucket, T represents the time interval between two calculations of the first parameter, and min represents taking the minimum value.

[0162] In some embodiments, allocating a first wireless resource to a first logical channel based on the first parameter includes: the first wireless resource satisfies the following formula: LCH1_ASG1=min(SG,Bk,LCH1_Buf); wherein, LCH1_ASG1 is the first wireless resource, SG is the allocable wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, and min represents the minimum value.

[0163] In some embodiments, the device further includes: a first updating unit, configured to update the first token variable according to the following formula after allocating the first wireless resource to the first logical channel based on the first parameter: Bk=Bk-LCH1_ASG1.

[0164] In some embodiments, the device also includes: a second update unit, used to update the amount of data to be transmitted and the allocable wireless resources of the first logical channel according to the following formula after allocating the first wireless resource to the first logical channel based on the first parameter: LCH1_Buf = LCH1_Buf-LCH1_ASG1; SG = SG-LCH1_ASG1.

[0165] In some embodiments, the resource allocation rate includes an incremental bit rate, the first parameter includes a second token variable, and the determination of the first parameter based on the resource allocation rate includes: the second token variable satisfies the following formula: Bd=Bd+delta_BR×T, Bd=min(Bd,delta_BS); wherein delta_BR is the incremental bit rate, delta_BS is the size of the second token bucket, T represents the time interval between two calculations of the first parameter, and min represents the minimum value.

[0166] In some embodiments, allocating a first wireless resource to a first logical channel based on the first parameter includes: the first wireless resource satisfies the following formula: LCH1_ASG1=min(SG,Bd,LCH1_Buf); wherein, LCH1_ASG1 is the first wireless resource, SG is the allocable wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, and min represents the minimum value.

[0167] In some embodiments, the device further includes: a third updating unit, configured to update the second token variable according to the following formula after allocating the first wireless resource to the first logical channel based on the first parameter: Bd=Bd-LCH1_ASG1.

[0168] In some embodiments, the device also includes: a fourth update unit, used to update the amount of data to be transmitted and the allocatable wireless resources of the first logical channel according to the following formula after allocating the first wireless resource to the first logical channel based on the first parameter: LCH1_Buf = LCH1_Buf-LCH1_ASG1; SG = SG-LCH1_ASG1; wherein, LCH1_ASG1 is the first wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted by the first logical channel, and SG is the allocatable wireless resource.

[0169] In some embodiments, the first wireless resource is a resource allocated by the terminal device to the first logical channel from the allocatable wireless resources; wherein the allocatable wireless resource is the remaining wireless resource after the terminal device allocates wireless resources to multiple logical channels based on the priority bit rates of the multiple logical channels, and the multiple logical channels include the first logical channel.

[0170] In some embodiments, the first parameter includes a first token variable, and the device further includes: a fifth update unit, used to update the first token variable according to the following formula after allocating wireless resources to multiple logical channels based on the priority bit rate of multiple logical channels: Bk=Bk-LCH1_ASG2; wherein Bk is the first token variable, LCH1_ASG2 is the second wireless resource, and the second wireless resource is the resource allocated by the terminal device to the first logical channel based on the priority bit rate.

[0171] In some embodiments, the device also includes: a sixth update unit, used to update the amount of data to be transmitted on the first logical channel and the allocatable wireless resources according to the following formula after allocating wireless resources to multiple logical channels based on the priority bit rate of multiple logical channels: LCH1_Buf = LCH1_Buf-LCH1_ASG2; SG = SG-LCH1_ASG2; wherein, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, SG is the allocatable wireless resource, LCH1_ASG2 is the second wireless resource, and the second wireless resource is the resource allocated by the terminal device to the first logical channel based on the priority bit rate.

[0172] In some embodiments, if the logical channels participating in wireless resource allocation include the first logical channel and the second logical channel, wireless resources are allocated to the first logical channel first, and then wireless resources are allocated to the second logical channel, wherein the priority of the first logical channel is higher than that of the second logical channel.

[0173] Figure 5 is a schematic diagram of the structure of a communication device according to an embodiment of the present application. The dashed lines in Figure 5 indicate that the unit or module is optional. The device 500 can be used to implement the method described in the above method embodiment. The device 500 can be a chip or a terminal device.

[0174] The device 500 may include one or more processors 510. The processor 510 may support the device 500 to implement the method described in the method embodiment above. The processor 510 may be a general-purpose processor or a special-purpose processor. For example, the processor may be a central processing unit (CPU). Alternatively, the processor may be another 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, a discrete hardware component, etc. The general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc.

[0175] The apparatus 500 may further include one or more memories 520. The memories 520 store programs that can be executed by the processor 510, causing the processor 510 to perform the methods described in the above method embodiments. The memories 520 may be independent of the processor 510 or integrated into the processor 510.

[0176] The apparatus 500 may further include a transceiver 530. The processor 510 may communicate with other devices or chips via the transceiver 530. For example, the processor 510 may transmit and receive data with other devices or chips via the transceiver 530.

[0177] The present invention also provides a computer-readable storage medium for storing a program. The computer-readable storage medium can be applied to a terminal device provided in the present invention, and the program enables a computer to execute the method performed by the terminal device in each embodiment of the present invention.

[0178] The present application also provides a computer program product. The computer program product includes a program. The computer program product can be applied to the terminal device provided in the present application, and the program causes a computer to execute the method performed by the terminal device in each embodiment of the present application.

[0179] The embodiments of the present application also provide a computer program. The computer program can be applied to the terminal device provided in the embodiments of the present application, and the computer program enables a computer to execute the method executed by the terminal device in each embodiment of the present application.

[0180] It should be understood that the terms "system" and "network" in this application can be used interchangeably. In addition, the terms used in this application are only used to explain the specific embodiments of this application and are not intended to limit this application. The terms "first", "second", "third", and "fourth" in the specification and claims of this application and the accompanying drawings are used to distinguish different objects rather than to describe a specific order. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions.

[0181] In the embodiments of this application, the term "indication" may refer to a direct indication, an indirect indication, or an indication of an association. For example, "A indicates B" may refer to a direct indication of B, e.g., B can obtain information through A; it may refer to an indirect indication of B, e.g., A indicates C, e.g., B can obtain information through C; or it may refer to an association between A and B.

[0182] In the embodiment of the present application, "B corresponding to A" means that B is associated with A and B can be determined based on A. However, it should be understood that determining B based on A does not mean determining B based solely on A, but B can also be determined based on A and / or other information.

[0183] In the embodiments of the present application, the term "corresponding" may indicate a direct or indirect correspondence between the two, or an association relationship between the two, or a relationship between indication and indication, configuration and configuration, etc.

[0184] In the embodiments of the present application, "pre-definition" or "pre-configuration" may be implemented by pre-storing corresponding codes, tables, or other methods that can be used to indicate relevant information in a device (e.g., a terminal device and a network device). The present application does not limit the specific implementation method. For example, pre-definition may refer to information defined in a protocol.

[0185] In the embodiments of the present application, the “protocol” may refer to a standard protocol in the communications field, for example, it may include an LTE protocol, an NR protocol, and related protocols used in future communication systems, and the present application does not limit this.

[0186] In the embodiments of this application, the term "and / or" is simply a description of the association relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this document generally indicates that the related objects are in an "or" relationship.

[0187] In various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0188] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0189] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0190] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0191] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from one website, computer, server or data center to another website, computer, server or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) method. The computer-readable storage medium can be any available medium that can be read by a computer or a data storage device such as a server or data center that includes one or more available media integrated therein. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a digital versatile disc (DVD)), or a semiconductor medium (eg, a solid state disk (SSD)).

[0192] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A method for wireless communication, characterized in that: include: The terminal device determines a first parameter based on the resource allocation rate; The terminal device allocates a first wireless resource to a first logical channel based on the first parameter; The resource allocation rate is associated with a satisfaction level of the first logical channel.

2. The method according to claim 1, characterized in that The resource allocation rate includes a satisfactory bit rate, the first parameter includes a first token variable, and the terminal device determines the first parameter based on the resource allocation rate, including: The first token variable satisfies the following formula: Bk=Bk+SBR×T, Bk=min(Bk,SBR_BS); Among them, Bk is the first token variable, SBR is the satisfied bit rate, SBR_BS is the size of the first token bucket, T represents the time interval between two calculations of the first parameter, and min represents taking the minimum value.

3. The method according to claim 2, characterized in that The terminal device allocates a first wireless resource to a first logical channel based on the first parameter, including: The first wireless resource satisfies the following formula: LCH1_ASG1=min(SG,Bk,LCH1_Buf); Among them, LCH1_ASG1 is the first wireless resource, SG is the allocatable wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, and min represents the minimum value.

4. The method according to claim 3, characterized in that: After the terminal device allocates a first wireless resource to the first logical channel based on the first parameter, the method further includes: Update the first token variable according to the following formula: Bk=Bk-LCH1_ASG1.

5. The method according to claim 3 or 4, characterized in that: After the terminal device allocates a first wireless resource to the first logical channel based on the first parameter, the method further includes: The amount of data to be transmitted and the allocatable radio resources of the first logical channel are updated according to the following formula: LCH1_Buf=LCH1_Buf-LCH1_ASG1; SG=SG-LCH1_ASG1.

6. The method according to claim 1, characterized in that The resource allocation rate includes an incremental bit rate, the first parameter includes a second token variable, and the terminal device determines the first parameter based on the resource allocation rate, including: The second token variable satisfies the following formula: Bd=Bd+delta_BR×T, Bd=min(Bd,delta_BS); Among them, delta_BR is the incremental bit rate, delta_BS is the size of the second token bucket, T represents the time interval between two calculations of the first parameter, and min represents taking the minimum value.

7. The method according to claim 6, characterized in that The terminal device allocates a first wireless resource to a first logical channel based on the first parameter, including: The first wireless resource satisfies the following formula: LCH1_ASG1=min(SG,Bd,LCH1_Buf); Among them, LCH1_ASG1 is the first wireless resource, SG is the allocatable wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, and min represents the minimum value.

8. The method according to claim 7, characterized in that After the terminal device allocates a first wireless resource to the first logical channel based on the first parameter, the method further includes: Update the second token variable according to the following formula: Bd=Bd-LCH1_ASG1.

9. The method according to claim 7 or 8, characterized in that: After the terminal device allocates a first wireless resource to the first logical channel based on the first parameter, the method further includes: The amount of data to be transmitted and the allocatable radio resources of the first logical channel are updated according to the following formula: LCH1_Buf=LCH1_Buf-LCH1_ASG1; SG = SG-LCH1_ASG1; Among them, LCH1_ASG1 is the first wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted by the first logical channel, and SG is the allocatable wireless resource.

10. The method according to any one of claims 1 to 9, characterized in that The first wireless resource is a resource allocated by the terminal device to the first logical channel from allocatable wireless resources; The allocatable wireless resources are the remaining wireless resources after the terminal device allocates wireless resources to multiple logical channels based on the priority bit rates of the multiple logical channels, and the multiple logical channels include the first logical channel.

11. The method according to claim 10, characterized in that The first parameter includes a first token variable, and after the terminal device allocates wireless resources to the multiple logical channels based on the priority bit rates of the multiple logical channels, the method further includes: Update the first token variable according to the following formula: Bk = Bk - LCH1_ASG2; Among them, Bk is the first token variable, LCH1_ASG2 is the second wireless resource, and the second wireless resource is the resource allocated by the terminal device to the first logical channel based on the priority bit rate.

12. The method according to claim 10 or 11, characterized in that: After the terminal device allocates wireless resources to the multiple logical channels based on the priority bit rates of the multiple logical channels, the method further includes: The amount of data to be transmitted on the first logical channel and the allocatable radio resources are updated according to the following formula: LCH1_Buf=LCH1_Buf-LCH1_ASG2; SG = SG-LCH1_ASG2; Among them, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, SG is the allocatable wireless resource, LCH1_ASG2 is the second wireless resource, and the second wireless resource is the resource allocated by the terminal device to the first logical channel based on the priority bit rate.

13. The method according to any one of claims 1 to 12, characterized in that If the logical channels participating in wireless resource allocation include the first logical channel and the second logical channel, wireless resources are allocated to the first logical channel first, and then to the second logical channel, wherein the priority of the first logical channel is higher than that of the second logical channel.

14. A terminal device, characterized in that: include: A determining unit, configured to determine a first parameter based on a resource allocation rate, wherein the resource allocation rate is associated with a satisfaction level of a first logical channel; An allocation unit is used to allocate a first wireless resource to the first logical channel based on the first parameter.

15. The device according to claim 14, characterized in that The resource allocation rate includes a satisfactory bit rate, the first parameter includes a first token variable, and determining the first parameter based on the resource allocation rate includes: The first token variable satisfies the following formula: Bk=Bk+SBR×T, Bk=min(Bk,SBR_BS); Among them, Bk is the first token variable, SBR is the satisfied bit rate, SBR_BS is the size of the first token bucket, T represents the time interval between two calculations of the first parameter, and min represents taking the minimum value.

16. The device according to claim 15, characterized in that The allocating a first wireless resource to a first logical channel based on the first parameter includes: The first wireless resource satisfies the following formula: LCH1_ASG1=min(SG,Bk,LCH1_Buf); Among them, LCH1_ASG1 is the first wireless resource, SG is the allocatable wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, and min represents the minimum value.

17. The device according to claim 16, characterized in that The device also includes: A first updating unit is configured to, after allocating a first wireless resource to a first logical channel based on the first parameter, Update the first token variable according to the following formula: Bk=Bk-LCH1_ASG1.

18. The device according to claim 16 or 17, characterized in that The device also includes: A second updating unit is configured to update the amount of data to be transmitted and the allocatable wireless resources of the first logical channel according to the following formula after allocating the first wireless resource to the first logical channel based on the first parameter: LCH1_Buf=LCH1_Buf-LCH1_ASG1; SG=SG-LCH1_ASG1.

19. The device according to claim 14, characterized in that The resource allocation rate includes an incremental bit rate, the first parameter includes a second token variable, and determining the first parameter based on the resource allocation rate includes: The second token variable satisfies the following formula: Bd=Bd+delta_BR×T, Bd=min(Bd,delta_BS); Among them, delta_BR is the incremental bit rate, delta_BS is the size of the second token bucket, T represents the time interval between two calculations of the first parameter, and min represents taking the minimum value.

20. The device according to claim 19, characterized in that The allocating a first wireless resource to a first logical channel based on the first parameter includes: The first wireless resource satisfies the following formula: LCH1_ASG1=min(SG,Bd,LCH1_Buf); Among them, LCH1_ASG1 is the first wireless resource, SG is the allocatable wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, and min represents the minimum value.

21. The device according to claim 20, characterized in that The device also includes: A third updating unit is configured to update the second token variable according to the following formula after allocating the first wireless resource to the first logical channel based on the first parameter: Bd=Bd-LCH1_ASG1.

22. The device according to claim 20 or 21, characterized in that The device also includes: A fourth updating unit, configured to update the amount of data to be transmitted and the allocatable wireless resources of the first logical channel according to the following formula after allocating the first wireless resource to the first logical channel based on the first parameter: LCH1_Buf=LCH1_Buf-LCH1_ASG1; SG = SG-LCH1_ASG1; Among them, LCH1_ASG1 is the first wireless resource, LCH1_Buf is used to indicate the amount of data to be transmitted by the first logical channel, and SG is the allocatable wireless resource.

23. The device according to any one of claims 14 to 22, characterized in that The first wireless resource is a resource allocated by the terminal device to the first logical channel from allocatable wireless resources; The allocatable wireless resources are the remaining wireless resources after the terminal device allocates wireless resources to multiple logical channels based on the priority bit rates of the multiple logical channels, and the multiple logical channels include the first logical channel.

24. The device according to claim 23, characterized in that The first parameter includes a first token variable, and the device further includes: A fifth updating unit, configured to update the first token variable according to the following formula after allocating wireless resources to the multiple logical channels based on the priority bit rates of the multiple logical channels: Bk = Bk - LCH1_ASG2; Among them, Bk is the first token variable, LCH1_ASG2 is the second wireless resource, and the second wireless resource is the resource allocated by the terminal device to the first logical channel based on the priority bit rate.

25. The device according to claim 23 or 24, characterized in that The device also includes: A sixth updating unit, configured to update the amount of data to be transmitted by the first logical channel and the allocatable wireless resources according to the following formula after allocating wireless resources to the multiple logical channels based on the priority bit rates of the multiple logical channels: LCH1_Buf=LCH1_Buf-LCH1_ASG2; SG = SG-LCH1_ASG2; Among them, LCH1_Buf is used to indicate the amount of data to be transmitted on the first logical channel, SG is the allocatable wireless resource, LCH1_ASG2 is the second wireless resource, and the second wireless resource is the resource allocated by the terminal device to the first logical channel based on the priority bit rate.

26. The device according to any one of claims 14 to 25, characterized in that If the logical channels participating in wireless resource allocation include the first logical channel and the second logical channel, wireless resources are allocated to the first logical channel first, and then to the second logical channel, wherein the priority of the first logical channel is higher than that of the second logical channel.

27. A terminal device, characterized in that: The invention comprises a memory and a processor, wherein the memory is used to store a program, and the processor is used to call the program in the memory to execute the method according to any one of claims 1 to 13.

28. A device, characterized in that The invention comprises a processor, which is used to call a program from a memory to execute the method according to any one of claims 1 to 13.

29. A chip, characterized in that: It comprises a processor, which is used to call a program from a memory, so that a device equipped with the chip executes a method as claimed in any one of claims 1 to 13.

30. A computer-readable storage medium, characterized in that: A program is stored thereon, and the program enables a computer to execute the method according to any one of claims 1 to 13.

31. A computer program product, characterized in that The method comprises a program which causes a computer to execute the method according to any one of claims 1 to 13.

32. A computer program, characterized in that The computer program enables a computer to execute the method according to any one of claims 1 to 13.

Images