Wireless communication method and device used in terminal

Abstract

The invention discloses a wireless communication method and device used in a terminal. The wireless communication method comprises the steps of judging whether a first discarding condition for a first PDU set is met or not; on the basis of meeting the first discarding condition, discarding at least part of the remaining PDUs transmitted in the first PDU set, and discarding at least part of the remaining PDUs transmitted in the second PDU set; wherein any PDU in the second PDU set is generated based on the PDU in the first PDU set. According to the invention, resources can be saved and the transmission reliability is improved.

Description

Technical Field

[0001] The present invention relates to cellular wireless communication, and in particular to a wireless communication method and device used in a terminal. Background Art

[0002] In the future, the application scenarios of wireless communication systems will become more and more diversified, and different application scenarios will put forward different performance requirements for the system. In order to meet the different performance requirements of various application scenarios, the 3GPP (3rd Generation Partner Project) RAN (Radio Access Network) #72 plenary meeting decided to study the new radio (NR) (or Fifth Generation, 5G) technology, and the WI (Work Item) of NR was passed at the 3GPP RAN #75 plenary meeting, and the standardization work of NR began.

[0003] With the continuous development of communication systems, data transmission latency is constantly decreasing, and transmission capacity is increasing. Some multimedia services with strong real-time performance have gradually emerged in 5G communication systems, such as video transmission, cloud gaming, extended reality (XR), tactile Internet, etc. In order to achieve an immersive experience of interaction between people and the virtual world, XR services with ultra-high bandwidth and ultra-low latency requirements have attracted much attention.

[0004] XR services are modeled according to data frames. The same data frame can be divided into multiple packet data units (PDUs). One or more PDUs corresponding to the same information unit constitute a PDU set (PDUset). The XR service is transmitted between the sender and the receiver by sending the PDU set. Summary of the invention

[0005] After investigation, the inventors found that application and service perception in the radio access network (RAN) is one of the key features to improve the user experience of XR services. 5G and future evolution systems can use a general quality of service (QoS) mechanism to handle various data services including XR services. The QoS mechanism supports the parameter priority level, which is used to indicate the priority of resource allocation between QoS flows. In addition, 5G research introduced the parameter PDU Set Importance (PSI) to indicate the importance of the PDU set.

[0006] With the development of technology, it is also necessary to introduce repair data (e.g., repair Protocol Data Unit (repair PDU)) to form a source block from a series of unmodified source packets. However, how to save system resources and ensure the service quality of the business with the help of repair data requires further research.

[0007] In view of the above-mentioned problems, the present invention provides a solution.

[0008] It should be noted that, in the absence of conflict, the embodiments and features in any node of the present invention can be applied to any other node. In the absence of conflict, the embodiments and features in the embodiments of the present invention can be arbitrarily combined with each other. At the same time, the method proposed in the present invention can also be used to solve other problems in communication, such as NR evolution and problems in 6G systems.

[0009] As an embodiment, the interpretation of the terminology in the present invention refers to the definition of the 3GPP specification protocol TS38 series.

[0010] As an embodiment, the interpretation of the terms in the present invention refers to the definition of the TS37 series of specification protocols of 3GPP.

[0011] An embodiment of the present invention discloses a wireless communication method for a terminal, comprising: determining whether a first discarding condition for a first PDU set is met; based on meeting the first discarding condition, discarding the first PDU set, transmitting at least a portion of the remaining PDUs, and discarding the second PDU set, transmitting at least a portion of the remaining PDUs; wherein any PDU in the second PDU set is generated based on a PDU in the first PDU set.

[0012] The embodiment of the present invention determines whether the PDU in the first PDU set can be discarded according to the first discard condition, and discards at least part of the first PDU set and the second PDU set when the first discard condition is met, and discards useless data packets in time, which is conducive to saving storage resources, alleviating network congestion, ensuring more efficient use of limited resources and improving service quality. In addition, by determining whether at least part of the PDU in the second PDU set is discarded by judging the first discard condition for the first PDU set, it is conducive to simplifying the processing process, reducing processing delays, and further reducing system complexity.

[0013] In one embodiment, the wireless communication method provides a solution for how to use different data sets to ensure the quality of service of a business so as to save network resources.

[0014] In one embodiment, the wireless communication method provides a solution for discarding data packets when network congestion occurs.

[0015] In one embodiment, the wireless communication method provides a solution for how to discard a data packet when a data packet transmission may time out.

[0016] As an embodiment, the problem to be solved by the present invention includes: how to process source data packets and repair data packets when network congestion occurs.

[0017] As an embodiment, the benefits of the above method include: when network congestion occurs, it is possible to save resources as much as possible to maximize the quality of service, which is conducive to better support for XR services.

[0018] As an embodiment, the above method also has the benefits of: timely discarding useless data packets, which is conducive to saving storage resources.

[0019] In one embodiment, each PDU in the first PDU set is source data, for example, a source PDU.

[0020] In one embodiment, each PDU in the second PDU set is repair data, for example, a repair PDU (source PDU).

[0021] In one embodiment, the total number of PDUs in the first PDU set is N, and the N PDUs are generated according to N PDCP SDUs respectively, N>K, N is a positive integer, and the value of K depends on N.

[0022] In one embodiment, the PDUs in the first PDU set are PDCP SDUs, the N PDCP SDUs are encoded at a protocol layer above the PDCP sublayer, and the K depends on at least one parameter of the encoding.

[0023] In one embodiment, a PDU set refers to one or more PDUs carrying a payload of a unit of information generated at the application layer (such as a frame or video slice of an XR service, etc.). A PDU in a PDU set corresponds to a PDCP SDU, and the definition can be found in TS23.501. Specifically, according to one aspect of the present invention, the N PDCP SDUs include at least one non-delay-critical PDCP SDU, and the delay-critical PDCP SDU is a PDCP SDU in which the remaining time of a first timer associated with the PDCP SDU is less than a first threshold, or the delay-critical PDCP SDU is a PDCP PDU in a PDU set, and the PDU set includes a PDCP SDU in which the remaining time of an associated first timer is less than a certain threshold.

[0024] Specifically, according to one aspect of the present invention, the wireless communication method also includes: when the first discarding condition is not met but the second discarding condition for the second PDU set is met, discarding at least part of the PDUs in the second PDU set, and the second discarding condition is used to determine whether to discard at least part of the PDUs in the second PDU set.

[0025] In an embodiment of the present invention, since the first discard condition is not met, the first PDU set will not be discarded, which is conducive to ensuring system reliability; under this condition, the second discard condition is used to determine whether to discard at least part of the PDUs in the second PDU set, which is conducive to distinguishing different PDU sets, avoiding wasting storage space due to insufficiently precise discard conditions, and thereby improving network congestion.

[0026] As an embodiment, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, the PDUs in the first PDU set are not discarded.

[0027] As an embodiment, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, only the PDUs in the second PDU set are discarded.

[0028] As an embodiment, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, only the PDUs in the second PDU set are discarded.

[0029] As an embodiment, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, only a part of the PDUs in the second PDU set is discarded.

[0030] As an embodiment, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, only part of the PDUs in the second PDU set are discarded, and the part of the PDUs are associated not only with the PDUs in the first PDU set but also with the PDUs in other PDU sets.

[0031] As an embodiment, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, only part of the PDUs in the second PDU set are discarded, and the correlation between the part of the PDU and the PDUs in the first PDU set is less than the correlation between the part of the PDU and the PDUs in other PDU sets.

[0032] As an embodiment, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, only part of the PDUs in the second PDU set are discarded, and the part of the PDUs are generated not only based on the PDUs in the first PDU set, but also based on the PDUs in other PDU sets.

[0033] As an embodiment, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, only all PDUs in the second PDU set are discarded.

[0034] Specifically, according to one aspect of the present invention, the second discarding condition includes at least one of the following:

[0035] The number of PDUs successfully received by the receiving end is not higher than a third threshold;

[0036] The delay budget range of the PDU to be transmitted is less than the preset time;

[0037] The number of PDUs successfully sent by the sending end is less than a fourth threshold.

[0038] Specifically, according to one aspect of the present invention, the first discarding condition includes at least one of the following:

[0039] The number of PDUs successfully received by the receiving end is not higher than a first threshold;

[0040] The delay budget range of the PDU to be transmitted is less than the preset time;

[0041] The number of PDUs successfully sent by the sending end is less than the second threshold.

[0042] The embodiments of the present invention try to fully consider the network congestion condition or channel condition according to different angles of successful reception by the receiving end and successful transmission by the transmitting end or based on a preset delay range, so as to determine whether to discard the PDU, which is conducive to alleviating network congestion and further improving system efficiency.

[0043] As an example, the first threshold depends on the number of PDUs in the second PDU set successfully received by the receiving end.

[0044] As an example, the first threshold depending on the number of PDUs in the second PDU set successfully received by the receiving end includes: Y < F(X1), where Y is the number of PDUs in the first PDU set successfully received by the receiving end, X1 is the number of PDUs in the first PDU set, F() is a function, and the output of F() is the first threshold.

[0045] As an example, the F() may include input parameters other than X1.

[0046] As an example, the input parameter other than X1 includes M1, and the M1 is a positive number less than 1.

[0047] As an example, the M1 is network-configured or determined by the terminal itself.

[0048] As an example, the F() is the product of X1 and M1.

[0049] As an example, the F() is a non-linear function.

[0050] As an example, the F() is defined in the form of a table.

[0051] As an example, F() can be defined as: the product of X1 and a first variable, and the magnitude of the first variable is negatively correlated with the magnitude of X1.

[0052] As an example, the F() can be defined as: when X1 is small, F() is the product of X1 and a first value; when X1 is large, F() is the product of X1 and another value greater than the first value.

[0053] As an example, the F() can be defined as: when X1 is less than 10, the output of F(X) is the product of X1 and 0.9; when X1 is not less than 10, the output of F(X1) is the product of X1 and 0.8.

[0054] As an example, the input parameter other than X1 includes M2, and the M2 is the number of PDUs in the second PDU set successfully received by the receiving end.

[0055] As an example, the F() can be defined as: when M2 is not less than 5, and when X1 is less than 10, the output of F(X1) is the product of X1 and 0.9; when X1 is not less than 10, the output of F(X1) is the product of X1 and 0.8.

[0056] As a sub-embodiment of this embodiment, when M2 is less than 5 and when X1 is less than 7, the output of F(X1) is the product of X1 and 0.8, and when X1 is not less than 7, the output of F(X1) is the product of X1 and 0.7.

[0057] As another embodiment, the F() can be defined as: when M2 is not less than 5 and when X1 is less than 100, the output of F(X1) is the product of X1 and 0.85; when X1 is not less than 100, the output of F(X1) is the product of X1 and 0.75.

[0058] As a sub-embodiment of this embodiment, when M2 is less than 5 and when X1 is less than 7, the output of F(X1) is the product of X1 and 0.8, and when X1 is not less than 7, the output of F(X1) is the product of X1 and 0.7.

[0059] As an embodiment, the first threshold depends on the number of PDUs in the second PDU set successfully received by the receiving end.

[0060] As an embodiment, the first threshold value depends on the number of PDUs in the second PDU set successfully received by the receiving end, including: the size of the first threshold value is negatively correlated with the number of PDUs in the second PDU set successfully received by the receiving end.

[0061] Specifically, according to one aspect of the present invention, before determining whether the first discarding condition is met, the method includes:

[0062] generating a second PDU based on the first PDU;

[0063] Sending (P+Q1) PDUs, wherein the P PDUs are the first PDUs from the first PDU set, and the Q1 PDUs are the second PDUs from the second PDU set;

[0064] Among them, P and Q1 are both positive integers.

[0065] The embodiment of the present invention further defines that each second PDU in the second PDU set is generated based on each first PDU in the first PDU set, clarifies the association between two PDU sets or each PDU, and provides an explanation for adopting different discarding conditions.

[0066] As an embodiment, the meaning that the P PDUs are from the first PDU in the first PDU set includes: the P PDUs are generated by the first PDU in the first PDU set.

[0067] As an embodiment, the meaning that the P PDUs are the first PDUs from the first PDU set includes: the P PDUs are the P first PDUs in the first PDU set.

[0068] As an embodiment, the meaning that the P PDUs are the first PDU from the first PDU set includes: the first PDU set includes P PDUs, wherein the P PDUs are named as the first PDU.

[0069] As an embodiment, the meaning that the P PDUs are the first PDU from the first PDU set includes: the first PDU set includes a plurality of PDUs whose number is greater than P, wherein the P PDUs are named as the first PDU.

[0070] As an embodiment, the meaning that the P PDUs are from the first PDU in the first PDU set includes: the P PDUs are copies of the first PDU in the first PDU set.

[0071] As an embodiment, the meaning that the P PDUs are the first PDU from the first PDU set includes: any one PDU in the first PDU set is named as the first PDU.

[0072] As an embodiment, the meaning that the Q1 PDUs are the second PDUs from the second PDU set includes: Q1 PDUs are generated by the second PDUs in the second PDU set, and each of the second PDUs is generated based on the first PDU.

[0073] As an embodiment, the meaning that the Q1 PDUs are the second PDUs from the second PDU set includes: the Q1 PDUs are the Q1 second PDUs in the second PDU set.

[0074] As an embodiment, the meaning that the Q1 PDUs are the second PDUs from the second PDU set includes: the second PDU set includes Q1 PDUs, wherein the Q1 PDUs are named as the second PDUs.

[0075] As an embodiment, the meaning that the Q1 PDUs are the second PDUs from the second PDU set includes: the second PDU set includes a plurality of PDUs whose number is greater than Q1, wherein Q1 PDUs are named as the second PDUs.

[0076] As an embodiment, the meaning that the Q1 PDU is the second PDU from the second PDU set includes: the Q1 PDU is a copy of the second PDU in the second PDU set.

[0077] As an embodiment, the meaning that the Q1 PDU is the second PDU from the second PDU set includes: any one PDU in the second PDU set is named as the second PDU.

[0078] Specifically, according to one aspect of the present invention, the first PDU set includes N first PDUs, and the N first PDUs are generated according to N PDCP SDUs respectively; the second PDU set includes X second PDUs, N>(K+X), N is a positive integer, and the values ​​of K and X depend on N; wherein, (P+Q1)<(K+X).

[0079] Specifically, according to one aspect of the present invention, the terminal assumes that the receiving end successfully receives Y first PDUs in the first PDU set; the wireless communication method includes: determining the value of Q2, and setting the PDU set importance of at least Q2 second PDUs in the second PDU set to the PDU set importance (PDU Set Importance) of the first PDU set; wherein the PDU set importance (PSI) of the first PDU set is higher than the PDU set importance (PSI) of the second PDU set, Y≤P, and Y is a positive integer.

[0080] An embodiment of the present invention adjusts the parameter values ​​(e.g., PDU Set Importance, PSI) of Q2 second PDUs in the second PDU set according to the number of PDUs successfully received by the receiving end, extends the storage time of the Q2 second PDUs as much as possible, and reduces the probability of the Q2 second PDUs being discarded when the second discard condition is met, so that the receiving end has the opportunity to successfully receive more data, which is beneficial to ensuring system reliability when network congestion occurs or channel quality degrades, and is beneficial to ensuring system QoS.

[0081] As an embodiment, the at least Q2 second PDUs in the second PDU set are PDUs to be transmitted.

