CN112822748A - Routing method and device - Google Patents
Routing method and device Download PDFInfo
- Publication number
- CN112822748A CN112822748A CN201911127622.XA CN201911127622A CN112822748A CN 112822748 A CN112822748 A CN 112822748A CN 201911127622 A CN201911127622 A CN 201911127622A CN 112822748 A CN112822748 A CN 112822748A
- Authority
- CN
- China
- Prior art keywords
- node
- channel
- routing
- routing path
- selecting
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention provides a routing method and routing equipment, wherein the method comprises the following steps: acquiring channel occupation information of a wireless link; establishing or updating a routing table according to the channel occupation information; and selecting a routing path according to the channel occupation information in the routing table. In the embodiment of the invention, the routing table used by the donor base station and/or the IAB node contains necessary channel occupation information, can trigger routing when LBT failure occurs, and can refer to the channel occupation information when routing is selected, thereby improving the success rate after routing replacement and reducing the service delay and interruption rate of a user.
Description
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a method and equipment for routing an unauthorized frequency band relay node.
Background
Referring to fig. 1, a basic structure of an Integrated Access and Backhaul (IAB) is shown:
The New air interface (NR) IAB supports the architecture of CU/DU separation, so that an IAB node serving as a relay only needs to have a user plane function, selects an appropriate forwarding path according to a routing table, routes user data of a child node to a parent node (uplink) thereof, or routes user data of a parent node to a child node (downlink) thereof, and guarantees Quality of Service (QoS) as much as possible.
Currently, in the research of the 3rd Generation Partnership Project (3 GPP) IAB, a Backhaul Link Adaptation Protocol (BAP) layer is introduced above a Radio Link Control (RLC) layer to take charge of the implementation of a routing function, but a specific routing table format and a routing decision right attribute are not determined. One possible solution is that the donor base station sends a routing table to the IAB node, each route comprising a communication end address and a path identification; the donor base station may configure and use a specific route for the IAB node, and the IAB node may also change the route when a Radio Link Failure (RLF) occurs.
Disclosure of Invention
An object of the embodiments of the present invention is to provide a routing method and device, which solve the problem of service delay or interruption caused by route replacement.
In a first aspect, an embodiment of the present invention provides a routing method applied to a first node, where the first node is a donor base station or a relay node, and the method includes:
acquiring channel occupation information of a wireless link;
establishing or updating a routing table according to the channel occupation information;
and selecting a routing path according to the channel occupation information in the routing table.
Optionally, the obtaining of the channel occupancy information of the wireless link includes:
receiving channel occupancy information of a wireless link collected by a second node from the second node, the second node being a donor base station or a relay node or a terminal, and/or,
and acquiring the channel occupation information of the wireless link acquired by the first node.
Optionally, receiving, from a second node, channel occupancy information collected by the second node, includes:
receiving, from the second node through a first interface, channel occupancy information collected by the second node;
wherein the first interface comprises any one of:
an air interface between the terminal and the relay node;
an interface between the donor base station and the relay node;
an interface between relay nodes.
Optionally, receiving, from a second node, channel occupancy information collected by the second node, includes:
receiving, from the second node, channel occupancy information collected by the second node through first signaling;
the first signaling comprises any one of:
user plane associated signaling between the terminal and the relay node;
control plane dedicated signaling or user plane associated signaling between the donor base station and the relay node;
and the user plane channel associated signaling between the relay nodes.
Optionally, the first node is a donor base station, and in the established or updated routing table, the channel occupancy information corresponding to the routing path includes one or more of the following items:
channel occupation information of each wireless link in the routing path;
the average value of the channel occupation information of a plurality of sections of wireless links in the routing path;
the maximum value of the channel occupation information of the multiple sections of wireless links in the routing path;
and the minimum value of the channel occupation information of the multiple wireless links in the routing path.
Optionally, the first node is a relay node, and in the updated routing table, the channel occupancy information corresponding to the routing path includes one or more of the following items:
channel occupation information of a link between a current relay node and a next relay node in a routing path;
the average value of the channel occupation information of a plurality of sections of wireless links in the routing path;
the maximum value of the channel occupation information of the multiple sections of wireless links in the routing path;
and the minimum value of the channel occupation information of the multiple wireless links in the routing path.
Optionally, the channel occupancy information includes one or more of:
a received signal strength indication of a wireless link;
a listen before talk or clear channel assessment success rate of the wireless link;
a listen-before-talk or clear channel assessment failure rate for the wireless link;
average time for the radio link to make listen before talk or clear channel assessment.
Optionally, selecting a routing path according to the channel occupancy information in the routing table, including:
and when the first node receives new service data and needs to establish a new route, or when a listen-before-talk or clear channel assessment failure or continuous listen-before-talk or clear channel assessment failure occurs in a next wireless link of any route managed by the first node, selecting a routing path according to the channel occupation information in the routing table.
Optionally, selecting a routing path according to the channel occupancy information in the routing table, including:
sorting the routing paths of the same communication terminal according to the channel occupation information in the routing table;
and selecting the optimal routing path according to the sorting result.
Optionally, selecting the best routing path according to the sorting result includes one or more of the following:
selecting a routing path with the lowest failure rate of the received signal strength indicated value of the next wireless link or the listening-before-speaking or clear channel evaluation;
selecting a routing path with the shortest average time for carrying out listen before talk or clear channel estimation on the next wireless link;
selecting a route path with the highest success rate of the next wireless link listening before speaking or clear channel evaluation;
selecting a routing path with the lowest failure rate of average received signal strength indicated value or listening-before-speaking or clear channel evaluation of all wireless links;
selecting a routing path with the shortest average time for carrying out listen before talk or clear channel estimation on all wireless links;
selecting a routing path with the highest average listening-first-speaking or clear channel evaluation success rate of all wireless links;
selecting a routing path with the lowest minimum value of the received signal strength indicated values of all wireless links or the minimum values of the listening-before-speaking or clear channel evaluation failure rates;
selecting a routing path with the shortest average time minimum value for carrying out listen before talk or clear channel estimation on all wireless links;
and selecting the routing path with the highest average listen-before-talk or clear channel estimation success rate maximum value of all the wireless links.
In a second aspect, an embodiment of the present invention further provides a first node, where the first node is a donor base station or a relay node, and the first node includes:
the acquisition module is used for acquiring channel occupation information of a wireless link;
the establishing or updating module is used for establishing or updating a routing table according to the channel occupation information;
and the selection module is used for selecting a routing path according to the channel occupation information in the routing table.
In a third aspect, an embodiment of the present invention further provides a first node, where the first node is a donor base station or a relay node, and the first node includes: a transceiver and a processor.
The processor is used for acquiring channel occupation information of a wireless link;
the processor is further configured to establish or update a routing table according to the channel occupancy information;
the processor is further configured to select a routing path according to the channel occupancy information in the routing table.
In a fourth aspect, an embodiment of the present invention further provides a communication device, where the communication device includes: a processor, a memory and a program stored on the memory and executable on the processor, which program, when executed by the processor, carries out the steps of the method of routing according to the first aspect.
In a fifth aspect, the embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the method for routing according to the first aspect.
In the embodiment of the present invention, the routing table used by the first node (the donor base station or the relay node) contains necessary channel occupancy information, and may trigger routing selection when Listen Before Talk (Listen Before Talk, LBT) fails, and may refer to the channel occupancy information when routing is selected, thereby improving the success rate after routing replacement, and reducing the user service delay and interruption rate.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
FIG. 1 is an IAB architecture diagram;
FIG. 2 is a flow chart of a method of routing according to an embodiment of the present invention;
FIG. 3 is a second flowchart of a method of routing according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating a first node according to an embodiment of the present invention;
FIG. 5 is a second schematic diagram of a first node according to the second embodiment of the present invention;
fig. 6 is a schematic diagram of a terminal according to an embodiment of the present invention;
fig. 7 is a schematic diagram of a base station according to an embodiment of the present invention.
Detailed Description
With the emergence of endless data-type applications such as virtual reality and augmented reality, the capacity of the current mobile communication network cannot meet the demands of people more and more, and the network densification becomes an important means for increasing the network capacity. Small base stations are densely deployed at stations such as light poles, bus shelters and the like, a backhaul solution with low cost, rapid deployment and simple and convenient maintenance needs to be found, and the backhaul of a wireless Mesh network (wireless Mesh network) becomes a very competitive method by virtue of the characteristics of self-configuration, self-optimization and fault self-healing. In order to further improve the utilization rate of spectrum resources, improve the reliability of a network, and provide more accurate QoS management, load balancing and multi-path routing based on services, the IAB technology is indispensable and has great research value.
The 3GPP has initiated research on the fifth generation mobile communication technology (5G) NR release 16(Rel-16) Unlicensed frequency band (NR in Unlicensed Spectrum, NR-U) as an extension and complement to the 5G NR. The initial intention of NR-U is to consider that licensed spectrum resources are limited, and to meet the traffic demands of seamless coverage and high data rate (large bandwidth), an NR protocol is used to provide access services in an unlicensed frequency band (e.g., 2.4GHz, 5.8GHz, 60GHz, etc.), for example, when a terminal has large-traffic non-real-time traffic, the terminal can be carried by a cell in the unlicensed frequency band, and the pressure of the cell in the licensed frequency band is relieved.
Due to the unlicensed characteristic of the unlicensed spectrum, some countries or regions require channel occupancy monitoring before any communication is performed on the unlicensed spectrum, that is, communication can be performed after LBT is successful. Therefore, LBT failure will affect any air interface interworking (including control plane and user plane) in the cellular network protocol. For example, when LBT on a certain time-frequency Resource fails, system messages, access requests, Radio Resource Control (RRC) signaling, user data, and the like cannot be transmitted on the time-frequency Resource, which results in delay or failure in reception at the network side or the terminal side.
In the existing scheme, the donor base station sends no channel occupation information in the routing table to the IAB node, so that no matter the donor base station configures and uses a specific route for the IAB node or the IAB node changes the route by itself, the channel occupation condition is not considered. LBT failure may occur in one or more radio links between the donor base station, the IAB node, the terminal and the IAB node if these links operate in unlicensed bands, especially when there are other operators or privately deployed unlicensed band access points around the node. On one hand, the IAB node has no LBT failure triggering route replacement mechanism; on the other hand, even if the LBT failure triggers the route replacement, the IAB node does not have the channel occupancy information and the like as reference, and the success rate after the route replacement cannot be ensured. Both of the above situations can result in delays or even interruptions in traffic.
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "comprises," "comprising," or any other variation thereof, in the description and claims of this application, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus. Furthermore, the use of "and/or" in the specification and claims means that at least one of the connected objects, such as a and/or B, means that three cases, a alone, B alone, and both a and B, exist.
In the embodiments of the present invention, words such as "exemplary" or "for example" are used to mean serving as examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "e.g.," an embodiment of the present invention is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.
The technology described herein is not limited to a 5th-generation (5G) system and a later-evolution communication system, and is not limited to an LTE/LTE evolution (LTE-a) system, and may also be used for various wireless communication systems, such as Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiple Access (OFDMA), Single-carrier Frequency-Division Multiple Access (SC-FDMA), and other systems.
The terms "system" and "network" are often used interchangeably. CDMA systems may implement Radio technologies such as CDMA2000, Universal Terrestrial Radio Access (UTRA), and so on. UTRA includes Wideband CDMA (Wideband Code Division Multiple Access, WCDMA) and other CDMA variants. TDMA systems may implement radio technologies such as Global System for Mobile communications (GSM). The OFDMA system can implement radio technologies such as Ultra Mobile Broadband (UMB), evolved-UTRA (E-UTRA)), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX)), IEEE 802.20, Flash-OFDM, and the like. UTRA and E-UTRA are parts of the Universal Mobile Telecommunications System (UMTS). LTE and higher LTE (e.g., LTE-A) are new UMTS releases that use E-UTRA. UTRA, E-UTRA, UMTS, LTE-A, and GSM are described in documents from an organization named "third Generation Partnership Project" (3 GPP). CDMA2000 and UMB are described in documents from an organization named "third generation partnership project 2" (3GPP 2). The techniques described herein may be used for both the above-mentioned systems and radio technologies, as well as for other systems and radio technologies.
The base station provided in the embodiment of the present invention may be a commonly used base station, may also be an evolved node base station (eNB), and may also be a network device (e.g., a next generation base station (gNB) or a Transmission and Reception Point (TRP)) in a 5G system.
The terminal provided by the embodiment of the invention can be a Mobile phone, a tablet Computer, a notebook Computer, an Ultra-Mobile Personal Computer (UMPC), a netbook or a Personal Digital Assistant (PDA), a Mobile Internet Device (MID), a Wearable Device (Wearable Device), a vehicle-mounted Device, or the like.
Referring to fig. 2, an embodiment of the present invention provides a routing method, where an execution subject of the method is a first node, where the first node includes but is not limited to a donor base station or a relay node, and the method includes: step 201, step 202 and step 203.
Step 201: acquiring channel occupation information of a wireless link;
in some embodiments, the channel occupancy information includes one or more of: (1) a received signal strength indication of a wireless link; (2) listen Before Talk (LBT) or Clear Channel Assessment (CCA) success rate of the wireless link; (3) a listen-before-talk or clear channel assessment failure rate for the wireless link; (4) average time for the radio link to make listen before talk or clear channel assessment.
In some embodiments, step 201 may be implemented in the following manner one and/or manner two.
Receiving channel occupation information of a wireless link collected by a second node from the second node, where the second node is a donor base station, a relay node or a terminal, and the relay node may be a terminal with a relay function, but is not limited thereto;
for example, receiving, from the second node through a first interface, channel occupancy information collected by the second node; wherein the first interface comprises any one of: (1) an air interface between the terminal and the relay node; (2) an interface between the donor base station and the relay node; (3) an interface between relay nodes.
For another example, receiving, from the second node, channel occupancy information collected by the second node through first signaling; the first signaling comprises any one of: (1) user plane associated signaling between the terminal and the relay node; (2) control plane dedicated signaling or user plane associated signaling between the donor base station and the relay node; (3) and the user plane channel associated signaling between the relay nodes.
And secondly, acquiring the channel occupation information of the wireless link acquired by the first node.
Step 202: establishing or updating a routing table according to the channel occupation information;
in some embodiments, the first node is a donor base station, and in the established or updated routing table, the channel occupancy information corresponding to the routing path includes one or more of the following: (1) channel occupation information of each wireless link in the routing path; (2) the average value of the channel occupation information of a plurality of sections of wireless links in the routing path; (3) the maximum value of the channel occupation information of the multiple sections of wireless links in the routing path; (4) and the minimum value of the channel occupation information of the multiple wireless links in the routing path.
In some embodiments, the first node is a relay node, and the updated routing table includes channel occupancy information corresponding to the routing path, where the channel occupancy information includes one or more of the following: (1) channel occupation information of a link between a current relay node and a next relay node in a routing path; (2) the average value of the channel occupation information of a plurality of sections of wireless links in the routing path; (3) the maximum value of the channel occupation information of the multiple sections of wireless links in the routing path; (4) and the minimum value of the channel occupation information of the multiple wireless links in the routing path.
Step 203: and selecting a routing path according to the channel occupation information in the routing table.
In some embodiment modes, when the first node receives new service data and needs to establish a new route, or when a listen-before-talk or clear channel assessment failure or a continuous listen-before-talk or clear channel assessment failure occurs in a next radio link of any route managed by the first node, a routing path is selected according to channel occupancy information in the routing table.
In some embodiment modes, the routing paths of the same communication end point are sequenced according to the channel occupation information in the routing table; and selecting the optimal routing path according to the sorting result.
Further, selecting the optimal routing path according to the sorting result, wherein the optimal routing path comprises one or more of the following items:
(1) selecting a routing path with the lowest failure rate of the received signal strength indicated value of the next wireless link or the listening-before-speaking or clear channel evaluation;
(2) selecting a routing path with the shortest average time for carrying out listen before talk or clear channel estimation on the next wireless link;
(3) selecting a route path with the highest success rate of the next wireless link listening before speaking or clear channel evaluation;
(4) selecting a routing path with the lowest failure rate of average received signal strength indicated value or listening-before-speaking or clear channel evaluation of all wireless links;
(5) selecting a routing path with the shortest average time for carrying out listen before talk or clear channel estimation on all wireless links;
(6) selecting a routing path with the highest average listening-first-speaking or clear channel evaluation success rate of all wireless links;
(7) selecting a routing path with the lowest minimum value of the received signal strength indicated values of all wireless links or the minimum values of the listening-before-speaking or clear channel evaluation failure rates;
(8) selecting a routing path with the shortest average time minimum value for carrying out listen before talk or clear channel estimation on all wireless links;
(9) and selecting the routing path with the highest average listen-before-talk or clear channel estimation success rate maximum value of all the wireless links.
In the embodiment of the present invention, the routing table used by the first node (the donor base station or the relay node) contains necessary channel occupancy information, which can trigger routing when Listen Before Talk (LBT) or clear channel evaluation fails, and can refer to the channel occupancy information when routing is selected, thereby improving the success rate after routing replacement, and reducing user service delay and interruption rate.
One embodiment of the present invention is described below in conjunction with the method illustrated in fig. 3.
Firstly, a node 1 collects channel occupation information and sends the channel occupation information to a node 2 connected with the node 1; then the node 2 establishes or updates a routing table according to the channel occupation information acquired and/or received by the node 2; finally, the node 2 selects a route according to the channel occupation information in the routing table. The specific flow is shown in fig. 3:
step 301: the node 1 collects the channel occupation information and interacts with the node 2 connected with the node.
The node 1 may be a donor base station (IAB node), a relay node (IAB node), or a terminal.
The node 2 may be a donor base station (IAB node) or a relay node (IAB node).
In some embodiments, collecting channel occupancy information may be performed by at least one of: (1) the method includes the steps of directly measuring Received Signal Strength Indicator (RSSI) of a wireless link, (2) counting LBT success rate of the wireless link, (3) counting LBT failure rate of the wireless link, and (4) counting average time of LBT of the wireless link.
In some embodiments, the channel occupancy information includes at least one of: RSSI of a certain wireless link, LBT success rate of the certain wireless link, LBT failure rate of the certain wireless link and average LBT time of the certain wireless link.
In some embodiments, the interaction occurs through at least one of the following: (1) an air interface (Uu) between the terminal and the relay node, (2) an interface (F1 interface) between the donor base station and the relay node, and (3) an interface between the relay node and the relay node.
In some embodiments, the interaction is performed by at least one of: (1) user plane channel associated signaling between a terminal and a relay node, (2) control plane dedicated signaling or user plane channel associated signaling between a donor base station and the relay node, and (3) user plane channel associated signaling between the relay node and the relay node.
Step 302: the node 2 establishes or updates a routing table according to the channel occupation information acquired and/or interacted by the node.
In some embodiments, if node 2 is a donor base station, it associates the channel occupancy information with each route when establishing or updating the routing table.
For any route, the corresponding channel occupancy information may be the channel occupancy information of each link in the route, or an average value, a maximum value, or a minimum value of the channel occupancy information of all links in the route.
Examples of routing tables established or updated by the donor base station are as follows:
(1) including channel occupancy information for each segment of the link in any route.
Table 1: routing table examples (including channel occupancy information for each segment of the link in any route).
(2) Including the average or maximum or minimum of the channel occupancy information for all links in any route.
Table 2: routing table examples (including the average or maximum or minimum of the channel occupancy information for all links in any route).
In some embodiments, node 2 sends a routing table containing channel occupancy information to its subordinate relay nodes.
If the node 2 is a relay node, it corresponds the channel occupation information to each route when updating the routing table.
For any route, in addition to receiving the routing table from the donor node, the corresponding channel occupancy information may also include channel occupancy information of a link between the current relay node and the next relay node in the route.
An example of a relay node updated routing table is as follows:
(1) if the node 2 receives the routing table from the donor base station and only includes the average value, the maximum value or the minimum value of the channel occupation information of all links in any route, the updated routing table of the node 2 may further include the channel occupation information of the link between the current relay node 2 and the next relay node in any route.
Table 3 example routing table (including channel occupancy information for the link between the current relay node and the next relay node in any route).
Step 303: the node 2 selects a routing path according to the channel occupation information in the routing table.
In some embodiments, if the node 2 receives new traffic data and needs to establish a new route, or if an LBT failure or a sustained LBT failure occurs on a next link of any route managed by the node 2, the node 2 may perform routing.
In some embodiments, the node 2 sorts the routing options of the same communication destination according to the channel occupancy information in the routing table, and selects the optimal route according to the sorting result.
Optionally, selecting the best route according to the sorting result may include: (1) selecting a route with the lowest RSSI value/LBT failure rate of the next link; (2) selecting the next link to carry out the routing with the shortest LBT average time; (3) selecting a route with the highest LBT success rate of a next link; (4) selecting the route with the lowest average RSSI value/LBT failure rate of all links; (5) selecting a route with shortest average LBT time for all links on average; (6) selecting a route with the highest success rate of the average LBT of all links; (7) selecting the route with the lowest minimum value of RSSI values/LBT failure rates of all links; (8) selecting all links to carry out the routing with the shortest average time minimum of LBT; (9) and selecting the route with the highest average LBT success rate of all links.
Referring to fig. 4, an embodiment of the present invention further provides a first node, where the first node 400 is a donor base station or a relay node, and the first node 400 includes:
an obtaining module 401, configured to obtain channel occupancy information of a wireless link;
a building or updating module 402, configured to build or update a routing table according to the channel occupation information;
a selecting module 403, configured to select a routing path according to the channel occupation information in the routing table.
In some embodiments, the obtaining module 401 is further configured to: and receiving the channel occupation information of the wireless link collected by the second node from the second node, wherein the second node is a donor base station or a relay node or a terminal, and/or obtaining the channel occupation information of the wireless link collected by the first node.
In some embodiments, the obtaining module 401 is further configured to: receiving, from the second node through a first interface, channel occupancy information collected by the second node; wherein the first interface comprises any one of: (1) an air interface between the terminal and the relay node; (2) an interface between the donor base station and the relay node; (3) an interface between relay nodes.
In some embodiments, the obtaining module 401 is further configured to: receiving, from the second node, channel occupancy information collected by the second node through first signaling; the first signaling comprises any one of: (1) user plane associated signaling between the terminal and the relay node; (2) control plane dedicated signaling or user plane associated signaling between the donor base station and the relay node; (3) and the user plane channel associated signaling between the relay nodes.
In some embodiments, the first node is a donor base station, and in the established or updated routing table, the channel occupancy information corresponding to the routing path includes one or more of the following: (1) channel occupation information of each wireless link in the routing path; (2) the average value of the channel occupation information of a plurality of sections of wireless links in the routing path; (3) the maximum value of the channel occupation information of the multiple sections of wireless links in the routing path; (4) and the minimum value of the channel occupation information of the multiple wireless links in the routing path.
In some embodiments, the first node is a relay node, and the updated routing table includes channel occupancy information corresponding to the routing path, where the channel occupancy information includes one or more of the following: (1) channel occupation information of a link between a current relay node and a next relay node in a routing path; (2) the average value of the channel occupation information of a plurality of sections of wireless links in the routing path; (3) the maximum value of the channel occupation information of the multiple sections of wireless links in the routing path; (4) and the minimum value of the channel occupation information of the multiple wireless links in the routing path.
In some embodiments, the channel occupancy information includes one or more of: (1) a received signal strength indication of a wireless link; (2) a listen before talk or clear channel assessment success rate of the wireless link; (3) a listen-before-talk or clear channel assessment failure rate for the wireless link; (4) average time for the radio link to make listen before talk or clear channel assessment.
In some embodiments, the selection module 403 is further configured to: and when the first node receives new service data and needs to establish a new route, or when a listen-before-talk or clear channel assessment failure or continuous listen-before-talk or clear channel assessment failure occurs in a next wireless link of any route managed by the first node, selecting a routing path according to the channel occupation information in the routing table.
In some embodiments, the selection module 403 is further configured to: sorting the routing paths of the same communication terminal according to the channel occupation information in the routing table; and selecting the optimal routing path according to the sorting result.
In some embodiments, selecting the best routing path according to the ranking results includes one or more of:
(1) selecting a routing path with the lowest failure rate of the received signal strength indicated value of the next wireless link or the listening-before-speaking or clear channel evaluation;
(2) selecting a routing path with the shortest average time for carrying out listen before talk or clear channel estimation on the next wireless link;
(3) selecting a route path with the highest success rate of the next wireless link listening before speaking or clear channel evaluation;
(4) selecting a routing path with the lowest failure rate of average received signal strength indicated value or listening-before-speaking or clear channel evaluation of all wireless links;
(5) selecting a routing path with the shortest average time for carrying out listen before talk or clear channel estimation on all wireless links;
(6) selecting a routing path with the highest average listening-first-speaking or clear channel evaluation success rate of all wireless links;
(7) selecting a routing path with the lowest minimum value of the received signal strength indicated values of all wireless links or the minimum values of the listening-before-speaking or clear channel evaluation failure rates;
(8) selecting a routing path with the shortest average time minimum value for carrying out listen before talk or clear channel estimation on all wireless links;
(9) and selecting the routing path with the highest average listen-before-talk or clear channel estimation success rate maximum value of all the wireless links.
The first node provided in the embodiment of the present invention may implement the embodiment shown in fig. 2, which has similar implementation principles and technical effects, and this embodiment is not described herein again.
Referring to fig. 5, an embodiment of the present invention further provides a first node, where the first node 500 is a donor base station or a relay node, and the first node 500 includes: a transceiver 501 and a processor 502.
A processor 502, configured to obtain channel occupancy information of a wireless link;
the processor 502 is further configured to establish or update a routing table according to the channel occupancy information;
the processor 502 is further configured to select a routing path according to the channel occupation information in the routing table.
In some embodiments, the processor 502 is further configured to: and receiving the channel occupation information of the wireless link collected by the second node from the second node, wherein the second node is a donor base station or a relay node or a terminal, and/or obtaining the channel occupation information of the wireless link collected by the first node.
In some embodiments, the transceiver 501 is configured to: receiving, from the second node through a first interface, channel occupancy information collected by the second node; wherein the first interface comprises any one of: (1) an air interface between the terminal and the relay node; (2) an interface between the donor base station and the relay node; (3) an interface between relay nodes.
In some embodiments, the transceiver 501 is configured to: receiving, from the second node, channel occupancy information collected by the second node through first signaling; the first signaling comprises any one of: (1) user plane associated signaling between the terminal and the relay node; (2) control plane dedicated signaling or user plane associated signaling between the donor base station and the relay node; (3) and the user plane channel associated signaling between the relay nodes.
In some embodiments, the first node is a donor base station, and in the established or updated routing table, the channel occupancy information corresponding to the routing path includes one or more of the following: (1) channel occupation information of each wireless link in the routing path; (2) the average value of the channel occupation information of a plurality of sections of wireless links in the routing path; (3) the maximum value of the channel occupation information of the multiple sections of wireless links in the routing path; (4) and the minimum value of the channel occupation information of the multiple wireless links in the routing path.
In some embodiments, the first node is a relay node, and the updated routing table includes channel occupancy information corresponding to the routing path, where the channel occupancy information includes one or more of the following: (1) channel occupation information of a link between a current relay node and a next relay node in a routing path; (2) the average value of the channel occupation information of a plurality of sections of wireless links in the routing path; (3) the maximum value of the channel occupation information of the multiple sections of wireless links in the routing path; (4) and the minimum value of the channel occupation information of the multiple wireless links in the routing path.
In some embodiments, the channel occupancy information includes one or more of: (1) a received signal strength indication of a wireless link; (2) a listen before talk or clear channel assessment success rate of the wireless link; (3) a listen-before-talk or clear channel assessment failure rate for the wireless link; (4) average time for the radio link to make listen before talk or clear channel assessment.
In some embodiments, the processor 502 is further configured to: and when the first node receives new service data and needs to establish a new route, or when a listen-before-talk or clear channel assessment failure or continuous listen-before-talk or clear channel assessment failure occurs in a next wireless link of any route managed by the first node, selecting a routing path according to the channel occupation information in the routing table.
In some embodiments, the processor 502 is further configured to: sorting the routing paths of the same communication terminal according to the channel occupation information in the routing table; and selecting the optimal routing path according to the sorting result.
In some embodiments, selecting the best routing path according to the ranking results includes one or more of:
(1) selecting a routing path with the lowest failure rate of the received signal strength indicated value of the next wireless link or the listening-before-speaking or clear channel evaluation;
(2) selecting a routing path with the shortest average time for carrying out listen before talk or clear channel estimation on the next wireless link;
(3) selecting a route path with the highest success rate of the next wireless link listening before speaking or clear channel evaluation;
(4) selecting a routing path with the lowest failure rate of average received signal strength indicated value or listening-before-speaking or clear channel evaluation of all wireless links;
(5) selecting a routing path with the shortest average time for carrying out listen before talk or clear channel estimation on all wireless links;
(6) selecting a routing path with the highest average listening-first-speaking or clear channel evaluation success rate of all wireless links;
(7) selecting a routing path with the lowest minimum value of the received signal strength indicated values of all wireless links or the minimum values of the listening-before-speaking or clear channel evaluation failure rates;
(8) selecting a routing path with the shortest average time minimum value for carrying out listen before talk or clear channel estimation on all wireless links;
(9) and selecting the routing path with the highest average listen-before-talk or clear channel estimation success rate maximum value of all the wireless links.
The first node provided in the embodiment of the present invention may implement the embodiment shown in fig. 2, which has similar implementation principles and technical effects, and this embodiment is not described herein again.
As shown in fig. 6, the terminal 600 shown in fig. 6 includes: at least one processor 601, memory 602, at least one network interface 604, and a user interface 603. The various components in terminal 600 are coupled together by a bus system 605. It is understood that the bus system 605 is used to enable communications among the components. The bus system 605 includes a power bus, a control bus, and a status signal bus in addition to a data bus. For clarity of illustration, however, the various buses are labeled as bus system 605 in fig. 6.
The user interface 603 may include, among other things, a display, a keyboard, or a pointing device (e.g., a mouse, trackball, touch pad, or touch screen, among others.
It will be appreciated that the memory 602 in embodiments of the invention may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The non-volatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash Memory. Volatile Memory can be Random Access Memory (RAM), which acts as external cache Memory. By way of illustration and not limitation, many forms of RAM are available, such as Static random access memory (Static RAM, SRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic random access memory (Synchronous DRAM, SDRAM), Double Data rate Synchronous Dynamic random access memory (ddr DRAM), Enhanced Synchronous SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), and Direct Rambus RAM (DRRAM). The memory 602 of the subject systems and methods is intended to comprise, without being limited to, these and any other suitable types of memory.
In some embodiments, memory 602 holds the following elements, executable modules or data structures, or a subset thereof, or an expanded set thereof: an operating system 6021 and application programs 6022.
The operating system 6021 includes various system programs, such as a framework layer, a core library layer, a driver layer, and the like, and is used for implementing various basic services and processing hardware-based tasks. The application program 6022 includes various application programs such as a Media Player (Media Player), a Browser (Browser), and the like, and is used to implement various application services. A program implementing the method of an embodiment of the invention can be included in the application program 6022.
In one embodiment of the invention, the steps of FIG. 2 are implemented by calling a program or instructions stored in memory 602, which in particular may be a program or instructions stored in application program 6022, when executed.
The terminal provided by the embodiment of the present invention can execute the above method embodiment, and the implementation principle and technical effect are similar, which are not described herein again.
Referring to fig. 7, fig. 7 is a structural diagram of a base station according to an embodiment of the present invention, and as shown in fig. 7, a base station 700 includes: a processor 701, a transceiver 702, a memory 703 and a bus interface, wherein:
in one embodiment of the present invention, the base station 700 further includes: a computer program stored on the memory 703 and executable on the processor 701, which when executed by the processor 701 performs the steps shown in fig. 2.
In fig. 7, the bus architecture may include any number of interconnected buses and bridges, with one or more processors, represented by processor 701, and various circuits, represented by memory 703, being linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The transceiver 702 may be a number of elements including a transmitter and a receiver that provide a means for communicating with various other apparatus over a transmission medium.
The processor 701 is responsible for managing the bus architecture and general processing, and the memory 703 may store data used by the processor 701 in performing operations.
The base station provided in the embodiment of the present invention may execute the method embodiment shown in fig. 2, and the implementation principle and the technical effect are similar, which are not described herein again
The steps of a method or algorithm described in connection with the disclosure herein may be embodied in hardware or may be embodied in software instructions executed by a processor. The software instructions may consist of corresponding software modules that may be stored in RAM, flash memory, ROM, EPROM, EEPROM, registers, hard disk, a removable hard disk, a compact disk, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an ASIC. In addition, the ASIC may be carried in a core network interface device. Of course, the processor and the storage medium may reside as discrete components in a core network interface device.
Those skilled in the art will recognize that, in one or more of the examples described above, the functions described in this invention may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
The above-mentioned embodiments, objects, technical solutions and advantages of the present invention are further described in detail, it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made on the basis of the technical solutions of the present invention should be included in the scope of the present invention.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, embodiments of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
Embodiments of the present invention are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various changes and modifications may be made in the embodiments of the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the embodiments of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to encompass such modifications and variations.
Claims (14)
1. A routing method is applied to a first node, wherein the first node is a donor base station or a relay node, and the method comprises the following steps:
acquiring channel occupation information of a wireless link;
establishing or updating a routing table according to the channel occupation information;
and selecting a routing path according to the channel occupation information in the routing table.
2. The method of claim 1, wherein obtaining channel occupancy information for the wireless link comprises:
receiving channel occupancy information of a wireless link collected by a second node from the second node, the second node being a donor base station or a relay node or a terminal, and/or,
and acquiring the channel occupation information of the wireless link acquired by the first node.
3. The method of claim 2, wherein receiving, from a second node, channel occupancy information collected by the second node comprises:
receiving, from the second node through a first interface, channel occupancy information collected by the second node;
wherein the first interface comprises any one of:
an air interface between the terminal and the relay node;
an interface between the donor base station and the relay node;
an interface between relay nodes.
4. The method of claim 2, wherein receiving, from a second node, channel occupancy information collected by the second node comprises:
receiving, from the second node, channel occupancy information collected by the second node through first signaling;
the first signaling comprises any one of:
user plane associated signaling between the terminal and the relay node;
control plane dedicated signaling or user plane associated signaling between the donor base station and the relay node;
and the user plane channel associated signaling between the relay nodes.
5. The method of claim 1, wherein the first node is a donor base station, and the channel occupancy information corresponding to the routing path in the established or updated routing table includes one or more of the following:
channel occupation information of each wireless link in the routing path;
the average value of the channel occupation information of a plurality of sections of wireless links in the routing path;
the maximum value of the channel occupation information of the multiple sections of wireless links in the routing path;
and the minimum value of the channel occupation information of the multiple wireless links in the routing path.
6. The method according to claim 1, wherein the first node is a relay node, and the updated routing table includes channel occupancy information corresponding to the routing path, which includes one or more of the following:
channel occupation information of a link between a current relay node and a next relay node in a routing path;
the average value of the channel occupation information of a plurality of sections of wireless links in the routing path;
the maximum value of the channel occupation information of the multiple sections of wireless links in the routing path;
and the minimum value of the channel occupation information of the multiple wireless links in the routing path.
7. The method according to any of claims 1 to 6, wherein the channel occupancy information comprises one or more of:
a received signal strength indication of a wireless link;
a listen before talk or clear channel assessment success rate of the wireless link;
a listen-before-talk or clear channel assessment failure rate for the wireless link;
average time for the radio link to make listen before talk or clear channel assessment.
8. The method of claim 1, wherein selecting a routing path according to the channel occupancy information in the routing table comprises:
and when the first node receives new service data and needs to establish a new route, or when a listen-before-talk or clear channel assessment failure or continuous listen-before-talk or clear channel assessment failure occurs in a next wireless link of any route managed by the first node, selecting a routing path according to the channel occupation information in the routing table.
9. The method according to claim 1 or 8, wherein selecting a routing path according to the channel occupancy information in the routing table comprises:
sorting the routing paths of the same communication terminal according to the channel occupation information in the routing table;
and selecting the optimal routing path according to the sorting result.
10. The method of claim 9, wherein selecting the best routing path according to the ranking comprises one or more of:
selecting a routing path with the lowest failure rate of the received signal strength indicated value of the next wireless link or the listening-before-speaking or clear channel evaluation;
selecting a routing path with the shortest average time for carrying out listen before talk or clear channel estimation on the next wireless link;
selecting a route path with the highest success rate of the next wireless link listening before speaking or clear channel evaluation;
selecting a routing path with the lowest failure rate of average received signal strength indicated value or listening-before-speaking or clear channel evaluation of all wireless links;
selecting a routing path with the shortest average time for carrying out listen before talk or clear channel estimation on all wireless links;
selecting a routing path with the highest average listening-first-speaking or clear channel evaluation success rate of all wireless links;
selecting a routing path with the lowest minimum value of the received signal strength indicated values of all wireless links or the minimum values of the listening-before-speaking or clear channel evaluation failure rates;
selecting a routing path with the shortest average time minimum value for carrying out listen before talk or clear channel estimation on all wireless links;
and selecting the routing path with the highest average listen-before-talk or clear channel estimation success rate maximum value of all the wireless links.
11. A first node, the first node being a donor base station or a relay node, comprising:
the acquisition module is used for acquiring channel occupation information of a wireless link;
the establishing or updating module is used for establishing or updating a routing table according to the channel occupation information;
and the selection module is used for selecting a routing path according to the channel occupation information in the routing table.
12. A first node, the first node being a donor base station or a relay node, comprising: a transceiver and a processor.
The processor is used for acquiring channel occupation information of a wireless link;
the processor is further configured to establish or update a routing table according to the channel occupancy information;
the processor is further configured to select a routing path according to the channel occupancy information in the routing table.
13. A communication device, comprising: processor, memory and program stored on the memory and executable on the processor, which when executed by the processor implements the steps of the method of routing according to any of claims 1 to 10.
14. A computer-readable storage medium, characterized in that a computer program is stored thereon, which computer program, when being executed by a processor, carries out the steps of the method of routing according to any one of claims 1 to 10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911127622.XA CN112822748B (en) | 2019-11-18 | 2019-11-18 | Routing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911127622.XA CN112822748B (en) | 2019-11-18 | 2019-11-18 | Routing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112822748A true CN112822748A (en) | 2021-05-18 |
| CN112822748B CN112822748B (en) | 2023-08-15 |
Family
ID=75852486
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911127622.XA Active CN112822748B (en) | 2019-11-18 | 2019-11-18 | Routing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112822748B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113342370A (en) * | 2021-05-25 | 2021-09-03 | 北京小米移动软件有限公司 | Configuration updating method and device, electronic equipment and storage medium |
| WO2023274127A1 (en) * | 2021-07-02 | 2023-01-05 | 维沃移动通信有限公司 | Routing selection method, rerouting method, routing configuration method, iab node, and cu node |
| WO2023006311A1 (en) * | 2021-07-30 | 2023-02-02 | Sony Group Corporation | Methods and communications nodes in a wireless backhaul network |
| WO2023038843A1 (en) * | 2021-09-10 | 2023-03-16 | Qualcomm Incorporated | Repeater initiated channel occupancy time for shared radio frequency spectrum |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1627722A (en) * | 2003-12-10 | 2005-06-15 | 联想(北京)有限公司 | Optimal route selection method of wireless network grids |
| CN101287268A (en) * | 2007-04-13 | 2008-10-15 | 中兴通讯股份有限公司 | Method for updating connection relation of wireless relay station |
| CN106792980A (en) * | 2016-11-25 | 2017-05-31 | 北京国电通网络技术有限公司 | A kind of joint route measurement and the method for channel allocation that partly overlaps |
| US20190182140A1 (en) * | 2017-12-12 | 2019-06-13 | Futurewei Technologies, Inc. | System and Method for Network Topology Management |
| US20190223078A1 (en) * | 2018-03-28 | 2019-07-18 | Alexander Sirotkin | Next generation node-b (gnb) for integrated access and backhaul (iab) relay in new radio (nr) networks |
| US20190261412A1 (en) * | 2018-02-16 | 2019-08-22 | At&T Intellectual Property I, L.P. | Close loop listen before talk for NR operation in unlicensed spectrum |
-
2019
- 2019-11-18 CN CN201911127622.XA patent/CN112822748B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1627722A (en) * | 2003-12-10 | 2005-06-15 | 联想(北京)有限公司 | Optimal route selection method of wireless network grids |
| CN101287268A (en) * | 2007-04-13 | 2008-10-15 | 中兴通讯股份有限公司 | Method for updating connection relation of wireless relay station |
| CN106792980A (en) * | 2016-11-25 | 2017-05-31 | 北京国电通网络技术有限公司 | A kind of joint route measurement and the method for channel allocation that partly overlaps |
| US20190182140A1 (en) * | 2017-12-12 | 2019-06-13 | Futurewei Technologies, Inc. | System and Method for Network Topology Management |
| US20190261412A1 (en) * | 2018-02-16 | 2019-08-22 | At&T Intellectual Property I, L.P. | Close loop listen before talk for NR operation in unlicensed spectrum |
| US20190223078A1 (en) * | 2018-03-28 | 2019-07-18 | Alexander Sirotkin | Next generation node-b (gnb) for integrated access and backhaul (iab) relay in new radio (nr) networks |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113342370A (en) * | 2021-05-25 | 2021-09-03 | 北京小米移动软件有限公司 | Configuration updating method and device, electronic equipment and storage medium |
| WO2023274127A1 (en) * | 2021-07-02 | 2023-01-05 | 维沃移动通信有限公司 | Routing selection method, rerouting method, routing configuration method, iab node, and cu node |
| WO2023006311A1 (en) * | 2021-07-30 | 2023-02-02 | Sony Group Corporation | Methods and communications nodes in a wireless backhaul network |
| WO2023038843A1 (en) * | 2021-09-10 | 2023-03-16 | Qualcomm Incorporated | Repeater initiated channel occupancy time for shared radio frequency spectrum |
| US11877319B2 (en) | 2021-09-10 | 2024-01-16 | Qualcomm Incorporated | Repeater initiated channel occupancy time for shared radio frequency spectrum |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112822748B (en) | 2023-08-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112822748B (en) | Routing method and device | |
| EP3092851B1 (en) | Apparatus, system and method of access network discovery and selection function (andsf) for traffic offloading | |
| KR101921986B1 (en) | Apparatus, system and method of offloading traffic at a user equipment (ue) based on a mobility state of a wlan access point | |
| JP6250816B2 (en) | Apparatus, system and method for providing offload capability information to user equipment (UE) | |
| EP3668262A1 (en) | Wireless access network node, core network node and wireless terminal and method | |
| KR101794784B1 (en) | Control method and apparatus | |
| CN104937995A (en) | Systems and methods for access network selection and traffic routing | |
| CN111356129B (en) | Terminal device, base station device, and usage configuration determination method | |
| CN111510906B (en) | Capability interaction method and related equipment | |
| CN110710149B (en) | Information determining method, terminal equipment and network equipment | |
| CN113746585B (en) | Time service method and communication device | |
| KR20200136976A (en) | Relay resource configuration method and device | |
| CN111918297B (en) | Method and device for cell merging under CU-DU (control Unit-data Unit) architecture | |
| JP2019524023A (en) | Reference signal transmission method, and related device and system | |
| CN113508639A (en) | Method and device for relay communication | |
| KR20190011775A (en) | Multi-link configuration method, base station, and user equipment | |
| CN112437470B (en) | Cell reselection method and device | |
| CN111837419B (en) | Data transmission method, terminal equipment and network equipment | |
| US11570770B2 (en) | Method and device for requesting for and scheduling relay resource | |
| CN112584412B (en) | Beam switching method and device and communication equipment | |
| CN115706600A (en) | Method and device for discovering on-satellite UPF | |
| CN109391951B (en) | Method and equipment for bearing type conversion | |
| CN114208262A (en) | Carrier wave measuring method and device | |
| WO2018072204A1 (en) | Method and device for assigning antenna port | |
| CN113840389B (en) | Method for determining random access resource and self-returning IAB node |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |