Data transmission method and apparatus, and storage medium and program product

Abstract

Provided in the present disclosure are a data transmission method and apparatus, and a storage medium and a program product. The data transmission method comprises: sending, on a transmission channel, data to be transmitted.

Description

Data transmission method and apparatus, storage medium, and program product

[0001] This application claims priority to Chinese Patent Application No. 202411389546.0, filed on September 29, 2024, the entire contents of which are incorporated herein by reference. TECHNICAL FIELD

[0002] The present disclosure relates to the technical field of communication, and in particular, to a data transmission method and apparatus, a storage medium, and a program product. BACKGROUND

[0003] With the accelerating process of commercialization of the 5th-generation mobile communication technology (5G), its characteristics such as high speed, large capacity, and low latency are profoundly changing various industries. SUMMARY

[0004] In one aspect, a data transmission method is provided, applied to a first node. The data transmission method includes: sending to-be-transmitted data on a transmission channel.

[0005] In another aspect, a data transmission method is provided, applied to a second node. The data transmission method includes: receiving to-be-transmitted data on a transmission channel.

[0006] In yet another aspect, a data transmission apparatus is provided, applied to a first node. The data transmission apparatus includes: a communication module configured to send to-be-transmitted data on a transmission channel.

[0007] In yet another aspect, a data transmission apparatus is provided, applied to a second node. The data transmission apparatus includes: a communication module configured to receive to-be-transmitted data on a transmission channel.

[0008] In yet another aspect, a communication apparatus is provided, which includes: a memory and a processor. The memory is coupled to the processor. The memory is configured to store computer program instructions executable by the processor. The processor implements the above-mentioned data transmission method when executing the computer program instructions.

[0009] In yet another aspect, a computer-readable storage medium is provided, and the computer-readable storage medium stores computer program instructions. When the computer program instructions are executed on a computer (for example, a communication apparatus or a data transmission apparatus), the above-mentioned data transmission method is implemented.

[0010] In yet another aspect, a computer program product is provided, which includes computer program instructions. When the computer program instructions are executed, the above-mentioned data transmission method is implemented. BRIEF DESCRIPTION OF DRAWINGS

[0011] FIG. 1 is a schematic diagram of an IMT-2030 application scenario according to an embodiment of the present disclosure.

[0012] FIG. 2 is an interactive flowchart of a data transmission method in a related art according to an embodiment of the present disclosure.

[0013] FIG. 3 is a schematic diagram of a structure of a communication system according to an embodiment of the present disclosure.

[0014] FIG. 4 is a flowchart of a data transmission method according to an embodiment of the present disclosure.

[0015] FIG. 5 is an interactive flowchart of a data transmission method according to an embodiment of the present disclosure.

[0016] FIG. 6 is a schematic diagram of a resource pattern corresponding to BSR repetition sending according to an embodiment of the present disclosure.

[0017] FIG. 7 is a schematic diagram of a data transmission process according to an embodiment of the present disclosure.

[0018] FIG. 8 is a schematic diagram of another data transmission process according to an embodiment of the present disclosure.

[0019] FIG. 9 is an interactive flowchart of another data transmission method according to an embodiment of the present disclosure.

[0020] FIG. 10 is a flowchart of another data transmission method according to an embodiment of the present disclosure.

[0021] FIG. 11 is an interactive flowchart of yet another data transmission method according to an embodiment of the present disclosure.

[0022] FIG. 12 is a schematic diagram of a structure of a time-frequency resource distribution according to an embodiment of the present disclosure.

[0023] FIG. 13A is a schematic diagram of a structure of a MAC CE according to an embodiment of the present disclosure.

[0024] FIG. 13B is a schematic diagram of a structure of another MAC CE according to an embodiment of the present disclosure.

[0025] FIG. 14 is a schematic diagram of yet another data transmission process according to an embodiment of the present disclosure.

[0026] FIG. 15 is a schematic diagram of a structure of a data transmission apparatus according to an embodiment of the present disclosure.

[0027] FIG. 16 is a schematic diagram of a structure of another data transmission apparatus according to an embodiment of the present disclosure.

[0028] FIG. 17 is a schematic diagram of a structure of a communication apparatus according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0029] The technical solutions in the embodiments of the present disclosure will be described clearly and completely in combination with the accompanying drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only part of the embodiments of the present disclosure, rather than all the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by those of ordinary skill in the art without creative effort belong to the scope of protection of the present disclosure.

[0030] In the description of the present disclosure, unless otherwise specified, " / " means "or", for example, A / B can mean A or B. "And / or" in this document is only used to describe the association relationship of the associated objects, which means that there can be three relationships. For example, A and / or B can mean: only A, only B, and A and B. In addition, "at least one" means one or more, and "multiple" means two or more. "First", "second", and the like do not limit the quantity and execution order of the objects, and "first", "second", and the like do not necessarily mean that the limited objects are different.

[0031] It should be noted that in the present disclosure, "exemplary" or "for example" and the like are used to describe examples, illustrations, or descriptions. Any embodiment or design scheme described in the present disclosure by "exemplary" or "for example" and the like should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the use of "exemplary" or "for example" and the like is intended to present the relevant concept in a specific manner.

[0032] For 6G, the international telecommunication union (ITU) has published a series of framework and target files on the research and development direction of international mobile telecommunications-2030 (IMT-2030) for 2030 and beyond to face the deployment of IMT-2030 for the future. Through 6G, an endogenous information society is built to achieve the sustainable development strategy, and its goals include: inclusiveness, ubiquitous connectivity, sustainability, innovation, enhanced privacy protection and security, standardization and interoperability, etc. The applications and services enabled by IMT-2030 are expected to connect people, machines and other different objects, and the trends are reflected in: ubiquitous artificial intelligence, ubiquitous computing power, immersive multimedia and multi-sensory interaction, digital twin and virtual world, smart industry, digital health, ubiquitous connectivity, fusion sensing communication, sustainable development, etc. Both the air interface and the wireless network need to be enhanced. The air interface involves enhanced coding technology. Enhanced waveform design includes orthogonal, bi-orthogonal and non-orthogonal, non-orthogonal multiple access and license-exempt access, extreme multiple input multiple output (MIMO) (E-MIMO), self-interference cancellation technology in full-duplex systems, surface wave communication (e.g., reconfigurable intelligence surface (RIS)), holographic radio, angular momentum communication, communication below 1 THz and in 1 THz frequency band, ultra-high accuracy positioning technology, etc. Technology-enabled wireless networks include quality of service (QoS) guarantee mechanisms, deterministic wireless networks, fusion-driven radio access network (RAN) structure, wireless access network with endogenous artificial intelligence technology (AI RAN), network node cooperation and aggregation, user equipment (UE) -centric network (UCN), digital twin network, interoperability with non-terrestrial networks (NTN), ultra dense network (UDN), etc.

[0033] The new application scenarios proposed for IMT-2030 are extensions of the three scenarios proposed for IMT-2020, as shown in Figure 1, including: Immersive Communication, Hyper Reliable and Low-Latency Communication, Massive Communication, Ubiquitous Connectivity, Integrated Artificial Intelligence and Communication, and Integrated Sensing and Communication.

[0034] Immersive Communication: an extension from the Enhanced Mobile Broadband (eMBB) scenario, including immersive XR, remote multi-sensory telepresence, and holographic communications.

[0035] Hyper Reliable and Low-Latency Communication: an extension from the URLLC scenario, including fully automated industrial communications, such as robot interaction, emergency services, remote medical care, and power transmission and distribution monitoring.

[0036] Massive Communication: an extension from the Massive Machine-Type Communications (mMTC) scenario, providing extended and new applications in smart cities, transportation, logistics, health, energy, environmental monitoring, agriculture, and many other areas, such as Internet of Things devices that require various battery-free or long-life batteries.

[0037] Ubiquitous Connectivity: focusing on areas that are currently not covered or have little coverage.

[0038] Integrated Artificial Intelligence and Communication: including assisted autonomous driving, autonomous collaboration between devices for medical assistance applications, offloading of heavy computing operations across devices and networks, creation and prediction of digital twins, and IMT-2030-assisted collaborative robots.

[0039] Sensing communication: typical scenarios include assisted navigation, activity detection and motion tracking (e.g., gesture recognition, fall detection, vehicle / pedestrian detection), environment monitoring (e.g., rain / pollution detection), and providing sensing data / information about the surrounding environment for artificial intelligence (AI), extended reality (XR), and digital twin applications.

[0040] In order to meet the requirements of ultra-reliable and low-latency communication, deep optimization is needed at each link of data transmission. From the source of data generation, to the data reaching the communication system and requesting transmission resources, to receiving scheduling information and completing data transmission, each step in this series of processes needs to reduce latency as much as possible.

[0041] Exemplarily, as shown in FIG. 2, in a ground network communication system, after the uplink data is generated, reaches the communication system of the UE, and especially reaches the data buffer of the medium access control (MAC) layer of the UE, the UE can send a control signaling of a scheduling request (SR) to request uplink data scheduling from the base station or the network side. The base station (BS) or the network sends a first scheduling signaling to allocate a first uplink resource, and the UE transmits a buffer status report (BSR) to the base station or the network on the allocated first uplink resource. The base station or the network further allocates the required resources of the actual data according to the data buffer status report (including the data amount or data priority of the data to be transmitted) reported by the UE. The base station or the network dynamically configures a second uplink resource allocation by sending a second scheduling signaling, and the UE transmits the data in the data buffer on the allocated second uplink resource. The first uplink resource and / or the second uplink resource can be a physical uplink shared channel (PUSCH).

[0042] The first scheduling signaling or the second scheduling signaling in the present disclosure has other names. For example, the scheduling signaling can be referred to as scheduling grant signaling, scheduling grant information, etc., and the present disclosure does not limit this. When the scheduling signaling includes uplink scheduling grant information, the scheduling signaling can be indicated in the form of downlink control information.

[0043] In some embodiments, in the present disclosure, transmission includes sending or receiving. For example, sending data or signals, receiving data or signals.

[0044] The transmission of scheduling request (SR) is mainly done through physical uplink control channel (PUCCH). The base station can configure periodic SR resources, allowing the UE to send SR within a predetermined time period. SR can be transmitted according to the pre-configured periodic resources, which means that the UE sends SR to the base station within a predetermined time interval. If the UE has data to be sent within the specified SR period, it will use the configured PUCCH resource to send the SR signal. SR is usually transmitted using PUCCH Format 0 or Format 1. The way SR is transmitted using PUCCH is the most common, usually used for periodic request of uplink resources by UEs in connected state.

