WO2021031651A1

WO2021031651A1 - Method and device for data transmission in relay network

Info

Publication number: WO2021031651A1
Application number: PCT/CN2020/093170
Authority: WO
Inventors: 谌丽
Original assignee: 大唐移动通信设备有限公司
Priority date: 2019-08-16
Filing date: 2020-05-29
Publication date: 2021-02-25
Also published as: CN112398589A; CN112398589B

Abstract

The embodiments of the present disclosure provide a method and a device for data transmission in a relay network. The method comprises: buffering, by means of a BAP layer in an IAB node, a data packet of which a transmission condition is not confirmed; and if an upper-level node to which the IAB node accesses changes, transmitting to a new upper-level node the data packet of which the transmission condition is not confirmed.

Description

Method and equipment for data transmission in relay network

Cross references to related applications

This application claims the priority of Chinese Patent Application No. 201910758947.1 filed in China on August 16, 2019, the entire content of which is incorporated herein by reference.

Technical field

The embodiments of the present disclosure relate to the field of communication technology, and in particular to a method and device for data transmission in a relay network.

Background technique

In the relay network, when a certain integrated access backhaul (Integrated Access and Backhaul, IAB) node (node) initiates the creation of a radio link to another IAB node, the related technical solution is Radio Link Control (RLC). ) Layer reconstruction, the data in the RLC layer transmission buffer and unsuccessful data are discarded. Therefore, in a multi-hop relay network, when the network topology changes, how to ensure lossless data transmission is an urgent problem to be solved.

Summary of the invention

An objective of the embodiments of the present disclosure is to provide a method and device for data transmission in a relay network, to solve the problem of how to ensure lossless data transmission when the network topology changes in a multi-hop relay network.

In the first aspect, the embodiments of the present disclosure also provide a method for data transmission in a relay network, which is applied to an IAB node, and includes:

Buffer the data packets whose transmission status is not confirmed through the BAP layer of the backhaul adaptive protocol in the IAB node;

If the upper-level node accessed by the IAB node changes, the data packet with the unconfirmed transmission status is transmitted to the new upper-level node.

Optionally, if the upper-level node accessed by the IAB node changes, transmitting the data packet with the unconfirmed transmission status to the new upper-level node includes:

If the upper-level node that the IAB node accesses is changed, the data packet with the unconfirmed transmission status is delivered to the lower layer of the BAP layer in the IAB node after the upper-level node is changed, and transmitted to the new upper-level node.

Optionally, the data packets with unconfirmed transmission status buffered by the BAP layer include one or a combination of the following:

Data packets arriving at the BAP layer that have not yet been delivered to the lower layer of the BAP layer;

Data packets that have been submitted to the lower layers of the BAP layer and have not been transmitted over the air interface;

The data packet for which the confirmation feedback has not been received has been transmitted on the air interface.

Optionally, the amount of data in the BAP buffer is not included in the buffer status report BSR reported by the IAB node.

Optionally, the method further includes:

After the upper-level node that the IAB node accesses is changed, the lower layer of the original BAP layer is reconstructed.

Optionally, after buffering the data packets whose transmission status is not confirmed by the BAP layer, delete the data packets in the BAP buffer by one or a combination of the following methods:

Deleting the data packet in the BAP buffer according to the confirmation feedback of the lower layer of the BAP layer, the confirmation feedback indicating that the data packet in the BAP buffer has been successfully transmitted;

Delete the data packet in the BAP buffer by using a timer;

Delete the data packet in the BAP cache through the sliding window;

After the upper-level node accessed by the IAB node changes, and the data packet in the BAP cache is delivered to the lower layer of the BAP layer, the data packet in the BAP cache is deleted.

Optionally, the confirmation feedback is a confirmation feedback sent by the RLC layer, and the specific content includes one or more of the following:

A first identifier, where the first identifier includes: PDCP SN of the data packet;

A second identifier, where the second identifier includes: a BAP SN allocated by the BAP layer to uniquely identify a data packet delivered from the BAP layer to the lower layer of the BAP layer;

The third identifier, the third identifier includes: the RLC SN allocated by the RLC layer for the data packet.

Optionally, the first identifier further includes: a terminal identifier and/or a bearer identifier.

Optionally, the second identifier BAPSN is allocated by the BAP layer, or the second identifier BAPSN is defined between the BAP layer and the lower layer of the BAP layer in a reservation manner.

Optionally, the deleting the data packet in the BAP buffer by using a timer includes:

