Wireless communication method and device for use in terminal

Abstract

The present application discloses a wireless communication method and device for use in a terminal. The method comprises: determining whether a first discarding condition for a first PDU set is satisfied; and on the basis that the first discarding condition is satisfied, discarding at least some of untransmitted PDUs in the first PDU set, and discarding at least some of untransmitted PDUs in a second PDU set, wherein any one PDU in the second PDU set is generated on the basis of a PDU in the first PDU set. The present application can save resources and improve the reliability of transmission.

Description

A wireless communication method and apparatus for use in a terminal

[0001] This application claims priority to Chinese Patent Application No. 202410793771.4, filed on June 19, 2024, entitled "A Wireless Communication Method and Apparatus for a Terminal", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to cellular wireless communication, and more particularly to a wireless communication method and apparatus for use in a terminal. Background Technology

[0003] The application scenarios of future wireless communication systems are becoming increasingly diversified, and different application scenarios place different performance requirements on 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 conduct research on New Radio (NR) (or Fifth Generation, 5G). The 3GPP RAN #75 plenary meeting adopted the NR WI (Work Item), and began the standardization work of NR.

[0004] With the continuous development of communication systems, data transmission latency is constantly decreasing and transmission capacity is increasing. 5G communication systems are gradually giving rise to some multimedia services with strong real-time requirements, such as video transmission, cloud gaming, extended reality (XR), and haptic internet. To achieve an immersive experience of interaction between humans and the virtual world, XR services, with their ultra-high bandwidth and ultra-low latency requirements, have attracted much attention.

[0005] XR services are modeled according to data frames. A single 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. The sending end and the receiving end transmit XR services by sending PDU sets. Summary of the Invention

[0006] The inventors discovered through research that application and service awareness in the Radio Access Network (RAN) is one of the key features for improving the user experience of XR services. 5G and future evolution systems can employ a common Quality of Service (QoS) mechanism to handle various data services, including XR services. The QoS mechanism supports priority levels, which indicate the priority of resource allocation among QoS flows. Furthermore, 5G research introduces the parameter PDU Set Importance (PSI) to indicate the importance of a PDU set.

[0007] With the development of technology, it is also necessary to introduce repair data (e.g., repair Protocol Data Units, repair PDUs) to form source blocks from a series of unmodified source packets. However, how to use repair data to save system resources and ensure the quality of service requires further research.

[0008] To address the problems mentioned above, this application provides a solution.

[0009] It should be noted that, unless otherwise specified, the embodiments and features in any node of this application can be applied to any other node. Unless otherwise specified, the embodiments and features in the embodiments of this application can be arbitrarily combined with each other. Furthermore, the method proposed in this application can also be used to solve other problems in communication, such as those in NR evolution and 6G systems.

[0010] As an example, the interpretation of the terminology in this application is based on the definitions in the 3GPP specification protocol TS38 series.

[0011] As an example, the interpretation of terms in this application is based on the definitions in the 3GPP specification protocol TS37 series.

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

[0013] This application embodiment determines whether PDUs in the first PDU set can be discarded based on a first discard condition. When the first discard condition is met, at least a portion of both the first and second PDU sets are discarded simultaneously. Timely discarding of useless data packets helps save storage resources, alleviates network congestion, and ensures more efficient use of limited resources, thus improving service quality. Furthermore, determining whether at least a portion of the PDUs in the second PDU set should be discarded based on the first discard condition for the first PDU set simplifies the processing, reduces processing latency, and further reduces system complexity.

[0014] In one embodiment, the wireless communication method provides a solution for how to utilize different datasets to ensure the quality of service for a business while saving network resources.

[0015] In one embodiment, the wireless communication method provides a solution for how to discard data packets when network congestion occurs.

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

[0017] As an example, the problem this application aims to solve includes: how to process source data packets and repair data packets when network congestion occurs.

[0018] As an example, the advantages of the above method include: when network congestion occurs, it can save resources as much as possible to maximize the quality of service and better support XR services.

[0019] As an example, the advantages of the above method also include: timely discarding of useless data packets, which helps to save storage resources.

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

[0021] In one embodiment, each PDU in the second PDU set is repair data, such as a source PDU.

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

[0023] 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.

[0024] In one embodiment, a PDU set refers to one or more PDUs carrying a payload of unit information (such as a frame or video clip of an XR service) generated at the application layer. One PDU in the PDU set corresponds to one PDCP SDU, as defined in TS23.501. Specifically, according to one aspect of this application, the N PDCP SDUs include at least one non-latency-critical PDCP SDU, wherein the latency-critical PDCP SDU is a PDCP SDU whose associated first timer has a remaining time of less than a first threshold, or the latency-critical PDCP SDU is a PDCP PDU in the PDU set, and the PDU set includes an associated PDCP SDU whose associated first timer has a remaining time of less than a certain threshold.

[0025] Specifically, according to one aspect of this application, the wireless communication method further includes: discarding at least a portion of the PDUs in the second PDU set when the first discard condition is not met but a second discard condition for the second PDU set is met, wherein the second discard condition is used to determine whether to discard at least a portion of the PDUs in the second PDU set.

[0026] In this embodiment, the first PDU set will not be discarded if the first discard condition is not met, which helps to ensure system reliability. Under this condition, using the second discard condition to determine whether to discard at least some PDUs in the second PDU set helps to distinguish different PDU sets, avoids wasting storage space due to insufficiently fine discard conditions, and thus improves network congestion.

[0027] As an example, if the first discard condition is not met but the second discard condition for the second PDU set is met, the PDUs in the first PDU set are not discarded.

[0028] As an example, if the first discard condition is not met but the second discard condition for the second PDU set is met, only the PDUs in the second PDU set are discarded.

[0029] As an example, if the first discard condition is not met but the second discard condition for the second PDU set is met, only the PDUs in the second PDU set are discarded.

[0030] As an example, if the first discard condition is not met but the second discard condition for the second PDU set is met, only a portion of the PDUs in the second PDU set are discarded.

[0031] As an example, if the first discard condition is not met but the second discard condition for the second PDU set is met, only a portion of the PDUs in the second PDU set are discarded. These portion of the PDUs are associated not only with the PDUs in the first PDU set but also with the PDUs in other PDU sets.

[0032] As an example, if the first discard condition is not met but the second discard condition for the second PDU set is met, only a portion of the PDUs in the second PDU set are discarded. The correlation between the portion of PDUs and the PDUs in the first PDU set is less than the correlation between the portion of PDUs and the PDUs in other PDU sets.

[0033] As an example, if the first discard condition is not met but the second discard condition for the second PDU set is met, only a portion of the PDUs in the second PDU set are discarded. These portion 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.

[0034] As an example, if the first discard condition is not met but the second discard condition for the second PDU set is met, only all PDUs in the second PDU set are discarded.

[0035] Specifically, according to one aspect of this application, the second discarding condition includes at least one of the following:

[0036] The number of PDUs successfully received by the receiver does not exceed the third threshold;

[0037] The latency budget range for the PDU to be transmitted is less than the preset time;

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

[0039] Specifically, according to one aspect of this application, the first discard condition includes at least one of the following:

[0040] The number of PDUs successfully received by the receiving end does not exceed the first threshold;

[0041] The latency budget range for the PDU to be transmitted is less than the preset time;

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

[0043] Embodiments of the present application consider the network congestion condition or channel condition as fully as possible from different perspectives of successful reception at the receiving end and successful transmission at the sending end or based on a preset time delay range, so as to determine whether to discard the PDU, which is beneficial to alleviating network congestion and thus improving system efficiency.

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

[0045] As an embodiment, 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.

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

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

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

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

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

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

[0052] 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.

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

[0054] As an embodiment, 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.

[0055] As an embodiment, 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.

[0056] As an example, F() can be defined as follows: 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, and when X1 is not less than 10, the output of F(X1) is the product of X1 and 0.8.

[0057] As a sub-example 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.

[0058] As another embodiment, F() can be defined as follows: 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, and when X1 is not less than 100, the output of F(X1) is the product of X1 and 0.75.

[0059] As a sub-example 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.

[0060] As one example, the first threshold depends on the number of PDUs in the second PDU set that the receiving end successfully receives.

[0061] As one embodiment, the first threshold depends 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.

[0062] Specifically, according to one aspect of this application, before determining whether the first discard condition is met, the method includes:

[0063] Generate a second PDU based on the first PDU;