[0045] In addition, SR can also be transmitted through PUSCH or physical random access channel (PRACH) to adapt to different network states and needs, for resource request in specific scenarios and conditions.

[0046] When the UE transmits other data on PUSCH, SR can be included in the same transport block at the same time. This usually happens when the UE already has uplink resources and needs to request more uplink resources. For example, when the UE transmits data, it initiates a resource request through a MAC layer control element (MAC CE), which can contain SR. This way allows the UE to dynamically request more resources during data transmission.

[0047] When the UE is in a connected state (such as RRC_IDLE or RRC_INACTIVE state) and needs uplink transmission resources, it can initiate a random access process through PRACH and implicitly request resources in the random access message. This way is usually used for initial access or reconnection.

[0048] BSR of UE is a kind of uplink control information (MAC CE) to let the base station know the data amount or data priority of the data to be transmitted in the transmission buffer of the UE, helping the base station to schedule resources and optimize the use of uplink resources. BSR as a MAC CE is carried by PUSCH and is configured by the base station or network for the UE to transmit on the first uplink transmission resource.

[0049] BSR is divided into at least the following three types according to its use and reporting range.

[0050] 1. Short BSR (Short Buffer Status Report): The short BSR reports the buffer status of only one logical channel group (LCG). When the UE needs to report the status of only one LCG, the short BSR is used, and its payload size is 1 byte (8 bits).

[0051] 2. Long BSR (Long Buffer Status Report): The long BSR reports the buffer status of all four logical channel groups (i.e., LCG 0 to LCG 3), and its payload size is 3 bytes (24 bits).

[0052] 3. Truncated BSR (Truncated Buffer Status Report): The truncated BSR reports the status of one or more LCGs, but contains less information than the short BSR, and is used for emergency situations, such as when system information needs to be updated or high-priority data arrives. Its payload size is 1 byte (8 bits).

[0053] There are generally four cases of trigger conditions for the BSR.

[0054] 1. New data arrives in the buffer: When new data arrives in the uplink buffer of the UE, the BSR can be triggered, especially when there are no available uplink resources to transmit the data.

[0055] 2. Change in available resources: When the UE obtains a new uplink resource allocation (e.g., the base station allocates PUSCH resources through PDCCH), if these resources are not sufficient to transmit all the data to be sent, the UE will request more resources through the BSR.

[0056] 3. Timer expires: When the BSR timer expires, the UE needs to send a BSR to update the base station's information about the buffer status.

[0057] 4. Priority change: When the priority of a certain logical channel of the UE changes, the change also needs to be reflected by sending a BSR to ensure that high-priority data is transmitted in a timely manner.

[0058] With reference to FIG. 2, the BSR is usually transmitted by a MAC CE on the PUSCH. If there is no available uplink resource, the UE can first need to send a scheduling request (SR) to request uplink resources. After the base station allocates uplink resources, the UE transmits the BSR on these resources. Then, after obtaining the re-uplink scheduling grant information from the base station, the UE can transmit the formal data. This process requires the UE to request twice from the base station or the network, and the base station or the network to allocate uplink transmission resources at least twice in succession, before the formal data can be transmitted. Although the transmission handshake process between the base station and the UE is very robust, it also causes a long delay between triggering the BSR and completely transmitting the data, which is not suitable for the needs and development trends of future mobile communications, and needs to be further optimized and reduced.

[0059] One way to reduce the delay is to reduce the communication handshake process from two requests or reports to one application or report, and the step of sending dynamic control signaling in the downlink to schedule uplink transmission resources is also reduced to one step, which can significantly improve the delay. In this disclosure, the delay of data uplink transmission can be improved by removing the request (i.e., SR) in the first step or removing the report (i.e., BSR) in the second step.

[0060] Alternatively, further, by indicating the contention-based PUSCH transmission through the prior message of the PUSCH, the scheduling grant process can be omitted. Alternatively, by predicting the future BSR, the number of BSR reports can be saved, and the scheduling grant can be performed in advance.

[0061] The data transmission method provided by the embodiments of the present disclosure can be applied to systems of various communication modes. For example, the data transmission method provided by the embodiments of the present disclosure can be applied to systems including but not limited to: a long term evolution (LTE) system, various versions based on LTE evolution, a 5G system, an ambient internet of things (Ambient IoT) communication system, and the like. In addition, the data transmission method provided by the embodiments of the present disclosure can also be applied to future-oriented communication systems (for example, a 6G communication system) and the like.

[0062] In the embodiments of the present disclosure, the network architecture of a mobile communication network (including but not limited to 3G, 4G, 5G and future mobile communication networks) can at least include a first communication node and a second communication node. It should be understood that in the present example, in the downlink, the first communication node can be a network side device (for example, including but not limited to a base station), and the second communication node can be a terminal side device (for example, including but not limited to a terminal). Of course, in the uplink, the first communication node can also be a terminal side device, and the second communication node can also be a network side device. In the communication between the two communication nodes, the first communication node and the second communication node can both be base stations or terminals. The first communication node and the second communication node can be referred to as the first node and the second node, respectively.

[0063] Exemplarily, taking the first node as a base station and the second node as a terminal as an example. As shown in FIG. 3, it is a structural schematic diagram of a communication system according to an embodiment of the present disclosure. The communication system includes a terminal 10 and a base station 20. The terminal 10 and the base station 20 can be one or more, and the number is not limited.

[0064] In some embodiments, the base station 20 provides a wireless access service for the terminal 10. One base station 20 provides at least one service coverage area (also referred to as a cell). The terminal 10 entering the area can communicate with the base station 20 through a wireless signal to receive the wireless access service provided by the base station 20.

[0065] In some embodiments, the base station can be a base station or an evolved node B (eNB or eNodeB) in LTE or long term evolution advanced (LTE-A), a base station device in a 5G network, or a base station in a future communication system, etc. The base station can include various macro base stations, micro base stations, home base stations, wireless remote devices, reconfigurable intelligent surfaces (RISs), routers, relays, TRPs (transmission and reception points), wireless fidelity (WIFI) devices, and various network side devices.

[0066] In some embodiments, the terminal can be a device with wireless transceiving function. The terminal can be a passive device, an ambient loT device, a mobile phone, a Pad, a computer with wireless transceiving function, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in self driving, a wireless terminal in remote medical, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, and the like. Embodiments of the present disclosure are not limited to the application scenarios. The terminal can also be referred to as a user, a UE, an access terminal, a UE unit, a UE station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a UE terminal, a wireless communication device, a UE agent, or a UE apparatus, and the like. Embodiments of the present disclosure are not limited thereto.

[0067] It should be noted that FIG. 3 is only an exemplary framework diagram, the number of devices included in FIG. 3, and the name of each device are not limited, and in addition to the devices shown in FIG. 3, the communication system can also include other devices, such as core network devices.

[0068] The application scenarios of embodiments of the present disclosure are not limited. The system architecture and business scenarios described in the embodiments of the present disclosure are used to more clearly illustrate the technical solutions of the embodiments of the present disclosure, and do not constitute a limitation on the technical solutions provided by the embodiments of the present disclosure. It can be known by those skilled in the art that, with the evolution of network architecture and the appearance of new business scenarios, the technical solutions provided by the embodiments of the present disclosure are also applicable to similar technical problems.

[0069] Embodiments of the present disclosure provide a data transmission method. As shown in FIG. 4, the data transmission method includes the following S101.

[0070] In S101, the first node sends the to-be-transmitted data to the second node on the transmission channel. Correspondingly, the second node receives the to-be-transmitted data sent by the first node on the transmission channel.

[0071] The transmission channel in the present disclosure at least includes a physical shared channel. In the case of uplink transmission, the physical shared channel can be a PUSCH, and in the case of downlink transmission, the physical shared channel can be a PDSCH. The transmission channel also has other names, such as a transmission resource, an uplink resource, a downlink resource, etc., which can be determined according to different communication scenarios, and the present disclosure does not limit this.

[0072] In some embodiments, as shown in FIG. 5, S101 can be implemented as S201 to S203.

[0073] In S201, the first node directly sends the BSR to the second node. Accordingly, the second node receives the BSR sent by the first node.

[0074] In some embodiments, the first node directly sends the BSR to the second node when the trigger condition of the BSR is met. The trigger condition of the BSR can refer to the foregoing description and will not be repeated here.

[0075] In some embodiments, the transmission channel of the BSR includes at least one of the following: a non-scheduled physical shared channel, a contention-based physical shared channel, a semi-persistent scheduling physical shared channel, a physical control channel, and a random access channel (RACH). It can be understood that, in the case where the first node is a terminal and the second node is a base station, the non-scheduled physical shared channel can be a non-scheduled PUSCH, the contention-based physical shared channel can be a contention-based PUSCH, the semi-persistent scheduling physical shared channel can be a semi-persistent scheduling PUSCH, and the physical control channel can be a PUCCH.

[0076] If the BSR is transmitted by the physical control channel, whether it is a common physical control channel resource or a UE-specific physical control channel resource, due to the characteristics of the physical control channel resource configuration, there is basically no possibility of BSR collision or collision between multiple users. Since the load of the BSR itself is from 8 bits to 24 bits, if the necessary identification information or redundancy check information is added, the amount of data carried is not large, and it is very suitable for transmission in the physical control channel.

[0077] If the BSR is transmitted by the physical shared channel, the physical shared channel has at least two types. The first type is a non-scheduled physical shared channel, that is, a common or shared physical shared channel, and the second type is a UE-specific semi-persistent scheduling physical shared channel.

[0078] The BSR transmitted on the non-scheduled physical shared channel is a contention-based BSR, and different users can transmit BSRs on the same physical shared channel resource and there is a conflict and collision. The risk of the base station successfully demodulating the BSRs of different users is high, but the method of using a shared physical shared channel does not need to allocate static or semi-static dedicated resources, nor does it need dynamic downlink control information (DCI) signaling to allocate specific resources, and the resources are fully shared, which is beneficial to improve the resource utilization rate.

