Network topology construction method and device

Abstract

The invention provides a network topology construction method and device, which are used for reducing time and overhead for constructing or updating a network topology, and relates to the technical field of wireless communication. In the method, a first node sends second information of the first node according to first information of the first node. Wherein the first information of the first node is determined according to 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 with the first node, or the first information indicates the number of nodes sensed 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 scheme, the first node can send the second information of the first node according to the first information so as to construct the network topology, and compared with a mode of constructing the network topology based on a flooding mechanism, the transmission information redundancy is less, and the information interaction frequency is less, so that the transmission overhead and the construction time of the network topology can be reduced.

Description

A network topology construction method and device Technical Field

[0001] The present application relates to the field of wireless communication technology, and in particular to a method and device for constructing a network topology. Background Art

[0002] In current wireless scenarios, effectively managing the entire network for optimal performance requires flexible and efficient dynamic management algorithms that can schedule and transmit traffic based on the network's real-time deployment. This requires nodes in the network to have actual topology information. This means they must be able to determine which nodes are in the network and the connections between them. This requires the network topology to be constructed and updated promptly and efficiently.

[0003] In the current process of building and updating network topologies, a flooding-based approach is generally used. The principle of the flooding approach is that during the process of building or updating the network topology, each node in the network broadcasts the link information of the surrounding nodes obtained by the node. When a node A receives the link information of the surrounding nodes broadcast by other nodes, the node A will be able to obtain the link information of more nodes. When all nodes in the network perform a broadcast, it can be understood as completing a flooding. After multiple flooding, there will be a node in the network that has global information. This node can be used as a control node, so that the control node can build or update the network topology based on the global information.

[0004] However, the method of building or updating the network topology based on the flooding mechanism requires the transmission of more redundant information, more information interactions, and a longer time.

[0005] Summary of the Invention

[0006] The present application provides a network topology construction method and apparatus to reduce the transmission of redundant information and shorten the time for constructing or updating the network topology.

[0007] In a first aspect, a network topology method is provided. This method can be performed by a communication device or a chip with similar functions to a communication device. In this method, a first node sends second information of the first node based on the first information of the first node. 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 that sent the second information to the first node.

[0008] Based on the above solution, the first node can send the second information of the first node based on one or more of the number of connected nodes, the number of perceived nodes, and the number of nodes that sent the second information to the first node to construct the network topology. Compared with the method of constructing the network topology based on the flooding mechanism, the transmitted information is less redundant and the number of information interactions is less, thereby reducing the transmission overhead and construction time of the network topology. In addition, adopting the above technical solution when updating the network topology can also reduce the time of updating the network topology, reduce information redundancy, and reduce the number of information interactions.

[0009] In one possible implementation, the second information includes one or more of channel state information of the communication link between the first node and the node connected to the first node, long-term channel state information of the communication link between the first node and the node connected to the first node, link quality indication information of the communication link between the first node and the node connected to the first node, and a fading coefficient of the communication link between the first node and the node connected to the first node.

[0010] 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.

[0011] In one possible implementation, the second information includes transmission request information. Optionally, the transmission request information may be used to request transmission of one or more of channel state information of a communication link between the first node and a node connected to the first node, long-term channel state information of a communication link between the first node and a node connected to the first node, link quality indicator information of a communication link between the first node and a node connected to the first node, and a fading coefficient of a communication link between the first node and a node connected to the first node.

[0012] Based on the above scheme, the first node can determine the order of transmitting the communication link information of the first node by transmitting the request information, which can reduce the number of information interactions when transmitting the communication link information of the first node, saving the overhead and time when constructing the network topology.

[0013] In one 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 can send the second information of the first node after receiving the second information sent by the connected node.

[0014] In one possible implementation, the first node transmits the second information of the first node when the first information is less than or equal to a first threshold. The first threshold is preset, such as 0, 1, or 2. Based on the above solution, the first node may transmit the second information of the first node when the number of connected nodes is less than or equal to the first threshold.

[0015] In one possible implementation, the first node transmits the second information of the first node based on the first information of the first node and the fifth information of the first node. The fifth information of the first node indicates a carrier sensing result or an energy detection result. When the carrier sensing result or the energy detection result is less than or equal to a second threshold, the first node transmits the second information of the first node based on the first information of the first node. Based on the above solution, the first node can refer to the carrier sensing result or the energy detection result when transmitting the second information of the first node, thereby reducing interference.

[0016] In one possible implementation, a first node transmits second information of the first node to a second node based on the first information of the first node. The first node then receives sixth information from the second node, where the sixth information indicates whether the second information of the first node was 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 was successfully transmitted.

[0017] 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, for use in constructing the network topology.

[0018] In a second aspect, a method for constructing a network topology is provided. This method may be implemented by a communication system that may include a first node, a second node, and a third node. In this method, the first node sends seventh information of the first node to the second node in a transmission order corresponding to the first node's degree. The seventh information of the first node includes information about 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 of the first node, the second node subtracts a 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 a 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 about nodes connected to the second node and the seventh information of the first node. The third node constructs network topology information based on the seventh information of the second node, where the network corresponding to the network topology information includes the first node, the second node, and the third node.

[0019] The preset value may be set based on experience, such as 1, 2, etc. Similarly, the first threshold may be set based on experience, such as 0.

[0020] Based on the above solution, each node can transmit its seventh information in the order of transmission corresponding to its degree. Compared to a flooding-based network topology construction method, this method reduces information redundancy and the number of information exchanges, thereby reducing network topology transmission overhead and construction time. Furthermore, using the above technical solution when updating the network topology can also reduce update time, information redundancy, and the number of information exchanges.

[0021] In one possible scenario, 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 about communication links known to the first node. Information about a communication link may include node information, link quality information (or referred to as link quality information), and / or beam state information of the communication link.

[0022] In another possible scenario, the eighth information may be used to request transmission of the seventh information. For example, the eighth information may also be referred to as 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.

[0023] In one possible implementation, the first node calculates the corresponding transmission order according to the degree of the first node, and after a preset condition is met, 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 amount of eighth information received by the second node. After receiving the eighth information of the first node, the second node updates the degree of the second node and subtracts a 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 order according to the degree of the second node, and after a preset condition is met, 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 eighth information received by the third node.

[0024] In one example, the first node may also receive the eighth information from other nodes. In one example, the degree of the first node may be the smallest within 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.

[0025] In another example, after receiving the eighth information from the second node, the third node can subtract a preset value from the degree of the third node, and the third node can send the eighth information to surrounding nodes, such as the fifth node, according to the transmission order corresponding to the degree of the third node.

[0026] Based on the above solution, each node in the network can exchange the eighth information, thereby updating the degree, that is, determining the order of transmitting the seventh information.