[0082] As an embodiment, the number of PDUs in the second PDU set is not less than (Q1+Q2).

[0083] In one embodiment, Y is the number of first PDUs sent by the terminal (eg, the transmitting end).

[0084] In one embodiment, Y is estimated by the terminal (eg, the transmitting end) according to the number of first PDUs sent out and based on channel quality.

[0085] In one embodiment, Y is estimated by the terminal (eg, the transmitting end) according to the number of first PDUs sent out and the channel BLER and BER.

[0086] In one embodiment, Y is estimated by the terminal (eg, the transmitting end) according to the number of first PDUs sent out and according to channel RSRP and RSRQ.

[0087] Specifically, according to one aspect of the present invention, the wireless communication method includes: receiving indication information, the indication information is used to indicate that the receiving end has successfully received Y PDUs in the first PDU set; determining the value of Q2, and sending at least Q2 of the second PDUs from the second PDU set; wherein Y≤P, and Y and Q2 are positive integers.

[0088] The embodiment of the present invention uses the indication information sent by the receiving end to determine the value of Q2 that satisfies the receiving end to correctly decode the data, which can minimize the number of PDUs sent in the second PDU set and effectively improve system efficiency.

[0089] Specifically, according to one aspect of the present invention, before sending at least Q2 second PDUs from the second PDU set, the wireless communication method includes: setting the PDU set importance of at least Q2 second PDUs to the PDU set importance of the first PDU set; wherein the PDU set importance (PSI) of the first PDU set is higher than the PDU set importance of the second PDU set.

[0090] In the embodiment of the present invention, the transmitting end determines the value of Q2 that satisfies the receiving end to correctly decode the data based on its own considerations, which can minimize the number of PDUs in the second PDU set sent, and can effectively improve system efficiency.

[0091] In one embodiment, the transmitting end evaluates the value of Q2 based on statistical information or other known parameter information, and sets the PDU set importance of Q2 of the second PDUs as the PDU set importance of the first PDU set.

[0092] In one embodiment, the transmitting end evaluates the value of Q2 based on statistical information and parameters in the first PDU set that has been sent, and sets the PDU set importance of Q2 of the second PDUs as the PDU set importance of the first PDU set.

[0093] In one embodiment, the sending end evaluates the value of Q2 based on one or more pieces of information among default parameters, default parameters, measurement results, and parameters in the first PDU set that has been sent, and sets the PDU set importance of the Q2 second PDUs to the PDU set importance of the first PDU set.

[0094] Specifically, according to one aspect of the present invention, the wireless communication method includes: receiving indication information for indicating that the receiving end has successfully received Y PDUs in the first PDU set; determining the value of Q2, and sending at least Q2 PDUs, where the Q2 PDUs are from the first PDU set and the second PDU set; where Y ≤ P, and Y and Q2 are positive integers.

[0095] Specifically, according to one aspect of the present invention, before sending at least Q2 PDUs, the wireless communication method includes: setting the PDU set importance of at least Q3 second PDUs to the PDU set importance of the first PDU set; where the PDU set importance of the first PDU set is higher than the PDU set importance of the second PDU set; Q3 < Q2, and the at least Q2 PDUs include Q3 second PDUs.

[0096] Specifically, according to one aspect of the present invention, the first PDU set is associated with at least one first timer, and the remaining time of at least one first timer is less than a preset time. The wireless communication method further includes: canceling an unfinished delay information report that is at least used to report the delay status of the logical channel corresponding to the first PDU set.

[0097] As an embodiment, any PDU in the first PDU set is associated with a first timer. The first timer may include, but is not limited to, a discard timer, such as discardTimer or discardTimerForLowImportance.

[0098] As an embodiment, all PDUs in the first PDU set are associated with a first timer. The first timer may include, but is not limited to, a discard timer, such as discardTimer or discardTimerForLowImportance.

[0099] As an embodiment, the PDUs in the first PDU set are associated with multiple first timers. The first timer may include, but is not limited to, a discard timer, such as discardTimer or discardTimerForLowImportance.

[0100] To solve the above technical problem, the present invention provides a terminal, which includes: one or more processors and a memory; the memory is coupled to the one or more processors, the memory is used to store computer program code, the computer program code includes computer instructions, and the one or more processors call the computer instructions to enable the terminal to execute the above method.

[0101] Specifically, according to one aspect of the present invention, the terminal is a user equipment, a vehicle-mounted terminal or a mobile phone.

[0102] In order to solve the above technical problems, the present invention provides a terminal device (terminal for short), including: a first processor, which determines whether a first discarding condition for a first PDU set is met; the first processor, based on meeting the first discarding condition, discards the first PDU set, transmits at least a part of the remaining PDUs, and discards the second PDU set, and transmits at least a part of the remaining PDUs; wherein any PDU in the second PDU set is generated based on the PDU in the first PDU set.

[0103] Specifically, according to one aspect of the present invention, the terminal may include: the first processor, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, discards at least part of the PDUs in the second PDU set, and the second discarding condition is used to determine whether to discard the second PDU set.

[0104] Specifically, according to one aspect of the present invention, the second discarding condition includes at least one of the following:

[0105] The number of PDUs successfully received by the receiving end is not higher than a third threshold;

[0106] The delay budget range of the PDU to be transmitted is less than the preset time;

[0107] The number of PDUs successfully sent by the sending end is less than a fourth threshold.

[0108] Specifically, according to one aspect of the present invention, the first discarding condition includes at least one of the following:

[0109] The number of PDUs successfully received by the receiving end is not higher than a first threshold;

[0110] The delay budget range of the PDU to be transmitted is less than the preset time;

[0111] The number of PDUs successfully sent by the sending end is less than the second threshold.

[0112] Specifically, according to one aspect of the present invention, the terminal may include: the first processor generates a second PDU based on the first PDU before determining whether the first discard condition is met; a first transmitter sends (P+Q1) PDUs, the P PDUs are the first PDUs from the first PDU set, and the Q1 PDUs are the second PDUs from the second PDU set; wherein P and Q1 are both positive integers.

[0113] Specifically, according to one aspect of the present invention, the first PDU set includes N first PDUs, and the N first PDUs are generated according to N PDCP SDUs respectively; the second PDU set includes X second PDUs, N>(K+X), N is a positive integer, and the values ​​of K and X depend on N; wherein, (P+Q1)<(K+X).

[0114] Specifically, according to one aspect of the present invention, the terminal assumes that the receiving end successfully receives Y first PDUs in the first PDU set; the terminal includes: the first processor, determines the value of Q2, and sets the PDU set importance of at least Q2 second PDUs in the second PDU set to the PDU set importance of the first PDU set; wherein the PDU set importance (PSI) of the first PDU set is higher than the PDU set importance (PSI) of the second PDU set, Y≤P, and Y is a positive integer.

[0115] Specifically, according to one aspect of the present invention, the terminal includes: a first receiver, receiving indication information, wherein the indication information is used to indicate that the receiving end has successfully received Y PDUs in the first PDU set; the first processor, determining the value of Q2, and sending at least Q2 of the second PDUs from the second PDU set; wherein Y≤P, and Y is a positive integer.

[0116] Specifically, according to one aspect of the present invention, the terminal includes: before sending at least Q2 second PDUs from the second PDU set, the first processor sets the PDU set importance of at least Q2 second PDUs to the PDU set importance of the first PDU set; wherein the PDU set importance of the first PDU set is higher than the PDU set importance of the second PDU set.

[0117] Specifically, according to one aspect of the present invention, the terminal includes: the first processor, receiving indication information, the indication information is used to indicate that the receiving end has successfully received Y PDUs in the first PDU set; the first processor determines the value of Q2 and sends at least Q2 PDUs, the Q2 PDUs are from the first PDU set and the second PDU set; wherein, Y≤P, and Y, Q2 are positive integers.

[0118] Specifically, according to one aspect of the present invention, the terminal includes: the first processor, before sending at least Q2 PDUs, setting the PDU set importance of at least Q3 of the second PDUs to the PDU set importance of the first PDU set; wherein, the PDU set importance of the first PDU set is higher than the PDU set importance of the second PDU set; Q3 < Q2, and the at least Q2 PDUs include Q3 of the second PDUs.

[0119] Specifically, according to one aspect of the present invention, the first PDU set is associated with at least one first timer, and the remaining time of at least one first timer is less than a preset time. The terminal further includes: the first processor, canceling an uncompleted delay information report, where the delay information report is at least used to report the delay status of the logical channel corresponding to the first PDU set.

[0120] As an embodiment of the invention, the wireless communication method can be used for a terminal-side device. The wireless communication method includes: determining whether a first discard condition for a first PDU set is satisfied; based on satisfying the first discard condition, discarding at least a remaining part of the PDUs in the first PDU set during transmission, and discarding at least a remaining part of the PDUs in the second PDU set during transmission; wherein, any PDU in the second PDU set is generated based on the PDUs in the first PDU set.

[0121] Compared with the prior art, the technical solution of the embodiment of the present invention has the following beneficial effects:

[0122] In the embodiment of the present invention, it is determined whether the PDUs in the first PDU set can be discarded according to the first discard condition, and when the first discard condition is satisfied, at least part of the first PDU set and the second PDU set are discarded together, timely discarding useless data packets, which is beneficial to saving storage resources, alleviating network congestion, ensuring more efficient use of limited resources, and improving service quality. In addition, by determining the first discard condition for the first PDU set to determine whether at least part of the PDUs in the second PDU set are discarded, it is beneficial to simplify the processing process, reduce processing delay, and further reduce system complexity. BRIEF DESCRIPTION OF THE DRAWINGS

[0123] By reading the following detailed description of non-limiting embodiments with reference to the accompanying drawings, other features, objects, and advantages of the present invention will become more apparent:

[0124] Figure 1 A flowchart of a wireless communication method according to an embodiment of the present invention is illustrated;

[0125] Figure 2A schematic diagram showing a network architecture according to an embodiment of the present invention is shown;

[0126] Figure 3 A schematic diagram showing an embodiment of a radio protocol architecture of a user plane and a control plane according to an embodiment of the present invention;

[0127] Figure 4 A schematic diagram showing a first communication device and a second communication device according to an embodiment of the present invention is shown;

[0128] Figures 5 to 7 A flow chart showing wireless signal transmission according to an embodiment of the present invention is shown;

[0129] Figure 8 A partial schematic diagram of another wireless signal transmission process according to an embodiment of the present invention is illustrated;

[0130] Fig. 9 A partial schematic diagram of another wireless signal transmission process according to an embodiment of the present invention is illustrated;

[0131] Fig.10 A partial schematic diagram of another wireless signal transmission process according to an embodiment of the present invention is illustrated;

[0132] Fig.11 A schematic diagram showing N PDCP SDUs according to an embodiment of the present invention is shown;

[0133] Fig.12 A schematic diagram showing a first PDCP SDU generating at least one second PDCP SDU among N PDCP SDUs according to an embodiment of the present invention;

[0134] Fig.13 A schematic diagram showing the dependence of K on N according to an embodiment of the present invention is shown;

[0135] Fig.14 The following is an example of a device structure block diagram of a first node according to an embodiment of the present invention. DETAILED DESCRIPTION

[0136] The present invention can be applied to NG-RAN (Next Generation Radio Access Networks) systems, LTE systems, 5G systems, and 6G, 7G and other systems that may appear in the future. It can also be applied to CU-DU architecture, but the present invention is not limited to this.

[0137] The technical solution of the embodiment of the present invention can also be applied to machine type communication (MTC), long term evolution-machine (LTE-M), device-to-device (D2D) network, machine-to-machine (M2M) network, Internet of Things (IoT) network or other networks. Among them, the IoT network can include, for example, the Internet of Vehicles. Among them, the communication methods in the Internet of Vehicles system are collectively referred to as vehicle to other devices (vehicle to X, V2X, X can represent anything), for example, the V2X can include: vehicle to vehicle (V2V) communication, vehicle to infrastructure (V2I) communication, vehicle to pedestrian (V2P) communication or vehicle to network (V2N) communication, etc.

[0138] To facilitate understanding of the embodiments of the present invention, the terms involved in the present invention are briefly described.

[0139] 1. Extended Reality

[0140] XR can be a term for different types of reality. For example, XR can refer to all real and virtual combined environments and human-computer interactions generated by computer technology and wearable devices. XR business may include but is not limited to the following areas: augmented reality (AR), mixed reality (MR), virtual reality (VR).

[0141] XR can include cloud gaming (CG). In order to enhance the experience of human interaction with the virtual world, XR services have strict requirements on bandwidth and latency. For example, during uplink transmission, the XR terminal can capture images through the built-in camera and continuously upload images of the current scene to the server at a specific frequency (for example, 60Hz or 120Hz, etc.). During downlink transmission, the server's encoder generates data content at a fixed frequency (for example, 60Hz or 120Hz, etc.) and transmits it to the XR terminal via the core network and RAN.

[0142] In a specific implementation, the air interface transmission delay budget of a video frame may refer to the total time from when a base station receives data of a frame of image from a user plane function (User Plane Function) to when a frame of image is successfully sent from the base station to the UE.

[0143] 2. Data to be transmitted (PDU to be transmitted)

[0144] The data to be transmitted can be divided into urgent data and non-urgent data. The data to be transmitted can be understood as data that the terminal expects the network to allocate transmission resources. Urgent data can be data with a small remaining time (remaining time), which can be understood as data that expects the network to allocate transmission resources as soon as possible; non-urgent data can be services with low or no latency requirements (for example: non-XR services) or data with a large remaining time. The data to be transmitted can also be divided into important data and low importance data. It should be noted that the data to be transmitted can be replaced by the PDU to be transmitted. In this specification, the data to be transmitted can refer to the PDU to be transmitted.

[0145] When the network performs resource scheduling, it can give priority to allocating transmission resources to urgent data. During data transmission, if the data has no information about the remaining time, it can be considered that the data is non-urgent data; on the contrary, if the data has a remaining time and the remaining time is very small, it can be considered that the data is urgent data.

[0146] 3. Remaining time

[0147] The remaining time may include any one or more of the following: remaining delay, remaining packet delay budget (PDB), remaining PDU set delay budget (PSDB), time / duration to expiration, time / duration to being discarded, time / duration to timeout of discard timer. For example, the expiration time may also be a deadline. For example, the expiration time may be understood as the time when the data becomes invalid, or as the time when the access stratum (AS) of the terminal starts calculating the remaining time corresponding to the data after acquiring the data, or as the time when the remaining time corresponding to the data is determined.

[0148] The remaining time corresponding to the data may include or be replaced by: the minimum, maximum or average remaining time in the remaining time corresponding to the data; or, information about the remaining time corresponding to the data; or, the minimum, maximum or average remaining time corresponding to the information about the remaining time corresponding to the data; or, the minimum, maximum or average remaining time indicated by the information about the remaining time corresponding to the data.

[0149] 4. Other concepts

[0150] The embodiments of the present invention are applicable to NR systems and also to NR evolution systems, such as 6G network systems.