[0079] The BSR transmitted based on the UE-specific semi-persistent scheduling physical shared channel is dedicated to a certain user, and does not conflict with other users, which can be regarded as a non-contention-based BSR transmission. The disadvantage is that a specific dedicated transmission resource needs to be reserved for this user UE for a long time, and the resource utilization effectiveness is low.

[0080] The BSR can also be transmitted in the RACH random access process. This occurs in the idle (Idle) state or the connected state and at the same time when the uplink is out of synchronization. It can be regarded as a contention-based BSR transmission. Since the 2-step RACH can directly carry some small amount of physical shared channel load in the first step of initiating random access, it is more suitable for transmitting BSR. The 4-step RACH can also be used to transmit BSR. In the process of transmitting msg3 in the third step of random access, the related BSR can be transmitted on the msg3 PUSCH.

[0081] In some embodiments, in the case where the BSR is transmitted based on a contention mechanism, the buffer status report includes an identification of the first node.

[0082] Exemplarily, taking the first node as a UE and the second node as a base station as an example. In the case that the BSR transmitted based on the contention mechanism is transmitted on the shared uplink PUSCH resource, since there is no UE-specific resource configuration, the base station does not know which UE the corresponding BSR belongs to after successfully demodulating the BSR. Therefore, the load of the BSR transmitted based on the contention mechanism needs to include the identification information of the UE in addition to the data buffer information or the data priority information. When the UE is in the connected state, the identification information of the UE can be a C-RNTI (cell-radio network temporary identifier). When the UE is in the idle state, the identification information of the UE can be a temporary identification information, such as a TMSI (temporary mobile subscriber identity), or an IMSI (international mobile subscriber identity), or a GUTI (globally unique temporary identifier), or a randomly selected identification, or a P-RNTI (paging-radio network temporary identifier), etc.

[0083] In some embodiments, in the case that the BSR is transmitted based on the contention mechanism, the transmission configurations of different first nodes are different in at least one of the following: time advance, frequency offset.

[0084] In some embodiments, the time and / or frequency of the transmission of different first nodes to the second node are different. For example, in the case that the first node is a UE and the second node is a base station, the time and / or frequency of the uplink transmission channel of the BSR corresponding to different UEs to the base station are different.

[0085] In some embodiments, the frequency deviation (which can also be referred to as frequency offset) between the transmission configurations of different first nodes is less than or equal to a preset number of resource elements, and the time advance deviation (which can also be referred to as time offset) between the transmission configurations of different first nodes is less than or equal to one symbol.

[0086] In some embodiments, the time advance corresponding to the transmission configuration of the first node is determined based on a preconfigured time advance and a time offset.

[0087] In some embodiments, the demodulation reference signals of the transmission channels of the BSR of different first nodes are orthogonal.

[0088] In some embodiments, the configuration of the transmission channel of the BSR of different first nodes is different in at least one of the following: time domain resource of the transmission channel, frequency domain resource of the transmission channel, demodulation reference signal configuration parameter, modulation and coding scheme (MCS) configuration parameter, waveform parameter, antenna port, scrambling code configuration.

[0089] Exemplarily, taking the first node as a UE and the second node as a base station as an example. Since multiple users based on the BSR transmission of the competition mechanism (for example, the transmission channel of the BSR is a non-scheduled PUSCH or a PUSCH based on competition) may have the risk of conflict or overlap or mutual coverage in the same time-frequency domain resource, in order to distinguish multiple users as much as possible and ensure the demodulation success rate at the base station side, it is necessary to design a demodulation reference signal (DMRS) (also known as a pilot signal) of a PUSCH of multiple users that are orthogonal. The DMRS signal of multiple users that are orthogonal can be code domain orthogonal, that is, different orthogonal code sequences (such as Zadoff-Chu sequences, m sequences, Gold sequences, OVSF sequences, Walsh code sequences, etc.) are used to distinguish different pilot signals. A unique orthogonal code sequence is allocated to each UE to ensure that the pilot signal is orthogonal in the code domain. Since different orthogonal code sequences have low cross-correlation and high autocorrelation, the receiving end can use matched filtering or other correlation decoding methods to distinguish the signals of different UEs, and then further demodulate the related PUSCH data according to the DMRS. By designing orthogonal pilot signals, multiple users in an uplink synchronization state can demodulate data signals as much as possible even in the case of conflict or overlap or mutual coverage of PUSCH. The orthogonal pilot signal can also be used for PUSCH demodulation of multiple users in an uplink out-of-sync state.

[0090] If the multiple users are not assigned orthogonal DMRS signals for distinguishing, that is, the multiple users transmit BSR based on the contention mechanism, not only is there a risk of conflict or overlap or mutual covering on the same time-frequency domain resource, but there is also a risk of conflict or overlap in demodulating the DMRS signal. At this time, some special design methods are needed for distinguishing users. The base station can configure different timing advances (TA) for different users (UEs) to carry the PUSCH for BSR transmission, so that the time of arrival of the PUSCH of different users at the base station is slightly different, and the base station can identify the time interval of the PUSCH of different users through a more advanced receiver, and distinguish different users through the time interval. This TA will not exceed the length of a PUSCH symbol, and is generally controlled within the CP (cyclic prefix) of the PUSCH. It should be noted that the UE in the connected state has a pre-configured TA when it enters the connected state, which is determined by the random access process or the uplink synchronization process. The original purpose of this TA is to ensure that multiple UE transmissions can be synchronized (at the same time) to arrive at the base station. However, the purpose here is to intentionally cause the time of arrival of the UE in the connected state at the base station to be different, so the configured TA in the present disclosure is actually a TA offset based on the pre-configured TA. The base station can directly configure a sum of a TA and a TA offset, or can increase the configured TA offset in the case of a pre-configured TA. The terminal UE can also randomly select different TAs or TA offsets. At this time, since there is no base station coordination between different terminal users (UEs), there is still a certain risk of conflict in their random selection of TAs. Therefore, different TAs or TA offsets are configured for different UEs by the base station. If the user terminal is in an uplink out-of-synchronization state, the time of arrival at the base station cannot be predicted in advance. In this case, the out-of-synchronization user terminal (UE) can not be configured with a TA. Alternatively, instead of configuring different TAs for multiple users, the base station can also configure different frequency offsets for multiple users, and the base station can distinguish different users by detecting the small frequency offset between multiple users. This frequency offset is small, generally 1 resource element (RE) or several REs, and will not interfere with and affect the transmission of other users outside the common PUSCH region.

[0091] The base station can also identify and decode different user collision PUSCH channels by training a deep neural network, which can further improve the accuracy and robustness of demodulation. Deep machine learning models such as convolutional neural networks can learn the signal characteristics of each UE through model training, and use the trained deep learning model to extract the features of different user UEs from the received mixed signal, classify and demodulate the UEs respectively. Model training can be continuously optimized, and through large data sets and various channel conditions, the model can adapt to different interference and channel changes, further improving signal separation effect.

[0092] The above can basically guarantee the demodulation performance of the transmission channel where the contention-based BSR is transmitted by designing multi-user orthogonal DMRS, or configuring different time advance, frequency offset, or using deep learning model. However, it is not from the perspective of actively reducing the risk of collision to ensure the demodulation performance of the transmission channel. Obviously, actively reducing the multi-user collision risk of the transmission channel where the contention-based BSR is transmitted can further improve the success rate of the base station successfully demodulating the BSR reported by the user, and optimize the performance and delay of the whole transmission resource request process. In order to actively reduce the risk of collision and improve the success rate of BSR reporting and demodulation, at least the following two aspects can be further enhanced.

[0093] The first aspect is that multi-user collision resolution can be mitigated using resource partitioning, such as configuring multiple resource partitions for common PUSCH, and UEs selecting different resource partitions according to identification information. However, this method can only alleviate, not completely avoid, the risk of collision. Obviously, at least one resource partition needs to be allocated to the common PUSCH for transmitting contention-based BSR, which is determined by the base station or network and notified to the user terminal (UE). The PUSCH for contention BSR transmission in this resource partition can also be pre-configured by the base station or network with relevant resource parameters, such as time slot, symbol resource, physical resource block (PRB) or resource element (RE) resource, DMRS configuration parameter, MCS parameter (including modulation method, coding rate, etc.), waveform, antenna port used, data scrambling configuration parameter, etc. The PUSCH resource parameters configured in the resource partition may only have one set, or may have multiple sets, and a typical example is to configure PUSCH resource parameters for two BSR sizes of 8bit and 24bit load respectively.

[0094] The second aspect is that the base station can use deep machine learning models and related algorithms to predict the uplink resource demand and collision probability of UEs. By analyzing historical data and UE behavior, the base station can more accurately allocate resources and reduce the likelihood of collision.

[0095] In some embodiments, the first node repeatedly transmits the BSR based on a preset repetition transmission configuration. The preset repetition transmission configuration comprises at least one of the following: a buffer status report repetition transmission mode, a buffer status report repetition transmission number, and a resource pattern corresponding to the BSR repetition transmission.

[0096] In the case that the first node is a UE, the preset repetition transmission configuration can be configured to the UE by a base station or a network.

[0097] In this way, the retransmission of the BSR can also be directly repeated without waiting for the confirmation of the transmission failure. The repeated BSR forms a BSR group and is regarded as one BSR report. The repeatedly transmitted BSRs can be multiplexed in the same PUSCH and only occupy the resources of one PUSCH. The repeated BSRs can also be repeated in the granularity of the PUSCH. Or, the repeated BSRs are a mixture of the above two repetition modes, that is, some repeated BSRs are multiplexed in the same PUSCH and the PUSCH also needs to be repeatedly transmitted. The repetition mode and the number of repetitions can be configured to the user terminal (UE) by the base station or the network. The repeated BSR is a transmission redundancy, which can improve the detection probability and the demodulation success rate. Under the same performance requirement, it can also be converted to improve the coverage of the user terminal (UE).

[0098] When the BSR is repeatedly transmitted, if the user terminal (UE) randomly selects the next PUSCH resource, the collision risk of the BSR transmission based on the competition between multiple users can be randomized, thereby improving the demodulation success rate of the BSR. However, the way that the UE randomly selects the next PUSCH resource is a non-transparent behavior for the base station, and the base station needs to consume a large amount of resources for blind detection. Therefore, the base station can intervene in the selection of the PUSCH resource for the repeated transmission by the UE, for example, by configuring a resource pattern corresponding to the BSR repetition transmission. In this way, the collision risk can also be randomized, the demodulation success rate can be improved, and the blind detection difficulty of the base station is greatly reduced.