[0027] In one possible implementation, the first node transmits the eighth information of the first node on a first transmit beam among N transmit beams according to a transmission order corresponding to the degree of the first node, where the direction of the first transmit beam matches the position of the second node. The second node receives the eighth information of the first node on a first receive beam among M receive beams, where the first receive beam corresponds to the first transmit beam. N and M are both integers greater than or equal to 1.

[0028] Based on the above solution, each node can transmit the eighth information using a transmit beam, and each node can receive the eighth information using a receive beam. The receive beam and transmit beam at the same moment correspond, thereby reducing communication interference during the transmission of the eighth information. This correspondence is predefined or configured. Optionally, each node can transmit the eighth information within the specified transmission time corresponding to the corresponding transmit beam.

[0029] Optionally, the first receive beam corresponds to the first transmit beam in a one-to-one manner. Alternatively, the first receive beam corresponds to the first transmit beam and X transmit beams. Alternatively, Y receive beams and the first receive beam correspond to the first transmit beam.

[0030] In one possible implementation, the second node receives the eighth information of the fourth node on the second receive beam among M receive beams. The second receive beam matches the position of the fourth node, and the eighth information of the fourth node includes information about the fourth node's degree. The second node determines that the first node's degree is less than the fourth node's degree based on the information about the first node's degree and the fourth node's degree. The eighth information of the first node includes information about the first node's degree. The second node sends ninth information to the first node, and the ninth information is used to instruct the first node to send the first node's seventh information.

[0031] In a possible implementation, the fourth node sends the eighth information of the fourth node to the second node on a second transmission beam among N transmission beams, where the second transmission beam corresponds to the second reception beam.

[0032] Based on the above scheme, 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 compare the degree of the first node with the degree of the fourth node, and send the ninth information to the node with the smaller degree, instructing the node with the smaller degree to send the seventh information.

[0033] Optionally, the second receive beam corresponds to the second transmit beam in a one-to-one manner. Alternatively, the second receive beam corresponds to the second transmit beam and X transmit beams. Alternatively, Y receive beams and the second receive beam correspond to the second transmit beam.

[0034] In a possible implementation, the ninth information includes the identifier of the first node. Based on the above solution, the identifier of the first node can allow each node that receives the ninth information to confirm that the ninth information instructs the first node to send the seventh information.

[0035] In one possible implementation, nodes with smaller degrees are ranked higher in the transmission order. Based on the above solution, nodes with smaller degrees are ranked higher in the transmission order in the network, that is, each node transmits the eighth information in order from smallest to largest degree, which can reduce the number of times the eighth information is transmitted.

[0036] In one possible implementation, the first node is the node with the lowest degree in the network, and the third node is the node with the highest degree in the network. Based on the above scheme, the first node may be the node with the lowest degree in the network, so the first node preferentially sends the second message, and the third node is the node with the highest degree in the network, so the third node can receive the eighth message from other nodes.

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

[0038] A processing unit is configured to obtain first information of a first node. A transceiver unit is configured to send second information of the first node based on the first information of the first node. 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 that have sent the second information to the first node.

[0039] In one possible implementation, the second information includes one or more of channel state information of the communication link between the first node and the node connected to the first node, long-term channel state information of the communication link between the first node and the node connected to the first node, link quality indication information of the communication link between the first node and the node connected to the first node, and a fading coefficient of the communication link between the first node and the node connected to the first node.

[0040] In a possible implementation manner, the second information includes transmission request information.

[0041] 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.

[0042] In a possible implementation, the transceiver unit is configured to send the second information of the first node based on the first information of the first node, and is specifically configured to send the second information of the first node when the first information is less than or equal to a first threshold.

[0043] In one possible implementation, the transceiver is configured to send the second information of the first node based on the first information of the first node, and is specifically configured to send the second information of the first node based on the first information of the first node and fifth information of the first node, where the fifth information of the first node indicates a carrier sensing result or an energy detection result.

[0044] In one possible implementation, the transceiver unit sends the second information of the first node based on the first information of the first node and the fifth information of the first node, and is specifically used to: when the carrier sensing result or the energy detection result is less than or equal to the second threshold, send the second information of the first node based on the first information of the first node.

[0045] In one possible implementation, the transceiver is configured to send the second information of the first node based on the first information of the first node, and is specifically configured to: send the second information of the first node to the second node based on the first information of the first node, and receive sixth information from the second node, the sixth information indicating whether the second information of the first node is successfully transmitted.

[0046] In a possible implementation manner, the second information of the first node further includes the second information received by the first node.

[0047] 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 of the above-mentioned embodiments, or a chip provided in the communication device of any one of the first to second aspects. The communication device includes a communication interface and a processor, and optionally, a memory. The memory is used to store computer programs, instructions, or data. The processor is coupled to the memory and the communication interface. When the processor reads the computer program, instructions, or data, the communication device executes the method performed by the first node, second node, or third node in the method embodiment of any one of the first to second aspects.

[0048] It should be understood that the communication interface can be implemented by an antenna, a feeder, a codec, etc. in the communication device, or, if the communication device is a chip provided in a network device or a terminal device, the communication interface can be an input / output interface of the chip, such as an input / output pin, etc. The communication device may further include a transceiver for communicating with other devices.

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

[0050] In a sixth aspect, the present application provides a computer-readable storage medium storing a computer program or instruction. When the computer program or instruction is executed, it implements the method executed by the first node in the above aspects; or implements the method executed by the second node in the above aspects; or implements the method executed by the third node in the above aspects.

[0051] In the seventh aspect, a computer program product is provided, comprising: computer program code or instructions, which, when the computer program code or instructions are run, causes the method executed by the first node in the above aspects to be executed, or causes the method executed by the second node in the above aspects to be executed, or causes the method executed by the third node in the above aspects to be executed.

[0052] In an eighth aspect, a communication device is provided, which includes a unit or module for executing the above-mentioned methods.

[0053] The beneficial effects of the third to eighth aspects and their implementations can refer to the description of the beneficial effects of the methods of the first and second aspects and their implementations. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] FIG1A is a schematic diagram of the first round of flooding process in a solution for constructing a network topology based on a flooding mechanism according to an embodiment of the present application;

[0055] FIG1B is a schematic diagram of the second round of flooding process in the solution for constructing a network topology based on a flooding mechanism according to an embodiment of the present application;

[0056] FIG2 is a schematic diagram of a multi-node writing network provided in an embodiment of the present application;

[0057] FIG3 is one of the exemplary flow charts of a network topology construction method provided in an embodiment of the present application;

[0058] FIG4A is one of exemplary flow charts of a network topology construction method provided in an embodiment of the present application;

[0059] FIG4B is a schematic diagram of the interaction process of the second information in the network topology construction method provided in an embodiment of the present application;

[0060] FIG4C is a schematic diagram of the interaction process of the first information in the network topology construction method provided in an embodiment of the present application;