[0151] In the embodiment of the present invention, the network refers to a network-side device or a network-side system. It may also refer to a service cell or a service base station of a terminal. The service cell refers to a cell where a terminal (such as a UE) resides. Taking the UE as an example, the process of the UE performing a cell search mainly includes the UE searching for a suitable cell of the selected PLMN (Public Land Mobile Network) or SNPN (Stand-alone Non-Public Network), selecting the suitable cell to provide available services, monitoring the control channel of the suitable cell, and then completing the UE's residency in the suitable cell. In other words, a cell that is resided on is the service cell of the UE relative to the UE. Staying in a cell in RRC idle state or RRC inactive state has the following benefits: it enables the UE to receive system messages from the PLMN or SNPN; after completing the cell registration, if the UE wishes to establish an RRC connection or continue a suspended RRC connection, the UE can do so by performing initial access on the control channel of the cell where it is staying; the network can page the UE; and it enables the UE to receive ETWS (Earthquake and Tsunami Warning System) and CMAS (Commercial Mobile Alert System) notifications.

[0152] As an embodiment, for a UE in an RRC connected state that is not configured with carrier aggregation / dual connectivity (CA / DC), there is only one service cell including a primary cell (PrimaryCell). For a UE in an RRC connected state that is configured with CA / DC, the service cell is used to indicate a set of cells including a special cell (SpCell) and all cells from the secondary cell. The main cell is the MCG (Master Cell Group) cell, which operates on the main frequency, and the frequency at which the secondary cell (SCell) operates is the secondary frequency. The UE performs an initial connection establishment process or initiates connection reconstruction on the primary cell. For dual connection operations, the special cell refers to the PCell of the MCG (or the PSCell (Primary SCG Cell, main SCG cell) of the SCG (Secondary Cell Group); if it is not a dual connection operation, the special cell refers to the PCell.

[0153] As an embodiment, the lower layer when the RRC sublayer performs operations includes at least one of the physical layer, the MAC sublayer, the RLC sublayer, and the PDCP sublayer.

[0154] As an embodiment, the higher layer when the RRC sublayer performs an operation includes a non-access stratum.

[0155] As an embodiment, the higher layer signaling includes RRC signaling or non-access stratum signaling.

[0156] The technical solution of the present invention will be further described in detail below in conjunction with the accompanying drawings. It should be noted that the embodiments of the present invention and the features in the embodiments can be arbitrarily combined with each other without conflict.

[0157] Example 1

[0158] Embodiment 1 illustrates a flow chart of a wireless communication method according to an embodiment of the present invention, as shown in the attached figure. Figure 1 Attached Figure 1 In the figure, each box represents a step. It should be emphasized that the order of the boxes in the figure does not represent the temporal relationship between the steps represented.

[0159] In embodiment 1, the wireless communication method may be performed at a first node 100. The first node 100 includes but is not limited to various terminal devices (referred to as terminals for short). The first node may be a UE. The first node 100 is in the service range of a network (eg, a serving cell).

[0160] As an embodiment, the first node is a terminal.

[0161] As an embodiment, the first node 100 is only configured with MCG.

[0162] As an example, individual contents of an information element are referred to as fields.

[0163] As an embodiment, MR-DC (Multi-Radio Dual Connectivity) refers to dual connectivity between E-UTRA and NR nodes, or dual connectivity between two NR nodes.

[0164] As an embodiment, in MR-DC, the wireless access node that provides the control plane connection to the core network is the master node, which may be a master eNB, a master ng-eNB, or a master gNB.

[0165] As an embodiment, MCG refers to a group of service cells associated with a master node in MR-DC, including SpCells, and may also, optionally, include one or more SCells.

[0166] As an embodiment, PCell is the SpCell of MCG.

[0167] As an embodiment, the PSCell is the SpCell of the SCG.

[0168] As an embodiment, in MR-DC, the control plane connection to the core network is not provided, and the radio access node that provides additional resources to the UE is a slave node. The slave node can be an en-gNB, a slave ng-eNB or a slave gNB.

[0169] As an embodiment, in MR-DC, a group of service cells associated with a slave node is a SCG (secondary cell group), including a SpCell and, optionally, one or more SCells.

[0170] As an embodiment, the SpCell is a PCell or the SpCell is a PSCell.

[0171] As an embodiment, in the RRC inactive state, DC is not used.

[0172] As an example, in the RRC inactive state, CA is typically not used.

[0173] As an embodiment, the RRC information block refers to an information block (information element) in an RRC message.

[0174] As an embodiment, SSB may be referred to as SS\PBCH, or SS block.

[0175] As an embodiment, L1 is layer 1 (Layer-1) or physical layer.

[0176] As an embodiment, L2 is layer 2 (Layer-2).

[0177] As an embodiment, one RRC information block may include one or more RRC information blocks.

[0178] As an embodiment, an RRC information block may not include any RRC information block, but only include at least one parameter.

[0179] As an embodiment, the radio bearer includes at least a signaling radio bearer and a data radio bearer.

[0180] As an embodiment, a radio bearer is a service or an interface of a service provided by the PDCP sublayer to a higher layer.

[0181] As a sub-embodiment of this embodiment, the higher layer includes one of the RRC sublayer, NAS, and SDAP layer.

[0182] As an embodiment, the signaling radio bearer is a service or an interface of services provided by PDCP to a higher layer.

[0183] As a sub-embodiment of this embodiment, the higher layer includes an RRC sublayer, at least the former in NAS.

[0184] As an embodiment, the data radio bearer is a service or an interface of services provided by PDCP to a higher layer.

[0185] As a sub-embodiment of this embodiment, the higher layer includes the SDAP layer, at least the former in NAS.

[0186] As an embodiment, the RLC bearer is a service or service interface provided by the RLC sublayer to the PDCP sublayer.

[0187] As an embodiment, after the first node establishes an RRC connection with the network, the first node enters an RRC connection state.

[0188] As a sub-embodiment of this embodiment, the network is a Radio Access Network (RAN).

[0189] As an embodiment, when the first node does not establish an RRC connection with the network, the first node is in an RRC idle state.

[0190] As a sub-embodiment of this embodiment, the network is a Radio Access Network (RAN).

[0191] As an embodiment, when the RRC connection established between the first node and the network is suspended, the first node enters an RRC inactive state.

[0192] As a sub-embodiment of this embodiment, the network is a Radio Access Network (RAN).

[0193] As an embodiment, different functions are supported in different RRC states.

[0194] As an embodiment, only very limited functions are supported in the non-RRC connected state.

[0195] As an embodiment, the non-RRC connected state is or includes an RRC idle state.

[0196] As an embodiment, the non-RRC connected state is or includes an RRC inactive state.

[0197] As an embodiment, the first node 100 is not in limited service mode.

[0198] As an embodiment, the present invention is directed to low-latency or ultra-low-latency transmission.

[0199] As an embodiment, the present invention is directed to XR services.

[0200] As an embodiment, the present invention is directed to low-delay interactive services.

[0201] In one embodiment, the data sent and received by the first node 100 may include XR data, and the XR data may refer to data related to an XR service. The transmission delay requirement of XR data and XR services is relatively high.

[0202] In one embodiment, XR video services may use group of picture coding and / or slice coding.

[0203] Specifically, in step S101, it is determined whether a first discard condition for a first PDU set is met;

[0204] In step S102, based on satisfying the first discard condition, discard the first PDU set, transmit at least a portion of the remaining PDUs, and discard the second PDU set, transmit at least a portion of the remaining PDUs;

[0205] Any PDU in the second PDU set is generated based on the PDU in the first PDU set.

[0206] In a specific implementation, the access stratum (AS) layer of the first node 100 may obtain a new data burst or a PDU set, wherein the access stratum may include multiple protocol layers.

[0207] As an embodiment, the access layer security of the first node 100 is activated.

[0208] As an embodiment, the parameters involved in the embodiment of the present invention may be configured by the network, or may be generated by the first node 100 according to an internal algorithm, such as randomly, or may be default or acquiescent.

[0209] In an embodiment, a data burst may be a group of PDUs generated and sent by a service at the application layer in a short period of time.

[0210] In one embodiment, a data burst may include one PDU set or multiple PDU sets. For example, a group of PDUs generated and sent by an application in a short time may be one PDU set or a group of PDU sets generated and sent by an application in a short time.

[0211] In one embodiment, the PDU set may include one or more PDUs carried on a payload of an information unit generated at the application level.

[0212] In one embodiment, the PDU set consists of one or more PDUs carrying a payload of an information unit generated by the application layer, such as a frame or video slice of an XR and media (XRM) service.

[0213] In one embodiment, the PDU set may be data such as a media frame, a media slice, or a media tile.

[0214] In one embodiment, the PDU set may include a frame or a slice. For example, a PDU set includes a frame or a slice.

[0215] In one embodiment, the application layer of the first node 100 needs all PDUs in the PDU set to use the corresponding information unit. In another embodiment, the application layer of the first node 100 needs all PDUs in the PDU set to decode the corresponding information unit, or the application layer needs all PDUs in the PDU set to use the corresponding information unit.

[0216] As an example, in some applications, data of a PDU set need to be decoded together to be meaningful.

[0217] As a sub-embodiment of this embodiment, the PDU in a PDU set is a PDU of the application layer or a PDU of other protocol layers that carries application layer information.

[0218] As a sub-embodiment of this embodiment, a PDU set consists of one or more PDUs carrying a payload of a unit of information generated by the application layer.

[0219] As a sub-embodiment of this embodiment, any PDU in a PDU set includes an identity or index for identifying the PDU set.

[0220] As an embodiment, N PDCP SDUs belong to or constitute a PDU set.

[0221] In one embodiment, when some PDUs are lost, the application layer of the first node 100 can still recover all or part of the information units.

[0222] In one embodiment, a PDU set may be associated with other PDU sets, and other PDU sets may depend on the PDU set. If the latter is discarded, the former may not be decoded.

[0223] For example, a PDU set is PDU Set 1, which may be associated with one or more other PDU sets, and the other one or more PDU sets are dependent on PDU Set 1. If PDU Set 1 is discarded, the other one or more PDU sets may not be decoded.

[0224] As an embodiment, if a part of the PDUs in the PDU set is not successfully received, the receiving end can still decode the corresponding image. That is, even if the receiving end only receives a part of the PDUs in the PDU set, the receiving end can still decode the corresponding image, but the image quality is slightly worse.

[0225] In some embodiments, the network side device (base station) may configure a discard timer for the first node 100, and the first node 100 may use an information element (IE) of "discard timer". The IE indicates the value of the discard timer of the PDU set corresponding to the data radio bearer (DRB).

[0226] For example, the PDCP entity of the first node 100 may set a discard timer corresponding to a PDU set and start the discard timer when a PDU belonging to the PDU set is first or last received from an upper layer of the first node 100. The first node 100 may discard the set PDU when the discard timer expires.

[0227] During specific implementation, the discard timer may be discardTimer and / or discardTimerForLowImportance.

[0228] In step S101, the first node 100 may determine whether a first discard condition for a first PDU set is satisfied. In specific implementation, the first node 100 generates one or more PDU sets. Each PDU set may include one or more PDUs.

[0229] As a non-limiting embodiment, the first node 100 generates a first PDU set and a second PDU set, wherein the second PDU set is generated based on the first PDU set.

[0230] In one implementation, any PDU in the second PDU set is generated based on a PDU in the first PDU set.

[0231] For example, each PDU in the second PDU set is generated by a corresponding PDU in the first PDU set. The PDUs in the two PDU sets have a one-to-one mapping relationship. At this time, the number of PDUs in the second PDU set is equal to the number of PDUs in the first PDU set.

[0232] For another example, each PDU in the second PDU set is generated based on one or more PDUs in the first PDU set. The PDUs in the two PDU sets have a one-to-one or one-to-many mapping relationship. At this time, the number of PDUs in the second PDU set may be less than the number of PDUs in the first PDU set.

[0233] For another example, each PDU in the second PDU set is generated based on multiple PDUs in the first PDU set. The mapping relationship between the PDUs in the two PDU sets can be relatively complex, rather than a one-to-one or one-to-many mapping relationship. At this time, the number of PDUs in the second PDU set can be much smaller than the number of PDUs in the first PDU set.

[0234] In one embodiment, each PDU in the first PDU set is source data, for example, a source PDU.

[0235] In one embodiment, each PDU in the second PDU set is repair data, for example, a repair PDU (source PDU).

[0236] In a specific implementation, the first node 100 has a first discard condition. The first discard condition may be configured by the network, or may be generated by the first node 100, or may be defaulted or acquiescent. The first discard condition may be a criterion for determining whether a PDU in the first PDU set is discarded.

[0237] In step S102, based on satisfying the first discarding condition, the first node 100 may discard the first PDU set, transmit at least a portion of the remaining PDUs, and discard the second PDU set, and transmit at least a portion of the remaining PDUs.

[0238] In a specific implementation, when the first node 100 determines in step S101 that the first discarding condition is satisfied, the first node 100 may discard the remaining PDUs in the first PDU set that have not been fully transmitted.

[0239] For example, the first node 100 may discard a portion of the remaining PDUs for transmission, or may discard all of the remaining PDUs for transmission. Further, the first node 100 may also discard the PDUs in the second PDU set. For example, the first node 100 may also discard a portion of the PDUs in the second PDU set, or the first node 100 may also discard all of the PDUs in the second PDU set.

[0240] As an embodiment, the N PDCP SDUs belong to the same PDU set, and the PDCP sublayer of the first node indicates the K to the MAC sublayer.

[0241] As an embodiment, K is fixed.

[0242] As an embodiment, the K is for the PDU set of the N PDCP SDUs.

[0243] As an embodiment, the K is determined by the QoS parameters of the services carried by the N PDCP SDUs.

[0244] As an embodiment, the N PDCP SDUs include at least one non-delay-critical PDCP SDU.

[0245] As an embodiment, the delay-critical PDCP SDU is a PDCP SDU in which the remaining time of a first timer associated with the PDCP SDU is less than a certain threshold.

[0246] As a sub-embodiment of this embodiment, the first timer is a discardTimer.

[0247] As an embodiment, the delay-critical PDCP SDU is a PDCP PDU in the first PDU set, and the first PDU set includes a PDCP SDU whose remaining time of an associated first timer is less than a certain threshold.

[0248] As a sub-embodiment of this embodiment, the first timer in this embodiment is discardTimerForLowImportance.

[0249] As a sub-embodiment of this embodiment, when the remaining time of a first timer associated with any PDU in the first PDU set is less than a certain threshold, all PDUs in the first PDU set are delay-critical PDCP PDUs.

[0250] As a sub-embodiment of this embodiment, when the remaining time of a first timer associated with any PDU in the first PDU set is less than a certain threshold, all the PDUs in the first PDU set that have not been transmitted are delay-critical PDCP PDUs.

[0251] As a sub-embodiment of this embodiment, the PDUs included in the first PDU set are all PDCP SDUs.

[0252] As an embodiment, the N PDCP SDUs include at least one delay-critical PDCP SDU.

[0253] As an embodiment, the second PDCP set includes K non-delay urgent PDCP SDUs.

[0254] In one embodiment, non-delay critical PDCP SDUs are supported to be associated with DSR.

[0255] Example 2

[0256] Embodiment 2 illustrates a schematic diagram of a network architecture according to the present invention, as shown in the attached Figure 2 shown.

[0257] Attached Figure 2The network architecture diagram of 5G NR, LTE (Long-Term Evolution) and LTE-A (Long-Term Evolution Advanced) systems is illustrated. The 5G NR or LTE network architecture 200 may be referred to as 5GS (5G System) / EPS (Evolved Packet System) 200 or some other suitable terminology. 5GS / EPS 200 may include one or more UEs (User Equipment) 201, NG-RAN (Next Generation Radio Access Network) 202, 5GC (5G Core Network) / EPC (Evolved Packet Core) 210, HSS (Home Subscriber Server) / UDM (Unified Data Management) 220 and Internet service 230. 5GS / EPS may be interconnected with other access networks, but these entities / interfaces are not shown for simplicity. Figure 2As shown, 5GS / EPS200 provides packet switching services, however, those skilled in the art will readily appreciate that the various concepts presented throughout the present invention can be extended to networks providing circuit switching services or other cellular networks. NG-RAN includes NR Node B (gNB) 203 and other gNBs 204. gNB 203 provides user and control plane protocol terminations toward UE 201. gNB 203 can be connected to other gNBs 204 via an Xn interface (e.g., backhaul). gNB 203 may also be referred to as a base station, a base transceiver station, a radio base station, a radio transceiver, a transceiver function, a basic service set (BSS), an extended service set (ESS), a TRP (transmitting receiving node), or some other suitable term. gNB 203 provides an access point to 5GC / EPC 210 for UE 201. Examples of UE 201 include cellular phones, smart phones, session initiation protocol (SIP) phones, laptop computers, personal digital assistants (PDAs), satellite radios, non-terrestrial base station communications, satellite mobile communications, global positioning systems, multimedia, video, digital audio players (e.g., MP3 players), cameras, game consoles, drones, aircraft, narrowband Internet of Things devices, machine type communication devices, land vehicles, cars, wearable devices, or any other similar functionality. Those skilled in the art may also refer to UE 201 as a mobile station, a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a mobile, a wireless, a wireless communication, a remote, a mobile subscriber station, an access terminal, a mobile terminal, a wireless terminal, a remote terminal, a handset, a user agent, a mobile client, a client, or some other suitable term. gNB203 is connected to 5GC / EPC210 via S1 / NG interface. 5GC / EPC210 includes MME (Mobility Management Entity) / AMF (Authentication Management Field) / SMF (Session Management Function) 211, other MME / AMF / SMF214, S-GW (Service Gateway) / UPF (User Plane Function) 212 and P-GW (Packet Data Network Gateway) / UPF213. MME / AMF / SMF211 is a control node that handles signaling between UE201 and 5GC / EPC210. ​​Generally, MME / AMF / SMF211 provides bearer and connection management.All user IP (Internet Protocol) packets are transmitted through S-GW / UPF212, which is itself connected to P-GW / UPF213. P-GW provides UE IP address allocation and other functions. P-GW / UPF213 is connected to Internet service 230. Internet service 230 includes operator-corresponding Internet protocol services, which may specifically include Internet, intranet, IMS (IP Multimedia Subsystem) and packet-switched streaming services.

[0258] As an embodiment, the first node in the present invention may be a terminal, such as UE201.

[0259] As an embodiment, the second node in the present invention may be a base station, for example, gNB203.

[0260] As an embodiment, the wireless link from the UE201 to the NR Node B is an uplink.

[0261] As an embodiment, the wireless link from the NR Node B to UE201 is a downlink.

[0262] As an embodiment, the UE 201 may be a mobile phone.

[0263] As an embodiment, the UE201 is a user equipment.

[0264] As an embodiment, the UE 201 is an Internet of Things device.

[0265] As an embodiment, the UE 201 is an aircraft.

[0266] As an embodiment, the UE 201 is a vehicle.

[0267] As an embodiment, the UE201 is a dedicated device or special device with communication function.

[0268] As an embodiment, the gNB203 is a micro cell base station.

[0269] The terminal in the embodiment of the present invention may be a mobile phone, a tablet computer, a computer with wireless transceiver function, an XR terminal, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a mixed reality (MR) terminal, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, 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, a cellular 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 function, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal in a 5G network or a terminal in a future evolution network, etc.

[0270] Example 3

[0271] Embodiment 3 shows a schematic diagram of an embodiment of a wireless protocol architecture of a user plane and a control plane according to the present invention, as shown in the attached figure. Figure 3 shown. Figure 3 is a schematic diagram illustrating an embodiment of a radio protocol architecture for a user plane 350 and a control plane 300, Figure 3The radio protocol architecture of the control plane 300 for a first node (UE, gNB) and a second node (gNB, UE), or between two UEs is shown in three layers: Layer 1 (L1 layer), Layer 2 (L2 layer), and Layer 3. The L1 layer is the lowest layer and implements various PHY (physical layer) signal processing functions. The L1 layer will be referred to as PHY301 herein. The L2 layer 305 is above PHY301 and is responsible for the link between the first node and the second node and the two UEs through PHY301. The L2 layer 305 includes a MAC (Medium Access Control) sublayer 302, a Radio Link Layer Control Protocol (Radio Link Control, RLC) sublayer 303, and a Packet Data Convergence Protocol (Packet Data Convergence Protocol, PDCP) sublayer 304, which terminate at the second node. The PDCP sublayer 304 provides multiplexing between different radio bearers and logical channels. The PDCP sublayer 304 also provides security by encrypting data packets, and provides support for inter-zone mobility of the first node between the second node. The RLC sublayer 303 provides segmentation and reassembly of upper layer data packets, retransmission of lost data packets, and reordering of data packets to compensate for out-of-order reception due to HARQ. The MAC sublayer 302 provides multiplexing between logical and transport channels. The MAC sublayer 302 is also responsible for allocating various radio resources (e.g., resource blocks) in a cell between the first nodes. The MAC sublayer 302 is also responsible for HARQ operations. The RRC (Radio Resource Control) sublayer 306 in the L3 layer in the control plane 300 is responsible for obtaining radio resources (i.e., radio bearers) and configuring the lower layer using RRC signaling between the second node and the first node. The PC5-S (PC5 Signaling Protocol) sublayer 307 is responsible for processing the signaling protocol of the PC5 interface. The radio protocol architecture of the user plane 350 includes Layer 1 (L1 layer) and Layer 2 (L2 layer). The radio protocol architecture for the first node and the second node in the user plane 350 is substantially the same as the corresponding layers and sublayers in the control plane 300 for the physical layer 351, the PDCP sublayer 354 in the L2 layer 355, the RLC sublayer 353 in the L2 layer 355, and the MAC sublayer 352 in the L2 layer 355, but the PDCP sublayer 354 also provides header compression for upper layer data packets to reduce radio transmission overhead.The L2 layer 355 in the user plane 350 also includes an SDAP (Service Data Adaptation Protocol) sublayer 356, which is responsible for mapping between QoS flows and data radio bearers (DRBs) to support the diversity of services. SRB can be regarded as a service or interface provided by the PDCP sublayer to a higher layer, such as the RRC sublayer. In the NR system, SRBs include SRB1, SRB2, and SRB3, which are used to transmit different types of control signaling. SRB is a bearer between the UE and the access network, and is used to transmit control signaling including RRC signaling between the UE and the access network. SRB1 has special significance for the UE. After each UE establishes an RRC connection, there will be SRB1 for transmitting RRC signaling. Most of the signaling is transmitted through SRB1. If SRB1 is interrupted or cannot be used, the UE must perform RRC reconstruction. SRB2 is generally only used to transmit NAS signaling or security-related signaling. The UE may not configure SRB3. Except for emergency services, the UE must establish an RRC connection with the network for subsequent communications. Although not shown, the first node may have several upper layers above the L2 layer 355. In addition, it also includes a network layer (e.g., IP layer) terminated at the P-GW on the network side and an application layer terminated at the other end of the connection (e.g., remote UE, server, etc.). The protocol layer may also be referred to as a protocol sublayer. Attached. Figure 3 What is shown is a general protocol layer structure, and the node used in the present invention may lack some protocol layers.

[0272] As an example, Figure 3 The wireless protocol architecture in is applicable to the terminal in the present invention.

[0273] As an example, Figure 3 The wireless protocol architecture in is applicable to the base station in the present invention.

[0274] As an embodiment, the first PDU set and the second PDU set in the present invention are generated in SDAP356.

[0275] Example 4

[0276] Embodiment 4 shows a schematic diagram of a first communication device (such as a first node) and a second communication device (such as a second node) according to an embodiment of the present invention, as shown in the attached figure. Figure 4 shown. Figure 4 is a block diagram of a first communication device 450 and a second communication device 410 communicating with each other in an access network.

[0277] The first communication device 450 includes a controller / processor 459, a memory 460, a data source 467, a transmit processor 468, a receive processor 456, and may optionally also include a multi-antenna transmit processor 457, a multi-antenna receive processor 458, a transmitter / receiver 454 and an antenna 452.

[0278] The second communication device 410 includes a controller / processor 475 , a memory 476 , a receiving processor 470 , a transmitting processor 416 , and may optionally also include a multi-antenna receiving processor 472 , a multi-antenna transmitting processor 471 , a transmitter / receiver 418 and an antenna 420 .

[0279] In the transmission from the second communication device 410 to the first communication device 450, at the second communication device 410, the upper layer data packets from the core network are provided to the controller / processor 475. The controller / processor 475 implements the functionality of the L2 (Layer-2) layer. In the transmission from the second communication device 410 to the first communication device 450, the controller / processor 475 provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and radio resource allocation to the first communication device 450 based on various priority metrics. The controller / processor 475 is also responsible for the retransmission of lost packets and signaling to the first communication device 450. The transmit processor 416 and the multi-antenna transmit processor 471 implement various signal processing functions for the L1 layer (i.e., the physical layer). The transmit processor 416 implements coding and interleaving to facilitate forward error correction (FEC) at the second communication device 410, as well as mapping of signal constellations based on various modulation schemes (e.g., binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), M-phase shift keying (M-PSK), M-quadrature amplitude modulation (M-QAM)). The multi-antenna transmit processor 471 performs digital spatial precoding, including codebook-based precoding and non-codebook-based precoding, and beamforming processing on the coded and modulated symbols to generate one or more spatial streams. The transmit processor 416 then maps each spatial stream to a subcarrier, multiplexes it with a reference signal (e.g., a pilot) in the time domain and / or frequency domain, and then uses an inverse fast Fourier transform (IFFT) to generate a physical channel carrying a time-domain multi-carrier symbol stream. The multi-antenna transmit processor 471 then performs a transmit analog precoding / beamforming operation on the time-domain multi-carrier symbol stream. Each transmitter 418 converts the baseband multi-carrier symbol stream provided by the multi-antenna transmit processor 471 into a radio frequency stream, and then provides it to a different antenna 420.

