METHOD AND APPRATUS FOR LINK MAINTENANCE

Abstract

 This application relates to the field of communications technologies, and provides a link maintenance method and an apparatus in a relay system, to reduce a service interruption latency caused by an instantaneous change of network traffic or an instantaneous interruption of a high frequency link in a multi-hop relay network, avoid service congestion caused by an instantaneous change of a terminal or traffic of a backhaul link, and improve availability of the backhaul link. The method includes: determining, by a first node, a candidate neighboring node to be measured; measuring, by the first node, the candidate neighboring node; determining, by the first node based on a measurement result, whether to establish or delete a backup backhaul link between the first node and the candidate neighboring node; and sending, by the first node, a request to a second node, where the request is used to request the second node to establish or delete the backup backhaul link between the first node and the candidate neighboring node.

Description

[0001] This application claims priority to Chinese Patent Application No. 201810190096.0, filed with China National Intellectual Property Administration on March 8, 2018 and entitled "LINK MAINTENANCE METHOD AND APPARATUS", which is incorporated herein by reference in its entirety.

TECHNICAL FIELD

[0002] The present disclosure relates to communications technologies, and more specifically, to a link maintenance method and an apparatus.

BACKGROUND

[0003] High frequency is an important deployment scenario of new radio (new radio, NR). Electromagnetic wave at the high frequency has disadvantages such as a poor diffraction capability and severe propagation attenuation. Consequently, there is a high possibility that a coverage hole exists in a network. Due to factors such as deployment costs, it is difficult for an operator to resolve a problem of the coverage hole by depending only on a wired TRP. In this case, it is necessary to introduce a relay having a wireless backhaul link. In this application, a relay node integrating access and backhaul is referred to as a relay transmission reception point (relay transmission reception point, rTRP), to be distinguished from a relay in LTE.

[0004] An in-band relay is a relay in which a backhaul link and an access link operate on a same frequency band. The in-band relay has advantages such as high spectral efficiency and low deployment costs, but has an impact on a physical layer protocol. In long term evolution advanced (long term evolution advance, LTE-A), an in-band relay solution in Release (release) 11 is standardized. However, in LTE-A, a relay network can support only two-hop transmission, that is, the relay node cannot provide service for another relay node.

[0005] In NR, a third generation partnership project (third generation partnership project, 3GPP) determines that an integrated access and backhaul (integrated access and backhaul, IAB) is used as an important feature to improve NR performance, and the IAB is an in-band relay solution with integrated access and backhaul links. Multi-hop multi-connectivity is a main design objective of NR IAB. In a multi-hop multi-connectivity relay network, a relay node may provide service to another relay node, that is, one relay node may have both a parent node and a child node, where the child node may be another relay, or may be user equipment (user equipment, UE) served by the relay node. When a relay node has both a parent node and a child node, a relay system has both a backhaul link and an access link. In a multi-hop relay scenario, relays in a network form a relay network, and there is a specific topology structure.

[0006] In NR, because a supported bandwidth is relatively high, for example, a downlink bandwidth may be 1 Gbps (giga bits per second, Gbps) or even higher, the bandwidth in the network may also change quickly. If the relay node supporting the IAB has only one backhaul link, congestion may be caused. On the other hand, a high bandwidth may cause a base station or the relay node to use a high frequency. A main feature of the high frequency is that the base station or the relay node is easily affected by an environment, and an instantaneous interruption easily occurs. Consequently, a backhaul link of a wireless relay network changes, and availability of the backhaul link is also affected. Therefore, in the NR IAB, improving availability of the backhaul link is a problem that needs to be resolved.

SUMMARY

[0007] Embodiments of this application provide a relay topology maintenance method and an apparatus, to resolve a problem that a backhaul link is unavailable in a multi-hop relay network due to an instantaneous change of network traffic or an instantaneous interruption of a high frequency link.

[0008] To achieve the foregoing objective, the following technical solutions are used in the embodiments of this application.

[0009] According to a first aspect, a link maintenance method is provided. The method includes: determining, by a first node, a candidate neighboring node to be measured; measuring, by the first node, the candidate neighboring node; determining, by the first node based on a measurement result, whether to establish or delete a backup backhaul link between the first node and the candidate neighboring node, and sending, by the first node, a request to a second node, where the request is used to request the second node to establish or delete the backup backhaul link between the first node and the candidate neighboring node. In the foregoing technical solution, a service interruption latency in a multi-hop relay network caused by an instantaneous change of network traffic or an instantaneous interruption of a high-frequency link may be reduced, service congestion caused by an instantaneous change of a terminal or traffic of a backhaul link may be avoided, and availability of the backhaul link may be improved.

[0010] In a possible implementation of the first aspect, the first node receives a backhaul link measurement threshold configured by the second node, where the backhaul link measurement threshold is used by the first node to determine backhaul link quality. In the foregoing technical solution, a threshold is configured for the first node, so that the first node may autonomously determine whether to establish the backup backhaul link between the first node and the candidate neighboring node, thereby reducing a calculation volume of the second node and improving system performance.

[0011] In a possible implementation of the first aspect, the first node receives a measurement indication sent by the second node, where the measurement indication includes an identifier of a potential neighboring node, and the identifier of the potential neighboring node is used by the first node to determine the candidate neighboring node. In the foregoing technical solution, the second node determines a potential neighboring node to be measured, for the first node, to avoid processing of a measurement message by some simple relay nodes, such as layer 2 relay nodes, and help the second node optimize access network performance.

[0012] In a possible implementation of the first aspect, the first node receives a measurement result that is of a potential neighboring node and that is sent by a terminal, where the measurement result of the potential neighboring node is used by the first node to determine the candidate neighboring node. In the foregoing technical solution, the first node may measure a neighboring cell by using the terminal, thereby reducing frequency of measuring the neighboring cell by the first node, improving service transmission performance of the first node, and minimizing service interruption caused by measuring the neighboring cell by the first node.

[0013] In a possible implementation of the first aspect, if the first node determines to establish a backhaul link between the first node and the candidate neighboring node, the first node initiates a random access process to the candidate neighboring node. In the foregoing technical solution, the first node automatically establishes the backup backhaul link between the first node and the candidate neighboring node through random access, thereby reducing establishment overheads of the second node. In addition, the first node directly interacts with the candidate neighboring node through random access, thereby reducing a time for establishing the backup backhaul link.

[0014] In a possible implementation of the first aspect, the determining, by the first node based on a measurement result, whether to establish or delete a backup backhaul link between the first node and the candidate neighboring node includes: determining, by the first node, to establish the backup backhaul link between the first node and the candidate neighboring node when a condition M_r - H_ys > Thresh is met, where M_r is a measurement result of the candidate neighboring node by the first node, H_ys is an event hysteresis parameter, and Thresh is a backhaul link measurement threshold; or determining, by the first node, to delete the backup backhaul link between the first node and the candidate neighboring node when a condition M_r + H_ys < Thresh is met. In the foregoing technical solution, the first node determines, by triggering an event, whether to establish or delete the backup backhaul link, thereby improving stability of the backup backhaul link, and avoiding signaling overheads caused by unnecessary backhaul link establishment.

[0015] According to a second aspect, a link maintenance method is provided. The method includes: receiving, by a second node, a first request sent by a first node, where the first request is used to request the second node to establish or delete a backup backhaul link between the first node and a candidate neighboring node; and sending, by the second node, a response to the first node. In the foregoing technical solution, the second node controls addition or deletion of the backup backhaul link of the first node, to help a network maintain a link of a relay system, reduce interference caused by a change of a backhaul link to a system, and improve access network performance.

[0016] In a possible implementation of the second aspect, the second node sends a backhaul link measurement threshold to the first node, where the backhaul link measurement threshold is used by the first node to determine backhaul link quality. In the foregoing technical solution, a threshold is configured for the first node, so that the first node may autonomously determine whether to establish the backup backhaul link between the first node and the candidate neighboring node, thereby reducing a calculation volume of the second node and improving system performance.

[0017] In a possible implementation of the second aspect, the second node sends a measurement indication to the first node, where the measurement indication includes an identifier of a potential neighboring node, and the identifier of the potential neighboring node is used by the first node to determine the candidate neighboring node. In the foregoing technical solution, the second node determines a potential neighboring node to be measured, for the first node, to avoid processing of a measurement message by some simple relay nodes, such as layer 2 relay nodes, and help the second node optimize access network performance.

[0018] In a possible implementation of the second aspect, the second node sends a second request to the candidate neighboring node, where the second request is used by the candidate neighboring node to establish or delete a bearer to the second node or a user plane function. In the foregoing technical solution, service interruption caused by interruption or congestion of an in-use backhaul link may be avoided through bearer pre-establishment, and the backup backhaul link may be quickly activated through the pre-established bearer, so that a service interruption latency of the first node is reduced, and service interruption or delay caused by a link change is avoided.

[0019] According to another aspect of this application, a first node is provided. The first node is configured to implement a function in the link maintenance method according to any one of the first aspect or the possible implementations of the first aspect. The function may be implemented by hardware, or may be implemented by hardware executing corresponding software. The hardware or the software includes one or more units corresponding to the foregoing function.

[0020] In a possible implementation, a structure of a first node device includes a processor and a memory. The memory stores code and data, and the memory is coupled to the processor, the processor is configured to support the first node in performing the link maintenance method provided in any one of the first aspect or the possible implementations of the first aspect. Optionally, the first node may further include a communications interface and a bus. The communications interface is connected to the memory and the processor through the bus.

[0021] According to another aspect of this application, a second node is provided. The second node is configured to implement a function in the link maintenance method according to any one of the second aspect or the possible implementations of the second aspect. The function may be implemented by hardware, or may be implemented by hardware executing corresponding software. The hardware or the software includes one or more units corresponding to the foregoing function.

[0022] In a possible implementation, a structure of the second node includes a processor and a memory. The memory stores code and data, and the memory is coupled to the processor, the processor is configured to support the second node in performing the link maintenance method provided in any one of the second aspect or the possible implementations of the second aspect. Optionally, the second node may further include a communications interface and a bus. The communications interface is connected to the memory and the processor through the bus.

[0023] According to another aspect of this application, a computer-readable storage medium is provided. The computer-readable storage medium stores an instruction, and when the instruction is run on a computer, the computer is enabled to perform the link maintenance method provided in any one of the first aspect or the possible implementations of the first aspect, or perform the link maintenance method provided in any one of the second aspect or the possible implementations of the second aspect.

[0024] According to another aspect of this application, a computer program product including an instruction is provided. When the computer program product is run on a computer, the computer is enabled to perform the link maintenance method provided in any one of the first aspect or the possible implementations of the first aspect, or perform the link maintenance method provided in any one of the second aspect or the possible implementations of the second aspect.

[0025] According to another aspect of this application, a communications system is provided. The communications system includes a plurality of nodes, and the plurality of nodes include a first node and a second node, where the first node is the first node provided in the foregoing aspects, and is configured to support the first node in performing the link maintenance method provided in any one of the first aspect or the possible implementations of the first aspect; and/or the second node is the second node provided in the foregoing aspects, and is configured to support the second node in performing the link maintenance method provided in any one of the second aspect or the possible implementations of the second aspect.