After the data packet reaches the BAP layer, or the data packet is delivered to the lower layer of the BAP layer, start the timer of the data packet;

When the timer expires, delete the data packet in the BAP layer cache;

Optionally, the duration of the timer is configured by the donor node or agreed by a protocol.

Optionally, deleting the data packet in the BAP cache through a sliding window includes:

After the data packet reaches the BAP layer, or the data packet is delivered to the lower layer of the BAP layer, adjust the upper boundary of the sliding window;

After the sliding window reaches the maximum length, the upper boundary and the lower boundary of the sliding window are adjusted, and the data packets that have exceeded the boundary of the sliding window in the BAP buffer are deleted.

Optionally, the maximum length of the sliding window is configured by the donor node or agreed by an agreement.

Optionally, the lower layer of the BAP layer includes: a radio link control RLC layer and/or a medium access control MAC layer.

In the second aspect, the embodiments of the present disclosure also provide an IAB node, including:

The cache module is used to cache data packets whose transmission status has not been confirmed through the BAP layer in the IAB node;

The processing module is configured to transmit the data packet with the unconfirmed transmission status to the new upper-level node if the upper-level node accessed by the IAB node changes.

In a third aspect, the embodiments of the present disclosure also provide an IAB node, including: a processor and a transceiver, where:

The processor is configured to cache data packets whose transmission status is not confirmed through the BAP layer in the IAB node;

The processor is further configured to, if the upper-level node accessed by the IAB node changes, transmit the data packet with the unconfirmed transmission status to the new upper-level node.

In a fourth aspect, the embodiments of the present disclosure also provide an IAB node, including: a processor, a memory, and a program stored on the memory and capable of running on the processor. When the program is executed by the processor, The steps of the method for data transmission in the relay network as described above are implemented.

In a fifth aspect, embodiments of the present disclosure also provide a computer-readable storage medium, characterized in that a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the above-mentioned Following the steps of the method of data transmission in the network.

In the embodiment of the present disclosure, the data packet whose transmission status is not confirmed is cached by the BAP layer in the IAB node. After the upper-level node accessed by the IAB node is changed, the data packet buffered at the BAP layer can be resubmitted to the lower layer. Transmission to a new upper-level node can realize lossless data transmission when the network topology structure changes in a multi-hop network.

Description of the drawings

By reading the detailed description of the optional embodiments below, various other advantages and benefits will become clear to those of ordinary skill in the art. The drawings are only used for the purpose of showing alternative embodiments, and are not considered as a limitation to the present disclosure. Also, throughout the drawings, the same reference symbols are used to denote the same components. In the attached picture:

Figure 1 is a schematic diagram of the IAB architecture;

2 is a flowchart of a method for data transmission in a relay network according to an embodiment of the disclosure;

FIG. 3 is one of the schematic diagrams of the manner of buffering data packets at the BAP layer according to an embodiment of the disclosure;

FIG. 4 is a second schematic diagram of a manner of buffering data packets at the BAP layer according to an embodiment of the disclosure;

FIG. 5 is a schematic diagram of the BAP submitting the data in the BAP buffer to the new RLC layer after the IAB node changes the access node according to the embodiment of the disclosure;

6 is a schematic diagram of deleting data packets in the BAP cache through the RLC layer confirmation feedback according to an embodiment of the disclosure;

FIG. 7 is a schematic diagram of discarding BAP buffered data packets according to a timer according to an embodiment of the disclosure;

FIG. 8 is a schematic diagram of discarding BAP buffered data packets according to a sliding window according to an embodiment of the disclosure;

FIG. 9 is one of the structural diagrams of an IAB node according to an embodiment of the disclosure;

FIG. 10 is the second structural diagram of an IAB node according to an embodiment of the disclosure;

FIG. 11 is the third structural diagram of an IAB node according to an embodiment of the disclosure.

detailed description

The fifth-generation mobile communication technology (fifth-generation, 5G) system has introduced a multi-hop relay architecture IAB node. Figure 1 is an example. The radio access network (RAN) 2 that is peer to the terminal is the control plane Radio Resource Control (RRC) layer and the user plane Packet Data Convergence Protocol (PDCP) layer at the donor IAB On the (IAB donor) node, there are multiple wireless network nodes IAB nodes between the IAB donor node and the terminal, and an IAB node includes a mobile terminal (Mobile-Termination, MT) part and a data unit (Data Unit, DU) part. The MT part is responsible for establishing a connection between the IAB node and the upper-level network node (also called the parent node), and the DU part is responsible for communicating with the lower-level node or terminal.

