WO2024000482A1

WO2024000482A1 - Network topology construction method and apparatus

Info

Publication number: WO2024000482A1
Application number: PCT/CN2022/103023
Authority: WO
Inventors: 张长; 栗忠峰
Original assignee: 华为技术有限公司
Priority date: 2022-06-30
Filing date: 2022-06-30
Publication date: 2024-01-04

Abstract

The present application relates to the technical field of wireless communications. Provided are a network topology construction method and apparatus, which are used for reducing the time and overhead for constructing or updating a network topology. In the method, a first node sends second information of the first node according to first information of the first node. The first information of the first node is determined according to third information of the first node and fourth information of the first node. The third information of the first node indicates the number of nodes which are connected to the first node, or the first information indicates the number of nodes which are perceived by the first node. The fourth information of the first node indicates the number of nodes which send the second information to the first node. On the basis of the solution, a first node can send second information thereof according to first information, such that a network topology is constructed. Compared with a method for constructing a network topology on the basis of a flooding mechanism, transmitted information is relatively less redundant, and the number of information interactions is fewer; therefore, the transmission overhead and construction time of the network topology can be reduced.

Description

A network topology construction method and device

Technical field

The present application relates to the field of wireless communication technology, and in particular, to a network topology construction method and device.

Background technique

In current wireless scenarios, in order to effectively manage the entire network to achieve good performance, a flexible and efficient dynamic management algorithm is required that can schedule and transmit according to the real-time deployment of the network. This requires that there be a node with actual network topology information in the network. That is to say, the node is required to be able to determine which nodes are in the network and to determine the connection relationship between each node. This requires that the network topology can be analyzed in a timely manner. And efficient construction and update.

In the process of constructing and updating the current network topology, flooding-based methods are generally used. The principle of the flooding method is that during the construction of the network topology or the update process of the network topology, each node in the network broadcasts the link information of surrounding nodes obtained by the node. When a node A receives the link information of surrounding nodes broadcast by other nodes, the node A can have the link information of more nodes. All nodes in the network perform a broadcast, which can be understood as completing a flood. After multiple floodings, there will be a node with global information in the network, and this node can be used as a control node, so that the control node can build the network topology or update the network topology based on the global information.

However, the way to build or update the network topology based on the flooding mechanism requires more redundant information to be transmitted, the number of information interactions is large, and it takes a long time.

Contents of the invention

This application provides a network topology construction method and device to reduce the transmission of redundant information and reduce the time to build or update network topology.

The first aspect provides a network topology method. The method may be executed by a communication device, or a chip with functions similar to the communication device. In this method, the first node sends the second information of the first node based on the first information of the first node. Wherein, the first information of the first node is determined based on the third information of the first node and the fourth information of the first node. The third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node. The fourth information of the first node indicates the number of nodes sending the second information to the first node.

Based on the above solution, the first node can send the second information of the first node according to one or more of the number of connected nodes, the number of sensed nodes, and the number of nodes sending the second information to the first node to perform network topology Compared with the method of constructing network topology based on the flooding mechanism, the information transmitted is less redundant and the number of information interactions is less, so the transmission overhead and construction time of the network topology can be reduced. Moreover, using the above technical solution when updating the network topology can also reduce the time for updating the network topology, reduce information redundancy, and reduce the number of information interactions.

In a possible implementation, the second information includes channel state information of the communication link between the first node and the node connected to the first node, and the communication between the first node and the node connected to the first node Long-term channel state information of the link, link quality indication information of the communication link between the first node and the node connected to the first node, and communication link between the first node and the node connected to the first node One or more of the fading coefficients.

Based on the above solution, the first node can send the communication link information of the first node for other nodes to determine the communication link of the first node, thereby constructing a network topology.

In a possible implementation, the second information includes transmission request information. Optionally, the transmission request information may be used to request the transmission of channel state information of the communication link between the first node and the node connected to the first node, and the communication between the first node and the node connected to the first node. Long-term channel state information of the link, link quality indication information of the communication link between the first node and the node connected to the first node, and communication link between the first node and the node connected to the first node One or more of the fading coefficients.

Based on the above solution, the first node can determine the order of transmitting the communication link information of the first node by transmitting the request information. When transmitting the communication link information of the first node, the number of information interactions can be reduced and the cost of constructing the network topology can be saved. and time.

In a possible implementation, the first node subtracts the number of nodes indicated by the fourth information from the number of nodes indicated by the third information to obtain the first information of the first node. Based on the above solution, the first node may send the second information of the first node after receiving the second information sent by the connected node.

In a possible implementation, the first node sends the second information of the first node when the first information is less than or equal to the first threshold. The first threshold is preset, for example, it can be set to 0, 1, 2, etc. Based on the above solution, the first node may send the second information of the first node when the number of connected nodes is less than or equal to the first threshold.

In a possible implementation, the first node sends the second information of the first node according to the first information of the first node and the fifth information of the first node. Wherein, the fifth information of the first node indicates the carrier sensing result or the energy detection result. When the carrier sensing result or the energy detection result is less than or equal to the second threshold, the first node sends the second information of the first node according to the first information of the first node. Based on the above solution, when sending the second information of the first node, the first node can refer to the carrier sensing result or the energy detection result, thereby reducing interference.

In a possible implementation, the first node sends the second information of the first node to the second node based on the first information of the first node. The first node receives sixth information from the second node, and the sixth information indicates whether the second information of the first node is successfully transmitted. Based on the above solution, the first node can receive the sixth information and determine whether the second information of the first node is successfully transmitted.

In a possible implementation, the second information of the first node also includes the second information received by the first node. Based on the above solution, the first node can carry the received second information in the second information of the first node for transmission, so as to construct the network topology.

In the second aspect, a network topology construction method is provided. The method may be provided by a communication system, which may include a first node, a second node and a third node. In this method, the first node sends the seventh information of the first node to the second node according to the transmission order corresponding to the degree of the first node. The seventh information of the first node includes information of nodes connected to the first node, and the degree of the first node is determined based on the number of nodes connected to the first node. After receiving the seventh information from the first node, the second node subtracts the preset value from the degree of the second node. The degree of the second node is determined based on the number of nodes connected to the second node. When the degree of the second node is less than or equal to the first threshold, the second node sends the seventh information of the second node to the third node. The seventh information of the second node includes information of nodes connected to the second node and seventh information of the first node. The third node constructs network topology information based on the seventh information of the second node. The network corresponding to the network topology information includes the first node, the second node and the third node.

Among them, the preset value can be set based on experience value, for example, it can be set to 1, 2, etc. Similarly, the first threshold can be set based on experience value, for example, it can be set to 0.

Based on the above solution, each node can send the seventh information of each node according to the transmission order corresponding to the degree. Compared with the method of constructing network topology based on the flooding mechanism, the information transmitted is less redundant and the number of information interactions is less. , thus reducing the transmission overhead and construction time of the network topology. Moreover, using the above technical solution when updating the network topology can also reduce the time for updating the network topology, reduce information redundancy, and reduce the number of information interactions.

In a possible situation, the eighth information of the first node may include link information of the first node, and the link information of the first node may include information of the communication link known by the first node. The information of a communication link may include node information, link quality information (or link quality information) and/or beam status information of the communication link.

In another possible situation, the eighth information may be used to request the transmission of the seventh information. For example, the eighth information may also be called transmission request information. For example, the eighth information of the first node may be used to request transmission of the seventh information of the first node.

In a possible implementation, the first node calculates the corresponding transmission sequence according to the degree of the first node, and after reaching the preset condition, sends the eighth information of the first node to the second node. The degree of the first node is used to indicate the number of nodes connected to the first node, the eighth information of the first node is used to determine the degree of the second node, and the degree of the second node is used to indicate the eighth information received by the second node. quantity. After receiving the eighth information from the first node, the second node updates the degree of the second node and subtracts the preset value from the degree of the second node. The degree of the second node is used to indicate the number of nodes connected to the second node. The second node calculates the corresponding transmission sequence according to the degree of the second node, and after reaching the preset condition, sends the eighth information of the second node to the third node. The eighth information of the second node is used to determine the degree of the third node, and the degree of the third node is used to indicate the amount of the eighth information received by the third node.

In one example, the first node may also receive eighth information from other nodes. In one example, the degree of the first node may be the smallest within the scope of the network to which it belongs, so the first node may not receive the eighth information from other nodes, that is, the degree of the first node may be 0.