[0099] Exemplarily, as shown in FIG. 6, the first transmission of the BSR of two UEs collides on the same shared PUSCH, but the pattern position of the retransmission has been randomized, and the corresponding resource position no longer collides. The BSR of UE1 is collectively transmitted 3 times, and the number of repeated transmissions is 2 times, which are UE1 1 st BSR transmission, UE1 2 st BSR transmission, UE1 3 st BSR transmission. The BSR of UE2 is collectively transmitted 5 times, and the number of repeated transmissions is 4 times, which are UE2 1 st BSR transmission, UE2 2 stBSR transmission, UE2 3 st BSR transmission, UE2 4 st BSR transmission, UE2 5 st BSR transmission.

[0100] In S202, the second node sends second scheduling signaling to the first node in response to the BSR. Accordingly, the first node receives the second scheduling signaling from the second node in response to the BSR.

[0101] In some embodiments, the second scheduling signaling includes an identity of the first node, in case that the BSR is transmitted based on a contention mechanism.

[0102] Taking the first node as a UE and the second node as a base station as an example, the second scheduling signaling can be a downlink control signaling (DCI). The DCI includes uplink scheduling grant information, and the uplink scheduling grant information includes an identity of the UE.

[0103] Taking the first node as a UE and the second node as a base station as an example, the base station allocates scheduling resources of a PUSCH according to a data volume of a data buffer in the BSR or a priority of the data after receiving the BSR, and indicates the uplink scheduling grant information to the UE in the DCI. For the BSR transmitted based on the contention mechanism, since there is a BSR conflict between different users, the base station needs to explicitly indicate that the uplink scheduling grant information in the DCI is for a specific UE after successfully demodulating one or part or all of the BSRs. That is, the uplink scheduling grant information in the downlink control signaling (DCI) needs to carry an identity of the UE included in the BSR reporting process. After successfully detecting the DCI, the UE can confirm that the DCI is its own valid DCI signaling indication only if the identity of the UE parsed out is consistent with the identity of the UE in the first BSR reporting process, and then sends the subsequent PUSCH on the uplink resource in the uplink scheduling grant information indicated in the DCI.

[0104] In some embodiments, the second scheduling signaling includes an identity of the first node, and includes at least one of the following: a cyclic redundancy check (CRC) of the second scheduling signaling is scrambled using the identity of the first node;

[0105] The cyclic redundancy check of the second scheduling signaling is scrambled using a time-frequency domain resource number of a transmission channel of the BSR and / or a demodulation reference signal number of the transmission channel of the BSR; the identity of the first node is included in a content of a format of the second scheduling signaling; and the identity of the first node is included in a transmission channel corresponding to the second scheduling signaling.

[0106] In some embodiments, the first node receives the second scheduling signaling within a preset time window. The start time of the preset time window is the first symbol of the earliest control resource set of the physical control channel search space configured to the first node after the end of the transmission of the transmission channel of the BSR. The preset time window length is predefined or configured by high layer signaling. The preset time window can also be referred to as a waiting time window, and the disclosure does not limit this.

[0107] Exemplarily, as shown in FIG. 7, taking the first node as a UE and the second node as a base station as an example. After the UE transmits the BSR, the UE needs to wait for the DCI signaling (i.e., the second scheduling signaling described above) that may respond to the BSR. This waiting cannot be infinite, and a preset time window length for receiving and a start point of the preset time window must be agreed. The start point of the preset time window can be defined as the first symbol of the earliest control resource set of the PDCCH search space configured to the UE after the end of the transmission of the last symbol of the PUSCH where the BSR is located. The preset time window length can be predefined or configured by high layer signaling. The UE monitors the possible DCI signaling within the preset time window, attempts to detect the DCI signaling, and responds to the valid DCI signaling (i.e., the second scheduling signaling described above) within the preset time window to transmit the uplink PUSCH.

[0108] In some embodiments, the first node does not receive the second scheduling signaling within the preset time window, and determines that the BSR transmission fails.

[0109] In some embodiments, the BSR is retransmitted in the case of BSR transmission failure.

[0110] In some embodiments, the BSR is retransmitted in the case of BSR transmission failure, including: sending a scheduling request in the case of BSR transmission failure.

[0111] Receiving first scheduling signaling in response to the scheduling request; retransmitting the BSR on the first transmission channel scheduled by the first scheduling signaling.

[0112] In some embodiments, the scheduling request is sent in the case of BSR transmission failure, including:

[0113] The scheduling request is sent in the case where the number of BSR transmission failures reaches a preset number threshold.

[0114] In some embodiments, the transmission channel used by the BSR for this time retransmission is different from the transmission channel used by the BSR for the last time transmission in the time domain and / or the frequency domain.

[0115] Exemplarily, the first node is a UE, and the second node is a base station. Due to collision of PUSCH where the multi-user BSR transmission based on the contention mechanism is located, or poor uplink channel condition when the BSR is transmitted, or other reasons such as the base station failing to detect or receive the BSR report or misjudging the BSR as another user terminal UE, the UE that transmits the BSR fails to receive valid DCI signaling for scheduling the next PUSCH transmission within a preset time window. At this time, it is counted as a failure of the BSR directly applying for transmission resources, and a relief mechanism is needed to continue to request transmission resources to avoid the risk of failure of the BSR directly applying for transmission resources but failing to obtain the scheduling signaling of the PUSCH. The relief mechanism can choose to directly fall back to the original process of transmitting the SR and then transmitting the BSR to apply for transmission resources. As shown in FIG. 8, the relief mechanism can also choose to retransmit the BSR. A preset number threshold can be pre-configured through high-layer signaling. When the retransmission reaches the preset number threshold, the original way of applying for transmission resources through the SR can still be used. The PUSCH resource for retransmitting the BSR can use the PUSCH resource for transmitting the BSR last time, or further set an additional time domain and / or frequency domain deviation based on the PUSCH resource for transmitting the BSR last time to reduce the risk of collision. The additional time domain and / or frequency domain deviation can be randomly determined by the UE or configured by the base station or the network. Which way to use, direct fallback or retransmission and then fallback, can be based on the capability reported by the UE or selected and configured by the base station or the network device.

[0116] In this way, the technical advantage of the BSR directly requesting transmission resources is that the delay between triggering the resource request and the final data transmission is greatly shortened. Assuming that the delay from transmitting the SR to receiving the first scheduling signaling is 5 ms, the delay from receiving the first scheduling signaling to transmitting the BSR is 5 ms, the delay from transmitting the BSR to receiving the second scheduling signaling is 5 ms, and the delay from receiving the second scheduling signaling to transmitting the PUSCH is 5 ms, the entire process has a delay of 20 ms. If the embodiment is used, because there are only two uplink steps of BSR reporting and one PUSCH uplink transmission, the delay is (5+5)=10 ms in an ideal case without collision risk. However, if the BSR transmission fails due to collision risk and needs to be retransmitted, the overall delay will increase. For example, the success rate of the first BSR transmission is 90%, the success rate of the second BSR transmission is 100%, and the waiting time window length is 10 ms, so the overall delay is generally (5+5)*90%+(10+5+5)*(1-90%)=11 ms. The more the number of retransmissions is, the longer the overall delay is.

[0117] In S203, the first node transmits the to-be-transmitted data to the second node on the second transmission channel scheduled by the second scheduling signaling. Correspondingly, the second node receives the to-be-transmitted data transmitted by the first node on the second transmission channel scheduled by the second scheduling signaling.

[0118] In some embodiments, the first scheduling signaling and / or the second scheduling signaling comprises at least one of the following: a frequency domain resource allocation parameter, a time domain resource allocation parameter, an MCS indication (including a modulation mode, a coding rate, a spectral efficiency, etc.), an antenna port, a parameter directly related to determination of a size of a load of a transmission channel, which will not be described one by one hereinafter.

[0119] It can be understood that, in addition to the second scheduling signaling, the first node can also need a second transmission channel parameter configured by high layer (such as radio resource control (RRC), MAC) signaling to jointly determine the second transmission channel carrying the data.

[0120] Based on this, in a related uplink data resource request process, at least the first step SR, the third step BSR and the scheduling grant sandwiched between the two steps are included, which can be referred to FIG. 2. In the embodiment, the first step SR and the second step scheduling grant are omitted. After the data arrives at the first node, especially after the data buffer, the BSR is triggered, and the first node directly reports the BSR to the second node. After receiving the BSR report, the second node allocates the scheduling resource of the PUSCH according to the data amount load of the data buffer or the priority of the data in the BSR information, and sends the second scheduling signaling to the first node. The first node determines the second transmission channel carrying the data according to the second scheduling signaling, and transmits the to-be-transmitted data on the second transmission channel.

[0121] In some embodiments, as shown in FIG. 9, S101 can be implemented as the following S301 to S303.

[0122] In S301, the first node sends an SR to the second node. Correspondingly, the second node receives the SR sent by the first node.

[0123] In some embodiments, the SR triggering condition can refer to the triggering condition of the BSR introduced above, which will not be described here again.

[0124] In some embodiments, the transmission channel of the SR includes at least one of the following: PUCCH, PUSCH, PRACH. In most scenarios, the SR is transmitted through the PUCCH. The transmission through the PUSCH is usually because the PUCCH for transmitting the SR conflicts with the PUSCH, and the SR is forced to be multiplexed to the PUSCH transmission. The motivation for directly multiplexing the SR to the PUSCH transmission is insufficient, because when there is a certain PUSCH resource, it is more reasonable to multiplex the BSR report on the PUSCH instead of the SR. The SR is transmitted through the PRACH, which is more used for resource request in the non-synchronization or idle scenario. The embodiment focuses on the case where the SR is transmitted through the PUCCH.

[0125] In S302, in response to the SR, the second node sends first scheduling signaling to the first node. Accordingly, the first node receives the first scheduling signaling sent by the second node in response to the SR.

[0126] In S303, the first node transmits all the data of the data to be transmitted to the second node on the first transmission channel scheduled by the first scheduling signaling, or transmits part of the data of the data to be transmitted to the second node on the first transmission channel scheduled by the first scheduling signaling and a BSR. Accordingly, the second node receives all the data of the data to be transmitted transmitted by the first node on the first transmission channel scheduled by the first scheduling signaling, or receives part of the data of the data to be transmitted transmitted by the first node on the first transmission channel scheduled by the first scheduling signaling and a BSR.

[0127] It can be understood that in addition to the first scheduling grant information, the first node can also need the transmission channel parameters configured by the high layer signaling to jointly determine the first transmission channel carrying the data.

[0128] In some embodiments, the content carried by the first transmission channel is determined based on the load supported by the first transmission channel.

[0129] In some embodiments, in a case where the load supported by the first transmission channel is greater than or equal to the data amount of the data to be transmitted, the first transmission channel carries all the data of the data to be transmitted; or in a case where the load supported by the first transmission channel is less than the data amount of the data to be transmitted, the first transmission channel carries part of the data of the data to be transmitted and a BSR.

[0130] In some embodiments, the first transmission channel further carries first indication information. The first indication information is used to indicate whether the BSR is carried in the first transmission channel. The first indication information also has other names, for example, it can be called a flag bit, and the disclosure does not limit this.

[0131] In some embodiments, continuing to refer to FIG. 9, S303 is implemented as the first node transmitting part of the data to be transmitted and the buffer status report to the second node on a first transmission channel scheduled by the first scheduling signaling. After S303, S304 and S305 are further included.

[0132] In S304, the second node transmits second scheduling signaling to the first node in response to the BSR. Accordingly, the first node receives the second scheduling signaling sent by the second node in response to the BSR.

[0133] In S305, the first node transmits the remaining data to be transmitted on a second transmission channel scheduled by the second scheduling signaling. Accordingly, the second node receives the remaining data to be transmitted sent by the first node on the second transmission channel scheduled by the second scheduling signaling.

[0134] It can be understood that the first node can also need the transmission channel parameters configured by high layer signaling in addition to the second scheduling grant information to jointly determine the second transmission channel resource carrying the data.

[0135] Exemplarily, referring to FIG. 10, the first node is taken as an example of a UE. The UE obtains uplink scheduling grant information (i.e., the first scheduling signaling described above) from downlink DCI. The dynamic uplink scheduling grant information generally includes frequency domain resource allocation parameters, time domain resource allocation parameters, MCS indication (including modulation mode, coding rate, spectral efficiency, etc.), antenna port, and other parameters directly related to determining the PUSCH load size.

[0136] The UE can also need to combine other PUSCH parameters configured by high layer RRC signaling according to the first scheduling signaling to determine the load (including resource and load size) supported by the first PUSCH, such as time slot, symbol resource, frequency domain PRB or RE resource, DMRS configuration parameters, data scrambling configuration parameters, etc.

[0137] The UE obtains the data buffer state such as data amount and data priority when the SR triggering condition is met.

[0138] The UE compares the buffer data amount with the load supported by the first PUSCH (which can also be referred to as the load of the first PUSCH).

[0139] When the buffer data amount is less than or equal to the load supported by the first PUSCH, all data in the transmission buffer of the first PUSCH is determined.

[0140] When the buffer data amount is greater than the load supported by the first PUSCH, it is determined that the first PUSCH can only transmit part of the data in the buffer and the BSR information for applying a second scheduling grant.

[0141] The second scheduling signaling (may also be referred to as second uplink scheduling grant information) of the base station in response to the BSR can meet the requirement of the remaining data in the buffer, and the UE determines the second PUSCH transmission buffer remaining data according to the second scheduling signaling (if the buffer status is not updated).

[0142] The data buffer status reported by the BSR can be the data buffer status before the first SR is sent, can be the remaining buffer data status after the data transmitted by the first PUSCH is deducted, or can be the updated data buffer status after the data buffer status is updated after the first SR is sent (new data can arrive).

[0143] Because the base station or the network does not know whether the BSR is multiplexed in the first PUSCH transmission, a flag (also referred to as the first indication information) must be included in the (first, and can be only once) PUSCH or the data packet carried by the PUSCH to prompt whether the BSR is carried in the first transmission channel, regardless of the comparison result is less than, equal to or greater than. The flag can be explicitly included in the data or the RE of the PUSCH, or can be indicated in an implicit manner, for example, the DMRS of the PUSCH can mark the flag.

[0144] In the complete process, the UE has a probability of transmitting all data in the buffer at one time in the case of sending only the SR and not sending the BSR. Only when all data in the buffer cannot be transmitted at one time, the transmission resource needs to be requested again and the second transmission is performed. Assuming that the delay from the SR transmission to the reception of the first scheduling signaling is 5 ms in FIG. 2, the delay from the reception of the first scheduling signaling to the transmission of the BSR is 5 ms, the delay from the transmission of the BSR to the reception of the second scheduling signaling is 5 ms, and the delay from the reception of the second scheduling signaling to the transmission of the PUSCH is 5 ms, the entire process delay is 20 ms. If the present embodiment scheme is adopted, assuming that the first transmission success rate is 80%, the final delay is (5+5)*80%+(5+5+5+5)*(1-80%) = 12 ms, which is still much lower than the transmission delay of the conventional scheme. Obviously, striving for a higher first transmission success probability can effectively reduce the delay in the process of applying for transmission resource.

[0145] To improve the efficiency of data transmission, the first transmission success rate can be improved to achieve a higher first transmission success probability. The key lies in whether the PUSCH resource or load determined by the parameters in the first scheduling signaling matches the data amount in the data buffer, or at least the load should be greater than or equal to the data amount in the data buffer. The traditional design scheme is to report BSR to enable the base station or network to understand the state of the UE data buffer. The innovation of the embodiment is that the UE does not report BSR, and the base station or network does not have any explicit knowledge of the uplink data load to be received, but still needs to give an indication of the scheduling grant parameters that match the data buffer state. The traditional scheme cannot solve this problem. However, with the introduction of AI and machine learning (ML) technology, through the training and inference of a deep neural network, the state in the data buffer, such as the data amount or data priority, can be reliably predicted, and then the appropriate uplink scheduling grant parameters can be indicated to fully match the data buffer state. The AI model of the deep neural network can exist in the base station or network device, and by using the transmission status of the historical uplink data, the future data buffer state can be predicted to achieve the purpose of allocating uplink resources that match the data buffer state without the UE reporting BSR.

[0146] Even without the prediction technology of the AI / ML model, other prediction technologies such as Wiener filtering can be used for prediction.

[0147] Even if there is an accidental prediction error, it will not cause the entire process to collapse. If the PUSCH resource or load determined by the parameters in the first scheduling signaling is not enough to carry all the data in the data buffer, then the first PUSCH can only transmit part of the data and BSR. The BSR makes a second resource application, and the PUSCH resource or load determined by the parameters in the second scheduling signaling can still transmit the remaining data in the data buffer. Unless the data amount in the data buffer is very large, the second PUSCH still cannot transmit all the data, and must transmit the data in batches through the third or more PUSCH. However, the third or more PUSCH batch transmission can refer to the second PUSCH transmission, which will not be described here.

[0148] Alternatively, without using any prediction technology, only a small data load is allowed in the first scheduling signaling. If it does not meet the one-time transmission condition, a second scheduling signaling is continued to be applied, and the remaining data is transmitted in the second PUSCH. The determination of this data load is a problem of implementation of the base station or network, and needs to balance between resource allocation overhead and possible mismatch of data load.

[0149] Based on this, in the previous embodiment (i.e., FIG. 5), the sending of the SR in the first step and the first scheduling signaling in the second step in FIG. 2 are omitted. In the present embodiment (i.e., FIG. 9), the BSR in the second step, the second scheduling signaling in the fourth step, and the data transmission in the fifth step in FIG. 2 are also omitted with a probability. When data arrives at the data buffer, the SR request is triggered, and the first node transmits the SR to the second node. After receiving the SR, the second node allocates scheduling resources of a transmission channel for the first node that makes the request. Because the second node does not know the data amount or the data priority state in the UE buffer, the load that can be carried by the allocated first transmission channel cannot necessarily completely match the data amount or the data priority state in the buffer. Therefore, the second node sends the first scheduling signaling (or indicates the first scheduling grant information in the downlink signaling DCI) to the first node, the first node determines the first transmission channel resources carrying data according to the first scheduling signaling, and decides whether to transmit all the data to be transmitted or only part of the data to be transmitted according to the load supported by the first transmission channel, and at the same time, reports the buffer state for secondary application. After obtaining the second scheduling signaling, the remaining data to be transmitted is transmitted. Therefore, the present embodiment further reduces the data transmission delay and improves the data transmission efficiency.

[0150] The method of the present embodiment for requesting transmission resources by SR is applicable to the transmission of SR on PUCCH in most scenarios. At this time, there is basically no multi-user competition, the requested uplink PUSCH transmission resource is also a scheduling grant, and there is no competition in transmission. It can be considered that the method of the present embodiment is applicable to the scenario of non-competitive transmission in the connected state.

[0151] The SR in the present embodiment (i.e., FIG. 9) and the BSR transmission in the previous embodiment (i.e., FIG. 5) both have the function of requesting transmission resources, and the second node needs to respond to the transmission resource request and send scheduling signaling to the first node (for example, the base station indicates the uplink scheduling grant information to the UE in the downlink DCI signaling) to determine the transmission channel resources for transmitting data. The delay of the entire process of the second node receiving and responding to the SR or BSR, sending the scheduling signaling, and being received and preparing by the first node to transmit the data to be transmitted can be further considered to be reduced to meet the needs of future mobile communication systems.

[0152] In some embodiments, as shown in FIG. 11, S101 can be implemented as S401 and S402.

[0153] In S401, the first node sends second indication information to the second node. Correspondingly, the second node receives the second indication information sent by the first node.

[0154] The second indication information is used to indicate whether there is a transmission channel to the second node. The second indication information also has other names, for example, it can be called a pre-transmission indicator (PTI) or an early PUSCH indicator (EPI). The simplest second indication information includes one information bit or multiple information bits, or a probe signal, and the present disclosure does not limit this.

[0155] In some embodiments, when the second indication information includes multiple information bits, the second indication information is also used to indicate auxiliary control information of the transmission channel.

[0156] For example, taking the first node as a UE and the second node as a base station as an example. When the second indication information uses 1 bit to indicate, it can simply indicate whether there is a subsequent PUSCH transmission. When multiple bits are used to indicate, it can indicate whether there is a PUSCH transmission, and also indicate auxiliary control information of the PUSCH.