In the IAB architecture, the IAB node air interface user plane layer 2 has only the Backhaul Adapt Protocol (BAP) layer, the RLC layer and the Media Access Control (MAC) layer. Figure 1 is only a schematic diagram, and the specific modeling method of the BAP layer has not yet been determined.

In Figure 1, data packet #1 has been received by IAB node#2; data packet #2 is being transmitted between IAB node#1 and IAB node#2, and has not been successfully transmitted; data packet #3 has been submitted to IAB node#1 The RLC layer has been organized into an RLC protocol data unit (Protocol Data Unit, PDU), and transmission has not started yet, and the data packet #4 has not yet been delivered to the RLC layer of IAB node#1. At this time, the network topology changes, IAB node#1 changes from accessing IAB node#2 to accessing IAB node#3, and connects the terminal (such as User Equipment (UE)) and the IAB donor through the alternate path. transmission.

The reasons for network topology changes can be:

(1) A radio link failure occurs between IAB node#1 and IAB node#2, RRC re-establishment occurs on IAB node#1, and an RRC connection is established with IAB node#3;

(2) IAB node#1 switches from IAB node#2 to IAB node#3;

(3) Other specific reasons, such as the need for network load balancing, etc.

When IAB node#1 initiates wireless link creation to IAB node#3, the related technical solution is RLC layer reconstruction, and the data in the RLC layer transmission buffer and unsuccessful data are discarded.

When switching from IAB node#1 to IAB node#3, RLC re-establishment is also required. If the terminal is handed over between base stations, for RLC Acknowledged Mode (AM) mode, there is an Xn interface or target between the original base station and the target base station. There is an interface between the base station and the core network for data forwarding, maintaining the continuity of the RLC sequence number (SN), so that RLC AM data packets can be transmitted losslessly, but in the IAB architecture, IAB node#3 does not have a forwarding data transmission for IAB node#1 Therefore, the data that is not successfully transmitted and the data submitted to the RLC layer will be lost, just like the wireless link reconstruction.

Therefore, if the related technology is directly applied to the scene where the IAB topology changes, specifically, when the IAB node changes, the lossless data transmission cannot be guaranteed.

The technical solutions in the embodiments of the present disclosure will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, rather than all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of the present disclosure.

The term "comprising" in the specification and claims of this application and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or device that includes a series of steps or units is not necessarily limited to clear Instead, those steps or units listed below may include other steps or units that are not clearly listed or are inherent to these processes, methods, products, or equipment. In addition, the use of "and/or" in the specification and claims means at least one of the connected objects, such as A and/or B, which means that A and B alone are included, and there are three cases for both A and B.

In the embodiments of the present disclosure, words such as "exemplary" or "for example" are used as examples, illustrations, or illustrations. Any embodiment or design solution described as "exemplary" or "for example" in the embodiments of the present disclosure should not be construed as being more preferable or advantageous than other embodiments or design solutions. To be precise, words such as "exemplary" or "for example" are used to present related concepts in a specific manner.

Referring to FIG. 2, an embodiment of the present disclosure provides a method for data transmission in a relay network. The execution subject of the method may be an integrated access backhaul (Integrated Access and Backhaul, IAB) node (node), including: step 201 and step 202.

Step 201: Buffer the data packets with unconfirmed transmission status through the Backhaul Adaptation Protocol (BAP) layer in the IAB node;

Step 202: If the upper-level node accessed by the IAB node changes, the data packet whose transmission status is not confirmed is transmitted to the new upper-level node.

Specifically, if the upper-level node accessed by the IAB node changes, the data packet with the unconfirmed transmission status is delivered to the lower layer of the BAP layer in the IAB node after the upper-level node is changed, and transmitted to the new upper-level node.

In the embodiments of the present disclosure, the lower layers of the BAP layer include: a radio link control (RLC) layer and/or a media access control (Media Access Control, MAC) layer.

In some embodiments, the data packets with unconfirmed transmission status buffered by the BAP layer include one or a combination of the following:

(1) Data packets arriving at the BAP layer that have not yet been delivered to the lower layer of the BAP layer;

(2) Data packets that have been submitted to the lower layers of the BAP layer and have not been transmitted over the air interface;

(3) Data packets that have not received confirmation feedback (or positive feedback) have been transmitted over the air interface;

Among them, the BAP layer buffer that buffers the aforementioned data packets whose transmission status is not confirmed is called a BAP buffer.

Optionally, the amount of data in the BAP buffer is not included in the buffer status report (Buffer Status Report, BSR) reported by the IAB node.