[0061] FIG5A is a schematic diagram of spatial direction distribution of transmission beams provided in an embodiment of the present application;

[0062] FIG5B is a schematic diagram of spatial direction distribution of receive beams provided in an embodiment of the present application;

[0063] FIG6 is a schematic diagram of the information interaction process in the network topology construction method provided in an embodiment of the present application;

[0064] FIG7 is a schematic diagram of a communication device according to an embodiment of the present application;

[0065] FIG8 is a schematic diagram of a communication device according to an embodiment of the present application;

[0066] FIG9 is a schematic diagram of a communication device according to an embodiment of the present application;

[0067] FIG10 is one of the schematic diagrams of a communication device provided in an embodiment of the application. DETAILED DESCRIPTION

[0068] The following introduces the technical terms involved in the embodiments of this application.

[0069] Network topology, also known as network structure, refers to the physical layout of various devices interconnected by transmission media. This physical layout can be a specific, physical (or real) arrangement of network members, or a logical (or virtual) arrangement of network members.

[0070] In a network topology, there may be a type of node that can be used to schedule other nodes. Such nodes may be referred to as control nodes. Control nodes may include central control nodes and distributed control nodes. In one possible scenario, the central control node may schedule each node in the network where the central control node is located (i.e., the network corresponding to the network topology). In another possible scenario, a distributed control node may schedule one or more nodes surrounding the distributed control node. These one or more nodes and the distributed control node may constitute a subnet. A network may contain multiple subnets.

[0071] Optionally, the central control node and the distributed control nodes may coexist in one network, wherein the central control node may be a distributed control node in a certain subnet.

[0072] With the development of wireless communications, increasingly dense, complex, and flexible networks will become the future trend, thus realizing the goal of the Internet of Everything. Therefore, the overall networking, transmission theory, methods, and optimization of the network are very important research topics.

[0073] In network research and future applications, wireless ad hoc networks (WANs) have been a hot topic of discussion due to their broad application scenarios and complex, open research content. Through the self-organization and self-cooperation of multiple nodes within a WAN, WANs can achieve superior overall network performance in various application scenarios. A typical WAN application is a wireless sensor network, which uses distributed sensor deployment to transmit sensor data. For example, in a vehicle-to-vehicle (V2V) WAN network, distributed sensors can be deployed on vehicles in a V2V network to collect road condition information, which can then be shared between vehicles. Most WAN networks are flexible and dynamic because nodes can dynamically join and leave the network. For example, new nodes can be added through the deployment of distributed sensors, while existing nodes can also exit the network due to factors such as low battery or failure. It is understood that individual nodes in a WAN network can also be mobile.

[0074] For example, in a V2V network, distributed sensors deployed on vehicles can join or leave the V2V network due to vehicle movement. To accommodate this flexible self-organizing mechanism, the scheduling transmission of distributed sensors in a V2V network can be generally divided into two categories. The first category includes scheduling transmission based on a deterministic network topology. Deterministic scheduling transmission refers to the presence of a central control node in the network that stores global information. This central control node can establish or update the network topology based on this global information and schedule nodes in the network. However, since the control node needs to store global information, this takes a long time. In highly dynamic networks with rapidly moving nodes, the network topology may need to be updated frequently. Therefore, the central control node needs to frequently update global information to achieve network topology updates. However, the time it takes for the central control node to update global information may exceed the actual update time of the network topology. Therefore, scheduling transmission based on a deterministic network topology is not suitable for highly dynamic network topologies with rapidly moving nodes.

[0075] The second type of scheduled transmission for distributed sensors in V2V networks includes scheduled transmission based on random network topology. This type of scheduled transmission does not require global information, but instead broadcasts information to the final node through flooding. The technical solution for broadcasting information through flooding will be described in detail later.

[0076] In current wireless scenarios, effectively managing the entire network for optimal performance requires flexible and efficient dynamic management algorithms that can schedule and transmit traffic based on the network's real-time deployment. This requires a control node that stores the actual network topology. This means the control node must be able to determine the nodes in the network and the connections between them, enabling the timely and efficient construction and updating of the network topology.

[0077] Currently, the construction and updating of the entire network topology can be divided into two phases. In the first phase, nodes in the network obtain link information from surrounding nodes to determine which nodes they have communication links with, as well as the quality parameters of these communication links. In the second phase, based on the obtained link information from surrounding nodes, nodes in the network aggregate network topology information to a control node, allowing the control node to obtain link information for all nodes within the network or its subnets.

[0078] In the current process of building and updating network topologies, a flooding-based approach is generally used. The principle of the flooding approach is that during the process of building or updating the network topology, each node in the network broadcasts the link information of the surrounding nodes obtained by the node. When a node A receives the link information of the surrounding nodes broadcast by other nodes, the node A will be able to obtain the link information of more nodes. When all nodes in the network perform a broadcast, it can be understood as completing a flooding. After multiple flooding, there will be a node in the network that has global information. This node can be used as a control node, so that the control node can build or update the network topology based on the global information.

[0079] During the construction or update of the network topology, since flooding is used to aggregate information, one disadvantage is that a large amount of redundant information is transmitted, which leads to low transmission efficiency. In addition, each node needs to broadcast information to surrounding nodes, so there is a lot of interference during the broadcast phase. Not only that, each node also needs to receive information from all surrounding nodes, so each flooding takes a long time. For ease of understanding, the flooding method is introduced below in conjunction with Figures 1A and 1B. Among them, Figures 1A and 1B take the process of building the network topology as an example.

[0080] In Figures 1A and 1B, black dots represent nodes, dashed lines indicate a communication link between two nodes, and bidirectional arrows indicate that two parties can communicate bidirectionally through this communication link, that is, exchange information. All communication links shown in Figures 1A and 1B are numbered, with the numbers corresponding to the corresponding communication links in the figure. In Figure 1A, during the first flooding, each node in the network can broadcast communication link information (hereinafter referred to as link information) to surrounding nodes. For example, node 1 broadcasts link information. Since node 1 has a communication link with node 3, node 1's link information includes link information between node 1 and node 3. Node 3 can receive the link information broadcast by node 1. In this way, node 3 has the link information of node 3 as well as the link information of node 1. For another example, node 3 can broadcast link information. Since node 3 has communication links with nodes 1, 4, 5, and 6, the link information broadcast by node 3 can include link information between node 3 and node 1, 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. Nodes 1, 4, 5, and 6 can receive the link information broadcast by node 3. Node 1 then has both node 3's and node 1's link information, node 4 has both node 3's and node 4's link information, node 5 has both node 3's and node 5's link information, and node 6 has both node 3's and node 6's link information. Similarly, nodes 2, 4, 5, 6, 7, and 8 all broadcast link information. The numbers in parentheses below the nodes in Figure 1A indicate the link information the node possesses after the first flooding completes.