In another example, after receiving the eighth information from the second node, the third node can subtract the preset value from the degree of the third node, and the third node can transmit the information to the surrounding area according to the transmission sequence corresponding to the degree of the third node. The node, such as the fifth node, sends the eighth message.

Based on the above solution, each node in the network can exchange the eighth information to update the degree, that is, determine the order of transmitting the seventh information.

In a possible implementation, the first node sends the eighth information of the first node on the first of the N sending beams according to the transmission order corresponding to the degree of the first node, and the direction of the first sending beam. Matches the position of the second node. The second node receives the eighth information of the first node on the first receiving beam among the M receiving beams, and the first receiving beam corresponds to the first transmitting beam. Among them, N and M are both integers greater than or equal to 1.

Based on the above solution, each node can send through the sending beam when sending the eighth information, and each node can receive through the receiving beam when receiving the eighth information. The receiving beam and the transmitting beam at the same time correspond to each other, so the eighth information transmission process can be reduced. communication interference. The corresponding method is predetermined or configured. Optionally, when each node sends the eighth information, it sends within the specified sending time corresponding to the corresponding sending beam.

Optionally, the first receiving beam has a one-to-one correspondence with the first transmitting beam. Alternatively, the first receive beam corresponds to the first transmit beam and X transmit beams. Alternatively, the Y receive beams and the first receive beam correspond to the first transmit beam.

In a possible implementation, the second node receives the eighth information of the fourth node on a second receiving beam among the M receiving beams, and the second receiving beam matches the position of the fourth node. The eighth information includes information on the degree of the fourth node. The second node determines that the degree of the first node is smaller than the degree of the fourth node based on the degree information of the first node and the degree information of the fourth node. The eighth information of the first node includes information about the degree of the first node. The second node sends ninth information to the first node, and the ninth information is used to instruct the first node to send seventh information of the first node.

In a possible implementation, the fourth node sends the eighth information of the fourth node to the second node on a second sending beam among the N sending beams, and the second sending beam corresponds to the second receiving beam.

Based on the above solution, the second node can receive the seventh information of the first node through the first receiving beam among the M receiving beams, receive the eighth information of the fourth node through the second receiving beam among the M receiving beams, and The degree of the first node is compared with the degree of the fourth node, ninth information is sent to the node with a smaller degree, and the node with a smaller degree is instructed to send seventh information.

Optionally, the second receiving beam has a one-to-one correspondence with the second transmitting beam. Alternatively, the second reception beam corresponds to the second transmission beam and X transmission beams. Alternatively, the Y receive beams and the second receive beam correspond to the second transmit beam.

In a possible implementation, the ninth information includes an identification of the first node. Based on the above solution, through the identification of the first node, each node that receives the ninth information can confirm that the ninth information instructs the first node to send the seventh information.

In one possible implementation, nodes with smaller degrees have higher transmission order. Based on the above solution, nodes with smaller degrees in the network are transmitted in higher order, that is, in order from small to large, each node transmits the eighth information, which can reduce the number of times the eighth information is transmitted.

In a possible implementation, the first node is the node with the smallest degree in the network, and the third node is the node with the largest degree in the network. Based on the above solution, the first node can be the node with the smallest degree in the network, so the first node sends the second message first, and the third node is the node with the largest degree in the network, so the third node can receive the eighth message from other nodes.

In a third aspect, a communication device is provided, including: a processing unit and a transceiver unit.

A processing unit, configured to obtain the first information of the first node. The transceiver unit is configured to send the second information of the first node according to the first information of the first node. Wherein, the first information of the first node is determined based on the third information of the first node and the fourth information of the first node. The third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node. The fourth information of the first node indicates the number of nodes sending the second information to the first node.

In a possible implementation, the second information includes transmission request information.

In a possible implementation, the processing unit is further configured to: subtract the number of nodes indicated by the fourth information from the number of nodes indicated by the third information, to obtain the first information of the first node.

In a possible implementation, the transceiver unit is configured to send the second information of the first node according to the first information of the first node, and is specifically configured to: when the first information is less than or equal to the first threshold, send the second information of the first node. The second information of a node.

In a possible implementation, the transceiver unit is configured to send the second information of the first node according to the first information of the first node, specifically: according to the first information of the first node and the third information of the first node. Five messages, sending the second message of the first node. Wherein, the fifth information of the first node indicates the carrier sensing result or the energy detection result.

In a possible implementation, the transceiver unit sends the second information of the first node according to the first information of the first node and the fifth information of the first node, specifically for: performing carrier sensing results or energy detection results. When it is less than or equal to the second threshold, the second information of the first node is sent according to the first information of the first node.

In a possible implementation, the transceiver unit is configured to send the second information of the first node according to the first information of the first node, and is specifically configured to: send the second information to the second node according to the first information of the first node. The second information of the first node. Sixth information is received from the second node, and the sixth information indicates whether the second information of the first node is successfully transmitted.

In a possible implementation, the second information of the first node also includes the second information received by the first node.

In a fourth aspect, a communication device is provided. The communication device may be the communication device of any one of the first to fourth aspects in the above embodiments, or may be provided in any one of the first to second aspects. chips in communication devices. The communication device includes a communication interface and a processor, and optionally, a memory. Wherein, the memory is used to store computer programs or instructions or data, and the processor is coupled to the memory and the communication interface. When the processor reads the computer program, instructions or data, the communication device is caused to execute the above first to second aspects. The method executed by the first node, the second node or the third node in any of the method embodiments.

It should be understood that the communication interface can be implemented through antennas, feeders, codecs, etc. in the communication device, or if the communication device is a chip provided in network equipment or terminal equipment, the communication interface can be the input of the chip /Output interface, such as input/output pins, etc. The communication device may also include a transceiver for communicating with other devices.

In a fifth aspect, embodiments of the present application provide a chip system, which includes a processor and may also include a memory for implementing the method performed by the communication device in any one of the first to second aspects. In a possible implementation, the chip system further includes a memory for storing program instructions and/or data. The chip system can be composed of chips or include chips and other discrete devices.

In a sixth aspect, the present application provides a computer-readable storage medium that stores a computer program or instructions. When the computer program or instructions are run, the steps executed by the first node in the above aspects are implemented. method; or implement the method executed by the second node in the above aspects; or implement the method executed by the third node in the above aspects.

In a seventh aspect, a computer program product is provided. The computer program product includes: computer program code or instructions. When the computer program code or instructions are executed, the method executed by the first node in the above aspects is caused to be executed. Execute, or cause the method executed by the second node in the above aspects to be executed, or cause the method executed by the third node in the above aspects to be executed.

An eighth aspect provides a communication device, which includes a unit or module that performs the methods of the above aspects.

For the beneficial effects of the above-mentioned third to eighth aspects and their implementation methods, reference may be made to the description of the beneficial effects of the methods of the first and second aspects and their implementation methods.

Description of drawings

Figure 1A is a schematic diagram of the first round of flooding process in the scheme of constructing network topology based on the flooding mechanism provided by the embodiment of the present application;

Figure 1B is a schematic diagram of the second round of flooding process in the scheme of constructing network topology based on the flooding mechanism provided by the embodiment of the present application;

Figure 2 is a schematic diagram of a multi-node writing network provided by an embodiment of the present application;

Figure 3 is one of the exemplary flow charts of a network topology construction method provided by an embodiment of the present application;

Figure 4A is one of the exemplary flow charts of a network topology construction method provided by an embodiment of the present application;

Figure 4B is a schematic diagram of the interaction process of the second information in the network topology construction method provided by the embodiment of the present application;

Figure 4C is a schematic diagram of the interaction process of the first information in the network topology construction method provided by the embodiment of the present application;

Figure 5A is a schematic diagram of spatial direction allocation of transmission beams provided by an embodiment of the present application;

Figure 5B is a schematic diagram of the spatial direction allocation of receiving beams provided by an embodiment of the present application;

Figure 6 is a schematic diagram of the information interaction process in the network topology construction method provided by the embodiment of the present application;

Figure 7 is one of the schematic diagrams of a communication device provided by an embodiment of the present application;

Figure 8 is one of the schematic diagrams of a communication device provided by an embodiment of the present application;

Figure 9 is a schematic diagram of a communication device provided by an embodiment of the present application;

Figure 10 is a schematic diagram of a communication device provided by an embodiment of the application.

Detailed ways

The technical terms involved in the embodiments of this application are introduced below.

Network topology, also known as network topology structure, refers to the physical layout of various devices interconnected by transmission media. The arrangement involved in the physical layout may be a specific, physical (or real) arrangement among the network members, or it may be a logical (or virtual) arrangement among the network members.