Exemplarily, the BAP layer caches data packets in any of the following ways:

(1) After the BAP layer receives the data packet sent by the lower-level IAB node or terminal, it directly submits the data packet to the RLC layer, and caches the data packet that has been submitted to the RLC layer, which is called redundant buffering. The amount of data in the cache is not included in the cache status report BSR that the IAB node may report to the higher-level IAB node, see Figure 3;

(2) After the BAP layer receives the data packet sent by the lower-level IAB node or the terminal, it will partially submit the data packet to the RLC layer, that is, there may be a data buffer to be transmitted in the BAP layer, and the BAP layer will send the data packet that has been submitted to the RLC layer Cache is called redundant cache. The amount of data in the redundant cache is not included in the BSR that the IAB node may report to the higher-level IAB node. The data packets buffered in the BAP layer are included in the transmission buffer as well as in the redundant buffer. The amount of data in the BAP layer transmission buffer shall be included in the buffer state of the BSR, and the redundant buffer shall not be included in the buffer state of the BSR. See Figure 4.

The "BAP buffer" described in the embodiments of the present disclosure corresponds to the redundant buffer in the two ways of buffering data packets at the BAP layer.

In some embodiments, the method further includes: after the upper-level node accessed by the IAB node is changed, reconstructing the lower layer (for example, the RLC layer and/or the MAC layer) of the original BAP layer.

In some implementation manners, after the data packets whose transmission status is not confirmed by the BAP layer are buffered, the data packets buffered by the BAP are deleted by a combination of one or more of the following methods:

Manner 1: Delete the data packet in the BAP buffer according to the confirmation feedback of the lower layer of the BAP layer, the confirmation feedback indicating that the data packet in the BAP buffer has been successfully transmitted;

Manner 2: Delete the data packet in the BAP buffer by using a timer;

Exemplarily, after the data packet arrives at the BAP layer, or the data packet is delivered to the lower layer of the BAP layer, the timer of the data packet is started; when the timer expires, the data in the BAP layer cache is deleted package. Further, the duration of the timer is configured by the donor node (gNB donor) or agreed by a protocol.

Manner 3: Delete the data packet in the BAP cache through a sliding window;

Exemplarily, after the data packet reaches the BAP layer, or the data packet is delivered to the lower layer of the BAP layer, the upper boundary of the sliding window is adjusted (for example, the upper boundary of the sliding window is increased by 1); the maximum length of the sliding window is reached Then, adjust the upper and lower boundaries of the sliding window (for example, when the sliding window reaches the maximum length, the upper boundary is increased by 1, and the lower boundary is also increased by 1), and delete the BAP cache that has exceeded the sliding window The boundary of the packet. Further, the maximum length of the sliding window is configured by the donor node or agreed by an agreement.

It is understandable that the data packets enter the sliding window in the order of entering the BAP layer. The identifier may be allocated within the BAP layer, or the BAP SN or PDCP SN may also be used.

Manner 4: After the upper-level node accessed by the IAB node is changed, and the data packet in the BAP buffer is delivered to the lower layer of the BAP layer, the data packet in the BAP buffer is deleted.

Optionally, the confirmation feedback is confirmation feedback sent by the RLC layer, and the specific content includes one or more of the following:

(a) A first identifier, the first identifier includes: the PDCP SN of the data packet, and further, the first identifier further includes: a terminal identifier and/or a bearer identifier;

(b) A second identifier, where the second identifier includes: a BAP SN allocated by the BAP layer for the data packet to uniquely identify the data packet delivered from the BAP layer to the lower layer of the BAP layer;

(c) The third identifier, the third identifier includes: RLC SN.

Embodiment 1: Data transmission when the IAB node changes the access node, see Figure 5.

Step 1: The BAP layer in IAB node1 buffers the data packets to be transmitted (or called the data packets with unconfirmed transmission status), including: data packets that have not been submitted to the RLC layer, and have been submitted to the RLC layer (and/or MAC layer) Data packets, data packets that have been transmitted to the upper-level node on the air interface;

For example, the data packet to be transmitted is buffered through a redundant buffer and/or a transmission buffer.

Step 2: If the conditions for deleting the BAP cache are met, delete the data packets in the BAP cache, for example, delete data packet #2, data packet #3, and data packet #4;

It can be understood that the specific process of deleting data packets in the BAP cache can refer to Embodiments 2-6.

Step 3: If the IAB node is connected to another superior node (parent IAB node or IAB donor), the BAP layer delivers the data packets in the BAP buffer to the RLC layer after the new connection is established for transmission.