[0157] In some embodiments, the resource of the second indication information is a periodic resource configured by the second node, allowing the first node to send the second indication information within a predetermined time period. The second indication information can be transmitted on demand according to the configured periodic resource, and the second node needs to monitor the second indication information within the configured time interval.

[0158] In some embodiments, if the UE has data to be sent within the specified second indication information period, the first node can use the configured PUCCH resource or multiplex the PUCCH to the PUSCH to send the second indication information using the PUSCH resource.

[0159] In some embodiments, the second indication information is a predefined or preconfigured sequence.

[0160] For example, when the second indication information is a probe signal, it can be a predefined or configured sequence. Common sequences include, for example, Zadoff-Chu, m, gold sequences, etc. When the base station detects the sequence, it can know that there is a subsequent PUSCH to be received. From the perspective of saving terminal UE power consumption, the relevant sequence can also be sent through on-off keying (OOK) symbols. The advantage of the probe signal over bit information indication is that the sequence detection is robust and can tolerate poor channel conditions. The disadvantage is that it is difficult to carry more information, such as auxiliary control information of the PUSCH, or information of the UE itself, such as the UE identity (UE ID).

[0161] At S402, in response to the second indication information indicating that a transmission channel will arrive at the second node, the first node sends the to-be-transmitted data to the second node on the transmission channel. Correspondingly, the second node receives the to-be-transmitted data sent by the first node on the transmission channel.

[0162] In some embodiments, the transmission channel is determined by at least one of the following: pre-defined or pre-configured configuration information of the transmission channel; a mapping relationship between the second indication information and the transmission channel; and auxiliary control information of the transmission channel in the second indication information.

[0163] In the embodiment, since there is no scheduling signaling to dynamically schedule the available transmission channel resources, if the transmission channel resources after the second indication information are directly determined by the pre-defined or configured transmission channel, the transmission channel can belong to a configured grant (CG) transmission channel, or a semi-statically configured transmission channel, or a semi-persistently configured transmission channel, or a shared (or common) transmission channel.

[0164] In the following, the second indication information is denoted as PTI, and the transmission channel is taken as an example of PUSCH for expansion description.

[0165] If the pre-defined or configured PUSCH resource belongs to a CG PUSCH or a semi-persistent scheduling (SPS) PUSCH resource, the resource is specific to the UE, and in general, no more auxiliary information is needed to further confirm the PUSCH resource. Since the CG PUSCH or the SPS PUSCH is a periodic PUSCH, when there is no more auxiliary information, the first available CG PUSCH or SPS PUSCH after the default PTI is used to transmit the PUSCH after the PTI. Further, the relative mapping relationship between the PTI and the available CG PUSCH or SPS PUSCH, such as a time offset, a frequency offset, etc., can also be further indicated by the auxiliary information (which can be pre-defined, RRC semi-statically configured, DCI dynamically indicated, or auxiliary control information in the PTI). Since the CG PUSCH or the SPS PUSCH is periodic by itself, the advantage of using the pre-positioned PTI is to inform the base station of the state of the subsequent possibly received PUSCH, and when there is no PUSCH transmission, the base station can be assisted to save energy.

[0166] It is more valuable to use shared PUSCH after PTI, which has the advantage of not needing to allocate specific PUSCH resources for the UE in advance, effectively saving PUSCH overhead, and the disadvantage of the risk of multi-user transmission conflict, which may cause the PUSCH to be unable to be correctly demodulated due to conflict. If the predefined or configured PUSCH resource belongs to the shared PUSCH resource, and there is no further information to specify the PUSCH resource corresponding to the PTI in the shared PUSCH resource pool, the terminal UE may randomly select a suitable PUSCH resource in the PUSCH resource pool to transmit data.

[0167] Randomly selecting a PUSCH resource does not help to reduce the risk of multi-user conflict. To reduce the risk of multi-user conflict caused by using shared PUSCH, a mapping relationship between PTI and shared PUSCH can be predefined or configured through high-layer signaling, and the transmission resource of the PUSCH after PTI can be determined according to the PTI resource and the mapping relationship; or the PUSCH transmission resource can be determined by the PUSCH auxiliary control information in the PTI.

[0168] The mapping relationship between PTI and shared PUSCH is mainly used to determine the transmission resource of the PUSCH based on the resource position information of the PTI.

[0169] In some embodiments, the mapping relationship between the second indication information and the transmission channel is used to represent at least one of the following: a transmission time difference between the second indication information and the transmission channel in the time domain; a relative frequency difference between the second indication information and the transmission channel in the frequency domain; density information of the transmission channel.

[0170] The transmission time difference between the second indication information and the transmission channel in the time domain describes the relative time position of the second indication information and the time slot in which the transmission channel is located, which is n time slots and / or symbol start positions in the time slot, and the granularity may be accurate to the time slot level or to the symbol level. The transmission time difference may also be a relative time difference with respect to the start time of a certain transmission channel resource pool after the second indication information, that is, the actual time difference also needs to add the time deviation of the second indication information to the transmission channel resource pool.

[0171] The relative frequency difference between the second indication information and the transmission channel in the frequency domain can be described in PRB or RE granularity, or it can be a frequency difference with respect to the start frequency of a certain transmission channel resource pool after the second indication information.

[0172] The density information of the transmission channel can include a parameter of time density and a parameter of frequency density. For example, the parameter of time density can include a number of slots used by the transmission channel, or a number of POs per slot (note that PO is a basic unit of PUSCH in time-frequency domain resources, and if there are multiple POs in a slot, it means that the length of the PO cannot exceed a slot). For example, the parameter of frequency density can include a number of PRBs per PO, or a number of POs FDM, and the like.

[0173] It can be understood that some predefined or configured by higher layer parameters can be considered as part of the mapping relationship, or can not belong to the mapping relationship, but belong to the parameters that must be used to define the transmission channel resource, including: time and frequency domain allocation information of the transmission channel resource pool, MCS related to the transmission channel, start and length indicator value (SLIV), mapping type, DMRS configuration information, data scrambling information, waveform information, antenna port information, code division multiplexing (CDM) group information, guard time and guard frequency band information between transmission channels, frequency hopping information indication, and the like.

[0174] In some embodiments, the auxiliary control information includes second indication information and parameters related to the mapping relationship between the transmission channels.

[0175] It can be understood that all or part of the parameters of the mapping relationship can be determined by the first node itself or selected within a given range and then multiplexed into the second indication information as auxiliary control information of the transmission channel to indicate the resource information of the transmission channel to be demodulated by the second node, in addition to being determined by predefinition or configuration. Commonly, the time offset, frequency offset and the like can be multiplexed into the second indication information and the second indication information is sent, and the resource position of the transmission channel is determined according to the auxiliary control information. After receiving the second indication information, the second node can determine the resource position of the transmission channel according to the indicated time offset and frequency offset and demodulate at the corresponding position.

[0176] In some embodiments, the auxiliary control information indicates a transmission channel configuration option in a plurality of transmission channel configuration options. The plurality of transmission channel configuration options at least includes two sets of independent transmission channel occasion configurations, which reduces the complexity of blind detection of the transmission channel by the second node.

[0177] In some embodiments, the transmission channel occasion is periodically configured, and the resource configuration period of the second indication information is the same as the resource configuration period of the transmission channel occasion. The resource configuration period of the second indication information being the same as the resource configuration period of the transmission channel occasion facilitates the first node to store the solidified second indication information and the resource location of the transmission channel, and can save the calculation complexity and power consumption of the first node.

[0178] Exemplarily, as shown in FIG. 12, a method of determining the transmission channel (PUSCH is taken as an example in the figure) after the PTI according to the mapping relationship and the second indication information (denoted as PTI) is shown.

[0179] The slot where the PTI is located in FIG. 12 corresponds to two independent PUSCH occasion (PO) configurations (POs per config1 and POs per config2 in FIG. 12). Among the two sets of PO configurations, the first set of PO configurations (POs per config1 in FIG. 12) provides more PUSCH resources and supports a larger load of the PUSCH; the second set of PO configurations (POs per config2 in FIG. 12) provides less PUSCH resources and supports a smaller load of the PUSCH. After sending the PTI, the terminal UE can decide to select the PO resource with a suitable load, and the base station or the network needs to perform blind detection on the two sets of configured PUSCH resources. The terminal can indicate in the auxiliary information multiplexed / carried in the PTI whether the first set of PO configurations or the second set of PO configurations is selected, thereby removing the uncertainty of the blind detection of the base station. The independent PO configurations are not limited to the two sets in the figure, and can be greater than two sets, and the disclosure does not limit the comparison.

[0180] As can be seen from the enlarged view of POs per config1 in FIG. 12, the PO resource corresponding to the PTI slot can contain one or more POs. When containing multiple POs, the mapping relationship between the PTI slot and the shared PUSCH can be considered as one-to-many. When containing only one PO, the mapping relationship between the PTI slot and the shared PUSCH can be considered as one-to-one. When multiple slots of the PTI correspond to only one PO, the mapping relationship between the PTI slot and the shared PUSCH can be considered as many-to-one. Which mapping method to choose depends on many factors such as the amount of available PUSCH resources, the initiation frequency of the PUSCH triggered by the PTI, the user activation density in the cell, and the like.

[0181] It should be noted that the various POs in FIG. 12 can be distinguished by time-frequency domain resources, that is, the various POs do not overlap or multiplex in the time-frequency domain. There can also be a possibility that the various POs multiplex or overlap in the time-frequency domain, and are distinguished by different DMRS sequences. POs using different DMRS sequences are considered as different POs.

[0182] Further, since the PTI resource can be periodically configured, the resource configuration of the PO can also be periodically configured, and the resource configuration period of the PTI can be the same as the resource configuration period of the PO.

[0183] Based on this, in the present embodiment (i.e., FIG. 11), after the first node transmits the signal similar to the SR or the BSR (i.e., the second indication information), since the signal similar to the SR or the BSR has no function of transmitting a resource request, but only prompts that there will be a transmission channel to the second node, the first node does not need to obtain scheduling signaling, and can directly transmit the to-be-transmitted data, saving the time of receiving and responding of the second node, and the time of waiting for receiving the response of the second node of the first node. Compared with FIG. 2, the processes of the second step, the third step, and the fourth step are saved, the data transmission efficiency is improved, and the data transmission delay is reduced.