[0280] In the transmission from the second communication device 410 to the first communication device 450, at the first communication device 450, each receiver 454 receives a signal through its corresponding antenna 452. Each receiver 454 recovers the information modulated onto the RF carrier and converts the RF stream into a baseband multi-carrier symbol stream and provides it to the receiving processor 456. The receiving processor 456 and the multi-antenna receiving processor 458 implement various signal processing functions of the L1 layer. The multi-antenna receiving processor 458 performs a receiving analog precoding / beamforming operation on the baseband multi-carrier symbol stream from the receiver 454. The receiving processor 456 uses a fast Fourier transform (FFT) to convert the baseband multi-carrier symbol stream after the receiving analog precoding / beamforming operation from the time domain to the frequency domain. In the frequency domain, the physical layer data signal and the reference signal are demultiplexed by the receiving processor 456, wherein the reference signal will be used for channel estimation, and the data signal is recovered after multi-antenna detection in the multi-antenna receiving processor 458 to any spatial stream destined for the first communication device 450. The symbols on each spatial stream are demodulated and recovered in the receiving processor 456, and soft decisions are generated. The receiving processor 456 then decodes and deinterleaves the soft decisions to recover the upper layer data and control signals transmitted by the second communication device 410 on the physical channel. The upper layer data and control signals are then provided to the controller / processor 459. The controller / processor 459 implements the functions of the L2 layer. The controller / processor 459 may be associated with a memory 460 that stores program codes and data. The memory 460 may be referred to as a computer-readable medium. In the transmission from the second communication device 410 to the second communication device 450, the controller / processor 459 provides multiplexing between transport and logical channels, packet reassembly, decryption, header decompression, and control signal processing to recover the upper layer data packets from the core network. The upper layer data packets are then provided to all protocol layers above the L2 layer. Various control signals may also be provided to L3 for L3 processing.

[0281] In the transmission from the first communication device 450 to the second communication device 410, at the first communication device 450, a data source 467 is used to provide upper layer data packets to the controller / processor 459. The data source 467 represents all protocol layers above the L2 layer. Similar to the transmission function at the second communication device 410 described in the transmission from the second communication device 410 to the first communication device 450, the controller / processor 459 implements header compression, encryption, packet segmentation and reordering, and multiplexing between logical and transport channels based on radio resource allocation, and implements L2 layer functions for user plane and control plane. The controller / processor 459 is also responsible for the retransmission of lost packets and signaling to the second communication device 410. The transmit processor 468 performs modulation mapping and channel coding processing, and the multi-antenna transmit processor 457 performs digital multi-antenna spatial precoding, including codebook-based precoding and non-codebook-based precoding, and beamforming processing. Then, the transmit processor 468 modulates the generated spatial stream into a multi-carrier / single-carrier symbol stream, which is then provided to different antennas 452 via the transmitter 454 after analog precoding / beamforming operations in the multi-antenna transmit processor 457. Each transmitter 454 first converts the baseband symbol stream provided by the multi-antenna transmit processor 457 into a radio frequency symbol stream, and then provides it to the antenna 452.

[0282] In the transmission from the first communication device 450 to the second communication device 410, the function at the second communication device 410 is similar to the reception function at the first communication device 450 described in the transmission from the second communication device 410 to the first communication device 450. Each receiver 418 receives a radio frequency signal through its corresponding antenna 420, converts the received radio frequency signal into a baseband signal, and provides the baseband signal to the multi-antenna reception processor 472 and the reception processor 470. The reception processor 470 and the multi-antenna reception processor 472 jointly implement the functions of the L1 layer. The controller / processor 475 implements the L2 layer functions. The controller / processor 475 can be associated with a memory 476 storing program codes and data. The memory 476 can be referred to as a computer-readable medium. In the transmission from the first communication device 450 to the second communication device 410, the controller / processor 475 provides multiplexing between transport and logical channels, packet reassembly, decryption, header decompression, control signal processing to recover the upper layer data packets from the UE 450. Upper layer packets from controller / processor 475 may be provided to the core network.

[0283] As an embodiment, the first communication device 450 includes: at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code are configured to be used together with the at least one processor, and the first communication device 450 at least: determines whether a first discarding condition for a first PDU set is met; based on meeting the first discarding condition, discards the first PDU set, transmits at least a portion of the remaining PDUs, and discards the second PDU set, transmits at least a portion of the remaining PDUs; wherein any PDU in the second PDU set is generated based on a PDU in the first PDU set.

[0284] As an embodiment, the first communication device 450 includes: a memory storing a computer-readable instruction program, wherein the computer-readable instruction program generates actions when executed by at least one processor, and the actions include: determining whether a first discarding condition for a first PDU set is met; based on meeting the first discarding condition, discarding the first PDU set, transmitting at least a portion of the remaining PDUs, and discarding the second PDU set, transmitting at least a portion of the remaining PDUs; wherein any PDU in the second PDU set is generated based on a PDU in the first PDU set.

[0285] As an embodiment, the first communication device 450 corresponds to the first node in the present invention, that is, the terminal.

[0286] As an embodiment, the second communication device 410 corresponds to the second node in the present invention.