[0026] It may be understood that any one of the apparatus, the computer storage medium, or the computer program product that perform the link maintenance method and that are provided above are configured to perform the corresponding method provided above. Therefore, for beneficial effects of the apparatus, the computer storage medium, or the computer program product, refer to the beneficial effects in the corresponding method provided above. Details are not described herein again.

[0027] It may be understood that any one of the apparatus, the computer storage medium, or the computer program product that perform the link maintenance method and that are provided above are configured to perform the corresponding method provided above. Therefore, for beneficial effects of the apparatus, the computer storage medium, or the computer program product, refer to the beneficial effects in the corresponding method provided above. Details are not described herein again.

BRIEF DESCRIPTION OF DRAWINGS

[0028] 

FIG. 1 is a schematic structural diagram of a communications system to which embodiments of this application are applicable;

FIG. 2 and FIG. 3 are architectural diagrams of protocol stacks of a user plane and a control plane of a layer 2 relay system respectively;

FIG. 4 and FIG. 5 are architectural diagrams of protocol stacks of a user plane and a control plane of a layer 3 relay system respectively;

FIG. 6 is a flowchart of establishing a backup backhaul link between a relay node and a neighboring node according to an embodiment of this application;

FIG. 7 is a schematic diagram showing that a first node initiates a random access process to a candidate neighboring node according to an embodiment of this application;

FIG. 8A and FIG. 8B show a procedure in which a candidate neighboring node establishes a bearer to a UPF according to an embodiment of this application;

FIG. 9 is a possible schematic structural diagram of a first node according to an embodiment of this application;

FIG. 10 is a schematic diagram of a possible logical structure of a first node according to an embodiment of this application;

FIG. 11 is a possible schematic structural diagram of a second node according to an embodiment of this application;

FIG. 12 is a schematic diagram of a possible logical structure of a second node according to an embodiment of this application;

FIG. 13 is a possible schematic structural diagram of a candidate neighboring node according to an embodiment of this application; and

FIG. 14 is a schematic diagram of a possible logical structure of a candidate neighboring node according to an embodiment of this application.

DESCRIPTION OF EMBODIMENTS

[0029] The following describes the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Definitely, the described embodiments are merely some but not all of the embodiments of the present invention. All other embodiments obtained by a person skilled in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present disclosure.

[0030] It should be understood that names of all nodes and messages in this application are merely names set for ease of description in this application, and may be different in an actual network. It should not be understood that the names of all the nodes and the messages are limited in this application, any name that has a function the same as or similar to that of the node or the message used in this application is considered as a method or equivalent replacement in this application, and falls within the protection scope of this application. Details are not described below again.

[0031] In consideration of a high bandwidth of a future wireless network, an integrated access and backhaul (integrated access and backhaul, IAB) solution is considered to be introduced in NR, to further reduce deployment costs and improve deployment flexibility. Therefore, a relay with integrated access and backhaul is introduced. In this application, a relay node integrating access and backhaul is referred to as a relay transmission reception point (relay transmission reception point, rTRP), to be distinguished from a relay in LTE. A 3rd generation partnership project (third generation partnership project, 3GPP) has determined to use NR IAB as a standardization target of Release (release) 16, and the NR IAB is currently in a research start phase.

[0032] However, due to a requirement for a high bandwidth in the NR, bandwidths of an access link and a backhaul link on a relay node that integrates access and backhaul are multiplied or dozens of times higher than those in conventional LTE. Therefore, introducing high frequency to the IAB is an option. On the other hand, at an early stage of deployment, more IAB nodes may work on a frequency band of 6 GHz or lower. For high frequency, instantaneous interruption may be caused from being affected by the environment. Consequently, a backhaul link may be unavailable. However, on the other hand, the NR supports multi-hop wireless relay. Therefore, there may be a plurality of options for routing of a backhaul link of the relay node, and a change of a high frequency link may cause a change of a routing topology of an IAB node, thereby affecting performance of the IAB node. To ensure the IAB in the NR, especially when a backhaul link of the IAB changes, maintaining an available backhaul link of the IAB and maintaining a route to a network is a problem that needs to be resolved.

[0033] FIG. 1 is a schematic structural diagram of a communications system to which embodiments of this application are applicable.

[0034] It should be noted that the communications system mentioned in the embodiments of this application includes but is not limited to a narrowband internet of things (narrow band-internet of things, NB-IoT) system, a long term evolution (long term evolution, LTE) system, a next-generation 5G mobile communications system or a communications system after 5G, or a device to device (device to device, D2D) communications system.

[0035] In the communications system shown in FIG. 1, an integrated access and backhaul IAB system is provided. One IAB system includes at least one base station 100, one or more user equipments (user equipment, UE) 101 served by the base station 100, one or more relay nodes rTRPs 110, and one or more UEs 111 served by the rTRPs 110. Usually, the base station 100 is referred to as a donor gNB (donor next generation NodeB, DgNB). The rTRP 110 is connected to the base station 100 through a wireless backhaul link 113. In this application, the donor gNB is also referred to as a donor node, namely, a donor node. The base station includes but is not limited to an evolved NodeB (evolved NodeB, eNB), a radio network controller (radio network controller, RNC), a node B (node B, NB), a base station controller (base station controller, BSC), a base transceiver station (base transceiver station, BTS), and a home base station (for example, a home evolved NodeB, or a home NodeB, HNB), a baseband unit (baseband unit, BBU), a next-generation new radio base station (for example, a gNB), or the like.

[0036] The integrated access and backhaul system may also include a plurality of other relay nodes, such as an rTRP 120 and an rTRP 130. The rTRP 120 is connected to the relay node rTRP 110 through the wireless backhaul link 123 to access the network. The rTRP 130 is connected to the relay node rTRP 110 through the wireless backhaul link 133 to access the network. The rTRP 120 serves the one or more UEs 121, and the rTRP 130 serves the one or more UEs 131. In FIG. 1, both the relay nodes rTRP 110 and rTRP 120 are connected to the network through the wireless backhaul links. In this application, the wireless backhaul links are viewed from a perspective of the relay node. For example, the wireless backhaul link 113 is a backhaul link of the relay node rTRP 110, and the wireless backhaul link 123 is a backhaul link of the relay node rTRP 120. As shown in FIG. 1, a relay node, for example, 120, may be connected to another relay node 110 through a wireless backhaul link, for example, 123, to be connected to the network. In addition, the relay node may be connected to the network through multiple levels of wireless relay nodes. Usually, a node that provides a resource of the wireless backhaul link, for example, 110, is referred to as a parent node of the relay node 120, and 120 is referred to as a child node of the relay node 110. Usually, the child node may be considered as a user equipment UE of the parent node. It should be understood that in the integrated access and backhaul system shown in FIG. 1, one relay node is connected to one parent node. However, in a future relay system, to improve reliability of the wireless backhaul link, one relay node, for example, 120, may have a plurality of parent nodes that simultaneously provide a service for one relay node. For example, the rTRP 130 in the figure may also be connected to the relay node rTRP 120 through a backhaul link 134, that is, both the rTRP 110 and the rTRP 120 are upper level nodes of the rTRP 130. In this application, the user equipments UEs 101, 111, 121, and 131 may be static or mobile devices. For example, the mobile devices may be a mobile phone, an intelligent terminal, a tablet computer, a notebook computer, a video game console, a multimedia player, or even a mobile relay node. The static devices are usually located at fixed locations, such as computers and access points (connected to the network through wireless links, such as static relay nodes). Names of the relay nodes rTRPs 110, 120, and 130 do not limit a scenario or a network in which the relay nodes rTRPs 110, 120, and 130 are deployed, and may be any other name such as a relay or RN. For ease of description, the rTRPs are used in this application.

[0037] In FIG. 1, radio links 102, 112, 122, 132, 113, 123, 133, and 134 may be bidirectional links, including uplink and downlink transmission links. Specifically, the wireless backhaul links 113, 123, 133, and 134 may be used by the parent node to provide a service for the child node, for example, a parent node 100 provides a wireless backhaul service for a child node 110. It should be understood that uplink and downlink of the backhaul link may be separated. To be specific, the uplink and the downlink are not transmitted through a same node. The downlink transmission refers to transmitting information or data from the parent node, such as a node 100, to the child node, such as a node 110. The uplink transmission refers to transmitting information or data from the child node, such as the node 110, to the parent node, such as the node 100. The node is not limited to a network node or a UE. For example, in a D2D scenario, the UE may be used as a relay node to serve another UE. In some scenarios, the wireless backhaul link may also be an access link. For example, for the node 110, the backhaul link 123 may also be considered as an access link, and the backhaul link 113 is also an access link of the node 100. It should be understood that the parent node may be a base station or a relay node, and the child node may be a relay node or a UE having a relay function. For example, in a D2D scenario, the child node may also be the UE.

[0038] The relay nodes shown in FIG. 1, such as 110, 120, and 130, may have two existing forms. One form is that the relay node exists as an independent access node and may independently manage a UE accessing the relay node. In this case, the relay node usually has an independent physical cell identifier (physical cell identifier, PCI). A relay in this form usually needs to have a complete protocol stack function, for example, a radio resource control (radio resource control, RRC) function. The relay is usually referred to as a layer 3 relay. However, a relay node in another form does not have an independent PCI, belongs to a same cell with a donor (donor) node, such as a donor eNB or a donor gNB, and does not manage a user. Protocol stacks of a layer 2 relay and the layer 3 relay are shown in FIG. 2 to FIG. 5. The donor node is a node that may access a core network through the node, or is an anchor base station in a radio access network. The donor node may access the network through the anchor base station. The anchor base station is responsible for processing data at a packet data convergence protocol (packet data convergence protocol, PDCP) layer, receiving data from the core network and forwarding the data to the relay node, or receiving data from the relay node and forwarding the data to the core network.

[0039] FIG. 2 and FIG. 3 are architectural diagrams of protocol stacks of a user plane and a control plane of a layer 2 relay system respectively. A next generation user plane (next generation user plane, NG-UP) in the figure is mainly a user plane gateway, and a next generation control plane (next generation control plane, NG-CP) is a control plane node. A protocol layer of a user plane of a UE includes a physical (physical, PHY) layer, a medium access control (medium access control, MAC) layer, a radio link control (radio link control, RLC) layer, a PDCP layer, a service data adaptation protocol (service data adaptation protocol, SDAP) layer, and an internet protocol (internet protocol, IP) layer. The SDAP layer mainly provides a service adaptation function, including a quality of service (quality of service, QoS) management function and a flow management function. An air interface protocol layer for communication between a layer 2 (layer 2, L2) relay and the UE mainly includes a PHY layer, a MAC layer, and an RLC layer. A protocol stack of an interface that communicates with the donor node through the backhaul link includes a PHY layer, a MAC layer, an RLC layer, and an adaptation (adaptation, Adpt.) layer. The adaptation layer mainly provides functions including bearer management and security management. Correspondingly, a protocol stack of an interface for communication between the donor node, namely, the DgNB, and the layer 2 relay includes a PHY layer, a MAC layer, an RLC layer, an Adpt. layer, a PDCP layer, and an SDAP layer. The DgNB and the NG-UP are usually connected in a wired manner, and a service bearer is usually established by using a tunnel. A protocol stack of the NG-UP corresponding to the DgNB includes an L1 (layer 1, LI), an L2 (layer 2, L2), an IP layer, a user datagram protocol (user datagram protocol, UDP) layer, and a general packet radio service tunneling protocol user plane (general packet radio service tunneling protocol user plane, GTP-U) layer. Correspondingly, a protocol stack of the NG-UP includes an L1, an L2, an IP layer, a UDP layer, a GTP-U layer, and an IP layer. The protocol layers and functions are well known by a person of ordinary skill in the art, and details are not described.