There can be a type of node in the network topology, which can be used to schedule other nodes. This type of node can be called a control node. The control nodes may include central control nodes and distributed control nodes. In one possible situation, the central control node can schedule each node in the network where the central control node is located (ie, the network corresponding to the network topology). In another possible situation, the distributed control node can schedule one or more nodes around the distributed control node. The one or more nodes and the distributed control node can form a subnet, and in a network it can Contains multiple subnets.

Optionally, the central control node and distributed control nodes can exist in the same network at the same time. Among them, the central control node can be a distributed control node in a certain subnet.

With the development of wireless communications, increasingly dense, complex and flexible networks will become the trend of future development, thereby achieving the goal of interconnecting everything. Therefore, the overall networking, transmission theory, methods and optimization of the network are very important research contents.

In terms of network research and future applications, wireless self-organizing networks have always been a hot topic of discussion because of their broader application scenarios and more complex and open research content. Wireless self-organizing network can achieve better performance of the overall network in different application scenarios through the self-organization and self-collaboration of multiple nodes in the network. A typical wireless self-organizing network application such as wireless sensor network can transmit sensing data through the deployment of distributed sensors. Take the vehicle to vehicle (V2V) network in wireless sensor networks as an example. Distributed sensors can be deployed on vehicles in the V2V network. The distributed sensors can collect road condition information, and the vehicles can interact with each other to collect the information. Traffic information. Most wireless self-organizing networks are flexible and dynamic because nodes can join or exit dynamically. For example, in a wireless sensor network, new nodes can be added by deploying distributed sensors. Old nodes may also exit the wireless sensor network due to insufficient power or failure. It is understandable that each node in the wireless self-organizing network can also move.

For example, for V2V networks, distributed sensors deployed on vehicles can also join or exit the V2V network due to the movement of the vehicles. In order to adapt to this flexible self-organization mechanism, the scheduling and transmission of distributed sensors in V2V networks can be generally divided into two categories. The first category includes scheduled transmissions based on deterministic network topology. Among them, scheduling transmission based on deterministic network topology means that there is a central control node in the network that stores global information. The central control node can establish the network topology or update the network topology based on the global information, and schedule the nodes in the network. However, because the control nodes need to store global information, it takes a long time. For highly dynamic networks where nodes move quickly, the network topology may need to be updated frequently. Therefore, the central control node needs to update global information frequently to achieve network topology updates. The time for the central control node to update global information may be greater than the actual update time of the network topology. It can be seen that scheduling transmission based on deterministic network topology is not suitable for highly dynamic network topologies where nodes move quickly.

The second category of scheduled transmission of distributed sensors in V2V networks includes scheduled transmission based on random network topology. Scheduling transmission based on random network topology means that there is no need for global information, but information is broadcast based on flooding until the final node. Among them, the technical solution for broadcasting information based on flooding will be introduced in detail later.

In current wireless scenarios, in order to effectively manage the entire network to achieve good performance, a flexible and efficient dynamic management algorithm is required that can schedule and transmit according to the real-time deployment of the network. This requires that there be a control node in the network that stores actual network topology information. That is to say, the control node is required to be able to determine which nodes are in the network and the connection relationships between the nodes, etc., so that the network topology Can be built and updated in a timely and efficient manner.

Currently, the construction of the entire network topology and the update of the network topology can be divided into two stages. Among them, the first stage is for the nodes in the network to obtain the link information of the surrounding nodes to learn which communication links exist between the node and the surrounding nodes, and to obtain the quality parameters of the communication links, etc. The second stage is for the nodes in the network to collect the network topology information to the control node based on the obtained link information of the surrounding nodes, so that the control node can obtain the link information of all nodes in the network or subnets of the network. .

In the process of constructing or updating network topology, due to the use of flooding method for information aggregation, one disadvantage is that there is a large amount of redundant information transmission, which will lead to low transmission efficiency, and each node needs to send data to surrounding nodes. Broadcast information, so there is greater interference during the broadcast stage. Not only that, each node also needs to receive information from all surrounding nodes, so each flooding will take a long time. For ease of understanding, the flooding method is introduced below in conjunction with Figure 1A and Figure 1B. Among them, Figure 1A and Figure 1B take the construction process of the network topology as an example.

Among them, in Figure 1A and Figure 1B, the black dots represent nodes, the dotted lines represent the existence of a communication link between the two nodes, and the two-way arrows represent that the two parties can conduct two-way communication through this communication link, that is, the exchange of information. All communication links shown in FIGS. 1A and 1B are numbered, and the numerical labels are on the corresponding communication links in the figures. In Figure 1A, during the first flooding, each node in the network can broadcast communication link information (hereinafter also referred to as link information for short) to surrounding nodes. For example, node 1 broadcasts link information. Since there is a communication link between node 1 and node 3, the link information of node 1 includes the link information of node 1 and node 3. Node 3 can receive the link information broadcast by node 1. In this way, node 3 can have the link information of node 3 and the link information of node 1. For another example, node 3 can broadcast link information. Since node 3 has communication links with node 1, node 4, node 5 and node 6 respectively, the link information broadcast by node 3 can include the link between node 3 and node 1. Information, link information between node 3 and node 4, link information between node 3 and node 5, and link information between node 3 and node 6. Node 1, node 4, node 5 and node 6 can receive the link information broadcast by node 3. In this way, node 1 can have the link information of node 3 and the link information of node 1, node 4 can have the link information of node 3 and the link information of node 4, and node 5 can have the link information of node 3 and the node 5's link information, node 6 can have the link information of node 3 and the link information of node 6. By analogy, node 2, node 4, node 5, node 6, node 7 and node 8 all broadcast link information. Among them, the numbers in brackets below the node in Figure 1A represent the link information owned by the node after the first flooding.

During the second flooding, nodes within the network can broadcast to surrounding nodes the link information received by the node from other nodes. For example, node 1 can broadcast the link information received from node 3, that is, the link information between node 3 and node 1, the link information between node 3 and node 4, the link information between node 3 and node 5, and the link information between node 3 and node 3. Link information to node 6. As another example, node 3 may broadcast link information received from node 1, node 4, node 5, and node 6, and so on. Among them, the numbers in brackets below the node in Figure 1B represent the link information owned by the node after the second flooding.

Comparing the link information broadcast by each node in Figure 1A and Figure 1B, during the second flooding, a lot of the link information broadcast by each node will be repeatedly broadcast by different nodes. For example, node 6 will receive the link information broadcast by node 3, node 4, node 5 and node 7, and the link information broadcast by these nodes contains duplicate link information, such as the link information of node 3 and node 4. , the link information of node 3 and node 5, etc. Not only that, comparing the link information owned by each node in Figure 1A and Figure 1B, we can know that in order to obtain global information, at least 40 times and 53 link information needs to be transferred. In fact, since it is almost impossible to send link information without redundancy, the number of link information actually transmitted will be significantly larger than 53. It can be seen that the network topology construction method based on the flooding mechanism requires more redundant information to be transmitted and takes a long time.

In view of this, embodiments of the present application provide a method for constructing a network topology. In this method, each node in the network can send information according to a certain transmission order, which can reduce interference during information transmission, and sending information according to the transmission order can reduce the number of information interactions, reduce the transmission of redundant information, and shorten the network topology construction. The duration of time.

The network topology construction method provided by the embodiment of the present application is introduced below with reference to the accompanying drawings.

The technical solutions provided by the embodiments of this application can be applied to multi-node cooperation networks. The nodes included in the multi-node cooperative network can have full-duplex capabilities. Refer to Figure 2, which is a schematic diagram of a multi-node cooperation network 200 provided by an embodiment of the present application. The multi-node cooperation network 200 may include one or more nodes. In FIG. 2 , 8 nodes are taken as an example. In Figure 2, black dots represent nodes, and dotted lines represent the existence of communication links between two nodes. Among them, a node can be a physical device, such as a terminal device, access point (AP) or relay device, etc., or a node can also be a logical device, such as a logical module set on a physical device, etc. . In the multi-node cooperation network 200, information can be transmitted between nodes with communication links. For example, communication link information may be transmitted.

Referring to Figure 3, an exemplary flow chart of a network topology construction method provided by an embodiment of the present application may include the following operations.

S301: The first node sends the second information of the first node based on the first information of the first node.

Correspondingly, the second node receives the second information of the first node.

S302: The second node constructs the network topology.