[0184] In the present disclosure, the buffer status report in the embodiments or examples includes a first type of buffer status report and a second type of buffer status report. The first type of buffer status report includes service information at a current time, and the second type of buffer status report includes at least service prediction information at a future time. The second type of buffer status report can also be referred to as a predicted BSR, and the present disclosure does not limit this.

[0185] In some embodiments, the second type of buffer status report further includes service information at a current time.

[0186] The second type of buffer status report includes at least one future time traffic prediction information, such as data buffer status, etc. Multiple time points can be distinguished using time labels. Taking a typical short BSR as an example, the MAC CE structure of the BSR can be organized in a time sequence by sequentially superimposing data, as shown in FIG. 13A. The MAC CE structure of the conventional short BSR report includes 3-bit logical channel group ID (LCG ID) and 5-bit buffer size. When the BSR report only includes multiple future time BSR predictions, the domain of the time stamp needs to be added. It can be understood that the time stamp in FIG. 13A occupies 8 bits, which is only an example, and the number of bits occupied may need to be modified according to the definition. Each specific time stamp is followed by the BSR prediction of the next time. This rule can also be used for other types of BSRs, such as long BSR, truncated BSR, or a mixture of multiple BSRs.

[0187] If there is currently another type of reason triggering the BSR report of the current data buffer status, the future prediction can also be superimposed in the MAC CE structure after the current BSR, as shown in FIG. 13B. The difference between FIG. 13B and FIG. 13A is that the head of the MAC CE structure adds the current data buffer status report and does not require a matching time stamp.

[0188] The trigger condition of the BSR report can refer to the introduction in the above embodiments, such as based on data arrival, timer expiration, resource change, priority change, etc. When these trigger conditions are not reached, the first node can also use a deep machine learning model and related algorithms to predict the unarrived data, that is, the traffic flow or business priority of the first node at the future time, and actively trigger the BSR report to report the predicted data arrival at the future time or the data buffer status at the future time to the second node. This prediction report assists the base station to allocate transmission resources in advance for the future time, and saves the number of BSR reports, which can further save the data transmission delay.

[0189] The second type of BSR report means that in addition to the above-mentioned several reasons, the trigger mechanism of the BSR report also needs to add a predicted BSR report. This predicted report can be periodic or non-periodic. Periodic reporting requires high-level parameter configuration of corresponding periodic resources such as period, starting time slot or starting symbol, etc. Non-periodic reporting depends on the implementation of the first node itself or the dynamic trigger mechanism of the second node.

[0190] In some embodiments, the first type of buffer status report includes third indication information. The third indication information is used to indicate whether a second type of buffer status report will be sent subsequently. The third indication information has other names, such as a flag, and the present disclosure does not limit this.

[0191] Exemplarily, referring to FIG. 14, the content of the BSR based on the current data buffer triggered in the first time is reported in the first BSR report, and one indicator is inserted in the first BSR report to indicate that the second BSR report will be subsequently reported. The second BSR report can be based on the predicted data buffer content. When the base station receives the first BSR, the PUSCH resource is allocated to the UE by the DCI scheduling grant signaling, and the load required for the second BSR report will be considered. The UE receives the DCI scheduling grant signaling within the preset time window, and then sends the PUSCH to the base station. The second BSR needs to be included in the PUSCH. One possibility is that only the second BSR is included in the PUSCH, and another possibility is that both the data in the current data buffer and the second BSR are included in the PUSCH.

[0192] The first BSR transmission in this method can be based on the method of FIG. 2, or based on the schemes related to FIG. 5, FIG. 9, and FIG. 11. Based on FIG. 5, the third indication information is added in the directly transmitted BSR (SR-free), based on FIG. 9, the third indication information is added in the possibly transmitted BSR, and based on FIG. 11, the BSR report is included in the contention-based PUSCH or the third indication information is included in the secondary control information of the second indication information.

[0193] In some embodiments, the buffer status report further includes the identification of the historical buffer status report to be discarded / updated. In this way, if the prediction at time A is found to be inaccurate, or has errors, or the service load information has changed at time B subsequently, it can be updated in the subsequent BSR report, and the UE expects the base station to cancel or discard the reported value at time A. In order to enable the base station to identify that this is an updated value, the identification of the reported BSR (such as the time label of the reported BSR) can be included in the BSR report.

[0194] The above describes the scheme of the embodiments of the present disclosure mainly from the perspective of the method. Hereinafter, a data transmission apparatus is also shown for performing the data transmission method in any of the above embodiments and implementation manners. It can be understood that the data transmission apparatus comprises a hardware structure and / or software module corresponding to the execution of each function in order to implement the data transmission method; it should be easily realized by those skilled in the art that, in combination with the algorithm steps of each example described in the embodiments of the present disclosure, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is implemented in hardware or computer software driven hardware depends on the specific application of the technical solution and the design constraint conditions. The skilled person can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present disclosure.

[0195] The embodiments of the present disclosure can divide the data transmission apparatus into functional modules according to the above method embodiments, for example, each functional module can be divided corresponding to each function, or two or more functions can be integrated in one functional module. The above integrated module can be realized in the form of hardware or software. It should be noted that the division of modules in the embodiments of the present disclosure is illustrative, and is only a logical functional division. When actually implemented, there can be another division manner. Hereinafter, taking the example of dividing each functional module corresponding to each function is described.

[0196] FIG. 15 is a data transmission apparatus according to an embodiment of the present disclosure, applied to a first node. The data transmission apparatus 500 comprises a communication module 501 and a processing module 502.

[0197] The communication module 501 is configured to send the to-be-transmitted data on a transmission channel.

[0198] In some embodiments, the communication module 501 is configured to, for example, directly send the buffer status report; receive second scheduling signaling in response to the buffer status report; and send the to-be-transmitted data on a second transmission channel scheduled by the second scheduling signaling.

[0199] In some embodiments, the communication module 501 is configured to, for example, receive the second scheduling signaling within a preset time window, wherein the start time of the preset time window is the first symbol of the earliest control resource set of the physical control channel search space configured for the first node after the end of the transmission channel of the buffer status report, and the length of the preset time window is pre-defined or configured by high-layer signaling.

[0200] In some embodiments, the processing module 502 is configured to, for example, determine that the buffer status report transmission fails when the second scheduling signaling is not received within the preset time window.

[0201] In some embodiments, the communication module 501 is further configured to retransmit the buffer status report in a case where the buffer status report transmission fails.

[0202] In some embodiments, the communication module 501 is configured to, for example, send a scheduling request in a case where the buffer status report transmission fails; receive first scheduling signaling in response to the scheduling request; and retransmit the buffer status report on a first transmission channel scheduled by the first scheduling signaling.

[0203] In some embodiments, the communication module 501 is further configured to send a scheduling request in a case where the number of times of buffer status report transmission failures reaches a preset number threshold.

[0204] In some embodiments, the communication module 501 is configured to, for example, repeatedly send the buffer status report based on a preset repeated sending configuration; and the preset repeated sending configuration comprises at least one of the following: a buffer status report repeated sending mode, a buffer status report repeated sending number, and a buffer status report repeated sending corresponding resource pattern.

[0205] In some embodiments, the communication module 501 is configured to, for example, send a scheduling request; receive first scheduling signaling in response to the scheduling request; and transmit all data of the to-be-transmitted data on a first transmission channel scheduled by the first scheduling signaling, or transmit part of the to-be-transmitted data and the buffer status report on the first transmission channel scheduled by the first scheduling signaling.

[0206] In some embodiments, the communication module 501 is configured to, for example, receive second scheduling signaling in response to the buffer status report; and transmit remaining data of the to-be-transmitted data on a second transmission channel scheduled by the second scheduling signaling.

[0207] In some embodiments, the communication module 501 is configured to, for example, send second indication information, the second indication information being used to indicate whether there will be a transmission channel to the second node; and in response to the second indication information indicating that there will be a transmission channel to the second node, send the to-be-transmitted data on the transmission channel.

[0208] For more details of the above communication module 501 and processing module 502, and the technical features and advantages thereof, please refer to the above corresponding method embodiment part, which will not be repeated here.

[0209] FIG. 16 is another data transmission apparatus according to an embodiment of the present disclosure, applied to a second node. The data transmission apparatus 600 comprises a processing module 601 and a communication module 602.

[0210] The processing module 601 is configured to determine a transmission channel.

[0211] The communication module 602 is configured to receive the to-be-transmitted data on the transmission channel.

[0212] In some embodiments, the communication module 602 is configured to receive the buffer status report.

[0213] The second scheduling signaling is sent in response to the buffer status report.

[0214] The to-be-transmitted data is received on the second transmission channel scheduled by the second scheduling signaling.

[0215] In some embodiments, the communication module 602 is configured to receive the scheduling request.

[0216] The first scheduling signaling is sent in response to the scheduling request.

[0217] The buffer status report is received on the first transmission channel scheduled by the first scheduling signaling.

[0218] In some embodiments, the communication module 602 is configured to receive the scheduling request.

[0219] The first scheduling signaling is sent in response to the scheduling request.

[0220] All of the to-be-transmitted data is received on the first transmission channel scheduled by the first scheduling signaling, or part of the to-be-transmitted data and the buffer status report are received on the first transmission channel scheduled by the first scheduling signaling.

[0221] In some embodiments, the communication module 602 is configured to send the second scheduling signaling in response to the buffer status report, and receive the remaining to-be-transmitted data on the second transmission channel scheduled by the second scheduling signaling.

[0222] In some embodiments, the communication module 602 is configured to receive the second indication information, and the second indication information is used to indicate whether there will be a transmission channel to the second node; and in response to the second indication information indicating that there will be a transmission channel to the second node, the to-be-transmitted data is received on the transmission channel.

[0223] For more details of the processing module 601 and the communication module 602, and more details of the technical features and the beneficial effects, please refer to the corresponding method embodiments described above, which will not be repeated here.

[0224] It should be noted that the modules in FIG. 15 and FIG. 16 can also be referred to as units, for example, the communication module can be referred to as a communication unit. In addition, in the embodiments shown in FIG. 15 and FIG. 16, the names of the various modules can not be the names shown in the figures, for example, the communication module can also be referred to as a sending module or a receiving module.