Further, when the BAP layer delivers the data packet in the BAP buffer to the RLC layer after the new connection is established, the RLC SN is allocated to the data packet.

Step 4: Optionally, after the IAB node submits the data packets in the BAP cache to the RLC layer after the new connection is established, delete the data packets in the BAP cache before the IAB node re-establishes the connection.

Embodiment 2: RLC feeds back successfully transmitted data packets to BAP according to PDCP SN, see FIG. 6.

Step 1: The BAP layer parses the identification identifier carried by the data packet, such as PDCP SN, and the BAP layer submits the data packet to the RLC layer. Optionally, the identification identifier also includes: terminal identification and/or bearer identification;

Step 2: The RLC layer receives the data packet submitted by the BAP layer, organizes it into RLC PDU for air interface transmission, and parses the identification identifier that the data packet carries, such as PDCP SN. Optionally, the identification identifier also includes terminal identification and/or Bearer identification

Step 3: The RLC layer receives the RLC feedback sent by the peer end, and for the data packet that receives the RLC ACK, it feeds back to the BAP the identifier of the data packet that can be recognized by the BAP layer, specifically the feedback PDCP SN, optionally, also includes: terminal identifier And/or bearer identification;

For example, feedback the data packet #2, data packet #3 receiving success indication, or feedback the data packet #4, data packet #5 receiving success indication.

Step 4: The BAP layer deletes the successfully sent data packets in the BAP buffer according to the feedback of the RLC layer.

Embodiment 3: The RLC reports a successful data packet transmission to the BAP according to the BAP SN, see FIG. 6.

Step 1: The BAP layer submits the data packet to the RLC layer, and assigns a BAP SN to the data packet;

Step 2: The RLC layer receives the data packet submitted by the BAP layer and the BAP SN corresponding to the data packet. The RLC layer can strip the BAP SN and not include it in the RLC PDU, or it can also include the BAP SN in the RLC PDU. in;

Step 3: The RLC layer receives the RLC feedback sent by the peer, and feeds back the BAP SN of the data packet that successfully received the RLC ACK to the BAP;

For example, feedback data packet #2, data packet #3 receiving success indication, or feedback data packet #4, data packet #5 receiving success indication.

Embodiment 4: The RLC reports a successful data packet transmission to the BAP according to the RLC SN, see FIG. 6.

Step 1: The BAP layer delivers the data packet to the RLC layer;

Step 2: The RLC layer receives the data packet submitted by the BAP layer and allocates RLC SN to it;

Step 3: The RLC layer will notify the BAP of the RLC SN allocated for the data packet submitted by the BAP layer;

Step 4: The RLC layer receives the RLC feedback sent by the opposite end, and feeds back to the BAP the RLC SN of the data packet that successfully received the RLC ACK;

Step 5: The BAP layer deletes the successfully sent data packets in the BAP buffer according to the feedback from the RLC layer.

Embodiment 5: discarding the BAP buffer data packet according to the discarding timer, see FIG. 7.

It should be noted that Embodiment 5 is a single-layer behavior at the IAB node BAP layer.

The BAP layer starts a discard timer for each data packet after each data packet reaches the BAP layer, or after the data packet is delivered from the BAP layer to the RLC layer. When the timer expires, the corresponding BAP buffer data packet in the BAP buffer is discarded. For example, drop packet #2.

Further, the BAP buffer packet discarding timer is configured or pre-configured by gNB donor.

Embodiment 6: discarding the BAP buffer data packet according to the sliding window, see FIG. 8.

It should be noted that Embodiment 6 is a single-layer behavior at the IAB node BAP layer.

The BAP layer adds 1 to the upper boundary of the sliding window after each data packet reaches the BAP layer, or after the data packet is delivered from the BAP layer to the RLC layer. When the sliding window reaches the maximum length, the upper boundary increases by 1, and the lower boundary also Add 1 and discard the data packets in the BAP buffer that have exceeded the sliding window. For example, drop packet #0.

Further, the maximum length of the sliding window is configured or pre-configured by gNB Donor.

Referring to FIG. 9, an embodiment of the present disclosure also provides an IAB node, and the IAB node 900 includes:

The buffer module 901 is used to buffer data packets whose transmission status is not confirmed through the BAP layer in the IAB node;

The processing module 902 is configured to, if the upper-level node accessed by the IAB node changes, transmit the unconfirmed data packet to the new upper-level node. Specifically, if the upper-level node accessed by the IAB node changes, the unconfirmed The data packet of the transmission status is submitted to the lower layer of the BAP layer in the IAB node after the upper-level node is changed, and is transmitted to the new upper-level node.