[0287] As an embodiment, the first communication device 450 is a UE.

[0288] As an embodiment, the first communication device 450 is a mobile phone.

[0289] As an embodiment, the second communication device 450 is a relay.

[0290] As an embodiment, the second communication device 410 is a base station.

[0291] As an embodiment, the receiver 454 (including the antenna 452), the receiving processor 456 and the controller / processor 459 are used in the present invention to receive the indication information.

[0292] As an embodiment, the transmitter 454 (including the antenna 452), the transmit processor 468 and the controller / processor 459 are used in the present invention to send the (P+Q1) PDUs.

[0293] Example 5

[0294] Embodiment 5 illustrates a wireless signal transmission flow chart according to an embodiment of the present invention, as shown in the attached figure. Figure 5 Attached Figure 5 In the example, U01 corresponds to the first node, and N02 corresponds to the second node. It should be noted that the order in this example does not limit the signal transmission order and implementation order in the present invention, and the steps in F51 are optional.

[0295] for First node U01 , generate a first PDU set and a second PDU set in step S5101; send the PDUs in the first PDU set and the second PDU set in step S5102; receive indication information in step S5103; determine whether to discard the remaining PDUs in transmission in step S5104; and discard or store the remaining PDUs in transmission based on the determination result in step S5105.

[0296] for Second node N02 , in step S5201, receive the PDUs in the first PDU set and the second PDU set; in step S5202, generate and send indication information.

[0297] In Embodiment 5, the first node U01 may be a terminal, such as a UE. The second node N02 may be a serving base station or a relay node of the first node U01, or may be other UEs, such as a V2X UE or a D2D UE.

[0298] As an embodiment, the second node N02 is a base station corresponding to the PCell of the first node U01.

[0299] In some embodiments, the base station may refer to a CU or a DU, or the base station includes a CU and a DU.

[0300] As an embodiment, the second node N02 is the service cell of the first node or the base station corresponding to the service cell.

[0301] As an embodiment, the second node N02 belongs to a cellular network.

[0302] As an embodiment, the second node N02 corresponds to the source cell.

[0303] Specifically, the first node U01 generates a first PDU set and a second PDU set in step S5101. In some implementations, the first PDU set is a data burst generated by a higher layer, which may include an AS layer, a NAS layer, or an application layer.

[0304] In one embodiment, the AS layer of the first node U01 may obtain the data burst or PDU set from the NAS layer or the application layer.

[0305] In another embodiment, the AS layer of the first node U01 may include a service data adaptation protocol (SDAP) layer or a packet data convergence protocol (PDCP) layer or an RLC layer. At this time, the first node U01 may obtain a data burst or a PDU set from the SDAP layer or the PDCP layer or the RLC layer.

[0306] In one embodiment, the first PDU set includes N first PDUs. Taking the first PDU as a PDCP PDU as an example, the first PDU set includes N first PDUs, which are N PDCP PDUs. Each of the PDCP PDUs is generated from a PDCP SDU. The N PDCP PDUs are generated based on N PDCP SDUs.

[0307] During specific implementation, the N PDCP SDUs belong to the same PDU set.

[0308] During specific implementation, the PDCP entity to which the N PDCP SDUs belong determines, based on protocol headers of the N PDCP SDUs, that the N PDCP SDUs belong to the same PDU set.

[0309] During specific implementation, the PDCP entity to which the N PDCP SDUs belong determines, according to an instruction from a higher layer, that the N PDCP SDUs belong to the same PDU set.

[0310] In one embodiment, the second PDU set is generated based on the first PDU set. Specifically, any PDU in the second PDCP set is generated based on the PDU in the first PDU set.

[0311] In one embodiment, the second PDU set includes X second PDUs, and the value of X may be less than or equal to N. In a typical scenario, the value of X depends on N, and the value of X is less than N, or the value of X is much less than N.

[0312] In another embodiment, the second PDU set includes (X+C) second PDUs, and the value of X may be less than or equal to N. In a typical scenario, the values ​​of X and C depend on N, the value of (X+C) is less than N, or the value of (X+C) is much less than N, and C is a positive integer.

[0313] In one embodiment, if the first node U01 successfully transmits (K+X) PDUs, the second node N02 can correctly decode the first PDU set, where K is the number of first PDUs successfully transmitted in the first PDU set, and X is the number of PDUs successfully transmitted by the first node U01 in the second PDU set.

[0314] In one embodiment, the second PDU set is composed of repair PDUs. Each repair PDU is generated based on one or more source PDUs.

[0315] In a specific implementation, any PDU in the first PDU set is referred to as a first PDU. The second PDU set is composed of a plurality of second PDUs, each of which is a repair PDU and is generated based on the first PDU.

[0316] In one embodiment, the second PDU contains sufficient information to form a source PDU from a series of unmodified source data packets. Taking the receiving end as an example, the receiving end receiving the second PDU is conducive to successfully decoding one or more first PDUs in the first PDU set.

[0317] As an embodiment, for different PDU sets (ie, PDU sets), the corresponding values ​​of N may be different.

[0318] As a sub-embodiment of this embodiment, N is greater than 0.

[0319] As an embodiment, when the cancellation of the first DSR process that has not been completed is performed, at least part of the N PDCP SDUs are not transmitted.

[0320] As an embodiment, the N PDCP SDUs are PDCP SDUs for the at least one logical channel.

[0321] As an embodiment, the N is indicated by a protocol layer above the PDCP sublayer.

[0322] As an embodiment, the N is indicated by a protocol header of a protocol layer above the PDCP sublayer.

[0323] As an embodiment, the protocol headers of the N PDCP SDUs include the same identifier.

[0324] As a sub-embodiment of this embodiment, the identifier is used to identify the N PDCP SDUs.

[0325] As a sub-embodiment of this embodiment, the identifier is used to identify a PDU set.

[0326] As a sub-embodiment of this embodiment, the protocol header is a protocol header of the SDAP sublayer.

[0327] As a sub-embodiment of this embodiment, the protocol header is a protocol header of the NAS layer.

[0328] As a sub-embodiment of this embodiment, the protocol header is a TCP or IP header.

[0329] As a sub-embodiment of this embodiment, the protocol header is an RTP header.

[0330] As a sub-embodiment of this embodiment, the protocol header is a protocol header of the application layer.

[0331] As an embodiment, when the number of PDCP SDUs received by the PDCP sublayer for a PDU set is N.

[0332] As a sub-embodiment of this embodiment, the N is implicitly indicated.

[0333] As an embodiment, the N is explicitly indicated by a higher layer of the PDCP sublayer.

[0334] As an embodiment, the explicit indication includes a fixed configuration.

[0335] As an embodiment, the explicit indication includes QoS parameters.

[0336] As an embodiment, the N is indicated implicitly.

[0337] As an embodiment, at least one of the N or the K is configured or predefined.

[0338] As an embodiment, at least one of the N or the K is configured.

[0339] As an embodiment, at least one of the N or the K is configured, including: the N is configured.

[0340] As an embodiment, at least one of the N or the K is configured, including: the K is configured.

[0341] As an embodiment, at least one of the N or the K is configured, including: the N and the K are configured.

[0342] As an embodiment, the configured includes: configured by the network.

[0343] As an embodiment, the configured includes: configured by the RRC sublayer of the first node.

[0344] As an embodiment, the configured includes: an SDAP sublayer of the first node.

[0345] As an embodiment, the configured includes: configured by a non-access layer of the first node.

[0346] As an embodiment, at least one of the N or the K is predefined.

[0347] As an embodiment, at least one of the N or the K is predefined, including: the N is predefined.

[0348] As an embodiment, at least one of the N or the K is predefined, including: the K is predefined.

[0349] As an embodiment, at least one of the N or the K is predefined, including: the N and the K are predefined.

[0350] As an embodiment, K is predefined and N is configured.

[0351] As an embodiment, the value of N varies with different PDU sets.

[0352] As an embodiment, the K varies with different PDU sets.

[0353] As an embodiment, the ratio of the K to the N varies with different PDU sets, and different performance indicators can be set for different PDU sets.

[0354] As an embodiment, the ratio of K to N remains unchanged with different PDU sets.

[0355] As an embodiment, the above method has the advantage of low complexity.

[0356] As an embodiment, the K is obtained from the N.

[0357] As an embodiment, the K depends on the N.

[0358] As an embodiment, at least one of the N or the K is configured or predefined, or the meaning that the K depends on the N includes: the N is configured and the K depends on the N.

[0359] As an embodiment, the benefits of the above method include: ensuring flexibility while controlling the complexity of implementation.

[0360] As an embodiment, at least one of the N or the K is configured or predefined, or the meaning that the K depends on the N includes: the N is predefined and the K depends on the N.

[0361] As an embodiment, the benefits of the above method include: greatly reducing the complexity of implementation.

[0362] In step S5102, the first node U01 sends the PDUs in the first PDU set and the second PDU set. Correspondingly, the second node N02 receives the PDUs in the first PDU set and the second PDU set in step S5201.

[0363] In one embodiment, in the first PDU set, some data packets are successfully sent, and some data packets are not successfully sent; or, among the data packets in the first PDU set, only some are successfully transmitted to the receiving end, and some data packets cannot be transmitted to the receiving end.

[0364] In one embodiment, a portion of the data packets in the first PDU set and the second PDU set are successfully sent, and a portion of the data packets are not successfully sent, including at least one PDU in the first PDU set that is not successfully sent; or, only a portion of the data packets in the first PDU set and the second PDU set are successfully transmitted to the receiving end, and a portion of the data packets cannot be transmitted to the receiving end, including at least one PDU in the first PDU set that is not successfully transmitted to the receiving end.

[0365] In a non-limiting embodiment, the first node U01 sends (P+Q1) PDUs. The P PDUs are first PDUs from the first PDU set, and the Q1 PDUs are second PDUs from the second PDU set; wherein P and Q1 are both positive integers. The first PDU may be any PDU in the first PDU set, and the second PDU may be any PDU in the second PDU set.

[0366] In a specific implementation, the meaning that the P PDUs are from the first PDU in the first PDU set may include: the P PDUs are generated by the first PDU in the first PDU set.

[0367] In a specific implementation, the meaning that the P PDUs are from the first PDU in the first PDU set may include: the P PDUs are copies of the first PDU in the first PDU set.

[0368] In specific implementation, (P + Q1) < (N + X). Or, (P + Q1) ≤ (K + X).

[0369] In specific implementation, the number of PDUs successfully received by the receiving end is not higher than a first threshold value.

[0370] As an embodiment, the first threshold value is configured by the network; or, the first threshold value is indicated by a higher layer; or, the first threshold value is determined by QoS parameters.

[0371] As an embodiment, the first threshold value depends on the number of PDUs in the second PDU set successfully received by the receiving end.

[0372] As an embodiment, the first threshold value depends on the number of PDUs in the second PDU set successfully received by the receiving end, including: Y < F(X1), where Y is the number of PDUs in the first PDU set successfully received by the receiving end, X1 is the number of PDUs in the first PDU set, F() is a function, and the output of F() is the first threshold value.

[0373] As an embodiment, the F() may include input parameters other than X1.

[0374] As an embodiment, the input parameter other than X1 includes M1, and the M1 is a positive number less than 1.

[0375] As an embodiment, the M1 is configured by the network or determined by the terminal itself.

[0376] As an embodiment, the F() is the product of X1 and M1.

[0377] As an embodiment, the F() is a non - linear function.

[0378] As an embodiment, the F() is defined in the form of a table.

[0379] As an embodiment, F() can be defined as: the product of X1 and a first variable, and the magnitude of the first variable is negatively correlated with the magnitude of X1.

[0380] As an embodiment, the F() can be defined as: when X1 is relatively small, F() is the product of X1 and a first value; when X is relatively large, F() is the product of X1 and another value greater than the first value.

[0381] As an embodiment, the F() may be defined as follows: when X1 is less than 10, the output of F(X) is the product of X1 and 0.9; when X1 is not less than 10, the output of F(X1) is the product of X and 0.8.

[0382] As an embodiment, the input parameters other than X1 include M2, and M2 is the number of PDUs in the second PDU set successfully received by the receiving end.

[0383] As an embodiment, the F() can be defined as: when M2 is not less than 5 and when X1 is less than 10, the output of F(X1) is the product of X1 and 0.9; when X1 is not less than 10, the output of F(X1) is the product of X1 and 0.8.

[0384] As another embodiment, the F() can be defined as: when M2 is less than 5 and when X1 is less than 10, the output of F(X1) is the product of X1 and 0.8; when X1 is not less than 10, the output of F(X1) is the product of X1 and 0.7.

[0385] As yet another embodiment, the first threshold may depend on the number of PDUs in the second PDU set successfully received by the receiving end.

[0386] As an embodiment, the first threshold may depend on the number of PDUs in the second PDU set successfully received by the receiving end, including: the size of the first threshold is negatively correlated with the number of PDUs in the second PDU set successfully received by the receiving end.

[0387] As another embodiment, the number of PDUs successfully sent by the transmitting end may be (for example, (P+Q1) PDUs) less than a second threshold. The second threshold may be preset by the protocol, or default, or tacitly set, or sent in advance by the second node N02 to the first node U01.

[0388] In another embodiment, the second threshold may also be sent by the network to the first node U01.

[0389] In one embodiment, the PDUs in the first PDU set and the second PDU set refer to PDCP PDUs, and each PDCP PDU is generated from a PDCP SDU.

[0390] As an embodiment, assuming that the PDUs in the first PDU set and the second PDU set are all PDCP PDUs or PDCP SDUs, in step S5103, the first node U01 may send all PDCP PDUs or PDCP SDUs in the first PDU set and the second PDU set.

[0391] As an embodiment, assuming that the PDUs in the first PDU set and the second PDU set are both PDCP PDUs or PDCP SDUs, in step S5103, the first node U01 sends part or all of the PDCP PDUs or PDCP SDUs in the first PDU set and the second PDU set in sequence.

[0392] As an embodiment, in step S5103, the first node U01 continues to send the PDCP PDUs in the first PDU set and the second PDU set.

[0393] As an embodiment, the PDCP PDUs in the first PDU set and the second PDU set need to be encapsulated as RLC PDUs during transmission and may undergo segmentation, after which each RLC PDU is encapsulated as a MAC PDU and then transmitted through the physical layer.

[0394] As an embodiment, step S5103 lasts for a period of time.

[0395] As an embodiment, the PDUs in the first PDU set and the second PDU set are sent via an AM (acknowledgement mode) RLC bearer.

[0396] As an embodiment, the first PDU set and the second PDU set are transmitted via AM DRB.

[0397] Accordingly, the second node N02 may only correctly decode some of the PDUs in the first PDU set and the second PDU set received in step S5201. Taking the PDU as a PDCP PDU as an example, the second node N02 may only correctly receive the PDCP SDUs in some of the PDCP PDUs.

[0398] In step S5103, the first node U01 receives the indication information. Specifically, before step S5103, the second node N02 decodes the received PDUs in the first PDU set and the second PDU set in step S5202 after step S5201, and then determines the number of first PDU sets successfully received in the first PDU set. In step S5202, the indication information is generated and sent.

[0399] As an embodiment, in step S5203, the indication information sent by the second node N02 may be confirmation information, such as a HAQK message.