[0040] Similarly, FIG. 3 shows a structure of a protocol stack of a control plane of a layer 2 relay system. A protocol stack of a UE includes a PHY layer, a MAC layer, an RLC layer, a PDCP layer, an RRC layer, and a non-access stratum (non-access stratum, NAS) layer. A protocol stack of a control plane of a layer 2 relay is the same as a protocol stack of a user plane of the layer 2 relay. Details are not described herein again. A protocol stack of a control plane interface for communication between the DgNB and the layer 2 relay includes a PHY layer, a MAC layer, an RLC layer, an Adpt. layer, a PDCP layer, and an RRC layer. The DgNB and a network element of a core network control plane NG-CP are usually connected in a wired manner. A protocol stack of the DgNB on the interface includes an L1, an L2, an IP layer, a stream control transmission protocol (stream control transmission protocol, SCTP) layer, and an S1 application protocol (S1 application protocol, S1-AP) layer. S1 is a code of the interface. Correspondingly, a protocol stack of the NG-CP on the S1 interface includes: an L1, an L2, an IP layer, an SCTP layer, an S1-AP layer, and a NAS layer. The NAS layer corresponds to a NAS layer of a UE.

[0041] Similarly, FIG. 4 and FIG. 5 are architectural diagrams of protocol stacks of a user plane and a control plane of a layer 3 relay system respectively. Different from the protocol stack of the user plane in the layer 2 relay system, the layer 3 relay and the UE support a complete air interface protocol stack on an air interface. The complete air interface protocol stack includes: a PHY layer, a MAC layer, an RLC layer, a PDCP layer, and an SDAP layer. On an interface between the relay and the DgNB, a protocol stack of the relay node includes a PHY layer, a MAC layer, an RLC layer, a PDCP layer, an IP layer, a UDP layer, and a GTP-U layer. Correspondingly, a protocol stack of an S1 interface of the DgNB includes a PHY layer, a MAC layer, an RLC layer, a PDCP layer, an IP layer, a UDP layer, and a GTP-U layer. Another structure is the same as the structure of the protocol stack of the user plane of the layer 2 relay system. Details are not described again.

[0042] FIG. 5 shows a structure of a protocol stack of a control plane of a layer 3 relay protocol. Different from the protocol stack of the control plane in the layer 2 relay system, in the structure of the protocol stack of the control plane of the layer 3 relay system, the layer 3 relay and the UE support a complete control plane protocol stack on an air interface. The complete control plane protocol stack includes a PHY layer, a MAC layer, an RLC layer, a PDCP layer, and an RRC layer. A protocol stack of an interface between the layer 3 relay and the DgNB includes a PHY layer, a MAC layer, an RLC layer, a PDCP layer, an IP layer, an SCTP layer, and an S1-AP layer. Correspondingly, the protocol stack of the interface between the DgNB and the layer 3 relay includes a PHY layer, a MAC layer, an RLC layer, a PDCP layer, an IP layer, an SCTP layer, and an S1-AP layer. Another structure is the same as the structure of the protocol stack of the control plane of the layer 2 relay system. Details are not described again.

[0043] For ease of description, the relay node is referred to as a first node in the following, a donor base station or a parent node of the first node is referred to as a second node, a cell that is physically adjacent to a cell in which the first node is located and that has specific signal overlapping coverage is referred to as a neighboring cell, and a base station or the relay node that forms the neighboring cell is referred to as a neighboring node. When the relay node is a layer 2 relay, a cell in which the relay node is located is the same as a cell of the donor node, and a neighboring node of the relay node is a neighboring node of the donor node. When the relay node is a layer 3 relay, the neighboring node is a cell that is physically adjacent to a cell of the relay node and that has specific signal overlapping coverage. The relay node establishes an X2 interface between the relay node and the neighboring node through the donor node, but the neighboring node may not be a neighboring node of the donor node. Usually, the neighboring cell is a cell that has specific coverage and that is formed by a signal transmitted by the neighboring node. The X2 interface is an interface for communication between base stations. It should be understood that X2 herein is merely used to represent an interface between the base stations, but this does not mean that this is a limitation on a name, or a name of the interface limits an application scope of this application. The name of the interface may also be another name. The first node may be any device having a relay function, such as a base station, a relay node, or UE having a relay function. The second node is usually the donor base station or a parent node of the first node. It should be understood that the first node and the second node may not directly communicate with each other through a backhaul link. To be specific, the first node and the second node may be connected to each other through a multi-hop delay. The X2 interface connecting the neighboring node with the first node may not be directly established in a wired or wireless manner, and may be established in another manner, for example, a tunnel.

[0044] Similarly, a candidate neighboring node and a potential neighboring node are defined. The candidate neighboring node is a neighboring node that is determined to perform measurement, and the candidate neighboring node may be the donor node of the first node, namely, some or all neighboring nodes that are configured by the second node for the first node and that are in the potential neighboring node, or may be a neighboring node selected by the first node from the potential neighboring node sent by the second node. For example, when a measurement result that is of the potential neighboring node and that is obtained by a terminal through measurement is greater than a threshold, the potential neighboring node is used as a candidate node. The potential neighboring node is the first node or a neighboring node of the cell in which the first node is located, and the potential neighboring node may be used as the parent node of the first node, or may be used as all neighboring nodes of the candidate neighboring node of the first node. Whether the potential neighbor node can be the candidate node is determined based on the measurement result of the potential neighboring node by the terminal. A backup backhaul link is a backhaul link that can implement transmission through the node. To be specific, as the parent node of the first node, the backup backhaul link may be in an inactive (inactive) state, or may be in an active (active) state, and this specifically depends on configuration.

[0045] To maintain the backhaul link, the first node, namely, the relay node, determines a candidate neighboring node to be measured, the first node measures the candidate neighboring node, determines, based on the measurement result, whether to establish or delete a backhaul link between the first node and the candidate neighboring node, and sends a request to the second node, where the request is used to request the second node to establish or delete the backup backhaul link between the first node and the candidate neighboring node. The first node may determine the candidate neighboring node to be measured based on a measurement indication sent by the second node, a measurement result that is of the potential neighboring node, that is measured by the terminal, and that is sent by the second node, or a measurement result that is of a potential neighboring node and that is sent by the terminal to the first node. If determining to measure the candidate neighboring node, the first node may send a measurement configuration request to the second node to obtain configuration information of a channel state information-reference signal (channel state information reference signal, CSI-RS) of the candidate neighboring node, and measure the CSI-RS of the neighboring cell, or the first node measures a synchronization signal/physical broadcast channel block (synchronization signal/physical broadcast channel, SS/PBCH block) of the neighboring cell. When the measurement result meets a threshold, it is considered that the candidate neighboring node may be used as a candidate of the backup backhaul link.

[0046] The first node sends a first request to the second node, and the second node receives the first request sent by the first node. The first request is used to request the second node to establish or delete the backup backhaul link between the first node and the candidate neighboring node. The second node may send a response to the first node. If the first node determines to establish the backhaul link between the first node and the candidate neighboring node, the first request is used to request the second node to establish the backup backhaul link between the first node and the candidate neighboring node. Alternatively, if the first node determines to delete the backhaul link between the first node and the candidate neighboring node, the first request is used to request the second node to delete the backup backhaul link between the first node and the candidate neighboring node.

[0047] After receiving the first request, the second node sends a second request to the candidate neighboring node, where the second request is used by the candidate neighboring node to establish or delete a bearer to the second node or a user plane function. If the first request is used to request the second node to establish the backup backhaul link between the first node and the candidate neighboring node, the second request is used by the candidate neighboring node to establish the bearer to the second node or the user plane function. Alternatively, if the first request is used to request the second node to delete the backup backhaul link between the first node and the candidate neighboring node, the second request is used by the candidate neighboring node to delete the bearer to the second node or the user plane function.

[0048] FIG. 6 is a flowchart of establishing a backup backhaul link between a relay node and a neighboring node according to an embodiment of this application. Main steps of the embodiment in FIG. 6 are as follows.

[0049] S601: A first node receives measurement configuration information sent by a second node, where the measurement configuration information includes a backhaul link measurement threshold, and the backhaul link measurement threshold is used by the first node to determine backhaul link quality. The backhaul link measurement threshold is used to determine, when the first node measures a candidate neighboring node, whether the candidate neighboring node can be used as a parent node of the first node. The measurement configuration information may further include a hysteresis parameter (hysteresis, H_ys) of a candidate link, where H_ys of the candidate link is used to determine that an entry condition or a leave condition of an event is met, to trigger the first node to establish or delete a backhaul link between the first node and the candidate neighboring node.

[0050] In an optional solution, the second node may further include a terminal measurement threshold in measurement configuration. The terminal measurement threshold is used by the first node to determine, when receiving a terminal measurement result, whether there is a need to measure a neighbor measured by the terminal. The terminal measurement threshold is used by the terminal to determine whether the measurement result meets a specific signal strength, and the backhaul link measurement threshold is used by the first node to measure the neighboring node. The terminal measurement threshold may be the same as or different from the backhaul link measurement threshold. Specific configuration is not limited in this application.

[0051] The measurement configuration may be independent of the following steps. In this embodiment, it does not mean that subsequent step S602(a) or S602(b) and subsequent steps are definitely performed immediately after step S601. It should be understood that the measurement configuration is used by the first node to determine whether to establish or delete the backhaul link between the first node and the candidate neighboring node. Therefore, execution of the following steps S602(a) or S602(b) and S603 does not depend on step S601.

[0052] It should be understood that the second node may configure a plurality of backhaul link measurement thresholds for the first node. For example, a first backhaul link measurement threshold is for an SS/PBCH block, and a second backhaul link measurement threshold is for a dedicated reference signal, for example, a CSI-RS. Alternatively, the second node may configure only one backhaul link measurement threshold, and whether the backhaul link measurement threshold is for an SS/PBCH block or a dedicated reference signal is not distinguished. A specific quantity of backhaul link measurement thresholds that are configured and whether to distinguish whether the backhaul link is for different reference signals depend on a protocol definition or configuration. This is not limited in this application.