The first information of the first node may be determined based on the third information of the first node and the fourth information of the first node. The third information of the first node indicates the number of nodes connected to the first node, or the third information of the first node indicates the number of nodes perceived by the first node. Optionally, the third information of the first node may be called the degree of the first node. The fourth information of the first node may indicate the number of nodes sending the second information to the first node.

For example, the first node may send the second information of the first node when the number of nodes indicated by the first information of the first node is less than or equal to the first threshold. The first threshold may be set based on experience values, for example, it may be set to 0, 1, 2, etc.

For another example, the first node may obtain the first information of the first node based on the number of nodes indicated by the third information minus the number of nodes indicated by the fourth information. Optionally, the first node may send the second information of the first node when the number of nodes indicated by the first information of the first node is less than or equal to the first threshold.

Optionally, the first node may send the second information of the first node based on the first information of the first node when the carrier sensing result or the energy detection result is less than or equal to the second threshold. It can be understood that the carrier sensing result or the energy detection result may be obtained by the first node monitoring the communication link. The embodiments of this application do not specifically limit the manner in which carrier sensing results and energy monitoring results are obtained.

In a possible situation, the first node may send the second information of the first node to the second node in a unicast manner. In another possible situation, the first node may broadcast the second information of the first node, and the second node may receive the second information of the first node broadcast by the first node.

In one example, the second information includes channel state information of the communication link between the first node and the node connected to the first node, and the length of the communication link between the first node and the node connected to the first node. time channel state information, link quality indication information of the communication link between the first node and the node connected to the first node, and fading coefficient of the communication link between the first node and the node connected to the first node of one or more.

In another example, the second information may include transmission request information. Optionally, the transmission request information may be used to request the transmission of channel state information of the communication link between the first node and the node connected to the first node, and the communication between the first node and the node connected to the first node. Long-term channel state information of the link, link quality indication information of the communication link between the first node and the node connected to the first node, and communication link between the first node and the node connected to the first node One or more of the fading coefficients.

Below, the cases where the second information includes different information are introduced respectively. To facilitate distinction, the second information including the transmission request information may be called eighth information, and the second information including the communication link information of the first node may be called seventh information.

Referring to Figure 4A, a flow chart of a network topology construction method provided by an embodiment of the present application includes the following operations.

S401: The first node sends the seventh information of the first node to the second node according to the transmission sequence corresponding to the degree of the first node. Correspondingly, the second node receives the seventh information of the first node from the first node. The first node and the second node belong to the same network. The embodiment of the present application is to construct the network topology of the network. For example, the network is called the first network.

It can be understood that the first node may send the seventh information of the first node to the second node in a unicast manner.

S401 is a possible implementation of S301. In a possible implementation, the first node may send the seventh information to the second node in a transmission sequence corresponding to the degree of the first node. For example, each node in the first network can store the corresponding relationship between the degree and the transmission order, and the first node can determine the transmission order of the first node based on the corresponding relationship between the degree and the transmission order and the degree of the first node. In this way, the first node can send the seventh information to the second node when the transmission sequence of the first node is reached.

In one example, each node in the first network can determine the transmission sequence of the node based on a timer. For example, each node in the first network may maintain multiple timers and send the seventh information when the corresponding timer is started. Among them, one timer can correspond to one degree. In the first network, each node can start multiple timers in sequence, wherein the next timer is started when one timer ends. Different nodes can start timers synchronously, or in other words, different nodes start the first timer at the same time. And different nodes start the timers in the same order. For example, each node starts timer A1 first and then starts timer A2. Optionally, when starting the timer, you can start it in order from the corresponding degree from small to large. For example, each node in the first network starts the timer A1 synchronously. During the running of the timer A1, the node with degree A1 can send the seventh information. When timer A1 ends, each node in the first network can start timer A2 corresponding to degree A2. During the running of timer A2, the node with degree A2 can send the seventh information, and so on. For the first node, the seventh information can be sent to the second node during the running of the timer corresponding to the degree of the first node.

It can be understood that for a node, it will correspond to a degree, and the node will also correspond to the timer corresponding to the degree. Then when the timer starts, or during the running of the timer, the node can send the seventh information.

In another example, each node in the first network can determine the transmission order of the node based on the corresponding relationship between the sending time and the degree. For example, each node in the first network can store sending times corresponding to different degrees. Optional, the smaller the degree, the earlier the sending time. For example, at time A1, the node with degree A1 can send the seventh information; at time A2, the node with degree A2 can send the seventh information, and so on. Among them, time A2 is behind time A1, and degree A1 is smaller than degree A2. For the first node, the seventh information can be sent to the second node at a time corresponding to the degree of the first node.

It can be understood that the smaller the node in the first network, the higher the transmission order. For example, the first node is the node with the smallest degree in the first network.

Optionally, the degree of the first node may be updated based on the third information of the first node and the fourth information of the first node. For example, the embodiment shown in FIG. 4A may also include S400A and S400B. For example, S400A and S400B may occur before S401.

S400A: The first node sends the eighth information of the first node to the second node according to the transmission sequence corresponding to the degree of the first node. Correspondingly, the second node receives the eighth information of the first node from the first node.

The degree of the first node can be understood as the number of nodes that have communication links with the first node. For example, in Figure 1A, node 1 and node 3 have communication links, but there are no communication links between node 1 and other nodes, then the degree of node 1 can be 1. For another example, in Figure 1A, node 3 has communication links with node 1, node 4, node 5 and node 6, but has no communication links with other nodes, then the degree of node 3 can be 4.

In a possible situation, the eighth information may be used to request the transmission of the seventh information. For example, the eighth information may also be called transmission request information and is used to request the transmission of the seventh information in S301 (ie, the seventh information of the first node). information).

In S400A, the first node may send the eighth information of the first node to the second node according to the transmission sequence corresponding to the degree of the first node. For example, each node in the first network can store the corresponding relationship between the degree and the transmission order, and the first node can determine the transmission order of the first node based on the corresponding relationship between the degree and the transmission order, and based on the degree of the first node. For this, reference may be made to the implementation in S401 in which the first node determines the transmission order according to the degree of the first node, which will not be described again here.

It can be understood that the smaller the node in the first network, the higher the transmission order. The above-mentioned first node is the node with the smallest degree in the first network.

Optionally, each node can perform a listen before talk (LBT) operation before unicasting the eighth information to one of the surrounding nodes. For example, taking the first node sending the eighth information to the second node as an example, the first node may perform LBT to determine the communication link between the first node and the second node before sending the eighth information to the second node. Whether it is idle, and when the LBT is successful, that is, when it is determined that the communication link between the first node and the second node is idle, the eighth information is sent to the second node.

S400B: After receiving the eighth information from the first node, the second node subtracts the preset value from the degree of the second node.

Among them, the preset value can be set based on experience value, for example, it can be set to 1, 2, etc.

S400B may be a possible implementation manner for the second node to determine the first information of the second node. For example, the second node may subtract the number of nodes indicated by the fourth information (such as the degree of the second node) from the number of nodes indicated by the third information, such as subtracting the number of received eighth information.

For example, the second node is node 3 in Figure 1A. For example, the degree of node 3 is 4. After receiving the eighth information from node 1, node 3 can subtract the preset value from the degree of node 3. The preset value is, for example, 1, then the degree of node 3 becomes 3. .

In an example, the second node may also send the eighth information to one of the surrounding nodes, such as the third node. For example, the second node is node 3 in Figure 1A. After node 3 receives the eighth information from node 1, the degree of node 3 becomes 3. Therefore, node 3 can send the eighth information to one of the surrounding nodes in the transmission sequence corresponding to the degree of 3.

The manner in which the second node sends the eighth information to one of the surrounding nodes may refer to the manner in which the first node sends the eighth information to the second node in S400A. In the same way, the third node can also send the eighth information to one of the surrounding nodes until the node with the highest degree can determine the nodes included in the first network and the link information between the nodes.

Below, S400A and S400B are introduced through FIG. 4B.

Referring to Figure 4B, the dots represent nodes, the dotted lines represent the existence of a communication link between the two nodes, and the bidirectional arrows represent that the two parties can conduct two-way communication through this link, that is, the exchange of information. All links shown are numbered in Figure 4B, with numerical labels on corresponding links in the figure. As can be seen from Figure 4B, the degree of node 1 is 1, the degree of node 2 is 1, the degree of node 3 is 4, the degree of node 4 is 3, the degree of node 5 is 3, the degree of node 6 is 4, and the degree of node 7 The degree of node 8 is 3, and the degree of node 8 is 1.

Among them, node 1 to node 8 may respectively send the eighth information to the surrounding nodes according to the transmission order corresponding to the degree. In one possible situation, nodes with smaller degrees in the network have higher transmission order. Therefore, in FIG. 4B , node 1 , node 2 and node 8 with degree 1 first send the eighth information to one of the surrounding nodes respectively. For example, node 1 may send the eighth information to node 3, node 2 may send the eighth information to node 4, and node 8 may send the eighth information to node 7. Each node that receives the eighth information can subtract a preset value from the degree, such as minus 1. For example, node 3 can have its degree subtracted by 1 so that the degree of node 3 becomes 3. Node 4 can subtract 1 from its degree, so that the degree of node 4 becomes 2. Node 7 can subtract 1 from its degree, so that the degree of node 7 becomes 2. Next, node 4 and node 7 with degree 2 send the eighth information to one of the surrounding nodes. For example, node 4 may send the eighth information to node 6, and node 7 may send the eighth information to node 5. Each node that receives the eighth information can subtract a preset value from the degree, such as minus 1. For example, node 6 can subtract 1 from its degree, so that the degree of node 6 becomes 3, and node 5 can subtract a preset value from its degree, so that the degree of node 5 becomes 2. Since the degree of node 5 becomes 2, when the node with degree 2 sends the eighth information to one of the surrounding nodes, node 5 can also send the eighth information to one of the surrounding nodes, such as node 3. In this way, the degree of node 3 can become 2. Therefore, node 3 may also send the eighth information to one of the surrounding nodes, such as node 6, when the node with degree 2 sends the eighth information to one of the surrounding nodes.

Through the link information interaction method shown in Figure 4B, each node can transmit the eighth information to one of the surrounding nodes, and then the node with the highest degree, such as node 6, can obtain which nodes are included in the network.

Based on the above S400A and S400B, each node in the network can determine its own degree. Among them, degree is used to indicate the quantity of the eighth information received. For example, the degree of the second node may be the number of eighth pieces of information received by the second node. As shown in Figure 4B, node 3 has received the eighth information of node 1 and node 5, so the degree of node 3 is 2. For another example, as shown in Figure 4B, node 6 has received the eighth information of node 4 and node 6, so the degree of node 6 is 2. By analogy, each node in the network can receive the eighth information according to the number of received eighth information. , update degree.

In this way, in S401, the first node can send the seventh information to the surrounding nodes according to the transmission sequence corresponding to the degree of the first node. Wherein, the first node may send the seventh information to a node that receives the eighth information of the first node, such as the second node. As shown in Figure 4B, node 1 sends the eighth information to node 3, then node 1 can send the eighth information to node 3 in S401. By analogy, node 5 sends the eighth information to node 3, then node 5 can send the seventh information to node 3 in S401.

S402: After receiving the seventh information of the first node, the second node subtracts the preset value from the degree of the second node.

For example, the second node is node 3 in Figure 4B. For example, if the degree of node 3 is 2, then after receiving the seventh information of node 1, node 3 can subtract a preset value from the degree. The preset value is, for example, 1, so that the degree of node 3 becomes 1.

S402 may be a possible implementation manner for the second node to determine the first information of the second node. For example, the second node may subtract the number of nodes indicated by the fourth information (such as the degree of the second node) from the number of nodes indicated by the third information, such as subtracting the number of received seventh information.

S403: When the degree of the second node is less than or equal to the first threshold, the second node sends the seventh information of the second node to the third node.

The first threshold may be set based on experience value, for example, it may be set to 0.

For example, the second node is node 3 in Figure 4B. For example, after node 3 receives the eighth information from node 1, node 3 can subtract a preset value from the degree. The preset value is, for example, 1, so that the degree of node 3 becomes 1. Similarly, after node 3 receives the eighth information from node 5, node 3 can subtract a preset value from the degree. The preset value is, for example, 1, so that the degree of node 3 becomes 0. Node 3 may send the seventh information to one of the surrounding nodes when the degree is less than or equal to 0. Among them, node 3 may send the seventh information to the node that receives the eighth information of node 3, that is, node 6.

In the following, S401 to S403 will be introduced through FIG. 4C.

In the manner shown in Figure 4B, each node in the network updates its own degree. In Figure 4C, the degree of node 1 is 0, the degree of node 2 is 0, the degree of node 3 is 2, the degree of node 4 is 1, the degree of node 5 is 1, the degree of node 6 is 2, and the degree of node 7 is 1, and the degree of node 8 is 0.

Among them, node 1 to node 8 may respectively send the seventh information to the surrounding nodes according to the transmission order corresponding to the degree. In one possible situation, nodes with smaller degrees in the network have higher transmission order. Therefore, in Figure 4C, node 1, node 2 and node 8 with degree 0 respectively send the seventh information to one of the surrounding nodes. One of the surrounding nodes may be the node that received the eighth information. For example, node 1 may send the seventh information to node 3, node 2 may send the seventh information to node 4, and node 8 may send the seventh information to node 7. Each node that receives the seventh information can subtract a preset value from the degree, such as minus 1. For example, node 3 can have its degree subtracted by 1 so that the degree of node 3 becomes 1. Node 4 can subtract 1 from its degree, so that the degree of node 4 becomes 0. Node 7 can subtract 1 from its degree, so that the degree of node 7 becomes 0. Next, the seventh information is sent from node 4 and node 7 with degree 0 to one of the surrounding nodes. For example, node 4 may send the seventh information to node 6, and node 7 may send the seventh information to node 5. Each node that receives the seventh information can subtract a preset value from the degree, such as minus 1. For example, node 6 can subtract 1 from its degree, so that the degree of node 6 becomes 1, and node 5 can subtract a preset value from its degree, so that the degree of node 5 becomes 0. Next, the seventh information is sent from node 5 with degree 0 to one of the surrounding nodes. For example, node 5 may send seventh information to node 3. In this way, the degree of node 3 can become 0. Therefore, node 3 can send the seventh information to node 6.

Based on the method shown in Figure 4C above, each node can transmit the seventh information to one of the surrounding nodes, and then the node with the highest degree, such as node 6, can obtain the global link information in the network.

S404: The third node constructs network topology information based on the seventh information of the second node.

The link information obtained by the third node constructs network topology information. The network corresponding to the network topology information includes a first node, a second node and a third node. For example, the third node is node 6 in Figure 4C. Through the processes shown in Figure 4B and Figure 4C, node 6 can obtain the link information of the network, so that node 6 can construct network topology information. The network corresponding to the network topology information includes node 1, node 2, node 3, node 4, node 5, node 6, node 7 and node 8.

Based on the technical solution shown in Figure 4A, in the construction process of the network topology, compared with the way of constructing the network topology based on the flooding mechanism, the information transmitted is less redundant, and the number of information interactions is less, so the network topology can be reduced. Build time. Moreover, using the technical solution shown in Figure 4A when updating the network topology can also reduce the time for updating the network topology, reduce information redundancy, and reduce the number of information interactions.

In a possible implementation, in order to reduce interference in the information transmission process, each node can send the seventh information and/or the eighth information through the sending beam, and each node can also receive the seventh information and/or the eighth information through the receiving beam. information.

For example, the spatial allocation relationship of beams may be predefined or preconfigured, such as the spatial allocation relationship of transmitting beams and receiving beams. For example, the transmitting beam has N directions in total, and the receiving beam has M directions in total. It can be understood that in the spatial allocation relationship of beams between different nodes, the transmitting beams with the same number correspond to the same direction, and the receiving beams also correspond to the same direction. Among them, N is an integer greater than or equal to 1, and M is an integer greater than or equal to 1. N can be equal to M, that is, one transmit beam corresponds to one receive beam. Optionally, N can be different from M. For example, one transmitting beam can correspond to multiple receiving beams. In this case, the transmitting beam can be regarded as a wide beam, and the receiving beam can be regarded as a narrow beam. That is, the direction of a wide beam corresponds to the direction of multiple narrow beams. For another example, multiple transmit beams can correspond to one receive beam. In this case, the transmit beam can be regarded as a narrow beam, and the receive beam can be regarded as a wide beam. That is, the direction of a wide beam corresponds to the direction of multiple narrow beams.

When N=M=1, it means that each node in the network uses omnidirectional beams to send and receive the seventh information and/or the eighth information during the network topology construction stage.

Refer to Figure 5A, which is a schematic diagram of spatial direction allocation of transmission beams. In FIG. 5A , a total of four directions of transmitting beams are used as an example for explanation. Refer to Figure 5B, which is a schematic diagram of the spatial direction allocation of the receiving beam. In Figure 5B, a total of four directions of receiving beams are used as an example for explanation. It can be seen from Figure 5A and Figure 5B that the beam is divided into 4 directions by the plane space, each corresponding to a quadrant. In Figure 5A and Figure 5B, if a node wants to receive in the R1 direction, it can only receive the transmit beam from the T1 direction. In the same way, if a node wants to receive in the R2 direction, it can only receive the transmit beam in the T2 direction. It can be seen that the R1 receiving direction corresponds to the T1 transmitting direction, and the R2 receiving direction corresponds to the T2 transmitting direction. By analogy, the R3 receiving direction corresponds to the T3 receiving direction, and the R4 receiving direction corresponds to the T4 receiving direction.

In a possible implementation, in S401 and/or S400A, when the first node sends the seventh information and/or the eighth information, it may send the seventh information and/or the eighth information to the second node through a preset sending beam. or eighth message. For example, in S400A, the first node may send the eighth information of the first node to the second node on the first transmission beam according to the transmission sequence corresponding to the degree of the first node. The first transmitting beam may be determined based on a predefined or preconfigured spatial allocation relationship of the beams. The direction of the first transmit beam matches the location of the second node. It can be understood that in the process of obtaining the seventh information by each node in the network, the direction or position of the surrounding nodes can be determined. Therefore, when sending the eighth information, each node can determine which direction of sending beam to use to send the eighth information.

For example, referring to Figure 4B, node 3 is located in the direction of the fourth quadrant of node 1, then node 1 can send the eighth information to node 3 in the T1 direction. When node 3 receives the seventh information from node 1, it may receive it in the R1 direction.

In another possible implementation, combined with the spatial allocation relationship of the above-mentioned beams, each node in the network can receive the eighth information in the same direction at a certain stage, and each node can send the eighth information in the same direction. For example, each node receives the eighth information and sends the eighth information in the order shown in FIG. 6 . In Figure 6, in the R1 phase, each node in the network receives in the R1 direction, and each node in the network can transmit in the T1 direction. In the R2 phase, each node in the network receives in the R2 direction, and each node in the network can transmit in the T2 direction. By analogy, in the request phase (Request, Ri) phase, each node in the network can exchange the eighth information. Among them, i is taken from 1 through M.

For example, assume that in the R1 phase, node A receives the eighth information in the R1 direction. At this time, it is assumed that there are two sending ends in the R1 direction, namely node B and node C. Node B and node C respectively send the eighth information in the T1 direction. Also assume that the degree of node B is d1, the degree of node C is d2, d1>d2. Since the smaller the degree, the higher the transmission order, so the timer of node C expires first. Optionally, after the timer of node C expires, node C can perform a listen before talk (LBT) operation. If LBT is successful, node C can send the eighth message to node A. If LBT is unsuccessful, node C can Node C does not send a transmission request to node A. After receiving the eighth information from node C, node A can send a reservation signal in the T1 direction. In this way, after the timer of node B expires, when performing the LBT operation, the eighth information will not be sent due to the LBT failure, thereby effectively avoiding interference.

Optionally, when each node sends the eighth information in the R stage, the code division multiple access (CDMA) method can be used to transmit it by multiple nodes at the same time. At this time, the receiving node does not need to send a reserved signal, and sends Node does not require LBT.

After each node in the network interacts with the eighth information, that is, after the R phase is completed, it enters the request response phase (Answer, A phase). In phase A, each node in the network serves as the receiving end, and compares the degree carried in the eighth information with its own degree based on the eighth information received in phase R. After the comparison is completed, if the degree of a surrounding node is the lowest, the ninth information will be sent to the node in phase A. The ninth information is used to instruct the node to send the seventh information of the node, or the ninth information may be used to indicate that the degree of the node is the smallest in the network.

For example, after receiving the eighth information of node B and the eighth information of node C, node A can compare the degree of node B, the degree of node C and the degree of node A. If node B has the lowest degree, node A may send ninth information to node B. If node C has the lowest degree, node A can send ninth information to node C. If node A has the lowest degree, node A does not need to send the ninth information, but can receive the ninth information from surrounding nodes.

It can be understood that the ninth information may carry the identity (identity, ID) information of the node, such as the identifier of the node. For example, if node A sends ninth information to node B, the ninth information may carry node B's identity information. In this way, even if the ninth information is received at multiple nodes, the notified node can be determined based on the identity information of Node B carried in the ninth information.

Through the above-mentioned R phase and A phase, each node in the network can realize the transmission of the eighth information. Optionally, the embodiment of the present application also designs a data transmission stage (Data, D stage). In phase D, the node that receives the ninth information may send a response to the node that sent the ninth information to indicate receipt of the ninth information. For example, after receiving the ninth information from node A, node B may send a response to node A in phase D to indicate to node A that the ninth information is received.

After the end of phase D, each node in the network can interact with the seventh information as shown in S401, S402, S403 and S404 to construct network topology information.

In the technical solution provided by the embodiments of this application, after constructing the network topology information, the third node can transfer the network topology information to other nodes in the network. For example, the third node serves as the information source and reaches the information sink via a path through multiple hops through relay transmission. For example, the third node is node 6 in Figure 4C. After constructing the network topology information, node 6 can send the network topology information to node 4, node 3, node 5 and node 7 that have communication links with node 6. Node 7 can send network topology information to node 8, which has a communication link with node 7. Node 4 can send network topology information to node 2, which has a communication link with node 4. Node 3 can send network topology information to node 7. Node 3 has a communication link to node 1.

The communication device used to implement the above method in the embodiment of the present application will be introduced below with reference to the accompanying drawings. Therefore, the above content can be used in subsequent embodiments, and repeated content will not be described again.

Figure 7 is a schematic block diagram of a communication device 700 provided by an embodiment of the present application. The communication device 700 can correspondingly implement the functions or steps implemented by the first node, the second node or the third node in each of the above method embodiments. The communication device may include a processing unit 710 and a transceiver unit 720. Optionally, a storage unit may also be included, which may be used to store instructions (code or programs) and/or data. The processing unit 710 and the transceiver unit 720 can be coupled with the storage unit. For example, the processing unit 710 can read instructions (codes or programs) and/or data in the storage unit to implement corresponding methods. Each of the above units can be set up independently or partially or fully integrated.

In some possible implementations, the communication device 700 can correspondingly implement the behaviors and functions of the first node in the above method embodiment. For example, the communication device 700 may be a first node, or a component (such as a chip or a circuit) applied in the first node. The transceiver unit 720 may be configured to perform all receiving or transmitting operations performed by the first node in the embodiment shown in FIG. 3 . For example, S301 in the embodiment shown in Figure 3 and/or other processes used to support the technology described herein; wherein, the processing unit 710 is used to perform the steps performed by the first node in the embodiment shown in Figure 3 All operations except transceiver operations, and/or other processes used to support the techniques described herein.

The processing unit 710 is used to obtain the first information of the first node. The transceiving unit 720 is configured to send the second information of the first node according to the first information of the first node. Wherein, the first information of the first node is determined based on the third information of the first node and the fourth information of the first node. The third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node. The fourth information of the first node indicates the number of nodes sending the second information to the first node.

In a possible implementation, the processing unit 710 is further configured to: subtract the number of nodes indicated by the fourth information from the number of nodes indicated by the third information, to obtain the first information of the first node.

In a possible implementation, the transceiving unit 720 is configured to send the second information of the first node according to the first information of the first node, specifically: when the first information is less than or equal to the first threshold, send The second information of the first node.

In a possible implementation, the transceiver unit 720 is configured to send the second information of the first node according to the first information of the first node, and is specifically configured to: according to the first information of the first node and the first information of the first node. The fifth information is to send the second information of the first node. Wherein, the fifth information of the first node indicates the carrier sensing result or the energy detection result.

In a possible implementation, the transceiver unit 720 sends the second information of the first node according to the first information of the first node and the fifth information of the first node, specifically for: performing carrier sensing results or energy detection. When the result is less than or equal to the second threshold, the second information of the first node is sent according to the first information of the first node.

In a possible implementation, the transceiving unit 720 is configured to send the second information of the first node according to the first information of the first node, and is specifically configured to: send the second information of the first node to the second node according to the first information of the first node. Send the second information of the first node. Sixth information is received from the second node, and the sixth information indicates whether the second information of the first node is successfully transmitted.