[0400] In one embodiment, the indication information may be used to indicate the number of PDUs in the first PDU set successfully received by the receiving end. For example, the number of first PDUs in the first PDU set successfully received by the receiving end (second node N02) is Y, where Y is a positive integer. Typically, the value of Y is greater than 1.

[0401] As another embodiment, the indication information may be confirmation information of the RLC sublayer.

[0402] As an embodiment, the protocol layer below the PDCP sublayer of the first node U01 indicates the received confirmation information to the PDCP sublayer of the first node.

[0403] As an embodiment, the indication information is confirmation information of the protocol layer below the PDCP sublayer.

[0404] As an embodiment, the indication information is confirmation information of the MAC sublayer.

[0405] As an embodiment, the indication information includes an RLC status report.

[0406] As an embodiment, the indication information includes a PDCP status report.

[0407] As an embodiment, the indication information includes MAC CE of the MAC sublayer.

[0408] As an embodiment, the indication information includes HARQ confirmation information.

[0409] As an embodiment, only the PDCP SDU corresponding to the indication information is determined as the correctly transmitted PDCP SDU.

[0410] As an embodiment, only the PDCP SDU corresponding to the indication information is determined as the transmitted PDCP SDU.

[0411] In the above embodiment, the indication information may also be referred to as confirmation information.

[0412] As an embodiment, the advantage of the above method is that it can save signaling overhead and reduce latency.

[0413] Further, after receiving the indication information, the first node U01 can execute step S5104, i.e., determine whether to discard the remaining PDUs for transmission. The remaining PDUs for transmission include each PDU in the first PDU set and the second PDU set. Specifically, the first node U01 determines whether there is enough remaining time to send the remaining PDUs. If there is enough remaining time, the remaining PDUs can continue to be sent (not shown); otherwise, step S5104 is executed.

[0414] In one embodiment, whether to discard the remaining PDU of the transmission may be determined by determining whether a first discarding condition is met.

[0415] In specific implementation, the first discard condition may include at least one of the following: the number of PDUs successfully received by the receiving end (for example, the second node N02) is not higher than the first threshold; the delay budget range of the PDU to be transmitted (the PDU remaining for transmission) is less than the preset time; and the number of PDUs successfully sent by the sending end (for example, the first node U01) is less than the second threshold.

[0416] In a specific implementation, the first discarding condition is for the first PDU set. The first discarding condition is specially set for determining whether to transmit the remaining first PDU in the first PDU set.

[0417] It should be noted that the first discarding condition is greatly related to the discarding or preservation of the remaining second PDUs in the second PDU centralized transmission. In other words, the discarding or preservation of the remaining second PDUs in the second PDU centralized transmission depends on the first discarding condition.

[0418] Further, in step S5105, the PDU remaining in the transmission is discarded or stored based on the judgment result. Specifically, the first node U01 can obtain the judgment result by using the first discard condition. Alternatively, the first node U01 can obtain the judgment result by using the first discard condition and the second discard condition.

[0419] In one embodiment, if the first discarding condition is met, the first node U01 discards the first PDU set, transmits the remaining one or more data packets, and discards the second PDU set, and transmits the remaining one or more data packets.

[0420] In one embodiment, if the first discarding condition is met, the first node U01 discards the first PDU set, transmits all remaining data packets, and discards the second PDU set, and transmits all remaining data packets.

[0421] In one embodiment, if the first discarding condition is met and the first node U01 has transmitted all the data packets in the first PDU set, the second PDU set is discarded and the remaining one or more data packets are transmitted.

[0422] In one embodiment, the first discard condition is that the delay budget range of the PDU to be transmitted is less than a preset time. If the first node U01 estimates that the delay budget range of the remaining PDUs in the first PDU set is less than the preset time, the first node U01 discards the first PDU set, transmits the remaining one or more data packets, and discards the second PDU set, and transmits the remaining one or more data packets.

[0423] In one embodiment, the first discard condition is that the delay budget range of the PDU to be transmitted is less than the preset time. If all the data packets in the first PDU set are sent, but some of the data packets are not successfully sent. If the first node U01 predicts that it cannot complete the transmission of the remaining data packets in the second PDU set within the delay budget range, the transmission of the remaining one or more data packets is abandoned.

[0424] In one embodiment, if the first node U01 has transmitted some data packets in the second PDU set, but the remaining data packets cannot be transmitted within the transmission delay range, the first node U01 may give up transmitting the remaining one or more data packets.

[0425] In some embodiments, if the first discard condition is met, transmission of some remaining data packets in the first PDU set may be abandoned, and all remaining data packets in the second PDU set may be discarded together.

[0426] In some embodiments, if the first discard condition is met, all remaining data packets of the transmission may be discarded.

[0427] Example 6

[0428] Embodiment 6 illustrates another wireless signal transmission flow chart according to an embodiment of the present invention, as shown in the attached figure. Figure 6 Attached Figure 6 In the example, U01 corresponds to the first node, and N02 corresponds to the second node.

[0429] For the first node U01, a first PDU set and a second PDU set are generated in step S6101; PDUs in the first PDU set and the second PDU set are sent in step S6102; indication information is waited for in step S6103; whether a first discard condition for the first PDU set is met is determined in step S6104; based on meeting the first discard condition, the first PDU set is discarded in step S6105, at least a portion of the remaining PDUs is transmitted, and the second PDU set is discarded, at least a portion of the remaining PDUs is transmitted.

[0430] For the second node N02, in step S6201, PDUs in the first PDU set and the second PDU set are received.

[0431] Similar to Embodiment 5, in Embodiment 6, the first node U01 may be a terminal, such as a UE. The second node N02 may be a serving base station or a relay node of the first node U01, or may be other UEs, such as a V2X UE or a D2D UE.

[0432] As an embodiment, the second node N02 is a base station corresponding to the PCell of the first node U01.

[0433] As an embodiment, the second node N02 is the service cell of the first node or the base station corresponding to the service cell.

[0434] As an embodiment, the second node N02 belongs to a cellular network.

[0435] As an embodiment, the second node N02 corresponds to the source cell.

[0436] Similar to Embodiment 5, step S6101 and step S6102 in Embodiment 6 can refer to step S5101 and step S5102 in Embodiment 5. Afterwards, the first node U01 executes step S6103, that is, waits for the indication information. The meaning of the indication information can refer to the relevant description in Embodiment 5.

[0437] In a specific implementation, the first node U01 executes step S6104 to determine whether the first discard condition for the first PDU set is met. The first discard condition may include at least one of the following: the number of PDUs successfully received by the receiving end (e.g., the second node N02) is not higher than the first threshold; the delay budget range of the PDU to be transmitted (the remaining PDU of the transmission) is less than the preset time; and the number of PDUs successfully sent by the sending end (e.g., the first node U01) is less than the second threshold.

[0438] In step S6105, the first node U01 may discard the first PDU set and transmit at least a portion of the remaining PDUs based on satisfying the first discard condition, and discard the second PDU set and transmit at least a portion of the remaining PDUs.

[0439] In specific implementation, the first discard condition may include one or more of the following: the number of PDUs successfully received by the receiving end is not higher than the first threshold; the delay budget range of the PDU to be transmitted is less than the preset time; the number of PDUs successfully sent by the sending end is less than the second threshold.

[0440] As an example, if the first node U01 does not receive the indication information within a preset time interval, it can be assumed that the second node N02 has successfully received Y first PDUs in the first PDU set, where Y < P and Y is a positive integer. The value of Y can be calculated by various suitable algorithms available to the first node U01.

[0441] In one embodiment, when the first node U01 meets the first discard condition, it discards a part of the PDUs in the first PDU set, transmits the remaining part of the PDUs, and discards a part of the PDUs in the second PDU set, and transmits the remaining part of the PDUs.

[0442] In one embodiment, when the first node U01 meets the first discard condition, it discards a part of the PDUs in the first PDU set, transmits the remaining part of the PDUs, and discards all of the PDUs in the second PDU set, and transmits the remaining part of the PDUs.

[0443] In one embodiment, when the first node U01 meets the first discard condition, it discards all of the PDUs in the first PDU set, transmits the remaining part of the PDUs, and discards all of the PDUs in the second PDU set, and transmits the remaining part of the PDUs.

[0444] Those skilled in the art understand that steps S6101 to S6102, step S6104, and step S6105 can refer to Figure 5 the relevant descriptions of the illustrated embodiments, which will not be elaborated here.

[0445] Example 7

[0446] Embodiment 7 exemplifies another wireless signal transmission flowchart according to an embodiment of the present invention, as shown in the appendix Figure 7 shown. In the appendix Figure 7 , U01 corresponds to the first node, and N02 corresponds to the second node. It should be particularly noted that the order in this example does not limit the signal transmission order and the implementation order in the present invention, and the steps within F71 are optional.

[0447] In this embodiment, steps S7101 - S7104 and step S7201 are similar to steps S6101 - S6104 and step S6201 in Embodiment 6, and can refer to Embodiment 5, Embodiment 6, as well as Figure 5 and Figure 6 .

[0448] In step S7105, based on the judgment result of step S7104, the first node U01 knows that it does not meet the first discard condition. Further, when it does not meet the first discard condition, it judges whether it meets the second discard condition of the second PDU set.

[0449] In one embodiment, the second discard condition may include at least one of the following: the number of PDUs successfully received by the receiving end is not higher than a third threshold; the delay budget range of the PDU to be transmitted is less than a preset time; the number of PDUs successfully sent by the sending end is less than a fourth threshold.

[0450] As an embodiment, the third threshold may be a default, or a default, or a network pre-configuration, or a protocol pre-setting.

[0451] As an embodiment, the fourth threshold may be a default, or a default, or a network pre-configured, or a protocol pre-set.

[0452] In specific implementation, the number of PDUs successfully received by the second node N02 is not higher than the third threshold; or, the number of PDUs successfully sent by the first node U01 is less than the fourth threshold; or, in the second PDU set, the delay budget range for transmitting the remaining PDUs is less than the preset time.

[0453] In a specific implementation, the second discarding condition is for the second PDU set. The second discarding condition is specially set for determining whether to transmit the remaining second PDUs in the second PDU set.

[0454] As an embodiment, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, the PDUs in the first PDU set are not discarded.

[0455] As an embodiment, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, only the PDUs in the second PDU set are discarded.

[0456] Those skilled in the art will appreciate that the remaining steps may refer to Figure 5 , Figure 6 The relevant description of the illustrated embodiment will not be repeated here.

[0457] Example 8A

[0458] Embodiment 8A illustrates another partial schematic diagram of a wireless signal transmission process according to an embodiment of the present invention, as shown in the attached figure. Figure 8 Attached Figure 8 In the example, U01 corresponds to the first node, and N02 corresponds to the second node. It should be noted that the order in this example does not limit the signal transmission order and implementation order in the present invention, and the steps in F81 are optional.

[0459] In this embodiment, even if the first discarding condition is met, all the PDUs of the remaining first PDU set and second PDU set are not immediately discarded.

[0460] In specific implementation, steps S8101 to S8102 may be executed after step S5103 of Example 5, or after step S5105, or in parallel with step S5105.

[0461] In specific implementation, steps S8101 to S8102 may be executed after step S6103 of Example 6, or after step S6104, or in parallel with step S6104.

[0462] In a specific implementation, the first node U01 stores a first PDU in a first PDU set and a second PDU in a second PDU set. The first PDU is a source PDU, and the second PDU may be a repair PDU generated according to the first PDU.

[0463] In specific implementation, the first node U01 may execute step S8101, i.e. determine the value of Q2, and set the value of the PDU set importance (PSI) of at least Q2 of the second PDUs to the value of the PSI of the first PDU set.

[0464] The PDU set importance (PSI) of the first PDU set is higher than the PDU set importance (PSI) of the second PDU set. It should be noted that PSI represents a parameter, which is a parameter used to indicate the importance of a PDU set; Y≤P, and Y, Q2 are positive integers.

[0465] In this embodiment, the importance of the first PDU set is higher than that of the second PDU set. If the value of the parameter PSI is larger, indicating that the importance of the PDU set is higher, then in step S8101, the PSI value of the second PDU set is smaller than the PSI value of the first PDU set; conversely, if the value of the parameter PSI is smaller, indicating that the importance of the PDU set is higher, then in step S8101, the PSI value of the second PDU set is larger than the PSI value of the second PDU set.

[0466] In step S8101, the PSI value of the new PDU set formed by the at least Q2 second PDUs is set to the PSI value of the first PDU set, which increases the importance of the new PDU set formed by the at least Q2 second PDUs and helps to extend the storage time of the at least Q2 PDUs.

[0467] After executing step S8101, the first node U01 will try to avoid discarding the at least Q2 second PDUs, which is conducive to the second node N02 at the receiving end to successfully obtain the first PDU set.

[0468] Afterwards, the first node U01 executes step S8102, i.e., sends the at least Q2 second PDUs from the second PDU set. In combination with other embodiments, when the first node U01 is allowed to send data, the at least Q2 second PDUs from the second PDU set may be sent to the second node N02, so that the second node N02 has a greater possibility of successfully receiving the first PDU set.

[0469] For a detailed description of this embodiment, please refer to Embodiment 1 to Embodiment 7.

[0470] Example 8B

[0471] Embodiment 8B illustrates another partial schematic diagram of a wireless signal transmission process according to an embodiment of the present invention, as shown in the attached figure. Figure 8 shown.

[0472] Embodiment 8B is similar to Embodiment 8A, except that when the first node U01 executes step S8101, it determines the value of Q2, but skips the following step: setting the value of the PDU set importance (PSI) of at least Q2 of the second PDUs to the value of the PSI of the first PDU set. In other words, in Embodiment 8B, in step S8101, after determining the value of Q2, step S8102 is executed to send the at least Q2 of the second PDUs from the second PDU set.

[0473] As a non-limiting embodiment, the Q2 second PDUs may be randomly selected, or selected by the first node U01 based on the correlation with the P first PDU sets that have been issued, or selected based on the sequence number or order number of the PDU in the second PDU set.

[0474] Example 9A

[0475] Embodiment 9A illustrates another partial schematic diagram of a wireless signal transmission process according to an embodiment of the present invention, as shown in the attached figure. Fig. 9 Attached Fig. 9 In the example, U01 corresponds to the first node, and N02 corresponds to the second node. The steps in F91 are optional.

[0476] In this embodiment, step S9101 may be executed after step S5103 of embodiment 5, or after step S5105, or may be executed in parallel with step S5105.

[0477] In a specific implementation, the first node U01 stores a first PDU in a first PDU set and a second PDU in a second PDU set. The first PDU is a source PDU, and the second PDU may be a repair PDU generated according to the first PDU.

[0478] In specific implementation, the first node U01 may execute step S9101, i.e. determine the value of Q2, and send at least Q2 PDUs, where the Q2 PDUs come from the first PDU set and the second PDU set; wherein Y≤P, and Y is a positive integer.

[0479] In one embodiment, the first node U01 may determine Q2 based on an algorithm so that the second node N02 obtains the first PDU set after receiving the at least Q2 PDUs. The Q2 PDUs are from the first PDU set and the second PDU set. The number of PDUs in the first PDU set may be 0.

[0480] In one embodiment, when it is impossible to send out all the remaining PDUs in the first PDU set and the second PDU set, the first node U01 may determine the value of Q2, and the Q2 PDUs may be the second PDUs from the second PDU set.