[0053] S602(a): UE sends a measurement report to the first node. The first node receives the measurement report sent by the terminal. The measurement report includes a measurement result of a potential neighboring node. The terminal accesses a network through the first node, and the measurement result of the potential neighboring node is used by the first node to determine the candidate neighboring node. If the first node is a layer 3 relay, that is, the first node is an independent cell and includes an RRC function, the first node may configure UE belonging to the first node to perform neighbor measurement, and the UE belonging to the first node sends the measurement result to the first node. The UE accesses the network through the first node, and the first node has the RRC function. That is, the first node is used as a layer 3 relay node to provide a service for the UE. If the first node is a layer 2 relay, this step is not performed. The measurement report includes at least one of the following parameters: a cell global identifier (cell global identifier, CGI), a physical cell identifier (physical cell identifier, PCI), and a tracking area identifier (tracking area identifier, TAI) that are of the neighboring cell, a public land mobile network (public land mobile network, PLMN), reference signal received power (reference signal received power, RSRP) corresponding to the CGI or the PCI, an index that is of the SS/PBCH block and that is obtained by the terminal through measurement or the CSI-RS, and location information of the terminal. The location information of the terminal may be global positioning system (global positioning system, GPS) information. It should be understood that in different solutions, the UE may send the measurement report to the first node (for example, the first node is the layer 3 relay), or send the measurement report to the second node (for example, the first node is the layer 2 relay). If the UE sends the measurement report to the first node, step S602(a) is performed. In this case, step S602(b) and step S603 are not performed. The UE sends the measurement report to the second node, and the second node sends a measurement indication or the measurement result that is of the neighboring node and that is obtained by the terminal through measurement, to the first node. In this case, steps S602(b) and S603 are performed. When S602(a) is performed, step S604 is performed, that is, either step S602(a) or steps S602(b) and S603 are performed.

[0054] S602(b): The UE sends the measurement report to the second node. If the first node is the layer 2 relay, because there is no RRC function on an access link, a neighboring cell discovery function is measured by the second node by configuring UE to which the second node belongs, to discover a new cell or find that a neighboring cell is removed. In this case, the second node obtains a status of the neighboring cell, that is, whether there is the new neighboring cell, or whether a neighboring cell is removed, by receiving the measurement report of the UE. Parameters of the measurement report are described above, and details are not described again.

[0055] S603: The first node receives the measurement indication sent by the second node, where the measurement indication includes an identifier of the potential neighboring node, and the identifier of the potential neighboring node is used by the first node to determine the candidate neighboring node, or the first node receives the measurement result that is of the potential neighboring node, that is obtained by the terminal through measurement, and that is sent by the second node, the terminal accesses the network through the first node, and the measurement result of the potential neighboring node is used by the first node to determine the candidate neighboring node.

[0056] After receiving the measurement report sent by the UE, the second node determines the neighboring node to be measured by the first node, that is, the second node determines, based on a measurement result that is of the neighboring cell and that is obtained by the UE through measurement, the neighboring node to be measured by the first node. If the measurement result that is of the neighboring cell and that is obtained by the UE through measurement, such as RSRP, is greater than a specific threshold, the neighboring node corresponding to the neighboring cell may be used as the potential neighboring node of the first node, and the result is sent to the first node in the measurement indication. The measurement indication may include a plurality of potential neighboring nodes. Because results that are of a same neighboring node and that are obtained by a plurality of UEs through measurement may be different, the second node may select a measurement result having largest RSRP as the measurement result of the neighboring cell, or select a measurement result of one UE closest to the first node as the measurement result of the neighboring cell. Alternatively, the second node may perform weighted averaging on measurement results that are of a same neighboring node and that are obtained by all UEs through measurement, and a weighted averaging result is used as the measurement result of the neighboring cell. A specific implementation is not limited in this application.

[0057] In an optional solution, if the second node sends the measurement indication to the first node, the measurement indication may include configuration information of a CSI-RS of the neighboring node. The configuration information of the CSI-RS includes a time-frequency resource location of the CSI-RS, a periodicity, a start system sending frame number, a sending slot number, a sending subframe number, a quantity of sending times, and the like. If the measurement indication includes the CSI-RS, before sending the measurement indication to the first node, the second node further sends a measurement configuration request to the neighboring node, to request the configuration information of the CSI-RS of the neighboring node. Details are not described herein again.

[0058] In an optional solution, the second node sends the measurement result that is of the neighboring cell and that is received from the UE, to the first node for processing. It should be understood that because the first node is the layer 2 relay, that there is no RRC function on an access link means that the first node does not process an RRC layer of the UE, and does not mean that there is no RRC function between the first node and the second node. Therefore, the first node may process an RRC message from the second node, but not process an RRC message of the UE. Therefore, the second node may send the measurement result from the UE to the first node without processing. A measurement result that is of the neighboring node, that is obtained by a terminal through measurement, and that is sent by the second node to the first node is associated with a neighboring node. The neighboring node is referred to as a potential neighboring node, that is, may be referred to as a neighboring node of a parent node of the first node.

[0059] In an optional solution, the measurement configuration in step S601 may also be sent to the first node in step S603. If the measurement configuration is sent to the first node together with the measurement indication or the measurement result that is of the neighboring node and that is obtained by the terminal through measurement, step S601 is optional. In addition, the measurement configuration may be sent to the first node when the second node sends the measurement indication or the measurement result that is of the neighboring node and that is obtained by the terminal through measurement, to the first node for the first time, and the measurement configuration is subsequently used. Optionally, the second node may also include the measurement configuration when subsequently sending the measurement indication or the measurement result that is of the neighboring node and that is obtained by the terminal through measurement, to the first node, to reconfigure the measurement configuration, or even send a measurement reconfiguration message to the first node to update the measurement configuration.

[0060] The measurement indication includes an identifier of the candidate neighboring node, and the identifier may be one of a CGI or a PCI. The measurement result that is of the neighboring node and that is obtained by the terminal through measurement includes the RSRP that is of the neighboring node and that is obtained by the terminal through measurement and the identifier of the neighboring node corresponding to the RSRP, and may further include measured location information of the terminal, for example, the global positioning system information.

[0061] S604: The first node determines the candidate neighboring node. If the second node sends the measurement indication to the first node, because the measurement result that is of the neighboring node and that is in the measurement indication has been processed by the second node, the first node may select some or all of the neighboring nodes for measurement, and select the potential neighboring node to be measured as the candidate neighboring node. The first node may perform selection based on a previous measurement result, or a measurement result of a cell that is not in a list of neighboring cells. A specific selection rule is not limited in this application.

[0062] If the second node sends the measurement result that is of the neighboring node and that is obtained by the terminal through measurement, and the neighboring node obtained by the terminal through measurement is the potential neighboring node of the first node, whether to measure the potential neighboring node needs to be determined based on the measurement result that is of the neighboring cell and that is obtained by the terminal through measurement. For a same potential neighboring node, results obtained by a plurality of terminals through measurement may be different. The first node may select a measurement result with largest RSRP as the measurement result of the neighboring cell, or select a measurement result obtained by one terminal closest to a location of the first node through measurement as the measurement result of the neighboring cell. Alternatively, the first node may perform weighted averaging on measurement results that are of a same neighboring node and that are obtained by all UEs through measurement, and a weighted averaging result is used as the measurement result of the neighboring cell. A specific implementation is not limited in this application.

[0063] If the first node needs to measure the candidate neighboring node by using the CSI-RS, step S605 is performed. Otherwise, if the first node may measure the candidate neighboring node by using the SS/PBCH block of the neighboring node, step S609 is directly performed. Whether the neighboring cell is measured by using the SS/PBCH block or the CSI-RS may be configured. For example, a manner that is for measuring the neighboring cell of the first node may alternatively be a manner defined in a protocol. This is not limited in this application.

[0064] S605: If the first node measures the neighboring cell by using the CSI-RS, the first node may send the measurement configuration request to the second node, to request the candidate neighboring node to send the configuration information of the CSI-RS. The measurement configuration request includes an identifier of the first node and an identifier of the candidate neighboring node. The identifier is described above, and details are not described again. The measurement configuration request may further include location information of the first node, for example, GPS information, and information about a measured beam, for example, an index of the beam.

[0065] S606: After receiving the measurement configuration request sent by the first node, the second node forwards the measurement configuration request to the candidate neighboring node. Content included in the measurement configuration request is described in step S605, and details are not described again.

[0066] S607: After receiving the measurement configuration request, the candidate neighboring node determines the configuration information of the CSI-RS based on a parameter included in the measurement configuration request, and sends a measurement configuration response to the second node, where the measurement configuration response includes the configuration information of the CSI-RS, and the configuration information of the CSI-RS is described above, and details are not described again.

[0067] S608: After receiving the measurement configuration response of the candidate neighboring node, the second node forwards the measurement configuration response to the first node, where content included in the measurement configuration response is described in step S607, and details are not described again.

[0068] S609: The first node measures the candidate neighboring node. If the first node receives the configuration information of the CSI-RS of the candidate neighboring node, the first node performs measurement on a given resource of the CSI-RS based on the configuration information of the CSI-RS. If the first node does not receive the CSI-RS of the candidate neighboring node, the first node measures the SS/PBCH block of the candidate neighboring node, and obtains the measurement result. The first node determines, based on the obtained measurement result, whether the candidate neighboring node can be used as a candidate node of a backhaul link.

[0069] It should be understood that measurement of the candidate node further includes measurement performed by the first node on an established backup backhaul link to the neighboring node, and measurement performed on the neighboring node of the established backup backhaul link may be periodic or may be triggered by an event. For example, when quality that is of a backup backhaul link to a neighboring node and that is obtained by the UE through measurement is lower than a threshold, the first node is triggered to perform measurement.

[0070] S610: The first node determines, based on the measurement result, whether to establish or delete the backhaul link between the first node and the candidate neighboring node. Specifically, when a condition M_r - H_ys > Thresh is met, the first node determines that the entry condition of the event is met. M_r is a measurement result of the candidate neighboring node by the first node, H_ys is an event hysteresis parameter, and Thresh is a backhaul link measurement threshold. The first node sends an addition request of the backup backhaul link to the second node. The addition request of the backup backhaul link is used by the second node to establish the backup backhaul link between the first node and the candidate neighboring node. Alternatively, when a condition M_r + H_ys < Thresh is met, the first node determines that the leave condition of the event is met, and the first node sends a deletion request of the backup backhaul link to the second node, where the deletion request of the backup backhaul link is used by the second node to delete the backup backhaul link between the first node and the candidate neighboring node.

[0071] It should be understood that a trigger entry condition may also meet M_r - H_ys ≥ Thresh, and a trigger leave condition may also meet M_r + H_ys ≤ Thresh.

[0072] S611: The first node sends a first request to the second node. The first request is used by the second node to establish or delete the backup backhaul link between the first node and the candidate neighboring node. The second node may send a response to the first node. If the first node determines to establish the backhaul link between the first node and the candidate neighboring node, the first request is used to request the second node to establish the backup backhaul link between the first node and the candidate neighboring node. Alternatively, if the first node determines to delete the backhaul link between the first node and the candidate neighboring node, the first request is used to request the second node to delete the backup backhaul link between the first node and the candidate neighboring node.