[0081] During the second flooding, nodes in the network can broadcast the link information received from other nodes to surrounding 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 6. For another example, node 3 can broadcast the link information received from node 1, node 4, node 5, and node 6, and so on. The numbers in brackets below the nodes in Figure 1B indicate the link information owned by the node after the second flooding is completed.

[0082] Comparing the link information broadcast by each node in Figures 1A and 1B, during the second flooding, much of the link information broadcast by each node is duplicated by different nodes. For example, node 6 will receive link information broadcast by nodes 3, 4, 5, and 7, and the link information broadcast by these nodes contains duplicate link information, such as link information between nodes 3 and 4, and link information between nodes 3 and 5, and so on. Furthermore, comparing the link information held by each node in Figures 1A and 1B shows that to obtain global information, at least 40 transmissions of 53 pieces of link information are required. In reality, because it is almost impossible to transmit link information without redundancy, the actual amount of link information transmitted is significantly greater than 53. Therefore, the network topology construction method based on the flooding mechanism requires the transmission of a large amount of redundant information and takes a long time.

[0083] In view of this, an embodiment of the present application provides a network topology construction method. In this method, each node in the network can send information in a certain transmission order, which can reduce interference during information transmission. Sending information in a transmission order can also reduce the number of information exchanges, reduce the transmission of redundant information, and shorten the time it takes to build the network topology.

[0084] The following describes a method for constructing a network topology according to an embodiment of the present application with reference to the accompanying drawings.

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

[0086] Referring to FIG3 , which is an exemplary flowchart of a network topology construction method provided in an embodiment of the present application, the method may include the following operations.

[0087] S301: The first node sends the second information of the first node according to the first information of the first node.

[0088] Correspondingly, the second node receives the second information from the first node.

[0089] S302: The second node builds a network topology.

[0090] 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 number of nodes perceived by the first node. Optionally, the third information of the first node may be referred to as the degree of the first node. The fourth information of the first node may indicate the number of nodes that have sent the second information to the first node.

[0091] 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 a first threshold value. The first threshold value may be set based on an empirical value, such as 0, 1, 2, etc.

[0092] For another example, the first node may obtain the first information of the first node by subtracting the number of nodes indicated by the fourth information from the number of nodes indicated by the third 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.

[0093] 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 is 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 the present application do not specifically limit the method for obtaining the carrier sensing result and the energy monitoring result.

[0094] In one possible scenario, the first node may send the second information of the first node to the second node in a unicast manner. In another possible scenario, 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.

[0095] In one example, the second information includes one or more of channel state information of the communication link between the first node and the node connected to the first node, long-term channel state information of the communication link between the first node and the node connected to the first node, 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.

[0096] In another example, the second information may include transmission request information. Optionally, the transmission request information may be used to request transmission of one or more of channel state information of the communication link between the first node and a node connected to the first node, long-term channel state information of the communication link between the first node and a node connected to the first node, link quality indication information of the communication link between the first node and a node connected to the first node, and a fading coefficient of the communication link between the first node and a node connected to the first node.

[0097] The following describes the cases where the second information includes different information. For ease of distinction, the second information including the transmission request information may be referred to as eighth information, and the second information including the communication link information of the first node may be referred to as seventh information.

[0098] 4A , which is a flow chart of a network topology construction method provided in an embodiment of the present application, including the following operations.

[0099] S401: A first node sends the first node's seventh information to a second node according to the transmission order corresponding to the first node's degree. Correspondingly, the second node receives the first node's seventh information from the first node. The first node and the second node belong to the same network, and embodiments of the present application are intended to construct a network topology for this network, for example, referred to as the first network.

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

[0101] S401 is a possible implementation of S301. In one possible implementation, the first node may send the seventh information to the second node according to the transmission order corresponding to the first node's degree. For example, each node in the first network may store a correspondence between degree and transmission order. The first node may then determine the first node's transmission order based on the correspondence between degree and transmission order and the first node's degree. In this way, the first node may send the seventh information to the second node when the transmission order of the first node is reached.

[0102] In one example, each node in the first network can determine its transmission order based on a timer. For example, each node in the first network can maintain multiple timers and transmit the seventh information when a corresponding timer is activated. Each timer can correspond to a degree. In the first network, each node can sequentially activate multiple timers, with the next timer activated when one timer expires. Different nodes can activate timers synchronously, or, in other words, different nodes can activate the first timer at the same time. The timers can be activated in the same order across different nodes. For example, each node activates timer A1 first and then timer A2. Optionally, the timers can be activated sequentially from the smallest to the largest degree. For example, each node in the first network can synchronously activate timer A1. During the execution of timer A1, the node with degree A1 can transmit the seventh information. When timer A1 expires, each node in the first network can activate timer A2 corresponding to degree A2. During the execution of timer A2, the node with degree A2 can transmit the seventh information, and so on. For the first node, the seventh information can be transmitted to the second node while the timer corresponding to the first node's degree is running.

[0103] It is understandable that a node corresponds to a degree, and the node also corresponds to a timer corresponding to the degree. When the timer starts or while the timer is running, the node can send the seventh information.

[0104] In another example, each node in the first network can determine the transmission order of the node based on the correspondence between the sending time and the degree. For example, each node in the first network can store the sending time corresponding to different degrees. Optionally, 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 after time A1, and degree A1 is less than degree A2. For the first node, the seventh information can be sent to the second node at the time corresponding to the degree of the first node.

[0105] It is understandable that the smaller the degree of a node in the first network, the earlier the transmission order. For example, the first node is the node with the smallest degree in the first network.

[0106] Optionally, the degree of the first node may be updated according to the third information of the first node and the fourth information of the first node. For example, the embodiment shown in FIG4A may further include S400A and S400B, for example, S400A and S400B may occur before S401.

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

[0108] The degree of a 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 has a communication link with node 3, but no communication link with any other node. In this case, the degree of node 1 can be 1. For another example, in Figure 1A, node 3 has communication links with nodes 1, 4, 5, and 6, but no communication link with any other node. In this case, the degree of node 3 can be 4.

[0109] In one possible scenario, the eighth information may be used to request transmission of the seventh information. For example, the eighth information may also be referred to as transmission request information, which is used to request transmission of the seventh information in S301 (ie, the seventh information of the first node).

[0110] In S400A, the first node may transmit the eighth information of the first node to the second node according to the transmission order corresponding to the degree of the first node. For example, each node in the first network may store a correspondence between degree and transmission order. The first node may then determine the transmission order of the first node based on the correspondence between degree and transmission order and the degree of the first node. For this purpose, reference may be made to the implementation in S401 where the first node determines the transmission order based on the degree of the first node, and further description is omitted here.

[0111] It is understandable that the smaller the degree of a node in the first network, the earlier it is in the transmission order. The first node mentioned above is the node with the smallest degree in the first network.