In some possible implementations, the communication device 700 can correspondingly implement the behaviors and functions of the first node in the above method embodiment. For example, the communication device 700 may be a first node, or a component (such as a chip or a circuit) applied in the first node. The transceiver unit 720 may be used to perform all receiving or transmitting operations performed by the first node in the embodiment shown in FIG. 4A. For example, S400A, S401 in the embodiment shown in Figure 4A, and/or other processes used to support the technology described herein; wherein, the processing unit 710 is used to execute the first node in the embodiment shown in Figure 4A All operations performed except transmit and receive operations, and/or other processes in support of the techniques described herein.

For example, the processing unit 710 is used to determine the transmission order corresponding to the degree of the first node. The transceiver unit 720 is configured to send the seventh information of the first node to the second node according to the transmission sequence corresponding to the degree of the first node. The seventh information of the first node includes information of nodes connected to the first node, and the degree of the first node is determined based on the number of nodes connected to the first node.

In some possible implementations, the communication device 700 can correspondingly implement the behaviors and functions of the second node in the above method embodiments. For example, the communication device 700 may be a second node, or may be a component (such as a chip or a circuit) used in the second node. The transceiver unit 720 may be used to perform all receiving or transmitting operations performed by the second node in the embodiment shown in FIG. 4A. For example, S400A, S401 and S403 in the embodiment shown in Figure 4A, and/or other processes used to support the technology described herein; wherein, the processing unit 710 is used to perform other than the sending and receiving operations performed by the second node. All operations except S400B and S402 in the embodiment shown in FIG. 4A, and/or other processes used to support the technology described herein.

For example, the transceiver unit 720 is configured to receive the seventh information from the first node. The processing unit 710 is configured to subtract a preset value from the degree of the second node after receiving the seventh information of the first node. The transceiver unit 720 is also configured to send the seventh information of the second node to the third node when the degree of the second node is less than or equal to the first threshold. The seventh information of the second node includes information of nodes connected to the second node and seventh information of the first node. The degree of the second node is determined based on the number of nodes connected to the second node.

In some possible implementations, the communication device 700 can correspondingly implement the behaviors and functions of the third node in the above method embodiments. For example, the communication device 700 may be a third node, or may be a component (such as a chip or circuit) applied in the third node. The transceiver unit 720 may be used to perform all receiving or transmitting operations performed by the third node in the embodiment shown in FIG. 4A. For example, S403 in the embodiment shown in Figure 4A, and/or other processes used to support the technology described herein; wherein, the processing unit 710 is used to perform all operations performed by the third node except for the transceiver operation. , such as S404 in the embodiment shown in FIG. 4A, and/or other processes used to support the technology described herein.

For example, the transceiver unit 720 is configured to receive the seventh information from the second node. The degree of the third node is greater than the degree of the second node. The degree of the second node is determined based on the number of nodes connected to the second node, and the degree of the third node is determined based on the number of nodes connected to the third node. The processing unit 710 is configured to subtract a preset value from the degree of the third node after receiving the seventh information from the second node. It can be understood that the preset value can be set based on experience, for example, it can be set to 1, 2, etc. The processing unit 710 is also configured to construct network topology information based on the seventh information of the second node when the degree is less than or equal to a first threshold. The first threshold may be set based on an empirical value, for example, it may be set to 0. The network corresponding to the network topology information includes the second node and the third node.

For operations performed by the processing unit 710 and the transceiver unit 720, please refer to the relevant descriptions of the foregoing method embodiments.

It should be understood that the processing unit 710 in the embodiment of the present application can be implemented by a processor or processor-related circuit components, and the transceiver unit 720 can be implemented by a transceiver or transceiver-related circuit components or a communication interface.

Based on the same concept, as shown in Figure 8, an embodiment of the present application provides a communication device 800. The communication device 800 includes a processor 810 . Optionally, the communication device 800 may also include a memory 820 for storing instructions executed by the processor 810 or input data required for the processor 810 to run the instructions or data generated after the processor 810 executes the instructions. The processor 810 can implement the method shown in the above method embodiment through instructions stored in the memory 820 .

Based on the same concept, as shown in Figure 9, an embodiment of the present application provides a communication device 900. The communication device 900 may be a chip or a chip system. Optionally, in the embodiment of the present application, the chip system may be composed of chips, or may include chips and other discrete devices.

The communication device 900 may include at least one processor 910 coupled with a memory. Optionally, the memory may be located within the device or outside the device. For example, communication device 900 may also include at least one memory 920. The memory 920 stores the computer programs, configuration information, computer programs or instructions and/or data necessary to implement any of the above embodiments; the processor 910 may execute the computer program stored in the memory 920 to complete the method in any of the above embodiments.

The coupling in the embodiment of this application is an indirect coupling or communication connection between devices, units or modules, which may be in electrical, mechanical or other forms, and is used for information interaction between devices, units or modules. Processor 910 may cooperate with memory 920. The specific connection medium between the above-mentioned transceiver 930, processor 910 and memory 920 is not limited in the embodiment of the present application.

The communication device 900 may also include a transceiver 930, and the communication device 900 may interact with other devices through the transceiver 930. The transceiver 930 can be a circuit, a bus, a transceiver, or any other device that can be used for information exchange, or is also called a signal transceiver unit. As shown in FIG. 9 , the transceiver 930 includes a transmitter 931 , a receiver 932 and an antenna 933 . In addition, when the communication device 900 is a chip-like device or circuit, the transceiver in the communication device 900 can also be an input-output circuit and/or a communication interface, which can input data (or receive data) and output data ( Or, sending data), the processor is an integrated processor or microprocessor or integrated circuit, and the processor can determine the output data according to the input data.

In a possible implementation, the communication device 900 can be applied to the first node. The specific communication device 900 can be the first node, or can be a first node that can support the first node to implement any of the above-mentioned embodiments. functional device. The memory 920 stores the necessary computer programs, computer programs or instructions and/or data to implement the functions of the first node in any of the above embodiments. The processor 910 can execute the computer program stored in the memory 920 to complete the method executed by the first node in any of the above embodiments.

In another possible implementation, the communication device 900 can be applied to the second node. The specific communication device 900 can be the second node, or can support the second node to implement the second node in any of the above-mentioned embodiments. A two-node functional device. The memory 920 stores necessary computer programs, computer programs or instructions and/or data to implement the functions of the second node in any of the above embodiments. The processor 910 can execute the computer program stored in the memory 920 to complete the method executed by the second node in any of the above embodiments.

In another possible implementation, the communication device 900 can be applied to a third node. The specific communication device 900 can be the third node, or can support the third node, to implement the third node in any of the above-mentioned embodiments. A three-node functional device. The memory 920 stores necessary computer programs, computer programs or instructions and/or data to implement the functions of the third node in any of the above embodiments. The processor 910 can execute the computer program stored in the memory 920 to complete the method executed by the third node in any of the above embodiments.

Since the communication device 900 provided in this embodiment can be applied to the first node to complete the method executed by the first node, or applied to the second node to complete the method executed by the second node, or applied to the third node to complete the above method The method executed by the third node. Therefore, the technical effects that can be obtained can be referred to the above method embodiments, and will not be described again here.

In the embodiment of the present application, the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or Execute each method, step and logical block diagram disclosed in the embodiment of this application. A general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in conjunction with the embodiments of the present application can be directly implemented by a hardware processor for execution, or can be executed by a combination of hardware and software modules in the processor.

In the embodiment of the present application, the memory may be a non-volatile memory, such as a hard disk drive (HDD) or a solid-state drive (SSD), etc., or it may be a volatile memory (volatile memory), such as Random-access memory (RAM). Memory may also be, but is not limited to, any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory in the embodiment of the present application can also be a circuit or any other device capable of performing a storage function, used to store computer programs, computer programs or instructions and/or data.

Based on the above embodiments, referring to Figure 10, the embodiment of the present application also provides another communication device 1000, including: an input and output interface 1010 and a logic circuit 1020; the input and output interface 1010 is used to receive code instructions and transmit them to the logic circuit 1020; Logic circuit 1020 is used to run code instructions to execute the method executed by the first node, the second node, or the third node in any of the above embodiments.

Hereinafter, operations performed by the communication device when applied to the first node, the second node, or the third node will be described in detail.

In an optional implementation, the communication device 1000 can be applied to a first node to execute the method executed by the first node, specifically, for example, the method executed by the first node in the embodiment shown in FIG. 3 .