[0073] In an optional solution, when the first node determines, based on the measurement result, that the condition M_r - H_ys > Thresh is met, that is, the first node determines that the entry condition of the event is met, the first node triggers a signal for sending the addition request of the backup backhaul link to the second node, or generates a request message. The signal or the request message indicates another module or process of the first node to send the addition request of the backup backhaul link to the second node. Alternatively, when the condition M_r + H_ys < Thresh is met, that is, the first node determines that the leave condition of the event is met, the first node triggers a signal for sending the deletion request of the backup backhaul link to the second node, or generates a deletion message. The signal or the deletion message indicates another module or process of the first node to send the deletion request of the backup backhaul link to the second node.

[0074] It should be understood that the trigger entry condition may also meet M_r - H_ys ≥ Thresh, and the trigger leave condition may also meet M_r + H_ys ≤ Thresh.

[0075] Specifically, after the second node receives the first request sent by the first node, if the first request is used to establish the backup backhaul link between the first node and the candidate neighboring node, the second node determines whether to add the requested candidate neighboring node as a node of the backup backhaul link of the first node. In an optional solution, the second node may reject the addition request of the backup backhaul link of the first node, and the second node sends a first response to the first node. The first response includes an addition response of the backup backhaul link, an addition rejection indication, and a rejection cause value. If the second node accepts the addition request that is of the backup backhaul link and that is sent by the first node, step S611 is performed. A similar operation is performed on the deletion request that is of the backup backhaul link and that is sent by the first node. Details are not described again.

[0076] It should be understood that the first response may be further used as a deletion response of the backup backhaul link to indicate a result of deleting the backup backhaul link between the first node and the candidate neighboring node.

[0077] If the first request is used by the second node to establish the backup backhaul link between the first node and the candidate neighboring node, when quality of a backhaul link that is being used by the first node is poor, or a capacity of a backhaul link that is being used is insufficient, the second node may enable the backup backhaul link. Therefore, the second node may control a status of the backup backhaul link of the first node, that is, may activate or deactivate the backup backhaul link.

[0078] S612: After receiving the first request, the second node sends a second request to the candidate neighboring node, where the second request is used by the candidate neighboring node to establish or delete a bearer to the second node or a user plane function (user plane function, UPF). If the first request is used to request the second node to establish the backup backhaul link between the first node and the candidate neighboring node, the second request is used by the candidate neighboring node to establish the bearer to the second node or the user plane function. Alternatively, if the first request is used to request the second node to delete the backup backhaul link between the first node and the candidate neighboring node, the second request is used by the candidate neighboring node to delete the bearer to the second node or the user plane function.

[0079] As described above, the first request is used by the second node to establish a relationship of the backup backhaul link between the first node and the candidate neighboring node, and the second request is used by the candidate neighboring node to establish the bearer to the second node or the UPF. Because the backhaul link being used by the first node may be instantaneously interrupted due to some reasons, for example, due to a change of an environment or a block, the backup backhaul link needs to be enabled. To reduce a time in which the candidate neighboring node establishes the bearer to the UPF, when the second node sends the second request to the candidate neighboring node to establish the backup backhaul link between the first node and the candidate neighboring node, the candidate neighboring node establishes the bearer to the second node or establishes the bearer to the UPF. The bearer to the second node is established mainly in a dual-connectivity or multi-connectivity manner, to route, to the second node through the candidate neighboring node, data that is sent by the first node through the backup backhaul link, so that the second node may control a status of the backup backhaul link, that is, activate or deactivate the backhaul link. In addition, user plane data transmitted by the first node through the candidate neighboring node is sent to the second node through a bearer between the candidate neighboring node and the second node, and routed by the second node.

[0080] However, in another optional solution, when the first node is the layer 3 relay, and when the first node sends data through the candidate neighboring node, the candidate neighboring node may establish the bearer to the UPF for the first node. That is, the data is not forwarded by the second node. In this case, when the candidate neighboring node receives the second request sent by the second node, if the second request is used to establish the backup backhaul link between the first node and the candidate neighboring node, the candidate neighboring node directly establishes the bearer to the UPF, but the bearer that is established by the candidate neighboring node and that is to the UPF is in a deactivated state. If the backhaul link currently used by the first node is unavailable due to a reason such as a change of the environment, the first node may switch to the backup backhaul link, and activate the bearer from the candidate neighboring node to the UPF, to provide a data forwarding channel for the first node.

[0081] It should be understood that in the foregoing solution, whether the candidate neighboring node establishes the bearer to the second node or establishes the bearer to the UPF depends on a specific application scenario. If the first node and the candidate neighboring node are layer 2 relays, whether to establish the bearer to the second node or establish the bearer to the UPF is controlled by the second node. To be specific, the second node includes an indication of a data plane route in the first request (used to establish the backup backhaul link between the first node and the candidate neighboring node). The indication is used to indicate whether the candidate neighboring node establishes a route to the second node or a route to the UPF, but the second node may accept or change the indication of the data plane route, and notify the first node of a selection result. If the first node and the candidate neighboring node are layer 3 relays, the first node may also include an indication of the data plane route in the first request (used to establish the backup backhaul link between the first node and the candidate neighboring node). In this case, the second node does not change the indication of the data plane route.

[0082] S613: The candidate neighboring node sends a second response to the second node, where the second response includes an addition response of the backup backhaul link or a deletion response of the backup backhaul link. It should be understood that the candidate neighboring node may reject the second node to use the candidate neighboring node as the parent node of the first node. In this case, the second response indicates that the request is rejected.

[0083] S614: After receiving the second response sent by the candidate neighboring node, the second node sends the first response to the first node. If the first request is used to establish the backup backhaul link between the first node and the candidate neighboring node, the second node also uses the candidate node as a node of the backup backhaul link of the first node, and activates the backup backhaul link through control signaling when necessary.

[0084] In an optional solution, when the first request is a request used to establish the backup backhaul link between the first node and the candidate neighboring node, the first node may request to activate the backup backhaul link of the candidate neighboring node. In this case, the second request sent by the second node to the candidate neighboring node also includes an activation indication. The candidate neighboring node includes an activation status indication in the second response.

[0085] In another optional solution, when the first request is used to delete the backup backhaul link between the first node and the candidate neighboring node, the second node may request to deactivate the backup backhaul link of the candidate neighboring node. In this case, a message of the second request sent by the second node to the candidate neighboring node includes a deactivation indication. The candidate neighboring node includes a deactivation status indication in the message of the second response. Optionally, the second node may include a retention time of the backup backhaul link in the second request. The candidate neighboring node starts a timer based on the retention time of the backup backhaul link. When the timer expires and no message for retaining the backup backhaul link of the second node is received, the backup backhaul link is deleted.

[0086] After the first node receives the first response sent by the second node, if the first request (used to establish the backup backhaul link between the first node and the candidate neighboring node) is accepted, the first node may switch to the backup backhaul link based on a requirement, or activate the backup backhaul link to establish dual connectivity or multi connectivity for the first node.

[0087] In the foregoing technical solution, if the second node accepts the first request sent by the first node, the first response is the same as the second response; and if the second node rejects the first request, the second response does not exist, and the first response is a response of the second node for the first request.

[0088] According to the foregoing technical solution, the first node may determine, by receiving the measurement indication of the second node, the measurement result that is of the neighboring node, that is obtained by the terminal through measurement, and that is forwarded by the second node, or the measurement report reported by the terminal, whether to establish or delete the backup backhaul link between the first node and the candidate neighboring node, so that measurement overheads caused by measurement of the first node are reduced, and a new available parent node is found through auxiliary measurement of the terminal. The backup backhaul link enhances availability of the backhaul link of the first node, and when quality of a currently used backhaul link is poor or a bandwidth of the currently used backhaul link is insufficient, quality of the backhaul link can be improved, a new backhaul link can be quickly established, and a service interruption time can be reduced.

[0089] In an optional solution, if the first node determines to establish the backhaul link between the first node and the candidate neighboring node, the first node initiates a random access process to the candidate neighboring node. FIG. 7 is a schematic diagram showing that a first node initiates a random access process to a candidate neighboring node according to an embodiment of this application. The figure further includes that the first node determines to delete a backhaul link between the first node and the candidate neighboring node, and the first node initiates the random access process to the candidate neighboring node. To be specific, whether the first node establishes or deletes the backhaul link between the first node and the candidate neighboring node, the first node may initiate the random access process to the candidate neighboring node. Specific steps are as follows:

[0090] S701: Determine to establish or delete the backhaul link between the first node and the candidate neighboring node. A determining manner thereof is the same as that in step S610 in the foregoing embodiment, and details are not described again.

[0091] In addition, after the first node determines to establish or delete the backhaul link between the first node and the candidate neighboring node, if the first node establishes the backhaul link between the first node and the candidate neighboring node in a random access manner, the first node further needs to obtain random access information of the candidate neighboring node, including a random access preamble group, a random access resource, and whether a cell is in a blocked state. If the first node deletes the candidate neighboring node, the first node may obtain the random access information when establishing the backhaul link with the candidate neighboring node before, and does not need to obtain the random access information again. However, the first node may also obtain the random access information again when deleting the backhaul link between the first node and the candidate neighboring node, this is mainly to prevent the random access information of the candidate neighboring node from being changed.

[0092] S702: The first node sends a random access preamble to the candidate neighboring node. The first node selects, based on the obtained random access information of the candidate neighboring node, a random access preamble for sending. Sending of the random access preamble is well known by a person of ordinary skill in the art, and details are not described.

[0093] S703: After receiving the random access preamble sent by the first node, the candidate neighboring node sends a random access response to the first node, where the random access response includes a random access preamble identifier, timing advance (timing advance, TA) adjustment, and/or a backoff indicator (backoff indicator, BI). This step is well known by a person of ordinary skill in the art, and details are not described.

[0094] S704: After receiving the random access response of the candidate neighboring node, the first node sends a message 3 to the candidate neighboring node, where the message 3 includes an indication of establishing the backhaul link and an identifier of the first node. The indication of establishing the backhaul link is used to notify the candidate neighboring node that a purpose of random access is to establish the backhaul link, and/or indicate that the first node is a relay node. Optionally, the message 3 may further include an attribute indication of the first node. The attribute indication of the first node indicates that the first node is the relay node. The message 3 may include only one of the indication of establishing the backhaul link and an attribute of the first node.

[0095] S705: After receiving the message 3 sent by the first node, the candidate neighboring node sends a contention resolution message to the first node, where the contention resolution message is also referred to as a message 4. The contention resolution message is the same as a conventional contention resolution message, and is well known by a person of ordinary skill in the art, and details are not described.

[0096] S706: The first node sends an addition request or a deletion request of the backup backhaul link between the first node and the candidate neighboring node. The addition request or the deletion request of the backup backhaul link may further include an identifier of the second node. A request of the backup backhaul link may further include an activation indication of the backhaul link, used to request whether to activate the backhaul link between the first node and the candidate neighboring node. The addition request of the backup backhaul link may further include an indication indicating whether data plane routing is performed through the second node, and is used to indicate whether the candidate neighboring node establishes a bearer to the second node.

[0097] After receiving the addition request or the deletion request of the backup link, the candidate neighboring node determines, based on a current resource situation, whether to accept an establishment request of the backhaul link of the first node.

[0098] S707: The candidate neighboring node sends an addition notification or a deletion notification of the backup backhaul link to the second node. The candidate neighboring node notifies the second node that the backup backhaul link between the candidate node and the first node has been established or deleted. The addition notification or the deletion notification of the backup backhaul link includes the identifier of the first node and an identifier of the candidate neighboring node. The addition notification of the backup backhaul link may further include a bearer establishment indication, used to request to establish a bearer between the candidate neighboring node and the second node for the first node. It should be understood that the addition notification or the deletion notification of the backup backhaul link may be two messages, namely, the addition notification of the backup backhaul link and the deletion notification of the backup backhaul link. The addition notification of the backup backhaul link or the deletion notification of the backup backhaul link may also indicate a function of the addition notification of the backup backhaul link or a function of the deletion notification of the backup backhaul link by using a field of a message. For example, in a notification of the backup backhaul link, a field is used to indicate whether the notification of the backup backhaul link is the addition notification of the backup backhaul link or the deletion notification of the backup backhaul link. It should be understood that the name herein is merely an example, and any name of the message with a similar function falls within the protection scope of the present disclosure. The following is the same, and details are not described.

[0099] S708: The second node sends an addition acknowledgment or a deletion acknowledgement of the backup backhaul link between the first node and the candidate neighboring node. The message is used to acknowledge, to the second node, to accept the backup backhaul link between the candidate neighboring node and the first node. The second node may also reject to accept the backup backhaul link between the candidate neighboring node and the first node.

[0100] It should be understood that the addition acknowledgement or the deletion acknowledgement of the backup backhaul link may be two messages, namely, the addition acknowledgement of the backup backhaul link and the deletion acknowledgement of the backup backhaul link. The addition acknowledgment of the backup backhaul link or the deletion acknowledgment of the backup backhaul link may also indicate a function of the addition acknowledgment of the backup backhaul link or the deletion acknowledgment of the backup backhaul link by using a field of a message. For example, in an acknowledgment of the backup backhaul link, a field may be used to indicate whether the acknowledgement of the backup backhaul link is the addition of the backup backhaul link or the deletion of the backup backhaul link. It should be understood that the name herein is merely an example, and any name of the message with a similar function falls within the protection scope of the present disclosure. The following is the same, and details are not described.

[0101] If the addition notification of the backup backhaul link includes a bearer establishment indication, the second node may further include bearer information such as an identifier and a port number of the bearer in the addition acknowledgment of the backup backhaul link. A bearer establishment process is the same as a conventional bearer establishment process of a dual-connectivity X2 interface, and details are not described.

[0102] S709: The candidate neighboring node sends an addition response or a deletion response of the backup backhaul link to the first node. If the candidate neighboring node accepts the addition request or the deletion request of the backup backhaul link of the first node, and the second node also accepts to establish the backup backhaul link between the candidate neighboring node and the first node, the addition response or the deletion response of the backup backhaul link includes indication information of accepting the request. If the candidate neighboring node does not accept the addition request or the deletion request of the backup backhaul link of the first node, or the second node does not accept to establish the backup backhaul link between the candidate neighboring node and the first node, the addition response or the deletion response of the backup backhaul link includes indication information of rejecting the request.

[0103] The addition response or the deletion response of the backup backhaul link further includes route indication information, used to indicate whether a bearer for user data transmission is established by using the second node or the UPF. The addition response or the deletion response of the backup backhaul link may further include bearer indication information, used to indicate whether the candidate neighboring node establishes a bearer to the second node or establishes a bearer to the UPF. The addition response or the deletion response of the backup backhaul link may further include an activation indication of the backhaul link, used to indicate whether the backhaul link is activated. The addition response or the deletion response of the backup backhaul link may further include a retention time of the backhaul link, used to indicate, when the first node deletes the backhaul link between the first node and the candidate neighboring node, that the backhaul link is to be deleted after a predetermined time. If the first node adds the candidate neighboring node again as the backup backhaul link before the retention time of the backhaul link expires, the candidate neighboring node only needs to simply modify a status of the backup backhaul link, that is, stop the timer, and identify backhaul link as the backup backhaul link, or activate the backup backhaul link according to an instruction.

[0104] S710: The first node sends an addition complete message or a deletion complete message of the backup backhaul link between the first node and the candidate neighboring node, to notify the candidate neighboring node that the first node has received the addition response or the deletion response of the backup backhaul link.

[0105] According to the foregoing embodiment, the relay node determines, based on a measurement result of the candidate neighboring node, whether to establish a backhaul link between the relay node and the candidate neighboring node, and directly accesses the candidate neighboring node in a random access manner, thereby reducing signaling overheads, reducing a latency of establishing the backhaul link, and helping reduce energy consumption of the first node. A backup link is established by directly accessing the candidate neighboring node, so that a topology and a route of the relay node are optimized.

[0106] In an optional solution, after step S705 shown in FIG. 7, the first node may send a measurement configuration request to the candidate neighboring node, to request the candidate neighboring node to send a dedicated reference signal, for example, a CSI-RS, to the first node for measurement, and the first node re-measures the CSI-RS, and re-determines whether to establish or delete the backup backhaul link between the first node and the candidate neighboring node. If the first node determines to continue establishing the backup backhaul link, step S706 is continued. According to this solution, a measurement result of the backhaul link between the first node and the candidate neighboring node may be more accurate, and an established backup backhaul link may be more reliable.

[0107] In an optional solution, after step S706 shown in FIG. 7, the candidate neighboring node configures a dedicated measurement reference signal for the first node, to require the first node to perform measurement again and report the measurement result. The candidate neighboring node determines, based on the measurement result reported by the first node, whether to establish or delete the backup backhaul link between the candidate neighboring node and the first node, or the first node determines, based on the measurement result, whether to establish or delete the backup backhaul link between the first node and the candidate neighboring node. If the candidate neighboring node determines to continue establishing or deleting the backup backhaul link, step S707 is continued. Otherwise, step S709 is performed, and establishment of the backhaul link is rejected in the addition response or the deletion response of the backup backhaul link. If determining to continue establishing or deleting the backup backhaul link, the first node sends indication information to the candidate neighboring node, to continue establishing or deleting the backup backhaul link, that is, continue to perform step S707. According to this solution, the measurement result of the backhaul link between the first node and the candidate neighboring node may be more accurate, and an established backup backhaul link may be more reliable.

[0108] In an optional solution, step S706 to step S710 in FIG. 7 are added only for the backup backhaul link, and the backup backhaul link is deleted by using the method shown in FIG. 6, that is, the backup backhaul link is deleted through the second node. In a measurement process, if the first node finds that a measurement value of the backup backhaul link between the first node and a candidate neighboring node is less than a configured threshold (for example, the threshold in step S610), and the first node accesses the candidate neighboring node in a random access method, the first node is required to perform sending by using relatively large power, and sending may easily fail. Therefore, sending through the second node may improve a success rate of message sending and reduce power consumption of the first node.

[0109] FIG. 8A and FIG. 8B show a procedure in which a candidate neighboring node establishes a bearer to a UPF according to an embodiment of this application. A user plane function is mainly a function network element, for example, a gateway, that provides user plane data routing and forwarding. As described above, a candidate node may establish the bearer according to an indication of a data plane route in an addition request or a deletion request of the backup backhaul link. If the indication of the data plane route in the addition request or the deletion request of the backup backhaul link is to establish the bearer by using the UPF, the candidate neighboring node does not forward the data plane route of the first node through the second node, and the candidate neighboring node establishes a bearer to the UPF, and determines, based on an activation indication of the backhaul link in the addition request or the deletion request of the backup backhaul link, whether to activate the bearer to the UPF. If the addition request or the deletion request of the backup backhaul link does not include the indication of the data plane route, the candidate neighboring node may autonomously select whether to establish a bearer to the second node or establish the bearer to the UPF. Specifically, an access and mobility management function (access and mobility management function, AMF)/session management function (session management function, SMF) in FIG. 8A and FIG. 8B is mainly a control plane network element, and is configured to control an access node, a user, and a gateway. It should be understood that a name of a message in FIG. 8A and FIG. 8B is merely used to indicate a function, and another similar name is used in an actual standard or product implementation. It should not be considered that the name of the message in the figure limits a usage scope of the name of the message. FIG. 8A and FIG. 8B show an example of establishing the bearer to the UPF. The steps are as follows.

[0110] S801: Same as step S701, and details are not described again.

[0111] S802(a1): The first node sends the addition request or the deletion request of the backup backhaul link to the second node. If the first node determines to request, through the second node, to establish or delete the backup backhaul link between the first node and the candidate neighboring node, steps S802(a1) and S802(a2) are performed. If the first node establishes or deletes the backup backhaul link between the first node and the candidate neighboring node in a random access manner through the candidate neighboring node, steps S802(a1) and S802(a2) are not performed, and steps S802(b1) and S802(b2) are performed. However, if steps S802(a1) and S802(a2) are performed, the following steps S802(b1) and S802(b2) are not performed. Specifically, this step is the same as S611, and details are not described again.

[0112] S802(a2): The second node sends the addition request or the deletion request of the backup backhaul link between the second node and the candidate neighboring node. If step S802(a1) is performed, step S802(a2) is performed. It should be understood that the candidate neighboring node herein is a candidate neighboring node that is determined by the first node to establish or delete the backup backhaul link, that is, a candidate neighboring node in the addition request or the deletion request of the backup backhaul link. Step S802(a2) is the same as step S612, and details are not described again.

[0113] As described above, if S802(a1) is not performed, S802(a2) is also not performed.

[0114] S802(b 1): The first node initiates a random access process to the candidate neighboring node. Herein, a step is used to replace the random access process. This is merely intended to simplify description. For details, refer to steps S702 to S705. Details are not described again. It should be understood that if the first node establishes or deletes the backup backhaul link between the first node and the candidate neighboring node in a random access manner through the candidate neighboring node, step S802(b1) is performed, and steps S802(a1) and S802(a2) are not performed.

[0115] S802(b2): The first node sends the addition request or the deletion request of the backup backhaul link between the first node and the candidate neighboring node. For details, refer to S706. Details are not described again.

[0116] If step S802(b1) is performed, step S802(b2) is performed. Otherwise, this step is not performed either. That is, in the foregoing steps, either S802(a1) and S802(a2) or S802(b1) and S802(b2) are performed.

[0117] S803: The candidate neighboring node sends a bearer setup request or a bearer modification request to an AMF/SMF. The bearer setup request includes at least one of the following parameters: an identifier of the first node, an identifier of the candidate neighboring node, a bearer identifier of the candidate neighboring node, a port number of the candidate neighboring node, an identifier of the UPF, and an access point name (accessing point name, APN). The bearer setup request may further include a bearer activation indication, used to indicate whether the established bearer needs to be activated. If the first node sends the deletion request of the backup backhaul link, the candidate neighboring node sends the bearer modification request to the AMF/SMF, where the bearer modification request includes a bearer deletion indication. Optionally, if the first node sends the deletion request of the backup backhaul link, the candidate neighboring node may directly enter step S807, start a timer, and perform steps S803 to S806 after the timer expires.

[0118] S804: After receiving the bearer setup request or the bearer modification request, the AMF/SMF sends a bearer creation or bearer modification request to a UPF, namely, may be the bearer creation request or the bearer modification request, where the bearer modification request may be used to delete a bearer.