[0481] In one embodiment, the Q2 second PDUs sent can effectively ensure that the receiving end (the second node N02) successfully decodes and obtains the first PDU set.

[0482] For example, in the case where K is not very large, additional information may be required, that is, the source PDU set (for example, the first PDU set) needs to be correctly transmitted for at least Y PDUs before each PDU in the first PDU set can be successfully decoded after a certain number of repair PDUs (for example, the second PDU in the second PDU set) are obtained.

[0483] In one embodiment, assuming that the second node N02 successfully receives Y first PDUs, or after receiving the indication information fed back by the second node N02 and knowing that it has successfully received Y first PDUs, the first node U01 determines that it needs to continue to send Q2 second PDUs in order for the second node N02 to successfully obtain the first PDU set.

[0484] Example 9B

[0485] Embodiment 9B illustrates another partial schematic diagram of a wireless signal transmission process according to an embodiment of the present invention, as shown in the attached figure. Fig. 9 shown.

[0486] Embodiment 9B is similar to Embodiment 9A, except that after the first node U01 determines the value of Q2 in step S9101, the following steps are performed: Set the PDU set importance (PSI) values of at least Q3 of the second PDUs to the PSI value of the first PDU set. In other words, in Embodiment 9B, a sub-step is added in step S9101, that is, set the PDU set importance of at least Q3 of the second PDUs to the PDU set importance of the first PDU set. Wherein, Q3 < Q2, and Q3 is a positive integer.

[0487] After that, the first node U01 sends at least Q2 PDUs, and the Q2 PDUs come from the first PDU set and the second PDU set; the at least Q2 PDUs include Q3 of the second PDUs.

[0488] In specific implementation, when the first node U01 sends more than Q2 PDUs, the Q2 PDUs come from the first PDU set and the second PDU set; among the more than Q2 PDUs, at least Q3 of the second PDUs can be included.

[0489] As a non-limiting embodiment, the Q3 second PDUs can be randomly selected, or can be selected by the first node U01 according to the degree of association with the P first PDU sets that have been sent, or can be selected according to the sequence number or serial number of the PDUs in the second PDU set.

[0490] Example 10

[0491] Embodiment 10 illustrates another partial schematic diagram of a wireless signal transmission process according to an embodiment of the present invention, as shown in the appendix Fig.10 shown. In the appendix Fig.10 , U01 corresponds to the first node, and N02 corresponds to the second node. The steps in F101 are optional.

[0492] In this embodiment, the first PDU set is associated with at least one first timer. Among them, among the at least one first timer, the remaining time of one or more of the first timers is less than the preset time.

[0493] In one embodiment, each first PDU in the first PDU set is associated with a first timer.

[0494] In another embodiment, the first PDU set is associated with a first timer.

[0495] In yet another embodiment, the first PDU set is associated with a plurality of first timers, and the number of the plurality of first timers is less than the total number of the first PDUs.

[0496] As an embodiment, the value of the first timer is limited and does not exceed 2560 milliseconds.

[0497] As an embodiment, the value of the first timer is the running time when the timer is not intervened.

[0498] As a sub-embodiment of this embodiment, the upper limit of the value of any parameter is 1024 times 65536.

[0499] As a sub-embodiment of this embodiment, the upper limit of the value of any parameter is 65536 or 65535.

[0500] As a sub-embodiment of this embodiment, the upper limit of the value of any parameter is 1024.

[0501] As a sub-embodiment of this embodiment, the upper limit of the value of any parameter is 640 or 320.

[0502] As an embodiment, the first timer is a timer of the PDCP sublayer.

[0503] As an embodiment, the first timer is only configured for data radio bearers.

[0504] As an embodiment, the duration of the first timer is configured by a higher layer.

[0505] As a sub-embodiment of this embodiment, the higher layer is the RRC sublayer.

[0506] As a sub-embodiment of this embodiment, the first node U01 may configure the first timer according to an instruction of the network.

[0507] As an embodiment, the first timer controls the discarding of the PDCP PDU. The PDCP PDU may be any PDU in the first PDU set. Each PDU may be a PDCP SDU.

[0508] In one embodiment, the MAC sublayer of the first node U01 generates a Delay Status Report (DSR) process, wherein the DSR process is to provide the serving base station with the delay status of at least one logical channel, wherein the delay status of the at least one logical channel includes a remaining time, and the remaining time is the minimum value of the remaining time of the first timer respectively associated with the untransmitted PDCP SDU of the at least one logical channel.

[0509] As an embodiment, DSR is a MAC layer process. After a DSR process is initiated, it will try to send a corresponding MAC CE to the serving base station to carry delay status information. Due to heavy uplink load or because resources have not yet been allocated or other data is transmitted first, this MAC CE may not be transmitted immediately. Therefore, the unfinished DSR can be canceled at an appropriate time; a DSR process can be associated with N PDCP SDUs, that is, the DSR is to report the remaining time or the shortest remaining time of the N PDCP SDUs so that the network can schedule the N PDCP SDUs in time.

[0510] As attached Fig.10 As shown, in step S1001, the unfinished delay information report is canceled, and the delay information report is at least used to report the delay status of the logical channel corresponding to the first PDU set.

[0511] The step S1001 may be performed after the step S6105 of the embodiment 6. When the first PDU in the first PDU set is a PDCP SDU, when the first node U01 satisfies the first discard condition and determines to discard the first PDU, the step S1001 may be performed to cancel the unfinished delay information report, and the delay information report is at least used to report the delay status of the logical channel corresponding to the first PDU set, thereby saving resources.

[0512] In one embodiment, the delay information report comprises a DSR.

[0513] In one embodiment, the delay information report is a DSR.

[0514] In one embodiment, the delay information report is a MAC CE.

[0515] In one embodiment, the delay information report is an enhanced BSR.

[0516] In one embodiment, the delay information report is a BSR.

[0517] As an embodiment, initiating the DSR process includes generating a MAC control element (CE).

[0518] As an embodiment, the MAC CE is a DSRMAC CE.

[0519] As an embodiment, initiating the DSR process includes controlling the sending of the MAC CE.

[0520] As an embodiment, initiating the DSR process includes controlling cancellation of the DSR process.

[0521] As an embodiment, the MAC CE indicates that the delay status of the at least one logical channel includes the remaining time.

[0522] As an embodiment, the DSR process that has not yet ended is a Pending DSR process; or the DSR process that has not yet ended is a DSR process that has not yet been completed; or, the DSR process that has not yet ended is a DSR process that has not yet been canceled.

[0523] As an embodiment, the at least one logical channel may include one logical channel or multiple logical channels.

[0524] As an embodiment, the at least one logical channel belongs to a logical channel group.

[0525] As an embodiment, the service cell of the first node U01 configures which logical channels belong to the same logical channel group.

[0526] As an embodiment, the at least one logical channel is based on a logical channel group.

[0527] As an embodiment, the MAC CE reports the delay status in units of logical channel groups.

[0528] As an embodiment, the MAC CE reports the delay status of at least one logical channel group.

[0529] As an embodiment, the DSR process is to provide the serving base station with the delay status of at least one logical channel. The DSR process is to provide the serving base station with the delay status of at least one logical channel group.

[0530] As an embodiment, the at least one logical channel is used to transmit a specific service, such as an XR service.

[0531] As an embodiment, the at least one logical channel is used to transmit a PDU set.

[0532] As an embodiment, the remaining time included in the delay state of the at least one logical channel is the minimum value of the remaining time of the first timer respectively associated with the untransmitted PDCP SDU of the at least one logical channel.

[0533] As an embodiment, the first PDU is a PDCP SDU. Each of the first PDCP SDUs is associated with a first timer.

[0534] As a sub-embodiment of this embodiment, the first timer includes discardTimer.

[0535] As a sub-embodiment of this embodiment, the first timer includes discardTimerForLowImportance.

[0536] As an embodiment, the first PDU in the first PDU set is a PDCP SDU, wherein a part of the PDCP SDU is associated with a discardTimerForLowImportance in a first timer; and the remaining part of the PDCP SDU is associated with a discardTimer in the first timer.

[0537] In one embodiment, the value of discardTimer can be set to 10, 20, 30, 40, 50, 60, 75, 100, 150, 200, 250, 300, 500, 750, 1500, in milliseconds.

[0538] In one embodiment, the value of discardTimer can be set to 0.5, 1, 2, 4, 6, or 8, in milliseconds.

[0539] In one embodiment, the value of discardTimerForLowImportance can be set to 0, 2, 4, 6, 8, 10, 12, 14, 18, 22, 26, 30, 40, 50, 75, 100, in milliseconds.

[0540] In one embodiment, for the same PDCP entity, the value of discardTimerForLowImportance is always smaller than discardTimer, discardTimerExt or discardTimerExt2.

[0541] In one embodiment, the network configures up to 8 DRBs with discardTimerForLowImportance.

[0542] In one embodiment, discardTimer can be used in the sidelink, and its value can be set to 3, 10, 20, 25, 30, 40, 50, 60, 75, 100, 150, 200, 250, 300, 500, 750, 1500, in ms.

[0543] As an embodiment, the remaining time is a minimum value of remaining times of first timers respectively associated with the untransmitted PDCP SDUs of the at least one logical channel.

[0544] As an embodiment, the meaning of the remaining time may include: the minimum value of the remaining time of the first timer associated with any PDCP SDU in the PDCP SDU that has not been transmitted for the at least one logical channel is the remaining time.

[0545] As an embodiment, the meaning of the remaining time may include: any PDCP SDU in the untransmitted PDCP SDU of the at least one logical channel is respectively associated with a first timer, and the smallest remaining time in all the respectively associated first timers is the remaining time.

[0546] As an embodiment, the meaning of the remaining time may include: the remaining time of the PDCP SDU that most urgently needs to be transmitted among the untransmitted PDCP SDUs of the at least one logical channel is the remaining time indicated by the delay status of the at least one logical channel.

[0547] As an embodiment, the meaning of the remaining time includes: when the remaining time of the first timer respectively associated with the untransmitted PDCP SDU of the at least one logical channel changes to a certain extent, the first node U01 generates a DSR MAC CE again.

[0548] For example, assuming that the untransmitted PDCP SDU for the at least one logical channel includes SDU1, SDU2, SDU3, ..., SDUn, the remaining time of the first timer associated with these SDUs are t1, t2, t3, ..., tn, respectively, then the smallest one among t1, t2, t3, ..., tn is the remaining time included in the delay state of the at least one logical channel.

[0549] As an embodiment, the delay state of the at least one logical channel includes only a remaining time.

[0550] As an embodiment, the DSR process is initiated only when the remaining time is shorter than a preset threshold.

[0551] As an implementation method, when the discardTimer or discardTimerForLowImportance of a PDCP SDU times out, the entity that transmits the PDCP will handle it according to different situations. For example, if pdu-SetDiscard is configured, all PDCP SDUs in the PDU set to which the PDCP SDU belongs and the corresponding PDCP data PDUs are discarded. It should be noted that even if the PDCP PDU is subsequently received from the upper layer, if it belongs to the same PDU set, the PDCP PDU received from the upper layer will also be discarded. For another example, if pdu-SetDiscard is not configured, the PDCP SDU and the corresponding PDCP data PDU can be discarded.

[0552] As an embodiment, if the corresponding PDCP data PDU has been submitted to the lower layer, it is discarded at the lower layer.

[0553] For signalling radio bearers (SRBs), when higher layers request to discard PDCP SDUs, the PDCP entity shall discard all stored PDCP SDUs and PDCP PDUs.

[0554] In one embodiment, the transmitting PDCP entity may maintain a first timer. The first timer may be discardTimer and / or discardTimerForLowImportance.

[0555] In specific implementation, the discardTimer timer is only set for the data radio bearer DRB. The duration of the discardTimer timer can be configured by a higher layer. When a higher layer SDU is received, a new discardTimer timer can be started.

[0556] In specific implementation, the discardTimerForLowImportance timer is only configured for DRB. The duration of the discardTimerForLowImportance timer can be configured by higher layers. When an SDU belonging to the low importance PDU set is received from a higher layer, a new discardTimerForLowImportance timer can be started.