[0112] Optionally, each node may perform a listen before talk (LBT) operation before unicasting the eighth information to one of the surrounding nodes. For example, taking the case where the first node sends the eighth information to the second node as an example, the first node may perform LBT to determine whether the communication link between the first node and the second node is idle before sending the eighth information to the second node, and send the eighth information to the second node if the LBT succeeds, i.e., if it is determined that the communication link between the first node and the second node is idle.

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

[0114] The preset value may be set based on experience, such as 1, 2, etc.

[0115] S400B may be a possible implementation manner in which the second node determines the first information of the second node. For example, the second node may subtract the number of nodes indicated by the fourth information from the number of nodes indicated by the third information (such as the degree of the second node), such as subtracting the number of nodes received from the eighth information.

[0116] 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 a preset value from the degree of node 3, such as 1, so that the degree of node 3 becomes 3.

[0117] In one example, the second node may also send the eighth information to one of the neighboring 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, its degree becomes 3. Therefore, node 3 may send the eighth information to one of the neighboring nodes according to the transmission order corresponding to a degree of 3.

[0118] The second node may send the eighth information to one of the surrounding nodes in a manner similar to the manner in which the first node sends the eighth information to the second node in S400A. Similarly, the third node may 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.

[0119] Hereinafter, S400A and S400B will be described with reference to FIG. 4B .

[0120] Referring to Figure 4B , dots represent nodes, dashed lines indicate a communication link between two nodes, and bidirectional arrows indicate that two parties can communicate bidirectionally through this link, i.e., exchange information. All links shown in Figure 4B are numbered, with the numbers corresponding to the links in the figure. As can be seen in Figure 4B , node 1 has a degree of 1, node 2 has a degree of 1, node 3 has a degree of 4, node 4 has a degree of 3, node 5 has a degree of 3, node 6 has a degree of 4, node 7 has a degree of 3, and node 8 has a degree of 1.

[0121] Nodes 1 to 8 can each send the eighth information to surrounding nodes in the order of transmission corresponding to their degrees. In one possible scenario, nodes with lower degrees in the network are assigned an earlier transmission order. Therefore, in Figure 4B , nodes 1, 2, and 8, each with a degree of 1, first send the eighth information to one of their respective surrounding nodes. For example, node 1 can send the eighth information to node 3, node 2 can send the eighth information to node 4, and node 8 can send the eighth information to node 7. Each node that receives the eighth information can subtract a preset value from its degree, such as 1. For example, node 3 can subtract 1 from its degree, so that node 3's degree becomes 3. Node 4 can subtract 1 from its degree, so that node 4's degree becomes 2. Node 7 can subtract 1 from its degree, so that node 7's degree becomes 2. Next, nodes 4 and 7, each with a degree of 2, send the eighth information to one of their surrounding nodes. For example, node 4 can send the eighth information to node 6, and node 7 can send the eighth information to node 5. Each node that receives the eighth information can subtract a preset value from its degree, such as 1. For example, node 6 can reduce its degree by 1, so that its degree becomes 3. Node 5 can reduce its degree by a preset value, so that its degree becomes 2. Since node 5's degree becomes 2, when a node with a degree of 2 sends the eighth information to one of its surrounding nodes, node 5 can also send the eighth information to one of its surrounding nodes, such as node 3. In this way, node 3's degree can become 2. Therefore, when a node with a degree of 2 sends the eighth information to one of its surrounding nodes, node 3 can also send the eighth information to one of its surrounding nodes, such as node 6.

[0122] Through the link information interaction method shown in FIG4B , each node can transmit the eighth information to one of the surrounding nodes, so that the node with the highest degree, such as node 6, can obtain which nodes are included in the network.

[0123] Based on the above S400A and S400B, each node in the network can determine its own degree. The degree is used to indicate the number of eighth information received. For example, the degree of the second node can be the number of eighth information received by the second node. As shown in Figure 4B, node 3 received the eighth information from node 1 and node 5, so the degree of node 3 is 2. For another example, as shown in Figure 4B, node 6 received the eighth information from node 4 and node 6, so the degree of node 6 is 2. And so on. Each node in the network can update its degree based on the number of eighth information received.

[0124] Thus, in S401, the first node can send the seventh information to the surrounding nodes according to the transmission order corresponding to the first node's degree. Specifically, the first node can send the seventh information to a node, such as the second node, that received the first node's eighth information. As shown in Figure 4B, if node 1 sends the eighth information to node 3, then node 1 can send the eighth information to node 3 in S401. Similarly, if node 5 sends the eighth information to node 3, then node 5 can send the seventh information to node 3 in S401.

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

[0126] For example, the second node is node 3 in Figure 4B. For example, the degree of node 3 is 2, so after receiving the seventh information from node 1, node 3 can subtract a preset value from its degree, such as 1, so that the degree of node 3 becomes 1.

[0127] S402 may be a possible implementation manner in which the second node determines the first information of the second node. For example, the second node may subtract the number of nodes indicated by the fourth information from the number of nodes indicated by the third information (such as the degree of the second node), such as subtracting the number of nodes indicated by the seventh information received.

[0128] 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.

[0129] The first threshold may be set based on an empirical value, such as 0.

[0130] For example, the second node is node 3 in Figure 4B. For example, after receiving the eighth message from node 1, node 3 may subtract a preset value, such as 1, from its degree, so that node 3's degree becomes 1. Similarly, after receiving the eighth message from node 5, node 3 may subtract a preset value, such as 1, from its degree, so that node 3's degree becomes 0. When the degree is less than or equal to 0, node 3 may send the seventh message to one of the surrounding nodes. Node 3 may send the seventh message to the node that received node 3's eighth message, that is, node 6.

[0131] Hereinafter, S401 to S403 will be described with reference to FIG. 4C .

[0132] As shown in Figure 4B, each node in the network updates its 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, the degree of node 7 is 1, and the degree of node 8 is 0.

[0133] Nodes 1 through 8 can each send the seventh information to surrounding nodes in the order of transmission corresponding to their degrees. In one possible scenario, nodes with lower degrees in the network are assigned an earlier transmission order. Therefore, in Figure 4C, nodes 1, 2, and 8, each with a degree of 0, each send the seventh information to one of their surrounding nodes. One of these surrounding nodes may be the node that receives 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 may subtract a preset value, such as 1, from its degree. For example, node 3 may subtract 1 from its degree, thus changing its degree to 1. Node 4 may subtract 1 from its degree, thus changing its degree to 0. Node 7 may subtract 1 from its degree, thus changing its degree to 0. Next, nodes 4 and 7, each with a degree of 0, send the seventh information to one of their 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 may subtract a preset value, such as 1, from its degree. For example, node 6 can subtract 1 from its degree, thus reducing its degree to 1. Node 5 can also subtract a preset value from its degree, thus reducing its degree to 0. Next, node 5, with a degree of 0, sends the seventh information to one of its neighboring nodes. For example, node 5 can send the seventh information to node 3. This reduces node 3's degree to 0. Therefore, node 3 can send the seventh information to node 6.

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