[0119] S805: The UPF sends a bearer creation response or a bearer modification response to the AMF/SMF. The bearer creation response or the bearer modification response includes at least one of the following parameters: a bearer identifier allocated by the UFP for the bearer, an identifier of the UFP, an identifier of the first node, an identifier of the candidate neighboring node, a port number, a QoS parameter, and a status of the bearer (activated or not).

[0120] S807 to S810: Same as S707 to S710, and details are not described again.

[0121] According to the foregoing embodiment, the candidate neighboring node may establish a bearer to the UPF, and may activate the bearer at any time by using the established bearer, thereby reducing impact caused by service interruption of the first node because the backhaul link of the first node is unavailable, so that fast route switching may be implemented, a service interruption latency may be reduced, and service quality may be improved.

[0122] The foregoing mainly describes the solutions provided in the embodiments of this application from a perspective of interaction between network elements. It may be understood that to implement the foregoing functions, each network element, for example, the first node or the second node, includes corresponding hardware structures and/or software modules for performing the functions. A person skilled in the art should easily be aware that, in combination with the examples described in the embodiments disclosed in this specification, network elements and algorithms steps may be implemented by hardware or a combination of hardware and computer software in this application. Whether a function is performed by hardware or hardware driven by computer software depends on particular applications and design constraints of the technical solutions. A person skilled in the art may use different methods to implement the described functions for each particular application, but it should not be considered that the implementation goes beyond the scope of this application.

[0123] In the embodiments of this application, function modules in the first node and the second node may be obtained through division based on the foregoing method examples. For example, function modules may be obtained through division based on each corresponding function, or two or more functions may be integrated into one processing module. The integrated module may be implemented in a form of hardware, or may be implemented in a form of a software function module. It should be noted that in the embodiments of this application, module division is an example, and is merely a logical function division. In actual implementation, another division manner may be used. In addition, based on the foregoing method examples, there may be a plurality of candidate neighboring nodes, and the plurality of candidate neighboring nodes have a same function and a same corresponding function module. In the following embodiments, only one candidate neighboring node is used as an example for description, but it should be understood that a same first node may have a plurality of candidate neighboring nodes.

[0124] When each function module is obtained through division based on each corresponding function, FIG. 9 is a possible schematic structural diagram of a first node in the foregoing embodiments according to an embodiment of this application. The first node includes a processing unit 902 and a sending unit 903. The processing unit 901 is configured to support step S604, S609, or S610 in FIG. 6, step S701 in FIG. 7, and S801 in FIG. 8A. The sending unit 901 is configured to support the first node in performing S605 or S611 in FIG. 6, step S702, S704, S706, or S710 in FIG. 7, and step S802(a1), S802(b2), or S810 in FIG. 8B. The first node may further include a receiving unit 903, configured to support the first node in performing S601, S602(a), S603, S608, or S614 in FIG. 6, step S703, S705, or S709 in FIG. 7, and step S802(b1) or S809 in FIG. 8B.

[0125] In hardware implementation, the processing unit 902 may be a processor, the sending unit 901 may be a transmitter, and the receiving unit 903 may be a receiver. The receiver and the transmitter may form a communications interface.

[0126] FIG. 10 is a schematic diagram of a possible logical structure of a first node in the foregoing embodiments according to an embodiment of this application. The first node includes a processor 1002. In this embodiment of this application, the processor 1002 is configured to control and manage an action of the first node. For example, the processor 1002 is configured to support the first node in performing step S604, S609, or S610 in FIG. 6, step S701 in FIG. 7, and S801 in FIG. 8A. The first node may further include a memory 1001 and a communications interface 1003. The processor 1002, the communications interface 1003, and the memory 1001 may be connected to each other or connected to each other through a bus 1004. The communications interface 1003 is configured to support the first node in performing communication, and the memory 1001 is configured to store program code and data of the first node. The processor 1002 invokes the code stored in the memory 1001 to perform control management. The memory 1001 may be coupled to or not coupled to the processor.

[0127] The processor 1002 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or another programmable logical device, a transistor logical device, a hardware component, or any combination thereof. The processor 1002 may implement or execute various example logical blocks, modules, and circuits described with reference to content disclosed in this application. Alternatively, the processor may be a combination of processors implementing a computing function, for example, a combination of one or more microprocessors, or a combination of the digital signal processor and a microprocessor. The bus 1004 may be a peripheral component interconnect (peripheral component interconnect, PCI) bus, an extended industry standard architecture (extended industry standard architecture, EISA) bus, and the like. The bus may be classified into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is used to represent the bus in FIG. 10, but this does not mean that there is only one bus or only one type of bus.

[0128] When each function module is obtained through division based on each corresponding function, FIG. 11 is a possible schematic structural diagram of a second node in the foregoing embodiments according to an embodiment of this application. The second node includes a sending unit 1101 and a receiving unit 1103. The sending unit 1101 is configured to support the second node in performing S601, S603, S606, S608, S612, or S614 in FIG. 6, step S708 in FIG. 7, and step S802(a2) and S808 in FIG. 8A and FIG. 8B. The receiving unit 1103 is configured to support the second node in performing S602(b), S605, S607, S611, and S613 in FIG. 6, and step S802(a1) or S807 in FIG. 8A and FIG. 8B. The second node may further include a processing unit 1102, configured to support the second node in determining, after the second node receives a measurement report sent by a terminal, a potential neighboring node in a measurement indication, a backhaul link measurement threshold configured for the first node, or whether to accept an addition request that is of a backup backhaul link and that is sent by the first node or a candidate neighboring node.

[0129] In hardware implementation, the processing unit 1102 may be a processor, the sending unit 1101 may be a transmitter, and the receiving unit 1103 may be a receiver. The receiver and the transmitter may form a communications interface.

[0130] FIG. 12 is a schematic diagram of a possible logical structure of a second node in the foregoing embodiments according to an embodiment of this application. The second node includes a processor 1202. In this embodiment of this application, the processor 1202 is configured to control and manage an action of the second node. For example, the processor 1202 is configured to support the second node in determining a potential neighboring node in a measurement indication, or determining a backhaul link measurement threshold t configured for a first node, or determining whether to accept an addition request that is of a backup backhaul link and that is sent by the first node or a candidate neighboring node. The second node may further include a memory 1201 and a communications interface 1203. The processor 1202, the communications interface 1203, and the memory 1201 may be connected to each other or connected to each other through a bus 1204. The communications interface 1203 is configured to support the second node in performing communication. The memory 1201 is configured to store program code and data of the second node. The processor 1202 invokes the code stored in the memory 1201 to perform control management. The memory 1201 may be coupled to or not coupled to the processor.

[0131] The processor 1202 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or another programmable logical device, a transistor logical device, a hardware component, or any combination thereof. The processor 1202 may implement or execute various example logical blocks, modules, and circuits described with reference to content disclosed in this application. Alternatively, the processor may be a combination of processors implementing a computing function, for example, a combination of one or more microprocessors, or a combination of the digital signal processor and a microprocessor. The bus 1204 may be a peripheral component interconnect (peripheral component interconnect, PCI) bus, an extended industry standard architecture (extended industry standard architecture, EISA) bus, and the like. The bus may be classified into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is used to represent the bus in FIG. 12, but this does not mean that there is only one bus or only one type of bus.

[0132] When each function module is obtained through division based on each corresponding function, FIG. 13 is a possible schematic structural diagram of a candidate neighboring node in the foregoing embodiments according to an embodiment of this application. The candidate neighboring node includes a sending unit 1301 and a receiving unit 1303. The sending unit 1301 is configured to support the candidate neighboring node in performing S607 or S613 in FIG. 6, step S703, S705, S707, or S709 in FIG. 7, and step S803, S807, or S809 in FIG. 8Aand FIG. 8B. The receiving unit 1303 is configured to support the candidate neighboring node in performing S606 and S612 in FIG. 6, step S702, S704, S706, S708, or S710 in FIG. 7, and S802(a2), S802(b1), S802(b2), S806, S808, or S810 in FIG. 8A and FIG. 8B. The candidate neighboring node may further include a processing unit 1302, configured to support the candidate neighboring node in configuring a CSI-RS resource for a first node based on a received measurement configuration request, determining whether to accept an addition request that is of a backup backhaul link and that is sent by a second node, determining whether to accept an addition request of a backup backhaul link of the first node, or determining to establish a bearer to a UPF or a bearer to the second node.

[0133] In hardware implementation, the processing unit 1302 may be a processor, the sending unit 1301 may be a transmitter, and the receiving unit 1303 may be a receiver. The receiver and the transmitter may form a communications interface.

[0134] FIG. 14 is a schematic diagram of a possible logical structure of a candidate neighboring node in the foregoing embodiments according to an embodiment of this application. The candidate neighboring node includes a processor 1402. In this embodiment of this application, the processor 1402 is configured to control and manage an action of a second node. For example, the processor 1402 is configured to support the candidate neighboring node in configuring a CSI-RS resource for a first node, or determining whether to accept an addition request that is of a backup backhaul link and that is sent by the second node, or determining whether to accept an addition request of a backup backhaul link of the first node, or determining to establish a bearer to a UPF or a bearer to the second node. The candidate neighboring node may further include a memory 1401 and a communications interface 1403. The processor 1402, the communications interface 1403, and the memory 1401 may be connected to each other or connected to each other through a bus 1404. The communications interface 1403 is configured to support the candidate neighboring node in performing communication. The memory 1401 is configured to store program code and data of the candidate neighboring node. The processor 1402 invokes the code stored in the memory 1401 to perform control management. The memory 1401 may be coupled to or not coupled to the processor.

[0135] The processor 1402 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or another programmable logical device, a transistor logical device, a hardware component, or any combination thereof. The processor 1402 may implement or execute various example logical blocks, modules, and circuits described with reference to content disclosed in this application. Alternatively, the processor may be a combination of processors implementing a computing function, for example, a combination of one or more microprocessors, or a combination of the digital signal processor and a microprocessor. The bus 1404 may be a peripheral component interconnect (peripheral component interconnect, PCI) bus, an extended industry standard architecture (extended industry standard architecture, EISA) bus, and the like. The bus may be classified into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is used to represent the bus in FIG. 14, but this does not mean that there is only one bus or only one type of bus.

[0136] In another embodiment of this application, a readable storage medium is further provided. The readable storage medium stores a computer execution instruction. When a device (which may be a single-chip microcomputer, a chip, or the like) or a processor performs steps of the first node, the second node, and the candidate neighboring node in the backhaul link maintenance method provided in FIG. 6, FIG. 7, and FIG. 8A and FIG. 8B, the computer execution instruction in a storage medium is read. The readable storage medium may include: any medium that can store program code, such as a USB flash drive, a removable hard disk, a read-only memory, a random access memory, a magnetic disk, or an optical disc.

[0137] Another embodiment of this application further provides a computer program product. The computer program product includes a computer execution instruction, and the computer execution instruction is stored in a computer-readable storage medium. At least one processor of a device may read the computer execution instruction from the computer-readable storage medium, and when the at least one processor executes the computer execution instruction, the device is enabled to implement a step of the first node, the second node, and the candidate neighboring node in the resource configuration method provided in FIG. 6, FIG. 7, and FIG. 8A and FIG. 8B.