In the embodiments of the present disclosure, the lower layers of the BAP layer include: RLC layer and/or MAC layer.

(2) Data packets that have been submitted to the lower layer and have not been transmitted over the air interface;

(3) The data packet for which the confirmation feedback has not been received has been transmitted on the air interface.

Optionally, the amount of data in the BAP cache is not included in the BSR reported by the IAB node.

In some embodiments, the IAB node 900 further includes: a reconstruction module, which is used to reconstruct the lower layer of the original BAP layer after the upper-level node accessed by the IAB node is changed.

Manner 2: Delete the data packet in the BAP buffer by using a timer;

Manner 3: Delete the data packet in the BAP cache through a sliding window;

(b) A second identifier, where the second identifier includes: the BAP SN allocated by the BAP layer for the data packet to uniquely identify the data packet delivered from the BAP layer to the lower layer of the BAP layer, further;

(c) The third identifier, the third identifier includes: RLC SN.

The IAB node provided by the embodiment of the present disclosure can execute the embodiment shown in FIG. 2 above, and its implementation principles and technical effects are similar, and the details are not repeated here in this embodiment.

Referring to FIG. 10, an embodiment of the present disclosure also provides an IAB node. The IAB node 1000 includes a processor 1001 and a transceiver 1002, where:

The processor 1001 is configured to cache data packets whose transmission status is not confirmed through the BAP layer in the IAB node;

The processor 1001 is further configured to, if the upper-level node accessed by the IAB node changes, transmit the data packet whose transmission status has not been confirmed to the new upper-level node. Specifically, if the upper-level node accessed by the IAB node changes, the The data packet confirming the transmission status is submitted to the lower layer of the BAP layer in the IAB node after the upper-level node is changed, and is transmitted to the new upper-level node.

In some embodiments, the processor 1002 is further configured to reconstruct the lower layer of the original BAP layer after the upper-level node accessed by the IAB node is changed.

In some implementation manners, after the data packets whose transmission status is not confirmed by the BAP layer are buffered, the data packets in the BAP buffer are deleted by a combination of one or more of the following methods:

Manner 2: Delete the data packet in the BAP buffer by using a timer;

Manner 3: Delete the data packet in the BAP cache through a sliding window;

(c) The third identifier, the third identifier includes: RLC SN.

Please refer to FIG. 11. FIG. 11 is a structural diagram of an IAB node applied in an embodiment of the present disclosure. As shown in FIG. 11, the IAB node 1100 includes: a processor 1101, a transceiver 1102, a memory 1103, and a bus interface. The processor 1101 Can be responsible for managing the bus architecture and general processing. The memory 1103 may store data used by the processor 1101 when performing operations.

In an embodiment of the present disclosure, the IAB node 1100 further includes: a program that is stored in the memory 1103 and can run on the processor 1101, and the program is executed by the processor 1101 to implement the steps in the method shown in FIG. 2 above.

In FIG. 11, the bus architecture may include any number of interconnected buses and bridges. Specifically, one or more processors represented by the processor 1101 and various circuits of the memory represented by the memory 1103 are linked together. The bus architecture can also link various other circuits such as peripherals, voltage regulators, power management circuits, etc., which are all known in the art, and therefore, no further descriptions are provided herein. The bus interface provides the interface. The transceiver 1102 may be multiple elements, that is, including a transmitter and a receiver, and provide a unit for communicating with various other devices on the transmission medium.

The IAB node provided by the embodiment of the present disclosure can execute the method embodiment shown in FIG. 2 above, and its implementation principles and technical effects are similar, and details are not described in this embodiment here.