[0135] S404: The third node constructs network topology information according to the seventh information of the second node.

[0136] The third node obtains the link information and constructs the network topology information. The network corresponding to the network topology information includes the first node, the second node, and the third node. For example, the third node is node 6 in Figure 4C. Through the process shown in Figures 4B and 4C, node 6 can obtain the link information of the network, so that node 6 can construct the network topology information. The network corresponding to the network topology information includes nodes 1, 2, 3, 4, 5, 6, 7, and 8.

[0137] Compared to flooding-based network topology construction, the technical solution shown in FIG4A reduces information redundancy and information interaction during network topology construction, thereby reducing network topology construction time. Furthermore, using the technical solution shown in FIG4A when updating the network topology can also reduce network topology update time, information redundancy, and information interaction.

[0138] In one possible implementation, in order to reduce interference in the information transmission process, each node may send the seventh information and / or the eighth information through a transmitting beam, and each node may also receive the seventh information and / or the eighth information through a receiving beam.

[0139] For example, the spatial allocation relationship of beams can be predefined or preconfigured, such as the spatial allocation relationship between transmit beams and receive beams. For example, there are N directions for transmit beams and M directions for receive beams. It can be understood that in the spatial allocation relationship of beams between different nodes, the transmit beams with the same number correspond to the same direction, and the receive beams also correspond to the same direction. Wherein, 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 transmit beam can correspond to multiple receive beams. In this case, the transmit beam can be regarded as a wide beam, and the receive beam can be regarded as a narrow beam, that is, the direction of a wide beam corresponds to the directions 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 directions of multiple narrow beams.

[0140] When N=M=1, it indicates that each node in the network uses omnidirectional beams to transmit and receive the seventh information and / or the eighth information during the stage of constructing the network topology.

[0141] Refer to Figure 5A, which is a schematic diagram of the spatial direction allocation of the transmitting beam. In Figure 5A, a total of 4 directions of the transmitting beam 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 4 directions of the receiving beam are used as an example for explanation. It can be seen from Figures 5A and 5B that the beam is divided into 4 directions in the plane space, each corresponding to a quadrant. In Figures 5A and 5B, if a node wants to receive in the R1 direction, it can only receive the transmitting beam from the T1 direction. Similarly, if a node wants to receive in the R2 direction, it can only receive the transmitting beam from the T2 direction. It can be seen that the R1 receiving direction corresponds to the T1 sending direction, and the R2 receiving direction corresponds to the T2 sending direction. Similarly, the R3 receiving direction corresponds to the T3 receiving direction, and the R4 receiving direction corresponds to the T4 receiving direction.

[0142] In one 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 transmission beam. 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 order corresponding to the degree of the first node. The first transmission beam may be determined based on a spatial allocation relationship of predefined or preconfigured beams. The direction of the first transmission beam matches the position of the second node. It is understandable that in the process of each node in the network obtaining the seventh information, the direction or position of the surrounding nodes can be determined. Therefore, when sending the eighth information, each node can determine which direction of the transmission beam to use to send the eighth information.

[0143] 4B , if node 3 is located in the fourth quadrant of node 1, node 1 may send the eighth information in the T1 direction to node 3. When node 3 receives the seventh information from node 1, it may receive it in the R1 direction.

[0144] 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 Figure 6. In Figure 6, in the R1 stage, 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 stage, each node in the network receives in the R2 direction, and each node in the network can transmit in the T2 direction. Similarly, in the request stage (Request, Ri), each node in the network can exchange the eighth information. Wherein, i is taken from 1 to M.

[0145] For example, assume that in the R1 phase, node A receives the eighth information in the R1 direction. At this time, assume that there are two transmitters in the R1 direction, namely node B and node C. Node B and node C respectively send the eighth information in the T1 direction. Assume that the degree of node B is d1 and the degree of node C is d2, and d1>d2. Since the smaller the degree, the earlier the transmission order, 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 the LBT is successful, node C can send the eighth information to node A. If the LBT is unsuccessful, node C will 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 failure of LBT, thereby effectively avoiding interference.

[0146] Optionally, when each node sends the eighth information in the R phase, code division multiple access (CDMA) can be used, with multiple nodes transmitting simultaneously. In this case, the receiving node does not need to send a reservation signal, and the sending node does not need LBT.

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

[0148] For example, after receiving the eighth information from node B and the eighth information from node C, node A may 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 the ninth information to node B. If node C has the lowest degree, node A may send the ninth information to node C. If node A has the lowest degree, node A does not need to send the ninth information, but may instead receive the ninth information from neighboring nodes.

[0149] It is understood that the ninth message may carry node identity (ID) information, such as a node identifier. For example, if node A sends the ninth message to node B, the ninth message may carry node B's identity information. Thus, even if multiple nodes receive the ninth message, the notified node can be determined based on the node B's identity information carried in the ninth message.

[0150] 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 phase (Data, D phase). In the D phase, the node receiving the ninth information can send a response to the node sending the ninth information to indicate that the ninth information has been received. For example, after node B receives the ninth information from node A, in the D phase, node B can send a response to node A to indicate to node A that the ninth information has been received.

[0151] After the D phase is finished, each node in the network may interact with the seventh information as shown in S401 , S402 , S403 and S404 to construct network topology information.

[0152] In the technical solution provided in the embodiment of the present application, after constructing the network topology information, the third node can transmit the network topology information to other nodes in the network. For example, the third node acts as a source of information, and through the source of information, it is relayed and reaches the destination through multiple hops via a path. 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 a communication link with node 6. Node 7 can send the network topology information to node 8 that has a communication link with node 7, node 4 can send the network topology information to node 2 that has a communication link with node 4, and node 3 can send the network topology information to node 1 that has a communication link with node 3.

[0153] The following describes the communication device used to implement the above method in the embodiment of the present application with reference to the accompanying drawings. Therefore, the above contents can be used in subsequent embodiments, and repeated contents will not be repeated.

[0154] Figure 7 is a schematic block diagram of a communication device 700 provided in 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 the above-mentioned various method embodiments. The communication device may include a processing unit 710 and a transceiver unit 720. Optionally, it may also include a storage unit, which can be used to store instructions (codes or programs) and / or data. The processing unit 710 and the transceiver unit 720 can be coupled to the storage unit. For example, the processing unit 710 can read the instructions (codes or programs) and / or data in the storage unit to implement the corresponding method. The above-mentioned units can be set independently or partially or fully integrated.