Logic circuit 1020, used to obtain the first information of the first node. The input and output interface 1010 is used to output the second information of the first node according to the first information of the first node. Wherein, the first information of the first node is determined based on the third information of the first node and the fourth information of the first node. The third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node. The fourth information of the first node indicates the number of nodes sending the second information to the first node.

In an optional implementation, the communication device 1000 can be applied to a first node to perform the method performed by the first node, specifically, for example, the method performed by the first node in the embodiment shown in FIG. 4A.

For example, the logic circuit 1020 is used to determine the transmission sequence corresponding to the degree of the first node. The input and output interface 1010 is configured to output the seventh information of the first node to the second node according to the transmission sequence corresponding to the degree of the first node. The seventh information of the first node includes information of nodes connected to the first node, and the degree of the first node is determined based on the number of nodes connected to the first node.

In another optional implementation, the communication device 1000 can be applied to a second node to perform the method performed by the second node. Specifically, for example, the method performed by the second node in the method embodiment shown in FIG. 4A. method.

For example, the input and output interface 1010 is used to receive the seventh information from the first node. The logic circuit 1020 is configured to subtract a preset value from the degree of the second node after receiving the seventh information of the first node. The input and output interface 1010 is also used to send the seventh information of the second node to the third node when the degree of the second node is less than or equal to the first threshold. The seventh information of the second node includes information of nodes connected to the second node and seventh information of the first node. The degree of the second node is determined based on the number of nodes connected to the second node.

In another optional implementation, the communication device 1000 can be applied to a third node to perform the method performed by the third node. Specifically, for example, the method performed by the third node in the method embodiment shown in FIG. 4A. method.

The input and output interface 1010 is used for receiving the seventh information from the second node. The degree of the third node is greater than the degree of the second node. The degree of the second node is determined based on the number of nodes connected to the second node, and the degree of the third node is determined based on the number of nodes connected to the third node. The logic circuit 1020 is configured to subtract a preset value from the degree of the third node after receiving the seventh information from the second node. It can be understood that the preset value can be set based on experience, for example, it can be set to 1, 2, etc. The logic circuit 1020 is also configured to construct network topology information based on the seventh information of the second node when the degree is less than or equal to a first threshold. The first threshold may be set based on an empirical value, for example, it may be set to 0. The network corresponding to the network topology information includes the second node and the third node.

Since the communication device 1000 provided in this embodiment can be applied to the first node to complete the method executed by the first node, or applied to the second node to complete the method executed by the second node, or applied to the third node to complete the above method The method executed by the third node. Therefore, the technical effects that can be obtained can be referred to the above method embodiments, and will not be described again here.

Based on the above embodiments, embodiments of the present application also provide a communication system. The communication system includes at least one communication device applied to a first node, at least one communication device applied to a second node, and at least one communication device applied to a third node. The technical effects that can be obtained may refer to the above method embodiments and will not be described again here.

Based on the above embodiments, embodiments of the present application also provide a computer-readable storage medium that stores computer programs or instructions. When the instructions are executed, the first node in any of the above embodiments is executed. The method is implemented or the method executed by the second node is implemented or the method executed by the third node is implemented. The computer-readable storage medium may include: U disk, mobile hard disk, read-only memory, random access memory, magnetic disk or optical disk and other various media that can store program codes.

In order to realize the functions of the communication device in FIGS. 7 to 7 above, embodiments of the present application also provide a chip including a processor to support the communication device to implement the first node, the second node or the third node in the above method embodiment. The functions involved in the node. In a possible design, the chip is connected to a memory or the chip includes a memory, which is used to store computer programs or instructions and data necessary for the communication device.

Those skilled in the art will understand that embodiments of the present application may be provided as methods, systems, or computer program products. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment that combines software and hardware aspects. Furthermore, the present application 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, etc.) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each process and/or block in the flowchart illustrations and/or block diagrams, and combinations of processes and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by a computer program or instructions. These computer programs or instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing device to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing device produce Means for implementing the functions specified in a process or processes of a flowchart and/or a block or blocks of a block diagram.

These computer programs or instructions may also be stored in a computer-readable memory that causes a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture that includes the instruction means, The instruction means implements the functions specified in a process or processes of the flowchart and/or a block or blocks of the block diagram.

These computer programs or instructions may also be loaded onto a computer or other programmable data processing device, causing a series of operating steps to be performed on the computer or other programmable device to produce computer-implemented processing, thereby executing on the computer or other programmable device. The instructions provide steps for implementing the functions specified in a process or processes in the flow diagram and/or in a block or blocks in the block diagram.

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

Claims

A network topology construction method, characterized by including:

The first node sends the second information of the first node according to the first information of the first node;

Wherein, the first information of the first node is determined based on the third information of the first node and the fourth information of the first node;

The third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node;

The fourth information of the first node indicates the number of nodes sending the second information to the first node.
The method of claim 1, wherein the second information includes channel state information of a communication link between the first node and a node connected to the first node, and the first node Long-term channel state information of the communication link between the nodes connected to the first node, and link quality indication information of the communication link between the first node and the node connected to the first node and one or more fading coefficients of a communication link between the first node and a node connected to the first node.
The method of claim 1, wherein the second information includes transmission request information.
The method according to any one of claims 1 to 3, characterized in that the first node subtracts the number of nodes indicated by the fourth information from the number of nodes indicated by the third information to obtain the first node first information.
The method according to any one of claims 1 to 4, characterized in that the first node sends the second information of the first node according to the first information of the first node, including:

The first node sends the second information of the first node when the first information is less than or equal to a first threshold.
The method according to any one of claims 1 to 5, characterized in that the first node sends the second information of the first node according to the first information of the first node, including:

When the carrier sensing result or the energy detection result is less than or equal to the second threshold, the first node sends the second information of the first node according to the first information of the first node.
The method according to any one of claims 1 to 6, characterized in that the first node sends the second information of the first node according to the first information of the first node, including:

The first node sends the second information of the first node to the second node according to the first information of the first node;

The first node receives sixth information from the second node, and the fifth information indicates whether the second information of the first node is successfully transmitted.
The method according to any one of claims 1 to 7, characterized in that the second information of the first node further includes the second information received by the first node.
A communication device, characterized in that it includes: a processing unit and a transceiver unit

A processing unit, used to obtain the first information of the first node;

The transceiver unit is configured to send second information of the first node according to the first information of the first node;

Wherein, the first information of the first node is determined based on the third information of the first node and the fourth information of the first node;

The third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node;

The fourth information of the first node indicates the number of nodes sending the second information to the first node.
The device according to claim 9, wherein the second information includes channel state information of a communication link between the first node and a node connected to the first node, and the first node Long-term channel state information of the communication link between the nodes connected to the first node, and link quality indication information of the communication link between the first node and the node connected to the first node and one or more fading coefficients of a communication link between the first node and a node connected to the first node.
The device according to claim 9, wherein the second information includes transmission request information.
The device according to any one of claims 9 to 11, characterized in that the processing unit is also used to:

The first information of the first node is obtained by subtracting the number of nodes indicated by the fourth information from the number of nodes indicated by the third information.
The device according to any one of claims 9 to 12, characterized in that the transceiver unit is used to send the second information of the first node according to the first information of the first node, specifically for:

When the first information is less than or equal to the first threshold, the second information of the first node is sent.
The device according to any one of claims 9 to 13, characterized in that the transceiver unit is used to send the second information of the first node according to the first information of the first node, specifically for:

When the carrier sensing result or the energy detection result is less than or equal to the second threshold, the second information of the first node is sent according to the first information of the first node.
The device according to any one of claims 9 to 14, characterized in that the transceiver unit is used to send the second information of the first node according to the first information of the first node, specifically for:

Send the second information of the first node to the second node according to the first information of the first node;

Sixth information is received from the second node, and the sixth information indicates whether the second information of the first node is successfully transmitted.
The device according to any one of claims 9 to 15, characterized in that the second information of the first node further includes the second information received by the first node.
A communication device, characterized by including: a processor and a memory;

The memory is used to store computer programs or instructions;

The processor is configured to execute computer programs or instructions in the memory, so that the device executes the method according to any one of claims 1 to 8.
A computer-readable storage medium, characterized in that the computer-readable storage medium stores computer-executable instructions, and when called by an electronic device, the computer-executable instructions cause the electronic device to execute claims 1 to The method described in any one of 8.
A computer program product, characterized by comprising computer execution instructions, which when the computer execution instructions are run on a computer, cause the computer to execute the method according to any one of claims 1 to 8.