[0225] The various units or modules in FIGS. 15 and 16, if implemented in the form of software functional modules and sold or used as independent products, can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present disclosure, essentially or partly, or all or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor to perform all or part of the steps of the methods according to the embodiments of the present disclosure. The storage medium storing the computer software product includes various media, such as a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0226] In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, the embodiments of the present disclosure also provide a structure of a communication device for performing the data transmission method provided by the embodiments of the present disclosure. As shown in FIG. 17, the communication device 700 includes a communication interface 703, a processor 702 and a bus 704. In some embodiments, the communication device can also include a memory 701.

[0227] The processor 702 can implement or execute the various exemplary logical blocks, modules and circuits described in combination with the embodiments of the present disclosure. The processor 702 can be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component or any combination thereof. It can implement or execute the various exemplary logical blocks, modules and circuits described in combination with the embodiments of the present disclosure. The processor 702 can also be a combination of implementing computing functions, such as a combination of one or more microprocessors, a combination of a digital signal processor (DSP) and a microprocessor, etc.

[0228] The communication interface 703 is used to connect with other devices through a communication network. The communication network can be an Ethernet, a wireless access network, a wireless local area network (WLAN), etc.

[0229] The memory 701 can be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to this.

[0230] As an implementation manner, the memory 701 can exist independently of the processor 702, and the memory 701 can be connected to the processor 702 through the bus 704, for storing instructions or program codes. When the processor 702 invokes and executes the instructions or program codes stored in the memory 701, the data transmission method provided by the embodiments of the present disclosure can be implemented.

[0231] In another implementation manner, the memory 701 can also be integrated with the processor 702.

[0232] The bus 704 can be an extended industry standard architecture (EISA) bus or the like. The bus 704 can be divided into an address bus, a data bus, a control bus, and the like. For the convenience of representation, only one thick line is shown in FIG. 17, but it does not mean that there is only one bus or only one type of bus.

[0233] Some embodiments of the present disclosure provide a computer-readable storage medium (for example, a non-transitory computer-readable storage medium) having computer program instructions stored therein, and the computer program instructions, when executed on a computer, cause the computer to perform the data transmission method described in any of the above embodiments.

[0234] In an exemplary implementation manner, the computer can be the data transmission apparatus described above, and the present disclosure does not limit the specific form of the computer.

[0235] In some examples, the aforementioned computer readable storage medium can include, but is not limited to, a magnetic storage device (e.g., hard disk, floppy disk, magnetic strips, etc.), an optical disk (e.g., compact disk (CD), digital versatile disk (DVD), etc.), a smart card, and a flash memory device (e.g., EPROM, card, stick, or key drive, etc.). The various computer readable storage media described in the present disclosure can represent one or more devices and / or other machine-readable storage media for storing information. The term "machine-readable storage medium" can include, without limitation, wireless channels and various other media capable of storing, containing, and / or carrying instruction(s) and / or data.

[0236] The embodiment of the present disclosure provides a computer program product containing instructions, which, when executed on a computer, cause the computer to perform the data transmission method described in any of the above embodiments.

[0237] The above merely provides the specific implementation of the present disclosure, but the protection scope of the present disclosure is not limited thereto, any change or replacement within the technical scope disclosed by the present disclosure should be covered within the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure should be subject to the protection scope of the claims.

Claims

1. A data transmission method applied to a first node, comprising: transmitting a to-be-transmitted data on a transmission channel.

2. The method of claim 1, wherein, The transmitting the to-be-transmitted data on the transmission channel comprises: directly transmitting a buffer status report; receiving second scheduling signaling in response to the buffer status report; transmitting the to-be-transmitted data on a second transmission channel scheduled by the second scheduling signaling.

3. The method of claim 2, wherein, The transmission channel of the buffer status report comprises at least one of the following: a non-scheduled physical shared channel, a contention-based physical shared channel, a semi-persistent scheduling physical shared channel, a physical control channel, and a random access channel.

4. The method of claim 2, wherein, In a case where the buffer status report is transmitted based on a contention mechanism, the buffer status report comprises an identity of the first node.

5. The method of claim 2, wherein, In a case where the buffer status report is transmitted based on a contention mechanism, the second scheduling signaling comprises an identity of the first node.

6. The method of claim 2, wherein, In a case where the buffer status report is transmitted based on a contention mechanism, transmission configurations of different first nodes are different in at least one of the following: a time advance and a frequency offset.

7. The method of claim 6, wherein, Transmission of different first nodes arrives at a second node at different times and / or frequencies.

8. The method of claim 6, wherein, A frequency offset between the transmission configurations of different first nodes is less than or equal to a preset number of resource elements, and a time advance offset between the transmission configurations of different first nodes is less than or equal to one symbol.

9. The method of claim 6, wherein, The time advance corresponding to the transmission configuration of the first node is determined based on a preconfigured time advance and a time offset.

10. The method of claim 2, wherein, Demodulation reference signals of the transmission channels of the buffer status reports of different first nodes are orthogonal. 11.The method of claim 2, further comprising: retransmitting the buffer status report in a case where the buffer status report fails to be transmitted.

12. The method of claim 11, wherein, The retransmitting the buffer status report in the case where the buffer status report fails to be transmitted comprises: transmitting a scheduling request in the case where the buffer status report fails to be transmitted; receiving first scheduling signaling in response to the scheduling request; retransmitting the buffer status report on a first transmission channel scheduled by the first scheduling signaling.

13. The method of claim 12, wherein, The transmitting the scheduling request in the case where the buffer status report fails to be transmitted comprises: transmitting the scheduling request in a case where a number of times of transmission failure of the buffer status report reaches a preset number threshold.

14. The method of claim 2, wherein, The transmitting the buffer status report comprises: repeatedly transmitting the buffer status report based on a preset repeated transmission configuration; the preset repeated transmission configuration comprises at least one of the following: a repeated transmission mode of the buffer status report, a number of times of repeated transmission of the buffer status report, and a resource pattern corresponding to the repeated transmission of the buffer status report.

15. The method of claim 1, wherein, The transmitting the to-be-transmitted data on the transmission channel comprises: transmitting a scheduling request; receiving first scheduling signaling in response to the scheduling request; transmitting all data of the to-be-transmitted data on a first transmission channel scheduled by the first scheduling signaling, or transmitting part of the to-be-transmitted data and a buffer status report on the first transmission channel scheduled by the first scheduling signaling.

16. The method of claim 15, wherein, Content carried by the first transmission channel is determined based on a load supported by the first transmission channel.

17. The method of claim 16, wherein, in a case that the load supported by the first transmission channel is greater than or equal to the data amount of the data to be transmitted, the first transmission channel carrying all data of the data to be transmitted; or, in a case that the load supported by the first transmission channel is less than the data amount of the data to be transmitted, the first transmission channel carrying part of the data to be transmitted and a buffer status report.

18. The method of claim 15, wherein, after transmitting the part of the data to be transmitted and the buffer status report on the first transmission channel scheduled by the first scheduling signaling, the method further comprises: receiving second scheduling signaling in response to the buffer status report; transmitting the remaining data of the data to be transmitted on a second transmission channel scheduled by the second scheduling signaling.

19. The method of claim 15, wherein, the first transmission channel further carries first indication information, the first indication information being used to indicate whether the first transmission channel carries a buffer status report.

20. The method of claim 1, wherein, the transmitting the data to be transmitted on the transmission channel comprises: transmitting second indication information, the second indication information being used to indicate whether the transmission channel will arrive at the second node; in response to the second indication information indicating that the transmission channel will arrive at the second node, transmitting the data to be transmitted on the transmission channel.

21. The method of claim 20, wherein, in a case that the second indication information comprises a plurality of information bits, the second indication information is further used to indicate auxiliary control information of the transmission channel.

22. The method of claim 20, wherein, the second indication information is a predefined or preconfigured sequence.

23. The method of claim 20, wherein, the transmission channel is determined by at least one of the following: predefined or preconfigured configuration information of the transmission channel; a mapping relationship between the second indication information and the transmission channel; auxiliary control information of the transmission channel in the second indication information.

24. The method of claim 23, wherein, the mapping relationship between the second indication information and the transmission channel is used to represent at least one of the following: a transmission time difference between the second indication information and the transmission channel in a time domain; a relative frequency difference between the second indication information and the transmission channel in a frequency domain; density information of the transmission channel.

25. The method of claim 21 or 23, wherein, the auxiliary control information comprises a mapping relationship related parameter between the second indication information and the transmission channel.

26. The method of claim 2 or 15, wherein, the buffer status report comprises a first type of buffer status report and a second type of buffer status report, the first type of buffer status report comprising service information at a current time, and the second type of buffer status report comprising service prediction information at a future time.

27. The method of claim 26, wherein, the first type of buffer status report comprises third indication information, the third indication information being used to indicate whether a second type of buffer status report will be subsequently transmitted.

28. The method of claim 26, wherein, the buffer status report further comprises an identifier of a historical buffer status report to be discarded or updated. 29.A data transmission method applied to a second node, comprising: receiving data to be transmitted on a transmission channel.

30. The method of claim 29, wherein, the receiving the data to be transmitted on the transmission channel comprises: receiving a buffer status report; transmitting second scheduling signaling in response to the buffer status report; receiving the data to be transmitted on a second transmission channel scheduled by the second scheduling signaling.

31. The method of claim 29, wherein, the receiving the data to be transmitted on the transmission channel comprises: receiving a scheduling request; sending first scheduling signaling in response to the scheduling request; receiving all of the to-be-transmitted data on a first transmission channel scheduled by the first scheduling signaling, or receiving part of the to-be-transmitted data on the first transmission channel scheduled by the first scheduling signaling and a buffer status report.

32. The method of claim 29, wherein, The receiving the to-be-transmitted data on the transmission channel comprises: receiving second indication information, the second indication information being used to indicate whether there will be a transmission channel to the second node; receiving the to-be-transmitted data on the transmission channel in response to the second indication information indicating that there will be a transmission channel to the second node.

33. A communications device comprising: a memory and a processor; wherein the memory is coupled to the processor; the memory is used to store instructions executable by the processor; and the processor executes the instructions to perform the method according to any one of claims 1 to 32.

34. A computer readable storage medium, wherein, The computer readable storage medium has stored thereon computer instructions which, when executed on a communication device, cause the communication device to perform the method according to any one of claims 1 to 32.

35. A computer program product, wherein, The computer program product, when executed, implements the method according to any one of claims 1 to 32.

Images