[0155] In some possible implementations, the communication device 700 can implement the behaviors and functions of the first node in the above-mentioned method embodiment. For example, the communication device 700 can be a first node, or a component (such as a chip or circuit) applied to the first node. The transceiver unit 720 can be used to perform all receiving or sending operations performed by the first node in the embodiment shown in Figure 3. For example, S301 in the embodiment shown in Figure 3 and / or other processes for supporting the technology described herein; wherein the processing unit 710 is used to perform all operations except the receiving and sending operations performed by the first node in the embodiment shown in Figure 3, and / or other processes for supporting the technology described herein.

[0156] Processing unit 710 is configured to obtain first information of a first node. Transceiver unit 720 is configured to send second information of the first node based on the first information of the first node. 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 that sent the second information to the first node.

[0157] 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.

[0158] 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, specifically to send the second information of the first node when the first information is less than or equal to a first threshold.

[0159] In one possible implementation, the transceiver unit 720 is configured to send the second information of the first node based on the first information of the first node, and is specifically configured to send the second information of the first node based on the first information of the first node and fifth information of the first node, where the fifth information of the first node indicates a carrier sensing result or an energy detection result.

[0160] In one possible implementation, the transceiver unit 720 sends the second information of the first node based on the first information of the first node and the fifth information of the first node, and is specifically used to: when the carrier sensing result or the energy detection result is less than or equal to the second threshold, send the second information of the first node based on the first information of the first node.

[0161] In one possible implementation, the transceiver unit 720 is configured to send the second information of the first node based on the first information of the first node, and is specifically configured to send the second information of the first node to the second node based on the first information of the first node, and receive sixth information from the second node, where the sixth information indicates whether the second information of the first node is successfully transmitted.

[0162] In some possible implementations, the communication device 700 can implement the behaviors and functions of the first node in the above-mentioned method embodiment. For example, the communication device 700 can be a first node, or a component (such as a chip or circuit) applied to the first node. The transceiver unit 720 can be used to perform all receiving or sending operations performed by the first node in the embodiment shown in Figure 4A. For example, S400A, S401 in the embodiment shown in Figure 4A, and / or other processes for supporting the technology described herein; wherein the processing unit 710 is used to perform all operations except the transceiver operations performed by the first node in the embodiment shown in Figure 4A, and / or other processes for supporting the technology described herein.

[0163] For example, processing unit 710 is configured to determine a transmission order corresponding to the degree of the first node. Transceiver unit 720 is configured to send 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 about nodes connected to the first node, where the degree of the first node is determined based on the number of nodes connected to the first node.

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

[0165] For example, transceiver unit 720 is configured to receive the seventh information from the first node. Processing unit 710 is configured to, upon receiving the seventh information from the first node, subtract a preset value from the degree of the second node. Transceiver unit 720 is further 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 a first threshold. The seventh information of the second node includes information about the nodes connected to the second node and the 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.

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

[0167] For example, the transceiver unit 720 is used 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 used 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, such as 1, 2, etc. The processing unit 710 is also used to construct network topology information based on the seventh information of the second node when the degree is less than or equal to the first threshold value. The first threshold value can be set based on an empirical value, such as 0. The network corresponding to the network topology information includes the second node and the third node.

[0168] For the operations performed by the processing unit 710 and the transceiver unit 720 , reference may be made to the relevant description of the aforementioned method embodiment.

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

[0170] Based on the same concept, as shown in FIG8 , 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 further include a memory 820 for storing instructions executed by the processor 810, or storing input data required by the processor 810 to execute instructions, or storing data generated after the processor 810 executes instructions. The processor 810 can implement the method shown in the above method embodiment using the instructions stored in the memory 820.

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

[0172] The communication device 900 may include at least one processor 910 coupled to a memory. Optionally, the memory may be located within or outside the device. For example, the communication device 900 may also include at least one memory 920. The memory 920 stores the necessary computer programs, configuration information, computer programs or instructions, and / or data for implementing any of the above-described embodiments. The processor 910 may execute the computer programs stored in the memory 920 to perform the method in any of the above-described embodiments.

[0173] The coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, units, or modules, which can be electrical, mechanical, or other forms, and is used for information exchange between devices, units, or modules. The processor 910 may operate in conjunction with the memory 920. The specific connection medium between the transceiver 930, the processor 910, and the memory 920 is not limited in the embodiments of the present application.

[0174] The communication device 900 may also include a transceiver 930, and the communication device 900 can exchange information 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 called a signal transceiver unit. As shown in Figure 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-type device or circuit, the transceiver in the communication device 900 can also be an input and output circuit and / or a communication interface, which can input data (or receive data) and output data (or send data). The processor is an integrated processor or microprocessor or integrated circuit, and the processor can determine the output data based on the input data.

[0175] In one possible implementation, the communication device 900 can be applied to a first node. Specifically, the communication device 900 can be the first node, or a device capable of supporting the first node in implementing the functions of the first node in any of the aforementioned embodiments. The memory 920 stores the necessary computer programs, computer programs, instructions, and / or data for implementing the functions of the first node in any of the aforementioned embodiments. The processor 910 can execute the computer program stored in the memory 920 to perform the method performed by the first node in any of the aforementioned embodiments.

[0176] In another possible implementation, the communication device 900 can be applied to a second node. Specifically, the communication device 900 can be a second node, or a device capable of supporting the second node and implementing the functions of the second node in any of the above-mentioned embodiments. The memory 920 stores the necessary computer programs, computer programs, instructions, and / or data for implementing the functions of the second node in any of the above-mentioned embodiments. The processor 910 can execute the computer program stored in the memory 920 to perform the method performed by the second node in any of the above-mentioned embodiments.

[0177] In another possible implementation, the communication device 900 can be applied to a third node. Specifically, the communication device 900 can be a third node, or a device capable of supporting a third node and implementing the functions of the third node in any of the above-mentioned embodiments. The memory 920 stores the necessary computer programs, computer programs, instructions, and / or data for implementing the functions of the third node in any of the above-mentioned embodiments. The processor 910 can execute the computer program stored in the memory 920 to perform the method performed by the third node in any of the above-mentioned embodiments.

[0178] Since the communication device 900 provided in this embodiment can be applied to a first node to implement the method executed by the first node, or applied to a second node to implement the method executed by the second node, or applied to a third node to implement the method executed by the third node, the technical effects that can be achieved can be referred to the above method embodiments and will not be repeated here.

[0179] In the embodiments 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 the methods, steps, and logic block diagrams disclosed in the embodiments of the present application. A general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of the present application may be directly implemented as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor.

[0180] In an 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 a volatile memory (volatile memory), such as a random-access memory (RAM). The memory may also be any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto. The memory in an embodiment of the present application may also be a circuit or any other device that can implement a storage function, for storing computer programs, computer programs or instructions and / or data.