[0557] In specific implementation, if discardTimerForLowImportance is configured and the importance of the PDU set discarded based on SDU (PDU

[0558] If the Packet Set Importance (PSI) is activated and the PDCP SDU belongs to a set of low-importance PDUs, the discardTimerForLowImportance associated with this PDCP SDU can be started. Otherwise, if there is a discardTimer associated with the PDCP SDU, that discardTimer can be started. Here, PSI is used to indicate the importance of a set of PDUs relative to other sets of PDUs in a QoS flow.

[0559] It should be noted that determining whether a set of PDUs is a set of low-importance PDUs depends on the UE implementation.

[0560] Embodiment 11

[0561] Embodiment 11 exemplifies a schematic diagram of N PDCP SDUs according to an embodiment of the present invention, as shown in the appendix Fig.11 as shown.

[0562] Appendix Fig.11 shows the N PDCP SDUs, and the sizes of these PDCP SDUs are not limited.

[0563] As an embodiment, the N PDCP SDUs arrive in sequence and are assigned consecutive PDCP sequence numbers.

[0564] As an embodiment, the N PDCP SDUs are source PDCP SDUs.

[0565] As an embodiment, the N PDCP SDUs serve as the first PDUs in the first set of PDUs. X second PDCP SDUs in the second set of PDUs are generated based on the N PDCP SDUs. Here, N > X.

[0566] As an embodiment, the N PDCP SDUs arrive within a time period.

[0567] As an embodiment, the "arrival" refers to arriving at the PDCP sublayer.

[0568] As an embodiment, N is variable.

[0569] As a sub-embodiment of this embodiment, K is fixed.

[0570] In one embodiment, K < N, and the K first PDUs can refer to K of the N first PDUs.

[0571] As an embodiment, the change refers to that the protocol layers above the PDCP sublayer continuously generate PDCP SDU, and the PDCP sublayer increases N by 1 when receiving a PDCP SDU.

[0572] As an embodiment, K is fixed.

[0573] As an embodiment, the K is predefined, which means that K is fixed.

[0574] As an embodiment, a PDCP set has a delay requirement, that is, there is a cutoff time, so the N will not be infinite.

[0575] As an embodiment, the above method has the advantages of being highly adaptable and having good performance in time-varying channel environments.

[0576] Example 12

[0577] Embodiment 12 illustrates a schematic diagram of generating at least one second PDCP SDU among N PDCP SDUs from a first PDCP SDU according to an embodiment of the present invention, as shown in the attached figure. Fig.12 In other embodiments, the second PDU may refer to the second PDCP SDU, the first PDU may refer to the first PDCP SDU; the second PDU set may refer to the second PDCP SDU set, and the first PDU set may refer to the second PDCP SDU set.

[0578] As an embodiment, the second PDCP SDU is generated by the first PDCP SDU.

[0579] As an embodiment, each PDCP SDU in the second PDCP SDU set is generated from multiple PDCP SDUs in the first PDCP SDU set.

[0580] As an embodiment, the first node generates the second PDCP SDU based on the first PDCP SDU according to a fixed algorithm.

[0581] As an embodiment, the first node generates the second PDCP SDU at a protocol layer above the PDCP sublayer.

[0582] As an embodiment, the protocol layer above the PDCP sublayer includes an SDAP sublayer.

[0583] As an embodiment, the protocol layer above the PDCP sublayer includes an RTP layer.

[0584] As an embodiment, the protocol layers above the PDCP sublayer include an application layer.

[0585] As an embodiment, the fixed algorithm is based on a given probability distribution.

[0586] As an embodiment, the fixed algorithm is an error correction algorithm.

[0587] As an embodiment, the fixed algorithm is a repair algorithm.

[0588] As an embodiment, the fixed algorithm is a coding algorithm.

[0589] As an embodiment, generating the at least one second PDCP SDU in the N PDCP SDUs from the first PDCP SDU includes performing an exclusive OR operation on one of the first PDCP SDUs and another of the first PDCP SDUs.

[0590] As a sub-embodiment of this embodiment, when the size of one of the first PDCP SDU set and the other of the first PDCP SDU set are different, the sizes of the two after processing are made the same by padding the smaller one.

[0591] As a sub-embodiment of this embodiment, when the sizes of one of the first PDCP SDU set and the other of the first PDCP SDU set are different, the sizes of the two after processing are made the same by performing rate matching on the smaller one.

[0592] As a sub-embodiment of this embodiment, when the size of one of the first PDCP SDU set is different from the size of the other one of the first PDCP SDU set, redundancy is added to the smaller one so that the sizes of the two after processing are the same.

[0593] As a sub-embodiment of this embodiment, when the sizes of one of the first PDCP SDU set and the other of the first PDCP SDU set are different, the larger one is truncated so that the sizes of the two after processing are the same.

[0594] As a sub-embodiment of this embodiment, when multiple PDCP SDUs in the first PDCP SDU set generate one second PDCP SDU, and when the sizes of the multiple PDCP SDUs in the first PDCP SDU set are different, methods similar to the aforementioned ones, such as padding, rate matching, increasing redundancy, truncation, etc., can be adopted to make the processed multiple PDCP SDUs the same size.

[0595] As a sub-embodiment of this embodiment, a PDCP SDU in the second PDCP SDU set is randomly generated from which PDCP SDUs in the first PDCP SDU set.

[0596] As a sub-embodiment of this embodiment, a PDCP SDU in the second PDCP SDU set is randomly generated from which Z PDCP SDUs in the first PDCP SDU set, and Z is a positive integer.

[0597] As a sub-embodiment of this embodiment, Z is fixed.

[0598] As a sub-embodiment of this embodiment, Z depends on a probability distribution.

[0599] As a sub-embodiment of this embodiment, the probability distribution includes Omega probability distribution.

[0600] As a sub-embodiment of this embodiment, the probability distribution includes normal distribution.

[0601] Example 13

[0602] Example 13 illustrates a schematic diagram of K depending on N according to an embodiment of the present invention, as shown in the attached figure. Fig.13 shown.

[0603] As an embodiment, the meaning that K depends on N includes: K is the product of N and a coefficient.

[0604] As an embodiment, the coefficients are network configured.

[0605] As an embodiment, the coefficient is indicated by QoS information. In a specific implementation, the QoS information is generated in the RRC layer or the non-access layer.

[0606] As an embodiment, the coefficient is determined by a higher layer of the first node, such as an application layer.

[0607] As an embodiment, the coefficient is a positive real number not greater than 1.

[0608] As an embodiment, the coefficient is used to measure reliability.

[0609] As an embodiment, K increases as N increases.

[0610] As an embodiment, when N is in the first value range, K is the product of N and a coefficient.

[0611] As an embodiment, when N is in the second value range, K is the product of N and another coefficient.

[0612] As an embodiment, the first value range is orthogonal to the second value range.

[0613] As an embodiment, the first value range includes at least one positive integer.

[0614] As an embodiment, the second value range includes at least one positive integer.

[0615] As an embodiment, the another coefficient is network configured.

[0616] As an embodiment, the other coefficient is indicated by the QoS information.

[0617] As an embodiment, the another coefficient is determined by a higher layer of the first node, such as an application layer.

[0618] As an embodiment, the other coefficient is a positive real number not greater than 1.

[0619] As an embodiment, the coefficient is different from the another coefficient.

[0620] As an embodiment, the coefficient is greater than the another coefficient.

[0621] As a sub-embodiment of this embodiment, the values ​​included in the first value range are smaller than the values ​​included in the second value range.

[0622] As an embodiment, the above method has the following advantages: better applicability to performance differences of N under different value ranges, and more reliable performance.

[0623] Embodiment 14

[0624] Embodiment 14 illustrates a device structure block diagram of a first node according to an embodiment of the present invention; Fig.14 As shown in the attached Fig.14 In the embodiment, the device 14 in the first node includes a first processor 1401, a first transmitter 1402 and a first receiver 1403.

[0625] In embodiment 14, the device 14 may include: a first processor 1401, determining whether a first discarding condition for a first PDU set is met; the first processor 1401 discards the first PDU set based on meeting the first discarding condition, transmits at least a portion of the remaining PDUs, and discards the second PDU set, transmits at least a portion of the remaining PDUs; wherein any PDU in the second PDU set is generated based on a PDU in the first PDU set.

[0626] In one embodiment, the device 14 may include: the first processor 1401, when the first discarding condition is not met but the second discarding condition for the second PDU set is met, discards at least part of the PDUs in the second PDU set, and the second discarding condition is used to determine whether to discard the second PDU set.

[0627] In one embodiment, the second discard condition includes at least one of the following:

[0628] The number of PDUs successfully received by the receiving end is not higher than a third threshold;

[0629] The delay budget range of the PDU to be transmitted is less than the preset time;

[0630] The number of PDUs successfully sent by the sending end is less than a fourth threshold.

[0631] In one embodiment, the first discard condition includes at least one of the following:

[0632] The number of PDUs successfully received by the receiving end is not higher than a first threshold;

[0633] The delay budget range of the PDU to be transmitted is less than the preset time;

[0634] The number of PDUs successfully sent by the sending end is less than the second threshold.

[0635] In one embodiment, the device 14 may include: the first processor 1401 generates a second PDU based on the first PDU before determining whether the first discard condition is met; the first transmitter 1402 sends (P+Q1) PDUs, the P PDUs are the first PDUs from the first PDU set, and the Q1 PDUs are the second PDUs from the second PDU set; wherein P and Q1 are both positive integers.

[0636] In one embodiment, the first PDU set includes N first PDUs, and the N first PDUs are respectively generated according to N PDCP SDUs; the second PDU set includes X second PDUs, N > (K + X), N is a positive integer, and the values of K and X depend on N; wherein, (P + Q1) < (K + X).

[0637] In one embodiment, the terminal assumes that the receiving end successfully receives Y first PDUs in the first PDU set; the apparatus 14 includes: the first processor 1401, which determines the value of Q2 and sets the PDU set importance of at least Q2 second PDUs in the second PDU set to the PDU set importance of the first PDU set; wherein, the PDU set importance (PSI) of the first PDU set is higher than the PDU set importance (PSI) of the second PDU set, Y ≤ P, and Y is a positive integer.

[0638] In a variant embodiment, the apparatus 14 may include: a first receiver 1403, which receives indication information for indicating that the receiving end successfully receives Y PDUs in the first PDU set; the first processor 1401, which determines the value of Q2 and sends at least Q2 second PDUs from the second PDU set; wherein, Y ≤ P, and Y is a positive integer.

[0639] In one embodiment, the apparatus 14 may include: before sending at least Q2 second PDUs from the second PDU set, the first processor 1401 sets the PDU set importance of at least Q2 second PDUs to the PDU set importance of the first PDU set; wherein, the PDU set importance (PSI) of the first PDU set is higher than the PDU set importance (PSI) of the second PDU set.

[0640] In another variant embodiment, the apparatus 14 may include: a first receiver 1403, which receives indication information for indicating that the receiving end successfully receives Y PDUs in the first PDU set; the first processor 1401, which determines the value of Q2 and sends at least Q2 PDUs, and the Q2 PDUs are from the first PDU set and the second PDU set; wherein, Y ≤ P, and Y and Q2 are positive integers.

[0641] In a specific implementation, before sending at least Q2 PDUs, the first processor 1401 sets the PDU set importance of at least Q3 second PDUs to the PDU set importance of the first PDU set; wherein, the PDU set importance of the first PDU set is higher than the PDU set importance of the second PDU set; Q3 < Q2, and the at least Q2 PDUs include Q3 second PDUs.

[0642] In one embodiment, the device 14 may include: the first PDU set is associated with at least one first timer, the remaining time of at least one first timer is less than a preset time, and the device 14 also includes: the first processor 1401, canceling the unfinished delay information report, and the delay information report is at least used to report the delay status of the logical channel corresponding to the first PDU set.

[0643] As an embodiment, the first node is a terminal, and the terminal may be a user equipment (UE).

[0644] As an embodiment, the first node is a terminal supporting a large delay difference.

[0645] As an embodiment, the first node is a terminal supporting NTN.

[0646] As an embodiment, the first node is an aircraft.

[0647] As an embodiment, the first node is a vehicle-mounted terminal.

[0648] As an embodiment, the first node is a relay.

[0649] As an embodiment, the first node is a vessel.

[0650] As an embodiment, the first node is an Internet of Things terminal.

[0651] As an embodiment, the first node is an industrial Internet of Things terminal.

[0652] As an embodiment, the first node is a device supporting low-latency and high-reliability transmission.

[0653] As an embodiment, the first node is a node supporting multicast.

[0654] As an embodiment, the first receiver 1403 includes at least one of the antenna 452, receiver 454, receiving processor 456, multi-antenna receiving processor 458, controller / processor 459, memory 460, or data source 467 in Example 4.

[0655] As an embodiment, the first transmitter 1402 includes at least one of the antenna 452, transmitter 454, transmit processor 468, multi-antenna transmit processor 457, controller / processor 459, memory 460, or data source 467 in Embodiment 4.

[0656] A person skilled in the art can understand that all or part of the steps in the above method can be completed by instructing the relevant hardware through a program, and the program can be stored in a computer-readable storage medium, such as a read-only memory, a hard disk or an optical disk. Optionally, all or part of the steps in the above embodiment can also be implemented using one or more integrated circuits. Accordingly, each module unit in the above embodiment can be implemented in the form of hardware or in the form of a software function module, and the present invention is not limited to any specific form of software and hardware combination. The user equipment, terminal and UE in the present invention include but are not limited to drones, communication modules on drones, remote-controlled aircraft, aircraft, small aircraft, mobile phones, tablet computers, notebooks, vehicle-mounted communication equipment, wireless sensors, Internet cards, Internet of Things terminals, RFID terminals, NB-IoT terminals, MTC (Machine Type Communication, machine type communication) terminals, eMTC (enhancedMTC, enhanced MTC) terminals, data cards, Internet cards, vehicle-mounted communication equipment, low-cost mobile phones, low-cost tablet computers, satellite communication equipment, ship communication equipment, NTN user equipment and other wireless communication equipment. The base stations or system equipment in the present invention include but are not limited to macrocell base stations, microcell base stations, home base stations, relay base stations, gNB (NR Node B) NR Node B, TRP (Transmitter Receiver Point), NTN base stations, satellite equipment, flight platform equipment and other wireless communication equipment.

[0657] The present invention may be implemented in other specified forms without departing from its core or essential features. Therefore, the embodiments disclosed herein should be considered as illustrative rather than restrictive in any way. The scope of the invention is determined by the appended claims rather than the preceding description, and all modifications within their equivalent meanings and regions are considered to be included therein.

Claims

1. A wireless communication method for a terminal, characterized in that: include: Determining whether a first discard condition for the first PDU set is met; Based on satisfying the first discard condition, discard the first PDU set, transmit at least a portion of the remaining PDUs, and discard the second PDU set, transmit at least a portion of the remaining PDUs; Any PDU in the second PDU set is generated based on the PDU in the first PDU set.

2. The wireless communication method according to claim 1, characterized in that: include: When the first discarding condition is not met but a second discarding condition for the second PDU set is met, at least part of the PDUs in the second PDU set is discarded, and the second discarding condition is used to determine whether to discard the second PDU set.

3. The wireless communication method according to claim 1 or 2, characterized in that: The first discard condition includes at least one of the following: The number of PDUs successfully received by the receiving end is not higher than a first threshold; The delay budget range of the PDU to be transmitted is less than the preset time; The number of PDUs successfully sent by the sending end is less than the second threshold.

4. The wireless communication method according to claim 2, characterized in that: Before determining whether the first discarding condition is met, the wireless communication method includes: generating a second PDU based on the first PDU; Sending (P+Q1) PDUs, wherein the P PDUs are the first PDUs from the first PDU set, and the Q1 PDUs are the second PDUs from the second PDU set; Among them, P and Q1 are both positive integers.

5. The wireless communication method according to claim 4, characterized in that: The first PDU set includes N first PDUs, and the N first PDUs are generated according to N PDCP SDUs respectively; The second PDU set includes X second PDUs, N>(K+X), N is a positive integer, and the values ​​of K and X depend on N; Among them, (P+Q1)<(K+X).

6. The wireless communication method according to claim 4 or 5, characterized in that: The terminal assumes that the receiving end successfully receives Y first PDUs in the first PDU set; the wireless communication method includes: determining a value of Q2, and setting the PDU set importance of at least Q2 of the second PDUs in the second PDU set to the PDU set importance of the first PDU set; The PDU set importance (PSI) of the first PDU set is higher than the PDU set importance (PSI) of the second PDU set, Y≤P, and Y, Q2 is a positive integer.

7. The wireless communication method according to claim 4 or 5, characterized in that: include: Receiving indication information, where the indication information is used to indicate that the receiving end has successfully received Y PDUs in the first PDU set; determining a value of Q2, and sending at least Q2 of the second PDUs from the second PDU set; Among them, Y≤P, and Y,Q2 are positive integers.

8. The wireless communication method according to claim 7, characterized in that: Before sending at least Q2 second PDUs from the second PDU set, the wireless communication method includes: Setting the PDU set importance of at least Q2 of the second PDUs to the PDU set importance of the first PDU set; Among them, the importance of the PDU set of the first PDU set is higher than that of the PDU set of the second PDU set.

9. The wireless communication method according to claim 4 or 5, characterized in that: Including: Receiving indication information, where the indication information is used to indicate that the receiving end has successfully received Y PDUs in the first PDU set; Determining the value of Q2 and sending at least Q2 PDUs, where the Q2 PDUs are from the first PDU set and the second PDU set; Among them, Y ≤ P, and Y and Q2 are positive integers.

10. The wireless communication method according to claim 9, characterized in that: Before sending at least Q2 PDUs, The wireless communication method includes: Setting the importance of the PDU set of at least Q3 second PDUs to the importance of the PDU set of the first PDU set; Among them, the importance of the PDU set of the first PDU set is higher than that of the PDU set of the second PDU set; Q3 < Q2, and the at least Q2 PDUs include Q3 second PDUs.

11. The wireless communication method according to any one of claims 1 to 8, characterized in that: The first PDU set is associated with at least one timer of the first type, and the remaining time of the at least one timer of the first type is less than a preset time. The wireless communication method further includes: Canceling an uncompleted delay information report, where the delay information report is at least used to report the delay status of the logical channel corresponding to the first PDU set.

12. A terminal, characterized in that: The terminal includes: one or more processors and a memory; the memory is coupled to the one or more processors, the memory is used to store computer program code, the computer program code includes computer instructions, and the one or more processors call the computer instructions to cause the terminal to execute the wireless communication method according to any one of claims 1-11.

Images