[0064] Send (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;

[0065] Where P and Q1 are both positive integers.

[0066] The embodiments of this application further define each second PDU in the second PDU set as being generated based on each first PDU in the first PDU set, clarifying the association between the two PDU sets or between individual PDUs, and providing an explanation for using different discard conditions.

[0067] As an example, the meaning of "P PDUs are from the first PDU in the first PDU set" includes: P PDUs are generated from the first PDU in the first PDU set.

[0068] As an example, the meaning of "P PDUs are the first PDUs from the first PDU set" includes: P PDUs are P first PDUs from the first PDU set.

[0069] As an example, the meaning of the P PDUs being the first PDU from the first PDU set includes: the first PDU set includes P PDUs, wherein the P PDUs are named the first PDU.

[0070] As an example, the meaning of "P PDUs are the first PDUs from the first PDU set" includes: the first PDU set includes multiple PDUs with a quantity greater than P, wherein P PDUs are named the first PDUs.

[0071] As an example, the meaning of "P PDUs are the first PDUs from the first PDU set" includes: "P PDUs are copies of the first PDUs from the first PDU set".

[0072] As an example, the meaning of "P PDUs are the first PDU from the first PDU set" includes: any PDU in the first PDU set is named the first PDU.

[0073] As an example, the meaning of Q1 PDUs being second PDUs from the second PDU set includes: Q1 PDUs are generated from the second PDUs in the second PDU set, and each second PDU is generated based on the first PDU.

[0074] As an example, the meaning of "Q1 PDUs are the second PDUs from the second PDU set" includes: Q1 PDUs are Q1 second PDUs from the second PDU set.

[0075] As an example, the meaning of the Q1 PDUs being the second PDUs from the second PDU set includes: the second PDU set includes Q1 PDUs, wherein the Q1 PDUs are named the second PDUs.

[0076] As an example, the meaning of Q1 PDUs being the second PDUs from the second PDU set includes: the second PDU set includes a plurality of PDUs with a number greater than Q1, wherein Q1 PDUs are named the second PDUs.

[0077] As an example, the meaning of Q1 PDUs being the second PDUs from the second PDU set includes: Q1 PDUs being copies of the second PDUs from the second PDU set.

[0078] As an example, the meaning of Q1 PDUs being the second PDU from the second PDU set includes: any PDU in the second PDU set is named the second PDU.

[0079] Specifically, according to one aspect of this application, the first PDU set contains N first PDUs, which are generated from N PDCP SDUs respectively; the second PDU set contains X second PDUs, N>(K+X), where N is a positive integer and the values ​​of K and X depend on N; where (P+Q1)<(K+X).

[0080] Specifically, according to one aspect of this application, 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 as 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.

[0081] In this embodiment, the parameter values ​​(e.g., PDU Set Importance, PSI) of Q2 second PDUs in the second PDU set are adjusted according to the number of PDUs successfully received by the receiving end. This extends the storage time of the Q2 second PDUs as much as possible and reduces the probability that the Q2 second PDUs will be discarded when the second discard condition is met. This gives the receiving end a chance to successfully receive more data, which is beneficial for ensuring system reliability when network congestion or channel quality degradation occurs, and for ensuring system QoS.

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

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

[0084] In one embodiment, Y is the number of first PDUs sent by the terminal (e.g., the sending end).

[0085] In one embodiment, Y is estimated by the terminal (e.g., the transmitter) based on the number of first PDUs transmitted, according to channel quality.

[0086] In one embodiment, Y is estimated by the terminal (e.g., the transmitter) based on the number of first PDUs sent, according to the channel BLER and BER.

[0087] In one embodiment, Y is estimated by the terminal (e.g., the transmitter) based on the number of first PDUs sent, according to channel RSRP and RSRQ.

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

[0089] This application embodiment utilizes the indication information sent by the receiving end to determine the value of Q2 that satisfies the correct decoding data of the receiving end, which can minimize the number of PDUs sent in the second PDU set and effectively improve system efficiency.

[0090] Specifically, according to one aspect of this application, before transmitting 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 that of the second PDU set.

[0091] In this embodiment, the sending end determines the value of Q2 that satisfies the correct decoding data of the receiving end based on its own evaluation, which can minimize the number of PDUs sent in the second PDU set and effectively improve system efficiency.

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

[0093] In one embodiment, the sending end evaluates the value of Q2 based on statistical information and parameters in the first set of PDUs that have been sent, and sets the PDU set importance of the Q2 second PDUs to the PDU set importance of the first PDU set.

[0094] 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.

[0095] Specifically, according to one aspect of the present application, 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.

[0096] Specifically, according to one aspect of the present application, 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.

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

[0098] 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.

[0099] 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.

[0100] 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.

[0101] To address the aforementioned technical problems, this application provides a terminal comprising: one or more processors and a memory; the memory is coupled to the one or more processors, the memory being used to store computer program code, the computer program code including computer instructions, and the one or more processors invoking the computer instructions to cause the terminal to execute the aforementioned method.

[0102] Specifically, according to one aspect of this application, the terminal is a user equipment, a vehicle terminal, or a mobile phone.

[0103] To address the aforementioned technical problems, this application provides a terminal device (hereinafter referred to as a terminal), comprising: a first processor, which determines whether a first discard condition for a first PDU set is met; the first processor, based on meeting the first discard condition, discards the first PDU set, transmits at least a remaining portion of the PDUs, and discards a second PDU set, transmits at least a remaining portion of the PDUs; wherein any PDU in the second PDU set is generated based on the PDUs in the first PDU set.

[0104] Specifically, according to one aspect of this application, the terminal may include: the first processor, which discards at least a portion of the PDUs in the second PDU set when the first discard condition is not met but a second discard condition for the second PDU set is met, wherein the second discard condition is used to determine whether to discard the second PDU set.

[0105] Specifically, according to one aspect of this application, the second discarding condition includes at least one of the following:

[0106] The number of PDUs successfully received by the receiver does not exceed the third threshold;

[0107] The latency budget range for the PDU to be transmitted is less than the preset time;

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

[0109] Specifically, according to one aspect of this application, the first discard condition includes at least one of the following:

[0110] The number of PDUs successfully received by the receiving end does not exceed the first threshold;

[0111] The latency budget range for the PDU to be transmitted is less than the preset time;

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

[0113] Specifically, according to one aspect of this application, the terminal may include: before determining whether the first discard condition is met, the first processor generates a second PDU based on the first PDU; and the first transmitter sends (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; wherein P and Q1 are both positive integers.

[0114] Specifically, according to one aspect of this application, the first PDU set contains N first PDUs, which are generated from N PDCP SDUs respectively; the second PDU set contains X second PDUs, N>(K+X), where N is a positive integer and the values ​​of K and X depend on N; where (P+Q1)<(K+X).

[0115] Specifically, according to one aspect of this application, the terminal assumes that the receiving end successfully receives Y first PDUs in the first PDU set; the terminal includes: a first processor, 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.

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

[0117] Specifically, according to one aspect of this application, the terminal includes: before sending at least Q2 second PDUs from the second PDU set, the first processor sets the PDU set importance of the 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.

[0118] Specifically, according to one aspect of this application, the terminal includes: a first processor, which receives indication information, the indication information being used to indicate that a receiving end has successfully received Y PDUs from the first PDU set; the first processor, which determines the value of Q2 and sends at least Q2 PDUs, the Q2 PDUs being from the first PDU set and the second PDU set; wherein, Y≤P, and Y and Q2 are positive integers.

[0119] Specifically, according to one aspect of the present application, 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.

[0120] Specifically, according to one aspect of the present application, 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.

[0121] As an embodiment of the present application, 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 and discarding at least a remaining part of the PDUs in the second PDU set; wherein, any PDU in the second PDU set is generated based on the PDUs in the first PDU set.

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

[0123] The embodiment of the present application determines 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, discarding at least part of the first PDU set and the second PDU set 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

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

[0125] FIG. 1 illustrates a flowchart of a wireless communication method according to an embodiment of the present application;

[0126] FIG. 2 shows a schematic diagram of a network architecture according to an embodiment of the present application;

[0127] Figure 3 illustrates a schematic diagram of an embodiment of a wireless protocol architecture for the user plane and control plane according to an embodiment of this application;

[0128] Figure 4 shows a schematic diagram of a first communication device and a second communication device according to an embodiment of this application;

[0129] Figures 5 to 7 illustrate flowcharts of wireless signal transmission according to an embodiment of this application;

[0130] Figure 8 illustrates a partial schematic diagram of another wireless signal transmission process according to an embodiment of this application;

[0131] Figure 9 illustrates a partial schematic diagram of another wireless signal transmission process according to an embodiment of this application;

[0132] Figure 10 illustrates a partial schematic diagram of another wireless signal transmission process according to an embodiment of this application;

[0133] Figure 11 shows a schematic diagram of N PDCPSDUs according to an embodiment of this application;

[0134] Figure 12 illustrates a schematic diagram of a first PDCPSDU generating at least one second PDCPSDU among N PDCPSDUs according to an embodiment of this application;

[0135] Figure 13 illustrates a schematic diagram of K depending on N according to an embodiment of this application;

[0136] Figure 14 illustrates a device structure block diagram of a first node according to an embodiment of this application. Detailed Implementation

[0137] This application can be applied to NG-RAN (Next Generation Radio Access Networks) systems, as well as LTE systems, 5G systems, and future 6G, 7G, and other systems. It can also be applied to CU-DU architectures. This application does not limit itself to any of these applications.

[0138] The technical solutions of this application embodiment can also be applied to machine-type communication (MTC), long-term evolution-machine (LTE-M) technology, device-to-device (D2D) networks, machine-to-machine (M2M) networks, Internet of Things (IoT) networks, or other networks. Among them, IoT networks may include, for example, vehicle-to-everything (V2X) networks. The communication methods in V2X systems are collectively referred to as vehicle-to-X (V2X), where X can represent anything. For example, V2X may include: vehicle-to-vehicle (V2V) communication, vehicle-to-infrastructure (V2I) communication, vehicle-to-pedestrian (V2P) communication, or vehicle-to-network (V2N) communication, etc.

[0139] To facilitate understanding of the embodiments of this application, the terms used in this application are briefly explained.

[0140] 1. Extended Reality (XR)

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

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

[0143] In practical implementation, the air interface transmission delay budget for video frames can refer to the total time from when the base station receives data of a frame of image from the user plane function to when the frame of image is successfully transmitted from the base station to the UE.

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

[0145] The data to be transmitted can be divided into urgent data and non-urgent data. Urgent data can be understood as data for which the terminal expects the network to allocate transmission resources. Urgent data may be data with a small remaining time, meaning data for which the terminal hopes the network will allocate transmission resources as soon as possible. Non-urgent data may be data for services with low or no latency requirements (e.g., 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 a PDU (Programmable Dedicated Unit). In this specification, the data to be transmitted can refer to a PDU.

[0146] When scheduling resources, the network can prioritize allocating transmission resources to urgent data. During data transmission, if there is no remaining time information, the data can be considered non-urgent; conversely, if there is remaining time and the remaining time is very small, the data can be considered urgent.

[0147] 3. Remaining Time

[0148] The remaining time can include any one or more of the following: remaining delay, remaining packet delay budget (PDB), remaining PDU set delay budget (PSDB), time / duration until expiration, time / duration until discarding, and time / duration until the discard timer expires. For example, the expiration time can also be the deadline. For example, the expiration time can be understood as the time when the data expires, or as the time when the terminal's Access Stratum (AS) begins calculating the remaining time corresponding to the data after acquiring it, or as the time when the remaining time corresponding to the data is determined. The remaining time corresponding to the data can 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 this application are applicable to NR systems and also to NR evolution systems, such as 6G network systems.

[0151] In this embodiment, "network" refers to network-side equipment or network-side system. It can also refer to the serving cell or serving base station of the terminal. The serving cell refers to the cell where the terminal (e.g., UE) camps. Taking the UE as an example, the UE's cell search process mainly includes: the UE searching for a suitable cell within a 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 thus completing the UE's camping in the suitable cell. In other words, a camped cell, relative to the UE, is the UE's serving cell. Camping on a cell in RRC idle or inactive state has the following advantages: it allows the UE to receive system messages from the PLMN or SNPN; after completing cell registration, if the UE wishes to establish an RRC connection or continue a suspended RRC connection, the UE can perform initial access on the control channel of the camped cell; the network can page the UE; and the UE can receive ETWS (Earthquake and Tsunami Warning System) and CMAS (Commercial Mobile Alert System) notifications.

[0152] As an example, for a UE in RRC connected state without carrier aggregation / dual connectivity (CA / DC) configured, there is only one serving cell, including the primary cell. For a UE in RRC connected state with CA / DC configured, the serving cell is used to indicate the set of cells including the special cell (SpCell) and all secondary cells. The primary cell is the MCG (Master Cell Group) cell, operating on the primary frequency, while the secondary cells (SCells) operate on the secondary frequencies. The UE performs the initial connection establishment procedure or initiates connection reconstruction on the primary cell. For dual connectivity operations, the special cell refers to the PCell of the MCG (or the PSCell of the SCG (Secondary Cell Group)); if it is not a dual connectivity operation, the special cell refers to the PCell.

[0153] As an example, the lower layers that perform operations in the RRC sublayer include at least one of the physical layer, MAC sublayer, RLC sublayer, and PDCP sublayer.

[0154] As one example, the higher layers that perform operations at the RRC sublayer include the non-access layer.

[0155] As one example, higher-layer signaling includes RRC signaling or non-access stratum signaling.

[0156] The technical solution of this application will be further described in detail below with reference to the accompanying drawings. It should be noted that, unless otherwise specified, the embodiments and features in the embodiments of this application can be arbitrarily combined with each other.

[0157] Example 1

[0158] Example 1 illustrates a flowchart of a wireless communication method according to an embodiment of this application, as shown in Figure 1. In Figure 1, each box represents a step. It is particularly important to emphasize that the order of the boxes in the figure does not represent the temporal sequence of the steps represented.

[0159] In Embodiment 1, the wireless communication method can be executed at a first node 100. The first node 100 includes, but is not limited to, various terminal devices (referred to as terminals). The first node can be a UE (User Equipment). The first node 100 is within the service range of a network (e.g., a serving cell).

[0160] As one example, the first node is a terminal.

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

[0162] As an example, the individual content of an information element is called a field.

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

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

[0165] As an example, MCG refers to a group of serving cells associated with the master node in MR-DC, including SpCell, and optionally, one or more SCell.

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

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

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

[0169] As an example, in MR-DC, the set of serving cells associated with a slave node is an SCG (secondary cell group), which includes SpCell and, optionally, one or more SCells.

[0170] As an example, the SpCell is a PCCell or the SpCell is a PSCell.

[0171] As an example, DC is not used when RRC is inactive.

[0172] As an example, CA is typically not used when RRC is inactive.

[0173] As an example, an RRC information block refers to an information element in an RRC message.

[0174] As an example, the SSB may be referred to as SS\PBCH, or SSblock.

[0175] As an example, L1 is Layer-1 or physical layer.

[0176] As an example, L2 is Layer-2.

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

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

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

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

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

[0182] As an example, the signaling radio bearer is a service or service interface that PDCP provides to higher layers.

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

[0184] As an example, the data radio bearer is a service or service interface that PDCP provides to higher layers.

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

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

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

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

[0189] As an example, when the first node fails to establish an RRC connection with the network, the first node is in an RRC idle state.

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

[0191] As an example, when the first node's RRC connection with the network is suspended, the first node enters the RRC inactive state.

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

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

[0194] As an example, only very limited functionality is supported in non-RRC connected mode.

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

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

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

[0198] As an example, this application is directed to low-latency or ultra-low-latency transmission.

[0199] As an example, this application is directed to XR services.

[0200] As an example, this application is directed to low-latency interactive services.

[0201] In one embodiment, the data transmitted and received by the first node 100 may include XR data, which may refer to data related to XR services. XR data and XR services have high latency requirements for transmission.

[0202] In one embodiment, an XR video service may employ image group coding and / or slice coding.

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

[0204] In step S102, based on satisfying the first discard condition, the first PDU set is discarded and at least a portion of the remaining PDUs are transmitted, and the second PDU set is discarded and at least a portion of the remaining PDUs are transmitted.

[0205] In this case, any PDU in the second PDU set is generated based on the PDUs in the first PDU set.

[0206] In practical implementation, the access stratum (AS) layer of the first node 100 can acquire new data bursts, also known as PDU sets. The access layer may include multiple protocol layers.

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

[0208] As an example, the parameters involved in this application embodiment may be configured by the network, generated by the first node 100 according to an internal algorithm, such as random, or may be default or set by default.

[0209] In one embodiment, a data burst can be a set of PDUs generated and issued by application-layer services within a short period of time.

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

[0211] In one embodiment, the PDU set may include one or more PDUs carried on the 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. For example, a frame or video slice from an XR and media (XRM) service.

[0213] In one embodiment, the PDU set can be data such as media frames, media slices, or media tiles.

[0214] In one embodiment, the PDU set may contain frames or slices. For example, a PDU set may contain a frame or a slice.

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

[0216] As an example, in some applications, the data in a set of PDUs needs to be decoded together to make sense.

[0217] As a sub-implementation of this embodiment, the PDUs in a PDU set are application layer PDUs or other protocol layer PDUs carrying application layer information.

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

[0219] As a sub-implementation of this embodiment, any PDU in a PDU set includes an identity or index used to identify this PDU set.

[0220] As an example, N PDCPSDUs belong to or constitute a PDUset.

[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 can be associated with other PDU sets, and the other PDU sets can depend on the PDU set. If the latter is discarded, the former may fail to be decoded.

[0223] For example, a PDU set, PDU Set1, can be associated with one or more other PDU sets that depend on PDU Set1. If PDU Set1 is discarded, the other one or more PDU sets may become undecodeable.

[0224] As an example, if a portion of the PDUs in the PDU set fails to be received, the receiving end can still decode the corresponding image. In other words, even if the receiving end only receives a portion of the PDUs in the PDU set, it can still decode the corresponding image, although the image quality will be 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 a "discard timer" information element (IE). The IE indicates the value of the discard timer corresponding to the set of PDUs of the data radio bearer (DRB).

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

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

[0228] In step S101, the first node 100 can determine whether the first discard condition for the first PDU set is met. 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. 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 PDUs in the first PDU set.

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

[0232] For 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. In this case, the number of PDUs in the second PDU set can be less than the number of PDUs in the first PDU set.

[0233] For 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 quite complex, rather than a one-to-one or one-to-many mapping relationship. In this case, 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, such as a source PDU.

[0236] In specific implementation, the first node 100 has a first discard condition. The first discard condition can be configured by the network, generated by the first node 100, or be a default setting. The first discard condition can be a criterion for determining whether a PDU in the first PDU set should be discarded.

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

[0238] In specific implementation, when the first node 100 determines in step S101 that the first discard condition is met, it can discard the remaining PDUs in the first PDU set that have not yet been transmitted.

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

[0240] As an example, 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 example, K is fixed.

[0242] As an example, K refers to the PDU set of the N PDCPSDUs.

[0243] As an example, K is determined by the QoS parameters of the services carried by the N PDCPSDUs.

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

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

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

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

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

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

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

[0251] As a sub-implementation of this embodiment, the PDUs included in the first PDUset are all PDCPSDUs.

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

[0253] As an example, the second PDCP set includes K non-delayed urgent PDCPSDUs.

[0254] In one embodiment, non-latency-critical PDCPSDUs are supported to be associated with DSRs.

[0255] Example 2

[0256] Example 2 illustrates a schematic diagram of a network architecture according to this application, as shown in Figure 2.

[0257] Figure 2 illustrates the network architecture of 5G NR, LTE (Long-Term Evolution), and LTE-A (Long-Term Evolution Advanced) systems. The 5G NR or LTE network architecture 200 can be referred to as 5GS (5G System) / EPS (Evolved Packet System) 200 or some other suitable term. 5GS / EPS 200 may include one or more UE (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 services 230. 5GS / EPS can interconnect with other access networks, but these entities / interfaces are not shown for simplicity. As shown in Figure 2, the 5GS / EPS200 provides packet-switched services; however, those skilled in the art will readily understand that the various concepts presented throughout this application can be extended to networks or other cellular networks providing circuit-switched services. NG-RAN includes NR Node B (gNB) 203 and other gNBs 204. gNB 203 provides user and control plane protocol termination to UE 201. gNB 203 can connect to other gNBs 204 via an Xn interface (e.g., backhaul). gNB 203 may also be referred to as a base station, base transceiver station, radio base station, radio transceiver, transceiver function, basic service set (BSS), extended service set (ESS), TRP (transmitter-receiver node), or some other suitable term. gNB 203 provides UE 201 with an access point to the 5GC / EPC210. Examples of UE201 include cellular phones, smartphones, Session Initiation Protocol (SIP) phones, laptops, 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 IoT devices, machine-type communication devices, land vehicles, automobiles, wearable devices, or any other similar functionality.Those skilled in the art may also refer to UE201 as a mobile station, subscriber station, mobile unit, subscriber unit, radio unit, remote unit, mobile, radio, wireless communication, remote, mobile subscriber station, access terminal, mobile terminal, radio terminal, remote terminal, handheld device, user agent, mobile client, client, or any other suitable term. gNB203 connects to 5GC / EPC210 via the S1 / NG interface. 5GC / EPC210 includes MME (Mobility Management Entity) / AMF (Authentication Management Field) / SMF (Session Management Function) 211, other MME / AMF / SMF 214, S-GW (Service Gateway) / UPF (User Plane Function) 212, and P-GW (Packet Data Network Gateway) / UPF 213. The MME / AMF / SMF211 is the control node that handles signaling between UE201 and 5GC / EPC210. ​​Essentially, the MME / AMF / SMF211 provides bearer and connection management. All user IP (Internet Protocol) packets are transmitted through the S-GW / UPF212, which is itself connected to the P-GW / UPF213. The P-GW provides UE IP address allocation and other functions. The P-GW / UPF213 is connected to Internet service 230. Internet service 230 includes operator-compliant Internet Protocol services, specifically including the Internet, intranet, IMS (IP Multimedia Subsystem), and packet-switched streaming services.

[0258] As an example, the first node in this application can be a terminal, such as UE201.

[0259] As an example, the second node in this application can be a base station, such as gNB203.

[0260] As an example, the radio link from UE201 to NR node B is an uplink.

[0261] As an example, the radio link from NR node B to UE201 is a downlink.

[0262] As an example, the UE201 may be a mobile phone.

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

[0264] As an example, the UE201 is an Internet of Things (IoT) device.

[0265] As an example, the UE201 is an aircraft.

[0266] As an example, the UE201 is a vehicle.

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

[0268] As an example, the gNB203 is a microcell base station.

[0269] The terminal in this application embodiment may be a mobile phone, tablet computer, computer with wireless transceiver function, XR terminal, virtual reality (VR) terminal, augmented reality (AR) terminal, mixed reality (MR) terminal, wireless terminal in industrial control, wireless terminal in autonomous driving, wireless terminal in telemedicine, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, cellular phone, cordless phone, session initiation protocol (SIP) phone, wireless local loop (WLL) station, personal digital assistant (PDA), handheld device with wireless communication function, computing device or other processing device connected to a wireless modem, vehicle device, wearable device, terminal in 5G network or terminal in future evolved network, etc.

[0270] Example 3

[0271] Example 3 illustrates a schematic diagram of an embodiment of a wireless protocol architecture for a user plane and control plane according to this application, as shown in Figure 3. 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 3 shows the radio protocol architecture for the control plane 300 between a first node (UE, gNB) and a second node (gNB, UE), or between two UEs, using 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 herein as PHY 301. The L2 layer 305 is above PHY 301 and is responsible for the link between the first node and the second node and between the two UEs via PHY 301. Layer L2 305 includes a Medium Access Control (MAC) sublayer 302, a Radio Link Control (RLC) sublayer 303, and a Packet Data Convergence Protocol (PDCP) sublayer 304, which terminate at the second node. PDCP sublayer 304 provides multiplexing between different radio bearers and logical channels. PDCP sublayer 304 also provides security through encrypted data packets and supports cross-regional mobility between the second node and the first node. RLC sublayer 303 provides upper-layer packet segmentation and reassembly, retransmission of lost packets, and packet reordering to compensate for out-of-order reception due to HARQ. MAC sublayer 302 provides multiplexing between logical and transport channels. MAC sublayer 302 is also responsible for allocating various radio resources (e.g., resource blocks) within a cell between the first nodes. MAC sublayer 302 is also responsible for HARQ operations. In the control plane 300, the RRC (Radio Resource Control) sublayer 306 in the L3 layer is responsible for acquiring radio resources (i.e., radio bearers) and configuring the lower layers 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 and second nodes in the user plane 350 is largely the same as the corresponding layers and sublayers in the control plane 300 for Physical Layer 351, PDCP sublayer 354 in L2 Layer 355, RLC sublayer 353 in L2 Layer 355, and MAC sublayer 352 in L2 Layer 355. However, 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 the SDAP (Service Data Adaptation Protocol) sublayer 356. The SDAP sublayer 356 is responsible for mapping between QoS flows and Data Radio Bearers (DRBs) to support service diversity. SRBs can be seen as services or interfaces provided by the PDCP sublayer to higher layers, 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. SRBs are bearers between the UE and the access network, used to transmit control signaling, including RRC signaling, between the UE and the access network. SRB1 is particularly important for the UE; after each UE establishes an RRC connection, there will be an SRB1 used to transmit RRC signaling. Most signaling is transmitted through SRB1. If SRB1 is interrupted or unavailable, the UE must re-establish RRC. SRB2 is generally only used to transmit NAS signaling or security-related signaling. UEs may not need to configure SRB3. Except for emergency services, the UE must establish an RRC connection with the network for subsequent communication. Although not illustrated, the first node may have several upper layers above L2 layer 355. It also includes a network layer (e.g., IP layer) terminating at the P-GW on the network side and an application layer terminating at the other end of the connection (e.g., remote UE, server, etc.). Protocol layers can also be referred to as protocol sublayers. Figure 3 shows a general protocol layer structure; the node used in this application may omit some protocol layers.

[0272] As an example, the wireless protocol architecture in Figure 3 is applicable to the terminal described in this application.

[0273] As an example, the wireless protocol architecture in Figure 3 is applicable to the base station described in this application.

[0274] As an example, the first PDU set and the second PDU set in this application are generated in SDAP356.

[0275] Example 4

[0276] Example 4 illustrates 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 this application, as shown in Figure 4. 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 transmitting processor 468, a receiving processor 456, and optionally may also include a multi-antenna transmitting processor 457, a multi-antenna receiving 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 receiver processor 470, a transmitter processor 416, and optionally may also include a multi-antenna receiver processor 472, a multi-antenna transmitter 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, upper-layer data packets from the core network are provided to the controller / processor 475. The controller / processor 475 implements L2 (Layer-2) layer functionality. 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 retransmitting 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). Transmit processor 416 performs encoding and interleaving to facilitate forward error correction (FEC) at the second communication device 410, and mapping of signal clusters based on various modulation schemes (e.g., Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK), Multi-Phase Shift Keying (M-PSK), Multi-QA Modulation (M-QAM)). Multi-antenna transmit processor 471 performs digital spatial precoding on the encoded and modulated symbols, including codebook-based and non-codebook-based precoding, and beamforming processing, generating one or more spatial streams. Transmit processor 416 then maps each spatial stream to subcarriers, multiplexes it with a reference signal (e.g., a pilot) in the time and / or frequency domains, and subsequently uses Inverse Fast Fourier Transform (IFFT) to generate a physical channel carrying the time-domain multicarrier symbol stream. Multi-antenna transmit processor 471 then performs transmit analog precoding / beamforming operations on the time-domain multicarrier symbol stream. Each transmitter 418 converts the baseband multicarrier symbol stream provided by the multi-antenna transmitter processor 471 into an radio frequency stream, which is then provided to different antennas 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 radio frequency carrier and converts the radio frequency stream into a baseband multicarrier symbol stream, which is then provided to the receiver processor 456. The receiver processor 456 and the multi-antenna receiver processor 458 implement various signal processing functions of the L1 layer. The multi-antenna receiver processor 458 performs receive analog precoding / beamforming operations on the baseband multicarrier symbol stream from the receiver 454. The receiver processor 456 uses a Fast Fourier Transform (FFT) to convert the baseband multicarrier symbol stream after the receive analog precoding / beamforming operations 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 receiver processor 456, where the reference signal is used for channel estimation, and the data signal is recovered in the multi-antenna receiver processor 458 after multi-antenna detection to recover any spatial stream destined for the first communication device 450. Symbols on each spatial stream are demodulated and recovered in the receive processor 456, generating soft decisions. The receive 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 over 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 Layer 2. The controller / processor 459 may be associated with a memory 460 storing program code and data. The memory 460 may be referred to as computer-readable media. In the transmission from the second communication device 410 to the second communication device 450, the controller / processor 459 provides multiplexing, packet reassembly, decryption, header decompression, and control signal processing between the transport and logical channels to recover upper-layer data packets from the core network. The upper-layer data packets are then provided to all protocol layers above Layer 2. Various control signals may also be provided to Layer 3 for Layer 3 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 functions 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, implementing L2 layer functions for the user plane and control plane. The controller / processor 459 is also responsible for retransmitting lost packets and signaling to the second communication device 410. Transmit processor 468 performs modulation mapping and channel coding processing, while multi-antenna transmit processor 457 performs digital multi-antenna spatial precoding, including codebook-based and non-codebook-based precoding, and beamforming processing. Subsequently, transmit processor 468 modulates the generated spatial stream into a multi-carrier / single-carrier symbol stream. After analog precoding / beamforming operations in multi-antenna transmit processor 457, the stream is provided to different antennas 452 via transmitter 454. Each transmitter 454 first converts the baseband symbol stream provided by multi-antenna transmit processor 457 into a radio frequency symbol stream before providing it to 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 receiving 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 radio frequency signals through its corresponding antenna 420, converts the received radio frequency signals into baseband signals, and provides the baseband signals to the multi-antenna receiving processor 472 and the receiving processor 470. The receiving processor 470 and the multi-antenna receiving processor 472 jointly implement the L1 layer functions. The controller / processor 475 implements the L2 layer functions. The controller / processor 475 may be associated with a memory 476 that stores program code and data. The memory 476 may be referred to as computer-readable media. In the transmission from the first communication device 450 to the second communication device 410, the controller / processor 475 provides multiplexing between the transmission and logical channels, packet reassembly, decryption, header decompression, and control signal processing to recover upper-layer data packets from the UE 450. Upper-layer packets from the controller / processor 475 can be provided to the core network.

[0283] As one 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 with the at least one processor, and the first communication device 450 at least: determines whether a first discard condition for a first PDU set is met; based on meeting the first discard condition, discards the first PDU set, transmits at least a remaining portion of the PDUs, and discards a second PDU set, transmits at least a remaining portion of the PDUs; wherein any PDU in the second PDU set is generated based on the PDUs in the first PDU set.

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

[0285] As an example, the first communication device 450 corresponds to the first node in this application, namely the terminal.

[0286] As an example, the second communication device 410 corresponds to the second node in this application.

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

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

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

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

[0291] As one embodiment, receiver 454 (including antenna 452), receiver processor 456 and controller / processor 459 are used in this application to receive the instruction information.

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

[0293] Example 5

[0294] Example 5 illustrates a wireless signal transmission flowchart according to an embodiment of this application, as shown in Figure 5. In Figure 5, 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 or the order of implementation in this application, and the steps within F51 are optional.

[0295] For the first node U01, in step S5101, a first PDU set and a second PDU set are generated; in step S5102, the PDUs in the first PDU set and the second PDU set are sent; in step S5103, indication information is received; in step S5104, it is determined whether to discard the remaining PDUs; in step S5105, the remaining PDUs are discarded or stored based on the determination result.

[0296] For the second node N02, in step S5201, PDUs from the first PDU set and the second PDU set are received; in step S5202, indication information is generated and sent.

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

[0298] As one example, the second node N02 is the base station corresponding to the PCell of the first node U01.

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

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

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

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

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

[0304] In one embodiment, the AS layer of the first node U01 can obtain data bursts or PDU sets 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, a Packet Data Convergence Protocol (PDCP) layer, or an RLC layer. In this case, the first node U01 can obtain data bursts or PDU sets from the SDAP layer, PDCP layer, or RLC layer.

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

[0307] In practice, the N PDCP SDUs belong to the same PDU set.

[0308] In practice, the PDCP entity to which the N PDCPSDUs belong determines that the N PDCP SDUs belong to the same PDU set based on the protocol header of the N PDCPSDUs.

[0309] In practice, the PDCP entity to which the N PDCPSDUs belong determines, according to instructions 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 PDUs in the first PDU set.

[0311] In one embodiment, the second PDU set contains X second PDUs, where the value of X can be less than or equal to N. In typical scenarios, the value of X depends on N, X is less than N, or X is much less than N.

[0312] In another embodiment, the second PDU set contains (X+C) second PDUs, where the value of X can 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 in the second PDU set successfully transmitted by the first node U01.

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

[0315] In practice, any PDU in the first PDU set is referred to as the first PDU. The second PDU set consists of multiple 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 set of unmodified source data packets. Taking the receiving end as an example, receiving the second PDU facilitates successful decoding to obtain one or more first PDUs from the first PDU set.

[0317] As an example, the value of N can be different for different PDU sets.

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

[0319] As an example, when the cancellation of the first DSR process that has not yet been completed is executed, at least some of the N PDCPSDUs are not transmitted.

[0320] As an example, the N PDCPSDUs are PDCPSDUs for the at least one logical channel.

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

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

[0323] As an example, the protocol headers of the N PDCPSDUs include the same identifier.

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

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

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

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

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

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

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

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

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

[0333] As an example, N is an explicit indication of a higher layer than the PDCP sublayer.

[0334] As one example, the explicit instructions include a fixed configuration.

[0335] As one example, the explicit indication includes QoS parameters.

[0336] As an example, N is implicitly indicated.

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

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

[0339] As an example, at least one of N or K is configured to include: N is configured.

[0340] As an example, at least one of N or K is configured to include: K is configured.

[0341] As an example, at least one of N or K is configured to include: N and K are configured.

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

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

[0344] As one embodiment, the configuration includes: the SDAP sublayer of the first node.

[0345] As one embodiment, the configured includes: the non-access layer configuration of the first node.

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

[0347] As an example, the fact that at least one of N or K is predefined includes: N being predefined.

[0348] As an example, the fact that at least one of N or K is predefined includes: K being predefined.

[0349] As an example, the requirement that at least one of N or K is predefined includes: N and K are predefined.

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

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

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

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

[0354] As an example, the ratio of K to N remains constant across different PDU sets.

[0355] As an example, the advantage of the above method is that it has low complexity.

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

[0357] As an example, K depends on N.

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

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

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

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

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

[0363] In one embodiment, in the first PDU set, some data packets were successfully sent, while others were not; or, in the data packets within the first PDU set, only some were successfully transmitted to the receiving end, while others failed to be transmitted to the receiving end.

[0364] In one embodiment, in the first PDU set and the second PDU set, a portion of the data packets were successfully sent, while a portion of the data packets were not successfully sent, including at least one PDU from the first PDU set that was not successfully sent; or, in the first PDU set and the second PDU set, only a portion of the data packets were successfully transmitted to the receiving end, while a portion of the data packets were not transmitted to the receiving end, including at least one PDU from the first PDU set that was 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; where P and Q1 are positive integers. The first PDU can be any PDU from the first PDU set, and the second PDU can be any PDU from the second PDU set.

[0366] In specific implementation, the meaning of "P PDUs are from the first PDU in the first PDU set" can include: the P PDUs are generated by the first PDU in the first PDU set.

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

[0368] In specific implementation, (P + Q1) < (N + X). Alternatively, (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.

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

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

[0372] As an embodiment, the first threshold 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, and F() is a function, and the output of F() is the first threshold.

[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 network-configured 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 small, F() is the product of X1 and a first value, and when X is large, F() is the product of X1 and another value greater than the first value.

[0381] As an embodiment, 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 X and 0.8.

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

[0383] As an example, F() can be defined as follows: 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, and when X1 is not less than 10, the output of F(X1) is the product of X1 and 0.8.

[0384] As another embodiment, F() can be defined as follows: 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 another embodiment, the first threshold may depend on the number of PDUs in the second PDU set that the receiver successfully receives.

[0386] As an example, 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] In another embodiment, the number of PDUs successfully transmitted by the sending end (e.g., (P+Q1) PDUs) may be less than a second threshold. The second threshold may be preset by the protocol, or be a default value, or be pre-sent 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 by a PDCP SDU.

[0390] As an example, 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 can send all PDCPPDUs or PDCP SDUs in the first PDU set and the second PDU set.

[0391] As an example, 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 some or all of the PDCP PDUs or PDCP SDUs in the first PDU set and the second PDU set in sequence.

[0392] As an example, in step S5103, the first node U01 continuously sends PDCPPDUs from the first PDU set and the second PDU set.

[0393] As an example, when transmitting, the PDCPPDUs in the first PDU set and the second PDU set need to be encapsulated into RLCPDUs and may undergo segmentation. After that, each RLCPDU is encapsulated into a MACPDU and then transmitted through the physical layer.

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

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

[0396] As an example, the first PDU set and the second PDU set are transmitted via AMDRB.

[0397] Correspondingly, the second node N02 receives PDUs from the first and second PDU sets in step S5201, but may only correctly decode a portion of them. Taking a PDCP PDU as an example, the second node N02 may only correctly receive the PDCPSDU from a portion of the PDCPPDU.

[0398] In step S5103, the first node U01 receives indication information. Specifically, before step S5103, the second node N02 executes step S5202 after step S5201, decoding the PDUs in the received first PDU set and second PDU set to determine the number of PDUs successfully received from the first PDU set. Then, in step S5202, indication information is generated and sent.

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

[0400] In one embodiment, the indication information can be used to indicate the number of PDUs successfully received by the receiving end from the first PDU set. For example, the number of first PDUs successfully received by the receiving end (second node N02) from the first PDU set 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 example, the protocol layer below the PDCP sublayer of the first node U01 indicates the received acknowledgment information to the PDCP sublayer of the first node.

[0403] As one example, the indication information is confirmation information from the protocol layer below the PDCP sublayer.

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

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

[0406] As one example, the indication information includes a PDCP status report.

[0407] As one example, the indication information includes the MAC CE of the MAC sublayer.

[0408] As one example, the indication information includes HARQ confirmation information.

[0409] As an example, only the PDCP SDU corresponding to the indication information is determined to be a correctly transmitted PDCP SDU.

[0410] As an example, only the PDCP SDU corresponding to the indication information is determined to be a transmitted PDCP SDU.

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

[0412] As an example, the advantages of the above method are that it can save signaling overhead and reduce latency.

[0413] Furthermore, after receiving the indication information, the first node U01 can execute step S5104, that is, 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 in the figure); otherwise, step S5104 is executed.

[0414] In one embodiment, determining whether to discard the remaining PDUs can be done by determining whether a first discard 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 (e.g., the second node N02) is not higher than a first threshold; the delay budget range of the PDUs to be transmitted (the PDUs remaining to be transmitted) is less than a preset time; and the number of PDUs successfully transmitted by the sending end (e.g., the first node U01) is less than a second threshold.

[0416] In specific implementation, the first discard condition applies to the first PDU set. The first discard condition is specifically set to determine whether to transmit the remaining first PDUs in the first PDU set.

[0417] It should be noted that the first discard condition is highly relevant to whether the remaining second PDUs in the second PDU centralized transmission are discarded or saved. In other words, whether the remaining second PDUs in the second PDU centralized transmission are discarded or saved depends on the first discard condition.

[0418] Further, in step S5105, the remaining PDUs from the transmission are discarded or stored based on the judgment result. Specifically, the first node U01 can obtain the judgment result using the first discard condition. Alternatively, the first node U01 can obtain the judgment result using both the first and second discard conditions.

[0419] In one embodiment, if the first discard condition is met, the first node U01 discards the first PDU set and 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 and transmits all remaining data packets, and discards the second PDU set and transmits all remaining data packets.

[0421] In one embodiment, if the first discard condition is met and the first node U01 has transmitted all data packets in the first PDU set, then 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 latency budget range of the PDU to be transmitted is less than a preset time. If the first node U01 expects that the latency budget range of the remaining PDUs in the first PDU set is less than the preset time, then the first node U01 discards the first PDU set, transmits the remaining one or more data packets, and discards the second PDU set, transmits the remaining one or more data packets.

[0423] In one embodiment, the first discard condition is that the latency budget of the PDUs to be transmitted is less than a preset time. If all data packets in the first PDU set are sent, but some data packets are not successfully sent, and if the first node U01 anticipates that it cannot complete the transmission of the remaining data packets in the second PDU set within the latency budget, then it abandons the transmission of the remaining one or more data packets.

[0424] In one embodiment, if the first node U01 has already 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 abandon the transmission of the remaining one or more data packets.

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

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

[0427] Example 6

[0428] Example 6 illustrates another wireless signal transmission flowchart according to an embodiment of this application, as shown in Figure 6. In Figure 6, U01 corresponds to the first node, and N02 corresponds to the second node.

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

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

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

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

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

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

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

[0436] Similar to Embodiment 5, Steps S6101 and S6102 in Embodiment 6 can refer to Steps S5101 and S5102 in Embodiment 5. After that, 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 specific implementation, the first node U01 executes Step S6104 to determine whether the first discard condition for the first PDU set is satisfied. The first discard condition can include at least one of the following: the number of PDUs successfully received by the receiving end (such as the second node N02) is not higher than the first threshold; the time delay budget range of the PDUs to be transmitted (the remaining PDUs to be transmitted) is less than the preset time; and the number of PDUs successfully sent by the sending end (such as the first node U01) is less than the second threshold.

[0438] In Step S6105, based on satisfying the first discard condition, the first node U01 can discard at least a part of the remaining PDUs to be transmitted in the first PDU set and discard at least a part of the remaining PDUs to be transmitted in the second PDU set.

[0439] In specific implementation, the first discard condition can 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 time delay budget range of the PDUs 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 embodiment, if the first node U01 does not receive the indication information within the preset time interval, it can be assumed that the second node N02 has successfully received Y first PDUs in the first PDU set, Y < P, and Y is a positive integer. The value of Y can be calculated by various suitable algorithms that the first node U01 has.

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

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

[0443] In one embodiment, when the first discard condition is met, the first node U01 discards the first PDU set and transmits all remaining PDUs, and discards the second PDU set and transmits all remaining PDUs.

[0444] Those skilled in the art will understand that steps S6101 to S6102, S6104 and S6105 can be referred to the relevant description of the embodiment shown in FIG5, and will not be repeated here.

[0445] Example 7

[0446] Example 7 illustrates another wireless signal transmission flowchart according to an embodiment of this application, as shown in Figure 7. In Figure 7, 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 or the order of implementation in this application, and the steps within F71 are optional.

[0447] In this embodiment, steps S7101-S7104 and S7201 are similar to steps S6101-S6104 and S6201 in embodiment 6. Please refer to embodiments 5 and 6, as well as Figures 5 and 6.

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

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

[0450] As an example, the third threshold may be a default value, or a network-preconfigured value, or a protocol-preset value.

[0451] As an example, the fourth threshold may be a default value, or a network-preconfigured value, or a protocol-preset value.

[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 transmitted by the first node U01 is less than the fourth threshold; or, in the second PDU set, the latency budget range for transmitting the remaining PDUs is less than the preset time.

[0453] In practice, the second discard condition applies to the second PDU set. The second discard condition is specifically set to determine whether to transmit the remaining second PDUs within the second PDU set.

[0454] As an example, if the first discard condition is not met but the second discard condition for the second PDU set is met, the PDUs in the first PDU set are not discarded.

[0455] As an example, if the first discard condition is not met but the second discard 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 understand that the remaining steps can be referred to the relevant descriptions of the embodiments shown in Figures 5 and 6, and will not be repeated here.

[0457] Example 8A

[0458] Example 8A illustrates a partial schematic diagram of another wireless signal transmission process according to an embodiment of this application, as shown in Figure 8. In Figure 8, 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 or the order of implementation in this application, and the steps within F81 are optional.

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

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

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

[0462] In specific implementation, the first node U01 stores the first PDU in the first PDU set and the second PDU in the second PDU set. The first PDU is the source PDU, and the second PDU can be a repair PDU, which is a repair PDU generated based on the first PDU.

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

[0464] The PDU set importance (PSI) of the first PDU set is higher than that of the second PDU set. It should be noted that PSI represents a parameter used to indicate the importance of a PDU set; Y ≤ P, and Y and 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, it indicates that the PDU set is more important. In step S8101, the PSI value of the second PDU set is less than the PSI value of the first PDU set. Conversely, if the value of the parameter PSI is smaller, it indicates that the PDU set is more important. In step S8101, the PSI value of the second PDU set is greater than the PSI value of the first 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 at least Q2 second PDUs, which is beneficial for the receiving end second node N02 to successfully obtain the first PDU set.

[0468] Subsequently, the first node U01 executes step S8102, that is, sends the at least Q2 second PDUs from the second PDU set. In conjunction with other embodiments, when the first node U01 is allowed to send data, the at least Q2 second PDUs from the second PDU set can be sent to the second node N02, making it more likely that the second node N02 will successfully receive the first PDU set.

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

[0470] Example 8B

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

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

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

[0474] Example 9A

[0475] Example 9A illustrates a partial schematic diagram of another wireless signal transmission process according to an embodiment of this application, as shown in Figure 9. In Figure 9, U01 corresponds to the first node, and N02 corresponds to the second node. The step within F91 is optional.

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

[0477] In specific implementation, the first node U01 stores the first PDU in the first PDU set and the second PDU in the second PDU set. The first PDU is the source PDU, and the second PDU can be a repair PDU, which is a repair PDU generated based on the first PDU.

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

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

[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 respectively, the first node U01 can determine the value of Q2, and the Q2 PDUs can be the second PDUs from the second PDU set.

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

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

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

[0484] Embodiment 9B

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

[0486] Embodiment 9B is similar to Embodiment 9A. The difference is that after the first node U01 determines the value of Q2 in step S9101, the following steps are executed: set the PDU set importance (PSI) value 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. Among them, 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] Specifically, 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 they can be selected by the first node U01 based on the correlation with the P sets of first PDUs that have been issued, or they can be selected based on the sequence number or order number of the PDUs in the second PDU set.

[0490] Example 10

[0491] Example 10 illustrates a partial schematic diagram of another wireless signal transmission process according to an embodiment of this application, as shown in Figure 10. In Figure 10, U01 corresponds to the first node, and N02 corresponds to the second node. The step within F101 is optional.

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

[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, the number of which is less than the total number of the first PDUs.

[0496] As an example, the values ​​of the first timers are all finite, not exceeding 2560 milliseconds.

[0497] As an example, the value of the first timer is the running time when the timer is not interfered with.

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

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

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

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

[0502] As an example, the first timer is a timer for the PDCP sublayer.

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

[0504] As an example, the duration of the first timer is configured at a higher level.

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

[0506] As a sub-implementation of this embodiment, the first node U01 can configure the first timer according to the instructions of the network.

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

[0508] In one embodiment, the MAC sublayer of the first node U01 generates a Delay Status Report (DSR) procedure. The DSR procedure is to provide the serving base station with the delay status of at least one logical channel, the delay status of which includes the remaining time, which is the minimum value of the remaining time of the first timers associated with the untransmitted PDCP SDUs for each of the at least one logical channel.

[0509] As an example, DSR is a MAC layer procedure. After a DSR procedure is initiated, it attempts to send a corresponding MACCE to the serving base station to carry latency status information. Due to high uplink load, unallocated resources, or priority transmission of other data, this MACCE may not be transmitted immediately. Therefore, DSRs that have not yet been completed can be cancelled at an appropriate time. A DSR procedure can be associated with N PDCPSDUs, that is, the DSR is to report the remaining time or minimum remaining time of the N PDCPSDUs so that the network can schedule the N PDCPSDUs in a timely manner.

[0510] As shown in Figure 10, in step S1001, the delayed information report that has not yet been completed is cancelled. The delayed information report is used at least to report the delay status of the logical channel corresponding to the first PDU set.

[0511] Step S1001 can be executed after step S6105 in 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, step S1001 can be executed to cancel the unfinished delay information report. 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 includes 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 example, initiating the DSR process includes generating a MAC control element (CE).

[0518] As an example, the MACCE is a DSRMACCE.

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

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

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

[0522] As an example, an unfinished DSR process is a Pending DSR process; or an unfinished DSR process is an incomplete DSR process; or an unfinished DSR process is a DSR process that has not yet been cancelled.

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

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

[0525] As an example, the serving cell of the first node U01 is configured to specify which logical channels belong to the same logical channel group.

[0526] As an example, the at least one logical channel is in units of a logical channel group.

[0527] As an example, the MAC CE reports the delay status on a logical channel group basis.

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

[0529] As an example, the DSR process is for providing the serving base station with the delay status of at least one logical channel; the DSR process is for providing the serving base station with the delay status of at least one logical channel group.

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

[0531] As an example, the at least one logical channel is used to transmit a set of PDUs.

[0532] As an example, 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 associated with each of the untransmitted PDCP SDUs for the at least one logical channel.

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

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

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

[0536] As an example, the first PDU in the first PDU set is a PDCPSDU, wherein a portion of the PDCPSDU is associated with discardTimerForLowImportance in a first timer; the remaining portion of the PDCPSDU is associated with discardTimer in a 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, or 1500, in milliseconds.

[0538] In one embodiment, the value of discardTimer can be set to 0.5, 1, 2, 4, 6, 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 less than discardTimer, discardTimerExt, or discardTimerExt2.

[0541] In one embodiment, the network can be configured with a maximum of 8 DRBs with discardTimerForLowImportance.

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

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

[0544] As an example, the meaning of the remaining time may include: the minimum value of the remaining time of the first timer associated with any of the untransmitted PDCPSDUs for the at least one logical channel is the remaining time.

[0545] As an example, the meaning of the remaining time may include: each of the untransmitted PDCPSDUs for the at least one logical channel is associated with a first timer, and the smallest of the remaining times of all the associated first timers is the remaining time.

[0546] As an example, the meaning of the remaining time may include: the remaining time of the most urgent PDCPSDU to be transmitted among the untransmitted PDCPSDUs 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 example, the meaning of the remaining time includes: when the remaining time of the first timer associated with the untransmitted PDCP SDU for the at least one logical channel changes to a certain extent, the first node U01 generates a DSRMACCE again.

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

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

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

[0551] As one implementation, when the discardTimer or discardTimerForLowImportance of a PDCP SDU times out, the entity transmitting the PDCP will handle the situation differently depending on the circumstances. For example, if pdu-SetDiscard is configured, all PDCP SDUs in the PDU set to which the PDCP SDU belongs, along with their corresponding PDCP data PDUs, will be discarded. It should be noted that even PDCP PDUs subsequently received from the upper layer will be discarded if they belong to the same PDU set. Conversely, if pdu-SetDiscard is not configured, the PDCP SDU and its corresponding PDCP data PDUs can be discarded.

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

[0553] For signaling radio bearers (SRBs), when a higher layer requests the discarding of PDCP SDUs, the PDCP entity should discard all stored PDCP SDUs and PDCP PDUs.

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

[0555] In practice, the discardTimer is only configured for the Data Radio Bearer (DRB). The duration of this discardTimer can be configured at higher layers. A new discardTimer can be started when a higher-layer SDU is received.

[0556] In practice, the discardTimerForLowImportance timer is configured only for the DRB. The duration of this 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 practice, if discardTimerForLowImportance is configured and the PDU Set Importance (PSI) based on the SDU is activated, and the PDCP SDU belongs to a low-importance PDU set, then discardTimerForLowImportance associated with this PDCP SDU can be enabled. Otherwise, if a discardTimer associated with the PDCP SDU is configured, then that discardTimer can be enabled. Here, PSI represents the importance of a PDU set relative to other PDU sets in the QoS flow.

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

[0559] Example 11

[0560] Example 11 illustrates a schematic diagram of N PDCPSDUs according to an embodiment of this application, as shown in Figure 11.

[0561] Figure 11 shows the N PDCPSDUs, the size of which is not limited.

[0562] As an example, the N PDCPSDUs arrive in sequence, and the assigned PDCP sequence numbers are consecutive.

[0563] As an example, the N PDCPSDUs are source PDCP SDUs.

[0564] As one embodiment, the N PDCPSDUs serve as the first PDU in the first PDU set. The X second PDCP SDUs in the second PDU set are generated based on the N PDCPSDUs. Where N > X.

[0565] As an embodiment, the N PDCPSDUs arrive within a period of time.

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

[0567] As an embodiment, the N is variable.

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

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

[0570] As an embodiment, the variable means that the protocol layer above the PDCP sublayer continuously generates PDCPSDUs, and when the PDCP sublayer receives a PDCPSDU, it increases N by 1.

[0571] As an embodiment, the K is fixed.

[0572] As an embodiment, the K is predefined, and its meaning includes: the K is fixed.

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

[0574] As an embodiment, the advantage of the above method is that it has strong adaptability and has good performance for time - varying channel environments.

[0575] Embodiment 12

[0576] Embodiment 12 illustrates a schematic diagram of generating at least one second PDCPSDU from a first PDCPSDU among N PDCPSDUs according to an embodiment of the present application, as shown in Figure 12. Among them, the second PDU in other embodiments may refer to the second PDCP SDU, and the first PDU may refer to the first PDCP SDU; the second PDU set may refer to the second PDCPSDU set, and the first PDU set may refer to the second PDCPSDU set.

[0577] As an embodiment, the second PDCPSDU is generated from the first PDCPSDU.

[0578] As an embodiment, each PDCPSDU in the second PDCPSDU set is generated from multiple PDCPSDUs in the first PDCPSDU set.

[0579] As an example, the first node generates the second PDCPSDU based on the first PDCPSDU according to a fixed algorithm.

[0580] As an example, the first node generates the second PDCPSDU at a protocol layer above the PDCP sublayer.

[0581] As an example, the protocol layer above the PDCP sublayer includes the SDAP sublayer.

[0582] As an example, the protocol layer above the PDCP sublayer includes the RTP layer.

[0583] As an example, the protocol layer above the PDCP sublayer includes the application layer.

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

[0585] As an example, the fixed algorithm is an error correction algorithm.

[0586] As an example, the fixed algorithm is a repair algorithm.

[0587] As an example, the fixed algorithm is an encoding algorithm.

[0588] As an example, generating at least one second PDCPSDU from N PDCPSDUs using a first PDCPSDU involves performing an XOR operation between one of the first PDCPSDUs and another of the first PDCPSDUs.

[0589] As a sub-implementation of this embodiment, when one of the first PDCPSDU sets is different in size from the other in the first PDCPSDU set, the smaller one is filled in so that the two are the same size after processing.

[0590] As a sub-implementation of this embodiment, when one of the first PDCPSDU sets has a different size than the other in the first PDCPSDU set, the smaller one is rate-matched so that the two are the same size after processing.

[0591] As a sub-implementation of this embodiment, when one of the first PDCPSDU sets is different in size from the other in the first PDCPSDU set, redundancy is added to the smaller one to make the two sizes the same after processing.

[0592] As a sub-implementation of this embodiment, when one of the first PDCPSDU sets is different in size from the other in the first PDCPSDU set, the larger one is truncated so that the two are the same size after processing.

[0593] As a sub-implementation of this embodiment, when multiple PDCPSDUs in the first PDCPSDU set generate a second PDCPSDU, and the multiple PDCPSDUs in the first PDCPSDU set are of different sizes, methods similar to those described above, such as padding, rate matching, adding redundancy, truncation, etc., can be adopted to make the multiple PDCPSDUs after processing the same size.

[0594] As a sub-implementation of this embodiment, the generation of a PDCPSDU in the second PDCPSDU set from which PDCPSDUs in the first PDCPSDU set are random.

[0595] As a sub-implementation of this embodiment, the generation of a PDCPSDU in the second PDCPSDU set from which Z PDCPSDUs in the first PDCPSDU set are generated is random, where Z is a positive integer.

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

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

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

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

[0600] Example 13

[0601] Example 13 illustrates a schematic diagram of K depending on N according to an embodiment of this application, as shown in Figure 13.

[0602] As an example, the meaning of K depending on N includes: K is the product of N and a coefficient.

[0603] As an example, the coefficients are configured by the network.

[0604] As one example, the coefficient is indicated by QoS information. In specific implementations, the QoS information is generated at the RRC layer or the non-access layer.

[0605] As an example, the coefficients are determined by a higher layer of the first node, such as the application layer.

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

[0607] As an example, the coefficient is used to measure reliability.

[0608] As an example, K increases as N increases.

[0609] As an example, when N is within a first value range, K is the product of N and a coefficient.

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

[0611] As an example, the first value range is orthogonal to the second value range.

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

[0613] As one example, the second value range includes at least one positive integer.

[0614] As an example, the other coefficient is configured by the network.

[0615] As an example, the other coefficient is indicated by the QoS information.

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

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

[0618] As an example, the coefficient is different from the other coefficient.

[0619] As an example, the coefficient is greater than the other coefficient.

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

[0621] As an example, the advantages of the above method include: better applicability to performance differences of N under different value ranges, and more reliable performance.

[0622] Example 14

[0623] Example 14 illustrates a device structure block diagram of a first node according to an embodiment of the present application; as shown in Figure 14. In Figure 14, the device 14 in the first node includes a first processor 1401, a first transmitter 1402, and a first receiver 1403.

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

[0625] In one embodiment, the apparatus 14 may include: a first processor 1401, which discards at least a portion of the PDUs in the second PDU set when the first discard condition is not met but a second discard condition for the second PDU set is met, wherein the second discard condition is used to determine whether to discard the second PDU set.

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

[0627] The number of PDUs successfully received by the receiver does not exceed the third threshold;

[0628] The latency budget range for the PDU to be transmitted is less than the preset time;

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

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

[0631] The number of PDUs successfully received by the receiving end does not exceed the first threshold;

[0632] The latency budget range for the PDU to be transmitted is less than the preset time;

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

[0634] In one embodiment, the apparatus 14 may include: a first processor 1401 generating a second PDU based on a first PDU before determining whether the first discard condition is met; a first transmitter 1402 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; wherein P and Q1 are both positive integers.

[0635] In one embodiment, the first PDU set contains N first PDUs, which are generated from N PDCP SDUs respectively; the second PDU set contains X second PDUs, where N>(K+X), N is a positive integer, and the values ​​of K and X depend on N; where (P+Q1)<(K+X).

[0636] In one embodiment, the terminal assumes that the receiving end successfully receives Y first PDUs in the first PDU set; the device 14 includes: a 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.

[0637] In a variation embodiment, the apparatus 14 may include: a first receiver 1403, receiving indication information for indicating that the receiver has successfully received Y PDUs from the first PDU set; a first processor 1401, determining the value of Q2, and sending at least Q2 second PDUs from the second PDU set; wherein Y≤P, and Y is a positive integer.

[0638] 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.

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

[0640] In a specific implementation, before sending at least Q2 PDUs, the first processor 1401 sets 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.

[0641] In one embodiment, the apparatus 14 may include: 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 apparatus 14 further includes: the first processor 1401 cancels an uncompleted delay information report, and the delay information report is at least used to report the delay status of a logical channel corresponding to the first PDU set.

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

[0643] As one embodiment, the first node is a terminal supporting large time delay differences.

[0644] As one embodiment, the first node is a terminal supporting NTN.

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

[0646] As one embodiment, the first node is a vehicle-mounted terminal.

[0647] As one embodiment, the first node is a relay.

[0648] As one embodiment, the first node is a ship.

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

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

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

[0652] As one embodiment, the first node is a node supporting multicast.

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

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

[0655] Those skilled in the art will understand that all or part of the steps in the above methods can be implemented by a program instructing related hardware, and the program can be stored in a computer-readable storage medium, such as a read-only memory, hard disk, or optical disk. Optionally, all or part of the steps in the above embodiments can also be implemented using one or more integrated circuits. Accordingly, each module unit in the above embodiments can be implemented in hardware or in the form of software functional modules. This application is not limited to any specific combination of software and hardware. The user equipment, terminal, and UE in this application include, but are not limited to, drones, communication modules on drones, remote-controlled aircraft, aircraft, small aircraft, mobile phones, tablets, laptops, vehicle-mounted communication equipment, wireless sensors, internet cards, IoT terminals, RFID terminals, NB-IoT terminals, MTC (Machine Type Communication) terminals, eMTC (enhanced MTC) terminals, data cards, internet cards, vehicle-mounted communication equipment, low-cost mobile phones, low-cost tablets, satellite communication equipment, ship communication equipment, NTN user equipment, and other wireless communication equipment. The base station or system equipment in this application includes, but is not limited to, macrocell base stations, microcell base stations, home base stations, relay base stations, gNB (NR Node B), TRP (Transmitter Receiver Point), NTN base stations, satellite equipment, flight platform equipment, and other wireless communication equipment.

[0656] This application may be implemented in other specified forms without departing from its core or essential characteristics. Therefore, the embodiments disclosed herein should in any way be considered descriptive rather than restrictive. The scope of this application is defined by the appended claims rather than the foregoing description, and all modifications within their equivalent meaning and scope are considered to be included therein.

Claims

1. A wireless communication method for use in a terminal, characterized in that, include: Determine whether the first discard condition for the first PDU set is met; Based on satisfying the first discarding 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. In this case, any PDU in the second PDU set is generated based on the PDUs in the first PDU set.

2. The wireless communication method according to claim 1, characterized in that, include: If the first discard condition is not met but the second discard condition for the second PDU set is met, at least a portion of the PDUs in the second PDU set are discarded. The second discard 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 does not exceed the first threshold; The latency budget range for 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 discard condition is met, the wireless communication method includes: Generate a second PDU based on the first PDU; Send (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; Where P and Q1 are both positive integers.

5. The wireless communication method according to claim 4, characterized in that, The first PDU set contains N first PDUs, which are generated from N PDCP SDUs respectively; The second PDU set contains X second PDUs, N>(K+X), where N is a positive integer, and the values ​​of K and X depend on N; Where (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 from the first PDU set; the wireless communication method includes: Determine the value of Q2, and set 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 that of the second PDU set, Y≤P, and Y and Q2 are positive integers.

7. The wireless communication method according to claim 4 or 5, characterized in that, include: Receive indication information, the indication information being used to indicate that the receiving end has successfully received Y PDUs from the first PDU set; Determine the value of Q2, and send at least Q2 of the second PDUs from the second PDU set; Where Y≤P, and Y and Q2 are positive integers.

8. The wireless communication method according to claim 7, characterized in that, Before transmitting at least Q2 second PDUs from the second PDU set, the wireless communication method includes: Set 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 PDU set importance of the first PDU set is higher than that of the second PDU set.

9. The wireless communication method according to claim 4 or 5, characterized in that, It includes: 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 PDU set importance of at least Q3 second PDUs to the PDU set importance of the first PDU set; Among them, the PDU set importance of the first PDU set is higher than that 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 at least one timer of the first type is less than a preset time. The wireless communication method further includes: Canceling an unfinished 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, and 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