[0181] Based on the above embodiments, referring to FIG10 , an embodiment of the present application also provides another communication device 1000, including: an input / output interface 1010 and a logic circuit 1020; the input / output interface 1010 is used to receive code instructions and transmit them to the logic circuit 1020; the 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.

[0182] The following describes in detail the operations performed by the communication device when applied to the first node, the second node, or the third node.

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

[0184] Logic circuit 1020 is configured to obtain first information about a first node. Input / output interface 1010 is configured to output second information about the first node based on the first information about the first node. The first information about the first node is determined based on third information and fourth information about the first node. The third information about the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes sensed by the first node. The fourth information about the first node indicates the number of nodes that have sent the second information to the first node.

[0185] In an optional implementation, the communication device 1000 may be applied to a first node to execute the method executed by the first node, for example, the method executed by the first node in the embodiment shown in FIG. 4A .

[0186] For example, logic circuit 1020 is configured to determine a transmission order corresponding to the degree of the first node. Input / output interface 1010 is configured to output 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 about nodes connected to the first node. The degree of the first node is determined based on the number of nodes connected to the first node.

[0187] In another optional implementation, the communication device 1000 may be applied to a second node to execute the method executed by the second node, for example, the method executed by the second node in the method embodiment shown in FIG. 4A .

[0188] For example, input / output interface 1010 is configured to receive seventh information from a first node. Logic circuit 1020 is configured to, upon receiving the seventh information from the first node, subtract a preset value from the degree of the second node. Input / output interface 1010 is further configured to send the seventh information of the second node to a third node when the degree of the second node is less than or equal to a first threshold. The seventh information of the second node includes information about nodes connected to the second node and the 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.

[0189] In another optional implementation, the communication device 1000 may be applied to a third node to execute the method executed by the third node, for example, the method executed by the third node in the method embodiment shown in FIG. 4A .

[0190] The input-output interface 1010 is used 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 logic circuit 1020 is used 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, such as 1, 2, etc. The logic circuit 1020 is also used to construct network topology information based on the seventh information of the second node when the degree is less than or equal to the first threshold value. The first threshold value can be set based on an empirical value, such as 0. The network corresponding to the network topology information includes the second node and the third node.

[0191] Since the communication device 1000 provided in this embodiment can be applied to a first node to implement the method executed by the first node, or applied to a second node to implement the method executed by the second node, or applied to a third node to implement the method executed by the third node, the technical effects that can be achieved can be referred to the above method embodiments and will not be repeated here.

[0192] Based on the above embodiments, embodiments of the present application further 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 achievable can be referenced with reference to the above method embodiments and will not be further elaborated here.

[0193] Based on the above embodiments, embodiments of the present application further provide a computer-readable storage medium storing a computer program or instructions. When the instructions are executed, the method executed by the first node, the method executed by the second node, or the method executed by the third node in any of the above embodiments is implemented. The computer-readable storage medium may include various media capable of storing program code, such as a USB flash drive, a mobile hard drive, a read-only memory, a random access memory, a magnetic disk, or an optical disk.

[0194] To implement the functions of the communication device shown in Figures 7 to 8 above, embodiments of the present application further provide a chip including a processor for supporting the communication device in implementing the functions of the first node, the second node, or the third node in the above method embodiments. In one possible design, the chip is connected to a memory or includes a memory, and the memory is used to store computer programs, instructions, and data necessary for the communication device.

[0195] Those skilled in the art will appreciate that the embodiments of the present application can be provided as methods, systems, or computer program products. Therefore, the present application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0196] The present application is described with reference to the flow chart and / or block diagram of the method, device (system) and computer program product according to the embodiment of the present application. It should be understood that each flow process and / or box in the flow chart and / or block diagram and the combination of the flow process and / or box in the flow chart and / or block diagram can be realized by a computer program or instruction. These computer programs or instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processing machine or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce a device for realizing the function specified in one flow chart flow or multiple flows and / or one box or multiple boxes of the block diagram.

[0197] These computer programs or instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device that implements the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0198] These computer programs or instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0199] 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. Thus, if these modifications and variations of the embodiments of the present application fall within the scope of the claims of the present application and their equivalents, the present application also intends to include these modifications and variations.

Claims

1. A network topology construction method, characterized in that: include: The first node sends the second information of the first node according to the first information of the first node; The first information of the first node is determined according to 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 that send the second information to the first node.

2. The method according to claim 1, characterized in that The second information includes one or more of channel state information of the communication link between the first node and the node to which the first node is connected, long-term channel state information of the communication link between the first node and the node to which the first node is connected, link quality indication information of the communication link between the first node and the node to which the first node is connected, and a fading coefficient of the communication link between the first node and the node to which the first node is connected.

3. The method according to claim 1, characterized in that The second information includes transmission request information.

4. 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 information of the first node.

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

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

7. The method according to any one of claims 1 to 6, characterized in that: The first node sending the second information of the first node according to the first information of the first node includes: 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, where the fifth information indicates whether the second information of the first node is successfully transmitted.

8. The method according to any one of claims 1 to 7, characterized in that: The second information of the first node also includes the second information received by the first node.

9. A communication device, characterized in that: include: Processing unit and transceiver unit A processing unit, configured to obtain first information of a first node; The transceiver unit is configured to send second information of the first node according to the first information of the first node; The first information of the first node is determined according to 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 that send the second information to the first node.

10. The device according to claim 9, characterized in that The second information includes one or more of channel state information of the communication link between the first node and the node to which the first node is connected, long-term channel state information of the communication link between the first node and the node to which the first node is connected, link quality indication information of the communication link between the first node and the node to which the first node is connected, and a fading coefficient of the communication link between the first node and the node to which the first node is connected.

11. The device according to claim 9, characterized in that The second information includes transmission request information.

12. The device according to any one of claims 9 to 11, characterized in that: The processing unit is further configured to: The number of nodes indicated by the fourth information is subtracted from the number of nodes indicated by the third information to obtain the first information of the first node.

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

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

15. The device according to any one of claims 9 to 14, characterized in that: The transceiver unit is configured to send the second information of the first node according to the first information of the first node, specifically to: Sending second information of the first node to a second node according to the first information of the first node; Receive sixth information from the second node, where the sixth information indicates whether the second information of the first node is successfully transmitted.

16. The device according to any one of claims 9 to 15, characterized in that: The second information of the first node also includes the second information received by the first node.

17. A communication device, characterized in that: include: processor and memory; The memory is used to store computer programs or instructions; The processor is configured to execute a computer program or instruction in a memory, so as to enable the apparatus to perform the method according to any one of claims 1 to 8.

18. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are called by an electronic device, the electronic device executes the method according to any one of claims 1 to 8.

19. A computer program product, characterized in that The method comprises computer-executable instructions, and when the computer-executable instructions are run on a computer, the computer is caused to execute the method according to any one of claims 1 to 8.

Images