[0138] Another embodiment of this application further provides a communications system. The communications system includes a plurality of devices, and the plurality of devices include a first node, a second node, and a candidate neighboring node. The first node may be the first node provided in FIG. 6, FIG. 7, or FIG. 8A and FIG. 8B, and is configured to perform the steps of the first node in the link maintenance method provided in FIG. 6, FIG. 7, or FIG. 8A and FIG. 8B; and/or the second node may be the second node provided in FIG. 6, FIG. 7, or FIG. 8A and FIG. 8B, and is configured to perform the steps of the second node in the link maintenance method provided in FIG. 6, FIG. 7, or FIG. 8A and FIG. 8B. It should be understood that the communications system may include a plurality of first nodes, that is, the second node may include a plurality of first nodes, and the plurality of first nodes perform a same or similar function.

[0139] In this embodiment of this application, after the first node sends an addition request or a deletion request of a backup backhaul link to the second node, the second node adds or deletes the backup backhaul link for the first node. In this way, a problem that a backhaul link is unavailable in a multi-hop relay network due to an instantaneous change of network traffic or an instantaneous interruption of a high-frequency link is resolved. By maintaining the backup backhaul link, a delay or a data transmission interruption time caused by poor quality or interruption of the backhaul link may be reduced, and transmission efficiency of a relay node may be improved through the backup backhaul link.

[0140] It should be finally noted that the foregoing descriptions are merely specific implementations of this application, but are not intended to limit the protection scope of this application. Any variation or replacement within the technical scope disclosed in this application shall fall within the protection scope of this application. Therefore, the protection scope of this application shall be subject to the protection scope of the claims.

Claims

1. A link maintenance method, comprising:

determining, by a first node, a candidate neighboring node to be measured;

measuring, by the first node, the candidate neighboring node;

determining, by the first node based on a measurement result, whether to establish or delete a backup backhaul link between the first node and the candidate neighboring node; and

sending, by the first node, a request to a second node, wherein the request is used to request the second node to establish or delete the backup backhaul link between the first node and the candidate neighboring node.

2. The method according to claim 1, further comprising:
receiving, by the first node, a backhaul link measurement threshold configured by the second node, wherein the backhaul link measurement threshold is used by the first node to determine backhaul link quality.

3. The method according to claim 1 or 2, comprising:
receiving, by the first node, a measurement indication sent by the second node, wherein the measurement indication comprises an identifier of a potential neighboring node, and the identifier of the potential neighboring node is used by the first node to determine the candidate neighboring node.

4. The method according to claim 1 or 2, further comprising:
receiving, by the first node, a measurement result that is of a potential neighboring node and that is sent by a terminal, wherein the measurement result of the potential neighboring node is used by the first node to determine the candidate neighboring node.

5. The method according to any one of claims 1 to 4, further comprising:
initiating, by the first node, a random access process to the candidate neighboring node if the first node determines to establish a backhaul link between the first node and the candidate neighboring node.

6. The method according to any one of claims 1 to 5, wherein the determining, by the first node based on a measurement result, whether to establish or delete a backup backhaul link between the first node and the candidate neighboring node comprises:

determining, by the first node, to establish the backup backhaul link between the first node and the candidate neighboring node when a condition M_r - H_ys > Thresh is met, wherein M_r is the measurement result of the candidate neighboring node by the first node, H_ys is an event hysteresis parameter, and Thresh is the backhaul link measurement threshold; or

determining, by the first node, to delete the backup backhaul link between the first node and the candidate neighboring node when a condition M_r + H_ys < Thresh is met.

7. A link maintenance method, comprising:

receiving, by a second node, a first request sent by a first node, wherein the first request is used to request the second node to establish or delete a backup backhaul link between the first node and a candidate neighboring node; and

sending, by the second node, a response to the first node.

8. The method according to claim 7, further comprising:
sending, by the second node, a backhaul link measurement threshold to the first node, wherein the backhaul link measurement threshold is used by the first node to determine backhaul link quality.

9. The method according to claim 7, further comprising:
sending, by the second node, a measurement indication to the first node, wherein the measurement indication comprises an identifier of a potential neighboring node, and the identifier of the potential neighboring node is used by the first node to determine the candidate neighboring node.

10. The method according to any one of claims 7 to 9, further comprising:
sending, by the second node, a second request to the candidate neighboring node, wherein the second request is used by the candidate neighboring node to establish or delete a bearer to the second node or a user plane function.

11. A first node, comprising:

a processing unit, configured to: determine a candidate neighboring node to be measured, measure the candidate neighboring node, and determine whether to establish or delete a backup backhaul link between the first node and the candidate neighboring node; and

a sending unit, configured to send a request to a second node, wherein the request is used to request the second node to establish or delete the backup backhaul link between the first node and the candidate neighboring node.

12. The first node according to claim 11, further comprising:
a receiving unit, configured to receive a backhaul link measurement threshold configured by the second node, wherein the backhaul link measurement threshold is used by the first node to determine backhaul link quality.

13. The first node according to claim 11 or 12, wherein the receiving unit is further configured to receive a measurement indication sent by the second node, wherein the measurement indication comprises an identifier of a potential neighboring node, and the identifier of the potential neighboring node is used by the first node to determine the candidate neighboring node.

14. The first node according to claim 12, wherein:
the receiving unit is further configured to receive a measurement result that is of a potential neighboring node and that is sent by a terminal, wherein the measurement result of the potential neighboring node is used by the first node to determine the candidate neighboring node.

15. The first node according to any one of claims 11 to 14, further comprising:

the processing unit is further configured to determine to establish a backhaul link between the first node and the candidate neighboring node; and

the sending unit is configured to initiate a random access process to the candidate neighboring node.

16. The first node according to any one of claims 11 to 15, wherein
the processing unit is configured to determine to establish the backup backhaul link between the first node and the candidate neighboring node when a condition M_r - H_ys > Thresh is met, wherein M_r is the measurement result of the candidate neighboring node by the first node, H_ys is an event hysteresis parameter, and Thresh is the backhaul link measurement threshold; or
the processing unit is configured to determine to delete the backup backhaul link between the first node and the candidate neighboring node when a condition M_r + H_ys < Thresh is met.

17. A second node, comprising:

a receiving unit, configured to receive a first request sent by a first node, wherein the first request is used to request the second node to establish or delete a backup backhaul link between the first node and a candidate neighboring node; and

a sending unit, configured to send a response to the first node.

18. The second node according to claim 17, wherein the sending unit is further configured to send a backhaul link measurement threshold to the first node, wherein the backhaul link measurement threshold is used by the first node to determine backhaul link quality.

19. The second node according to claim 17 or 18, wherein the sending unit is further configured to send a measurement indication to the first node, wherein the measurement indication comprises an identifier of a potential neighboring node, and the identifier of the potential neighboring node is used by the first node to determine the candidate neighboring node.

20. The second node according to any one of claims 17 to 19, wherein
the sending unit is further configured to send a second request to the candidate neighboring node, wherein the second request is used by the candidate neighboring node to establish or delete a bearer to the second node or a user plane function.

21. A communications apparatus, wherein the communications apparatus is a first node and comprises:

a processor, configured to: determine a candidate neighboring node to be measured, measure the candidate neighboring node, and determine whether to establish or delete a backup backhaul link between the first node and the candidate neighboring node; and

a transmitter, configured to send a request to a second node, wherein the request is used to request the second node to establish or delete the backup backhaul link between the first node and the candidate neighboring node.

22. The communications apparatus according to claim 21, further comprising:
a receiver, configured to receive a backhaul link measurement threshold configured by the second node, wherein the backhaul link measurement threshold is used by the first node to determine backhaul link quality.

23. The communications apparatus according to claim 21 or 22, wherein the receiver is further configured to receive a measurement indication sent by the second node, wherein the measurement indication comprises an identifier of a potential neighboring node, and the identifier of the potential neighboring node is used by the first node to determine the candidate neighboring node.

24. The communications apparatus according to claim 22, wherein:
the receiver is further configured to receive a measurement result that is of a potential neighboring node and that is sent by a terminal, wherein the measurement result of the potential neighboring node is used by the first node to determine the candidate neighboring node.

25. The communications apparatus according to any one of claims 21 to 24, further comprising:

the processor is further configured to determine to establish a backhaul link between the first node and the candidate neighboring node; and

the transmitter is configured to initiate a random access process to the candidate neighboring node.

26. The communications apparatus according to any one of claims 21 to 25, wherein
the processor is configured to determine to establish the backup backhaul link between the first node and the candidate neighboring node when a condition M_r - H_ys > Thresh is met, wherein M_r is the measurement result of the candidate neighboring node by the first node, H_ys is an event hysteresis parameter, and Thresh is the backhaul link measurement threshold; or
the processor is configured to determine to delete the backup backhaul link between the first node and the candidate neighboring node when a condition M_r + H_ys < Thresh is met.

27. A communications apparatus, wherein the communications apparatus is a second node and comprises:

a receiver, configured to receive a first request sent by a first node, wherein the first request is used to request the second node to establish or delete a backup backhaul link between the first node and a candidate neighboring node; and

a transmitter, configured to send a response to the first node.

28. The communications apparatus according to claim 27, wherein the transmitter is further configured to send a backhaul link measurement threshold to the first node, wherein the backhaul link measurement threshold is used by the first node to determine backhaul link quality.

29. The communications apparatus according to claim 27 or 28, wherein the transmitter is further configured to send a measurement indication to the first node, wherein the measurement indication comprises an identifier of a potential neighboring node, and the identifier of the potential neighboring node is used by the first node to determine the candidate neighboring node.

30. The communications apparatus according to any one of claims 27 to 29, wherein
the transmitter is further configured to send a second request to the candidate neighboring node, wherein the second request is used by the candidate neighboring node to establish or delete a bearer to the second node or a user plane function.

31. An apparatus, comprising a processor and a memory, wherein the memory stores code and data, the memory is coupled to the processor, and the processor is configured to implement the link maintenance method according to any one of claims 1 to 6, or implement the link maintenance method according to any one of claims 7 to 10.

32. A readable storage medium, wherein the readable storage medium stores a program, and when the program is run, the link maintenance method according to any one of claims 1 to 6 or the link maintenance method according to any one of claims 7 to 10 is implemented.

33. A computer program product comprising an instruction, wherein when the computer program product is run, the link maintenance method according to any one of claims 1 to 6 or the link maintenance method according to any one of claims 7 to 10 is implemented.

34. A chip system, wherein the chip system comprises a memory and a processor, the memory stores code and data, the memory is coupled to the processor, and the processor runs the code in the memory, so that the device performs the link maintenance method according to any one of claims 1 to 6 or implements the link maintenance method according to any one of claims 7 to 10.

35. A communications system, wherein the communications system comprises a plurality of devices, the plurality of devices comprise a first node device and a second node device, the first node device implements the link maintenance method according to any one of claims 1 to 6, and the second node device implements the link maintenance method according to any one of claims 7 to 10.

Drawing