The steps of the method or algorithm described in connection with the disclosure of the present disclosure may be implemented in a hardware manner, or may be implemented in a manner of executing software instructions on a processor. Software instructions can be composed of corresponding software modules, which can be stored in random access memory (Random Access Memory, RAM), flash memory, memory (Read-Only Memory, ROM), erasable programmable read-only memory (Erasable PROM (EPROM), Electrically Erasable Programmable Read-Only Memory (EPROM, EEPROM), registers, hard disk, mobile hard disk, CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor, so that the processor can read information from the storage medium and can write information to the storage medium. Of course, the storage medium may also be an integral part of the processor. The processor and the storage medium may be carried in an application specific integrated circuit (ASIC). In addition, the ASIC can be carried in the core network interface device. Of course, the processor and the storage medium may also exist as discrete components in the core network interface device.

Those skilled in the art should be aware that in one or more of the above examples, the functions described in the present disclosure can be implemented by hardware, software, firmware, or any combination thereof. When implemented by software, these functions can be stored in a computer-readable medium or transmitted as one or more instructions or codes on the computer-readable medium. Computer readable media include computer storage media and communication media, where communication media includes any media that facilitates the transfer of computer programs from one place to another. The storage medium may be any available medium that can be accessed by a general-purpose or special-purpose computer.

The specific implementations described above further describe the purpose, technical solutions and beneficial effects of the present disclosure in further detail. It should be understood that the foregoing are only specific implementations of the present disclosure and are not intended to limit the disclosure. The protection scope, any modification, equivalent replacement, improvement, etc. made on the basis of the technical solution of the present disclosure shall be included in the protection scope of the present disclosure.

Those skilled in the art should understand that the embodiments of the present disclosure may be provided as methods, systems, or computer program products. Therefore, the embodiments of the present disclosure may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the embodiments of the present disclosure may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

The embodiments of the present disclosure are described with reference to flowcharts and/or block diagrams of methods, devices (systems), and computer program products according to the embodiments of the present disclosure. It should be understood that each process and/or block in the flowchart and/or block diagram, and the combination of processes and/or blocks in the flowchart and/or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to the processors of general-purpose computers, special-purpose computers, embedded processors, or other programmable data processing equipment to generate a machine, so that instructions executed by the processor of the computer or other programmable data processing equipment are used It is a device that realizes the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device. The device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so that the computer or other programmable equipment is executed The instructions provide steps for implementing functions specified in a flow or multiple flows in the flowchart and/or a block or multiple blocks in the block diagram.

It should be noted that it should be understood that the division of the above modules is only a division of logical functions, and may be fully or partially integrated into a physical entity in actual implementation, or may be physically separated. And these modules can all be implemented in the form of software called by processing elements; they can also be implemented in the form of hardware; some modules can be implemented in the form of calling software by processing elements, and some of the modules can be implemented in the form of hardware. For example, the determining module may be a separately established processing element, or it may be integrated into a certain chip of the above-mentioned device for implementation. In addition, it may also be stored in the memory of the above-mentioned device in the form of program code, and a certain processing element Call and execute the functions of the above-identified module. The implementation of other modules is similar. In addition, all or part of these modules can be integrated together or implemented independently. The processing element described here may be an integrated circuit with signal processing capability. In the implementation process, each step of the above method or each of the above modules can be completed by hardware integrated logic circuits in the processor element or instructions in the form of software.

For example, each module, unit, sub-unit or sub-module may be one or more integrated circuits configured to implement the above method, for example: one or more application specific integrated circuits (ASIC), or, one or Multiple microprocessors (digital signal processors, DSP), or one or more field programmable gate arrays (Field Programmable Gate Array, FPGA), etc. For another example, when one of the above modules is implemented in the form of processing element scheduling program code, the processing element may be a general-purpose processor, such as a central processing unit (CPU) or other processors that can call program codes. For another example, these modules can be integrated together and implemented in the form of a system-on-a-chip (SOC).

The terms “first”, “second”, etc. in the specification and claims of the present disclosure are used to distinguish similar objects, and not necessarily used to describe a specific sequence or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances so that the embodiments of the present disclosure described herein, for example, are implemented in a sequence other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations of them are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to the clearly listed Those steps or units may include other steps or units that are not clearly listed or are inherent to these processes, methods, products, or equipment. In addition, the use of "and/or" in the specification and claims means at least one of the connected objects, such as A and/or B and/or C, which means that it includes A alone, B alone, C alone, and both A and B Exist, B and C exist, A and C exist, and A, B, and C exist in 7 situations. Similarly, the use of "at least one of A and B" in this specification and claims should be understood as "A alone, B alone, or both A and B exist".

Obviously, those skilled in the art can make various changes and modifications to the embodiments of the present disclosure without departing from the spirit and scope of the present disclosure. In this way, if these modifications and variations of the embodiments of the present disclosure fall within the scope of the claims of the present disclosure and equivalent technologies, the present disclosure also intends to include these modifications and variations.

Claims

A method for data transmission in a relay network, applied to integrated access backhaul IAB nodes, includes:

Buffer the data packets whose transmission status is not confirmed through the BAP layer of the backhaul adaptive protocol in the IAB node;

If the upper-level node accessed by the IAB node changes, the data packet with the unconfirmed transmission status is transmitted to the new upper-level node.
The method according to claim 1, wherein if the upper-level node accessed by the IAB node changes, transmitting the data packet with the unconfirmed transmission status to the new upper-level node comprises:

If the upper-level node that the IAB node accesses is changed, the data packet with the unconfirmed transmission status is delivered to the lower layer of the BAP layer in the IAB node after the upper-level node is changed, and transmitted to the new upper-level node.
The method according to claim 1, wherein the data packets with unconfirmed transmission status buffered by the BAP layer include one or a combination of the following:

Data packets arriving at the BAP layer that have not yet been delivered to the lower layer of the BAP layer;

Data packets that have been submitted to the lower layers of the BAP layer and have not been transmitted over the air interface;

The data packet for which the confirmation feedback has not been received has been transmitted on the air interface.
The method according to claim 3, wherein the amount of data in the BAP buffer is not included in the buffer status report BSR reported by the IAB node.
The method according to claim 1, further comprising:

After the upper-level node that the IAB node accesses is changed, the lower layer of the original BAP layer is reconstructed.
The method according to claim 3, wherein, after buffering the data packets whose transmission status is not confirmed by the BAP layer, delete the data packets in the BAP buffer by a combination of one or more of the following methods:

Deleting the data packet in the BAP buffer according to the confirmation feedback of the lower layer of the BAP layer, the confirmation feedback indicating that the data packet in the BAP buffer has been successfully transmitted;

Delete the data packet in the BAP buffer by using a timer;

Delete the data packet in the BAP cache through the sliding window;

After the upper-level node accessed by the IAB node changes, and the data packet in the BAP cache is delivered to the lower layer of the BAP layer, the data packet in the BAP cache is deleted.
The method according to claim 6, wherein the confirmation feedback is a confirmation feedback sent by the RLC layer, and the specific content includes one or more of the following:

A first identifier, where the first identifier includes: PDCP SN of the data packet;

A second identifier, where the second identifier includes: a BAP SN allocated by the BAP layer to uniquely identify a data packet delivered from the BAP layer to the lower layer of the BAP layer;

The third identifier, the third identifier includes: the RLC SN allocated by the RLC layer for the data packet.
The method according to claim 7, wherein the first identification further comprises: a terminal identification and/or a bearer identification.
The method according to claim 7, wherein the second identifier BAPSN is allocated by the BAP layer, or the second identifier BAPSN is defined between the BAP layer and the lower layer of the BAP layer in a reservation manner.
The method according to claim 6, wherein the deleting the data packet in the BAP buffer by using a timer comprises:

After the data packet reaches the BAP layer, or the data packet is delivered to the lower layer of the BAP layer, start the timer of the data packet;

When the timer expires, delete the data packet in the BAP layer cache.
The method according to claim 6 or 10, wherein the duration of the timer is configured by the donor node or agreed by a protocol.
The method according to claim 6, wherein deleting the data packet in the BAP buffer through a sliding window comprises:

After the data packet reaches the BAP layer, or the data packet is delivered to the lower layer of the BAP layer, adjust the upper boundary of the sliding window;

After the sliding window reaches the maximum length, the upper boundary and the lower boundary of the sliding window are adjusted, and the data packets that have exceeded the boundary of the sliding window in the BAP buffer are deleted.
The method according to claim 6 or 12, wherein the maximum length of the sliding window is configured by the donor node or agreed by an agreement.
The method according to any one of claims 1 to 13, wherein the lower layer of the BAP layer comprises: a radio link control RLC layer and/or a medium access control MAC layer.
An IAB node, including:

The cache module is used to cache data packets whose transmission status has not been confirmed through the BAP layer in the IAB node;

The processing module is configured to transmit the data packet with the unconfirmed transmission status to the new upper-level node if the upper-level node accessed by the IAB node changes.
An IAB node, including: a processor and a transceiver, where,

The processor is configured to cache data packets whose transmission status is not confirmed through the BAP layer in the IAB node;

The processor is further configured to, if the upper-level node accessed by the IAB node changes, transmit the data packet with the unconfirmed transmission status to the new upper-level node.
An IAB node, comprising: a processor, a memory, and a program stored on the memory and capable of running on the processor, and the program is executed by the processor to implement any one of claims 1 to 14 The steps of the method of data transmission in the relay network described in the item.
A computer-readable storage medium having a computer program stored on the computer-readable storage medium, and when the computer program is executed by a processor, the data transmission in the relay network according to any one of claims 1 to 14 is realized Method steps.