CN119487791A - A network topology construction method and device - Google Patents

Abstract

The present application provides a network topology construction method and device, which are used to reduce the time and overhead of constructing or updating the network topology, and relates to the field of wireless communication technology. In the method, the first node sends the second information of the first node based on the first information of the first node. Among them, 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 send the second information to the first node. Based on the above scheme, the first node can send the second information of the first node based on the first information to construct the network topology. Compared with the method of constructing the network topology based on the flooding mechanism, the transmitted information redundancy is less, and the number of information interactions is less, so the transmission overhead and construction time of the network topology can be reduced.

Description

Network topology construction method and device Technical Field

The present application relates to the field of wireless communications technologies, and in particular, to a method and an apparatus for constructing a network topology.

Background

At present, in order to effectively manage the whole network to obtain good performance in a wireless scene, a flexible and efficient dynamic management algorithm is required, and scheduling and transmission can be performed according to the real-time deployment condition of the network. This requires that nodes with actual network topology information exist in the network, that is, that the nodes can determine which nodes are in the network, and can determine connection relationships between the nodes, etc., which requires that the network topology be constructed and updated in a timely and efficient manner.

In the current construction of the network topology and the update of the network topology, a flooding-based manner is generally used. The flooding mode is based on the principle that each node in the network broadcasts the link information of the surrounding node acquired by the node during the construction of the network topology or the updating of the network topology. When one node A receives the link information of the peripheral nodes broadcasted by other nodes, the node A can have the link information of more nodes. All nodes in the network perform a broadcast once, which can be understood as completing a flood. After multiple times of flooding, nodes with global information exist in the network, and the nodes can serve as control nodes, so that the control nodes can construct network topology or update the network topology according to the global information.

However, based on the manner of constructing or updating the network topology by the flooding mechanism, redundant information to be transmitted is more, the number of information interaction times is more, and the required time is longer.

Disclosure of Invention

The application provides a network topology construction method and device, which are used for reducing transmission of redundant information and reducing time for constructing or updating network topology.

In a first aspect, a network topology method is provided. The method may be performed by a communication device or a chip that resembles the functionality of a communication device. In the method, a first node sends second information of a first node according to first information of the first node. Wherein the first information of the first node is determined based on the third information of the first node and the fourth information of the first node. The third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node. The fourth information of the first node indicates the number of nodes that send 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 one or more of the number of connected nodes, the number of perceived nodes and the number of nodes sending the second information to the first node so as to construct the network topology, compared with a mode of constructing the network topology based on a flooding mechanism, the method has the advantages that the information redundancy is less, the number of times of information interaction is less, and therefore the transmission cost and the construction time of the network topology can be reduced. Moreover, when the network topology is updated, the technical scheme is adopted, so that the time for updating the network topology can be reduced, the redundancy of information is reduced, and the interaction times of the information are reduced.

In one possible implementation, the second information includes one or more of channel state information of a communication link between the first node and a node to which the first node has a connection, long-term channel state information of a communication link between the first node and a node to which the first node has a connection, link quality indication information of a communication link between the first node and a node to which the first node has a connection, and fading coefficients of a communication link between the first node and a node to which the first node has a connection.

Based on the scheme, the first node can send the communication link information of the first node, and the communication link information is used for other nodes to determine the communication link of the first node, so that the network topology is constructed.

In one possible implementation, the second information includes transmission request information. Alternatively, 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 to which the first node has a connection, long-term channel state information of a communication link between the first node and a node to which the first node has a connection, link quality indication information of a communication link between the first node and a node to which the first node has a connection, and fading coefficients of a communication link between the first node and a node to which the first node has a connection.

Based on the scheme, the first node can determine the sequence of transmitting the communication link information of the first node through transmitting the request information, so that the information interaction times can be reduced when the communication link information of the first node is transmitted, and the expenditure and time for constructing the network topology are saved.

In one possible implementation manner, 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 scheme, the first node may send the second information of the first node after receiving the second information sent by the connected node.

In one possible implementation, the first node sends the second information of the first node when the first information is less than or equal to the first threshold. Wherein the first threshold is preset, e.g., may be set to 0,1, 2, etc. Based on the above scheme, the first node may send the second information of the first node when the number of connected nodes is less than or equal to the first threshold.

In one possible implementation, the first node sends the second information of the first node according to the first information of the first node and the fifth information of the first node. Wherein the fifth information of the first node indicates a carrier sense result or an energy detection result. And the first node sends second information of the first node according to the first information of the first node when the carrier sensing result or the energy detection result is smaller than or equal to a second threshold value. Based on the above scheme, the first node may refer to the carrier sense result or the energy detection result when transmitting the second information of the first node, so that interference may be reduced.

In one possible implementation, the first node sends 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, the sixth information indicating whether the second information of the first node is transmitted successfully. Based on the above scheme, the first node may receive the sixth information and determine whether the second information of the first node is transmitted successfully.

In one possible implementation, the second information of the first node further includes second information received by the first node. Based on the scheme, the first node can carry the received second information in the second information of the first node for transmission, and the second information is used for constructing network topology.

In a second aspect, a network topology construction method is provided. The method may be performed by a communication system that may include a first node, a second node, and a third node. In the method, a first node sends seventh information of a first node to a second node according to a transmission sequence corresponding to the degree of the first node. The seventh information of the first node includes information of nodes to which the first node is connected, and the degree of the first node is determined according to the number of nodes to which the first node is connected. The second node subtracts a preset value from the second node after receiving the seventh information of the first node. The degree of the second node is determined based on the number of nodes to which the second node is connected. And the second node sends seventh information of the second node to the third node when the degree of the second node is smaller than or equal to the first threshold value. The seventh information of the second node includes information of a node to which the second node is connected and seventh information of the first node. The third node constructs network topology information according to seventh information of the second node, and a network corresponding to the network topology information comprises the first node, the second node and the third node.

The preset value may be set according to an empirical value, for example, may be set to 1,2, etc. Similarly, the first threshold may be set based on empirical values, such as may be set to 0.

Based on the scheme, each node can send the seventh information of each node according to the transmission sequence corresponding to the degree, compared with a mode of constructing the network topology based on a flooding mechanism, the method has the advantages that the transmitted information redundancy is less, the number of times of information interaction is less, and therefore the transmission overhead and the construction time of the network topology can be reduced. Moreover, when the network topology is updated, the technical scheme is adopted, so that the time for updating the network topology can be reduced, the redundancy of information is reduced, and the interaction times of the information are reduced.

In a possible scenario, the eighth information of the first node may comprise link information of the first node, which may comprise information of a communication link known to the first node. The information of one communication link may include node information, link quality information (or link quality information) and/or beam state information of the communication link, among others.

In another possible scenario, the eighth information may be used to request transmission of the seventh information, e.g. 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.

In one possible implementation manner, the first node calculates a corresponding transmission sequence according to the degree of the first node, and after reaching a preset condition, the first node sends eighth information of the first node to the second node. The degree of the first node is used for indicating the number of nodes connected by the first node, the eighth information of the first node is used for determining the degree of the second node, and the degree of the second node is used for indicating the number of the eighth information received by the second node. And 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 to which the second node is connected. And the second node calculates a corresponding transmission sequence according to the degree of the second node, and after the preset condition is met, the second node sends eighth information of the second node to the third node. The eighth information of the second node is used to determine a degree of the third node, the degree of the third node being used to indicate an amount of the eighth information received by the third node.

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

In another example, after receiving the eighth information of the second node, the third node may subtract the preset value from the degree of the third node, and the third node may send the eighth information to the peripheral node, such as the fifth node, according to a transmission order corresponding to the degree of the third node.

Based on the above scheme, each node in the network may interact with the eighth information, thereby updating the degree, that is, determining the order in which the seventh information is transmitted.

In one possible implementation, the first node sends the eighth information of the first node on a first sending beam of the N sending beams according to a transmission sequence corresponding to the degree of the first node, and the direction of the first sending beam matches the position of the second node. The second node receives eighth information of the first node on a first receive beam of the M receive beams, the first receive beam corresponding to the first transmit beam. Wherein N and M are integers greater than or equal to 1.

Based on the above scheme, each node can transmit through the transmission beam when transmitting the eighth information, and each node can receive through the reception beam when receiving the eighth information, and the reception beam and the transmission beam at the same time correspond to each other, so that communication interference in the transmission process of the eighth information can be reduced. The corresponding mode is preset or configured. Optionally, each node transmits the eighth information in a transmission time corresponding to the specified corresponding transmission beam.

Optionally, the first receiving beam corresponds to the first transmitting beam one by one. Or the first receive beam corresponds to the first transmit beam and the X transmit beams. Or Y receive beams and the first receive beam corresponds to the first transmit beam.

In one possible implementation, the second node receives eighth information of the fourth node on a second reception beam of the M reception beams, the second reception beam matching a position of the fourth node, the eighth information of the fourth node including information of a degree of the fourth node. The second node determines that the degree of the first node is smaller than that of the fourth node according to the degree information of the first node and the degree information of the fourth node. Wherein the eighth information of the first node includes information of the degree of the first node. The second node transmits, to the first node, ninth information indicating seventh information of the first node to be transmitted by the first node.

In one possible implementation, the fourth node transmits eighth information of the fourth node to the second node on a second transmit beam of the N transmit beams, the second transmit beam corresponding to the second receive beam.

Based on the above scheme, the second node may receive the seventh information of the first node through a first receiving beam of the M receiving beams, receive the eighth information of the fourth node through a second receiving beam of the M receiving beams, compare the degree of the first node with the degree of the fourth node, send the ninth information to the node with smaller degree, and instruct the node with smaller degree to send the seventh information.

Optionally, the second receiving beam corresponds to the second transmitting beam one-to-one. Or the second receive beam corresponds to the second transmit beam and the X transmit beams. Or Y receive beams and the second receive beam correspond to the second transmit beam.

In one possible implementation, the ninth information includes an identification of the first node. Based on the above-described scheme, by the identification of the first node, each node that receives the ninth information can be made to confirm that the ninth information is indicative of the seventh information to the first node.

In one possible implementation, the transmission order of the nodes with smaller degrees is the earlier. Based on the above scheme, the transmission sequence of the nodes with smaller network degree is more advanced, namely, the nodes transmit the eighth information in the sequence from smaller illumination intensity to larger illumination intensity, so that the times of transmitting the eighth information can be reduced.

In one possible implementation, the first node is the node with the smallest degree in the network and the third node is the node with the largest degree in the network. Based on the above scheme, the first node may be the node with the smallest degree in the network, so the first node preferentially sends the second message, and the third node is the node with the largest degree in the network, so the third node may receive the eighth information of other nodes.

In a third aspect, a communication device is provided that includes a processing unit and a transceiver unit.

And the processing unit is used for acquiring the first information of the first node. And the receiving and transmitting unit is used for transmitting the second information of the first node according to the first information of the first node. Wherein the first information of the first node is determined based on the third information of the first node and the fourth information of the first node. The third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node. The fourth information of the first node indicates the number of nodes that send the second information to the first node.

In one possible implementation, the second information includes one or more of channel state information of a communication link between the first node and a node to which the first node has a connection, long-term channel state information of a communication link between the first node and a node to which the first node has a connection, link quality indication information of a communication link between the first node and a node to which the first node has a connection, and fading coefficients of a communication link between the first node and a node to which the first node has a connection.

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

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

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

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

In one possible implementation, the transceiver unit is configured to send the second information of the first node according to the first information of the first node and the fifth information of the first node, and specifically configured to send the second information of the first node according to 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.

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

In one possible implementation, the second information of the first node further includes second information received by the first node.

In a fourth aspect, a communication device is provided, which may be a communication device according to any one of the first to fourth aspects of the embodiments described above, or a chip provided in a communication device according to any one of the first to second aspects. The communication device comprises a communication interface and a processor, and optionally a memory. The memory is used for storing a computer program or instructions or data, and the processor is coupled with the memory and the communication interface, when the processor reads the computer program or instructions or data, the communication device executes the method executed by the first node, the second node or the third node in the method embodiments of any one of the first aspect to the second aspect.

It will be appreciated that the communication interface may be implemented by an antenna, feeder, 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 may be an input/output interface of the chip, such as an input/output pin etc. The communication means may further comprise a transceiver for the communication means to communicate with other devices.

In a fifth aspect, an embodiment of the present application provides a chip system, where the chip system includes a processor and may further include a memory, to implement a method performed by a communication device in any one of the first to second aspects. In one possible implementation, the chip system further includes a memory for storing program instructions and/or data. The chip system may be formed of a chip or may include a chip and other discrete devices.

In a sixth aspect, the present application provides a computer readable storage medium storing a computer program or instructions which, when executed, implement a method of each of the above aspects performed by a first node, or implement a method of each of the above aspects performed by a second node, or implement a method of each of the above aspects performed by a third node.

In a seventh aspect, there is provided a computer program product comprising computer program code or instructions which, when executed, cause a method of the above aspects to be performed by a first node, or cause a method of the above aspects to be performed by a second node, or cause a method of the above aspects to be performed by a third node.

In an eighth aspect, there is provided a communication device comprising units or modules for performing the methods of the above aspects.

Advantageous effects of the above third to eighth aspects and implementations thereof reference may be made to the description of advantageous effects of the methods of the first and second aspects and implementations thereof.

Drawings

Fig. 1A is a schematic diagram of a first flooding process in a scheme for constructing a network topology based on a flooding mechanism according to an embodiment of the present application;

fig. 1B is a schematic diagram of a second flooding process in a scheme for constructing a network topology based on a flooding mechanism according to an embodiment of the present application;

FIG. 2 is a schematic diagram of a multi-node authoring network in accordance with an embodiment of the present application;

Fig. 3 is one of exemplary flowcharts of a network topology construction method according to an embodiment of the present application;

Fig. 4A is an exemplary flowchart of a network topology construction method according to an embodiment of the present application;

fig. 4B is a schematic diagram of an interaction process of second information in the network topology construction method according to the embodiment of the present application;

Fig. 4C is a schematic diagram of an interaction process of first information in the network topology construction method according to the embodiment of the present application;

Fig. 5A is a schematic diagram of spatial direction allocation of a transmission beam according to an embodiment of the present application;

fig. 5B is a schematic diagram of spatial direction allocation of a received beam according to an embodiment of the present application;

Fig. 6 is a schematic diagram of an information interaction process in a network topology construction method according to an embodiment of the present application;

fig. 7 is a schematic diagram of a communication device according to an embodiment of the present application;

fig. 8 is a schematic diagram of a communication device according to an embodiment of the present application;

FIG. 9 is a schematic diagram of a communication device according to an embodiment of the present application;

Fig. 10 illustrates one of schematic diagrams of a communication device according to an embodiment of the present application.

Detailed Description

Technical terms related to the embodiments of the present application are described below.

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

There may be a class of nodes in the network topology that may be used to schedule other nodes, which may be referred to as control nodes. The control nodes may include a central control node and distributed control nodes. In a possible scenario, a central control node may schedule each node in the network in which the central control node is located (i.e., the network to which the network topology corresponds). In another possible scenario, a distributed control node may schedule one or more nodes around the distributed control node, which may form a subnet, and the distributed control node may include multiple subnets in a network.

Alternatively, the central control node and the distributed control nodes may exist in one network at the same time. The central control node may be a distributed control node in a certain subnet.

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

In research and future application of the network, the wireless self-organizing network is always a discussed hot spot because of a wider application scene and a more complex and open research content. The wireless self-organizing network can enable the whole network to achieve better performance in different application scenes through self-organization and self-cooperation of a plurality of nodes in the network. A typical application of a wireless ad hoc network, such as a wireless sensor network, may be the transmission of sensor data through the deployment of distributed sensors. Taking a vehicle-to-vehicle (vehicle to vehicle, V2V) network in a wireless sensor network as an example, a distributed sensor can be deployed on vehicles in the V2V network, and the distributed sensor can collect road condition information, so that the collected road condition information can be interacted between the vehicles. Most wireless ad hoc networks have flexible and dynamic features because nodes can dynamically join or leave. For example, a wireless sensor network can be deployed with distributed sensors so as to add new nodes, and old nodes can also exit the wireless sensor network due to insufficient electric quantity or faults. It will be appreciated that the individual nodes in the wireless ad hoc network may also be mobile.

For example, for a V2V network, distributed sensors deployed on-board a vehicle may also join the V2V network or exit the V2V network due to movement of the vehicle. To accommodate such flexible self-organizing machines, the scheduled transmissions for distributed sensors in V2V networks can generally be divided into two broad categories. The first category includes scheduled transmissions based on a deterministic network topology. The scheduling transmission based on the deterministic network topology means that a central control node storing global information exists in the network, and the central control node can establish the network topology or update the network topology based on the global information so as to schedule the nodes in the network. However, since the control node needs to store global information, the time needed is long, and for a high-dynamic network with a faster node moving speed, the network topology may need to be updated frequently, so that the central control node needs to update the global information frequently to update the network topology, and the time for updating the global information by the central control node may be longer than the actual update time of the network topology, so that the scheduling transmission based on the deterministic network topology is not suitable for the high-dynamic network topology with a faster node moving speed.

The second category for scheduled transmissions of distributed sensors in V2V networks includes scheduled transmissions based on random network topology. Scheduling transmissions based on a random network topology means that no global information is needed, but information is broadcast to the final nodes based on a flooding pattern. The technical scheme of broadcasting information based on the flooding mode is described in detail later.

At present, in order to effectively manage the whole network to obtain good performance in a wireless scene, a flexible and efficient dynamic management algorithm is required, and scheduling and transmission can be performed according to the real-time deployment condition of the network. This requires that in the network there be a control node storing the actual network topology information, that is, that the control node is able to determine which nodes are in the network, and to determine the connection relationships between the nodes, etc., so that the network topology can be constructed and updated in a timely and efficient manner.

Currently, the construction of the entire network topology and the updating of the network topology can be divided into two phases. The first stage is that a node in the network acquires link information of surrounding nodes to acquire which nodes of the node and the surrounding have communication links, and acquires quality parameters of the communication links and the like. The second stage is that the nodes in the network collect the network topology information to the control node according to the acquired link information of the peripheral nodes, so that the control node can acquire the link information of all nodes in the network or the sub-network of the network.

In the current construction of the network topology and the update of the network topology, a flooding-based manner is generally used. The flooding mode is based on the principle that each node in the network broadcasts the link information of the surrounding node acquired by the node during the construction of the network topology or the updating of the network topology. When one node A receives the link information of the peripheral nodes broadcasted by other nodes, the node A can have the link information of more nodes. All nodes in the network perform a broadcast once, which can be understood as completing a flood. After multiple times of flooding, nodes with global information exist in the network, and the nodes can serve as control nodes, so that the control nodes can construct network topology or update the network topology according to the global information.

In the process of constructing the network topology or updating the network topology, since the information is collected by using a flooding manner, one disadvantage is that there is a large amount of redundant information to be transmitted, which results in low transmission efficiency, and each node needs to broadcast information to the peripheral nodes, which results in a large interference in the broadcasting stage. Furthermore, each node needs to receive information from all nodes around, which requires a long time for each flooding. For ease of understanding, the flooding scheme is described below in connection with fig. 1A and 1B. Fig. 1A and 1B illustrate a process of constructing a network topology.

In fig. 1A and 1B, the black dots indicate nodes, the dashed lines indicate that a communication link exists between two nodes, and the double-headed arrow indicates that two parties can perform double-headed communication through the communication link, that is, information interaction. All communication links shown in fig. 1A and 1B are numbered, with the number numbers on the corresponding communication links in the figures. In fig. 1A, each node within the network may broadcast information of a communication link (hereinafter also simply referred to as link information) to a peripheral node at the time of the first flooding. For example, the node 1 broadcasts link information, and since the node 1 and the node 3 have communication links, the link information of the node 1 and the node 3 is included in the link information of the node 1. Node 3 may receive the link information broadcast by node 1. Thus, node 3 can have the link information of node 3 and the link information of node 1. For another example, node 3 may broadcast link information, and since node 3 has communication links with node 1, node 4, node 5, and node 6, respectively, the link information broadcast by node 3 may include link information of node 3 and node 1, link information of node 3 and node 4, link information of node 3 and node 5, and link information of node 3 and node 6. Node 1, node 4, node 5, and node 6 may receive the link information broadcast by node 3. Thus, node 1 may have the link information of node 3 and the link information of node 1, node 4 may have the link information of node 3 and the link information of node 4, node 5 may have the link information of node 3 and the link information of node 5, and node 6 may have the link information of node 3 and the link information of node 6. And so on, node 2, node 4, node 5, node 6, node 7 and node 8 all broadcast link information. Wherein the numerals in brackets below the node in fig. 1A represent the link information possessed by the node after the end of the first flooding.

On the second flooding, nodes within the network may broadcast link information received by the node from other nodes to the surrounding nodes. For example, node 1 may broadcast the link information received from node 3, namely the link information of node 3 with node 1, the link information of node 3 with node 4, the link information of node 3 with node 5, and the link information of node 3 with node 6. As another example, node 3 may broadcast link information received from node 1, node 4, node 5, and node 6, and so on. Wherein the numerals in brackets below the node in fig. 1B represent the link information owned by the node after the second flooding is completed.

Referring to the link information broadcast by each node in fig. 1A and 1B, in the second flooding, many link information in the link information broadcast by each node may be repeatedly broadcast by different nodes. For example, the node 6 receives link information broadcast by the node 3, the node 4, the node 5, and the node 7, and there is duplicated link information in the link information broadcast by these nodes, such as link information of the node 3 and the node 4, link information of the node 3 and the node 5, and so on. Furthermore, it can be known that, with reference to the link information possessed by each node in fig. 1A and 1B, a minimum of 40 times and 53 times of transfer of link information are required in order to obtain global information. In practice, since redundancy-free transmission of link information is almost impossible, the amount of link information actually transmitted may be significantly greater than 53. Therefore, the network topology construction method based on the flooding mechanism needs more redundant information to be transmitted and needs longer time.

In view of this, the embodiment of the application provides a network topology construction method. In the method, each node in the network can send information according to a certain transmission sequence, so that the interference during information transmission can be reduced, the information interaction times can be reduced by sending the information according to the transmission sequence, the transmission of redundant information is reduced, and the time length during network topology construction is shortened.

The following describes a network topology construction method provided by the embodiment of the present application with reference to the accompanying drawings.

The technical scheme provided by the embodiment of the application can be applied to a multi-node cooperative network. A node comprised by a multi-node cooperative network may be full duplex capable. Referring to fig. 2, a schematic diagram of a multi-node cooperative network 200 according to an embodiment of the present application is provided. The multi-node collaboration network 200 may include one or more nodes, 8 nodes being an example in FIG. 2. In fig. 2, black dots represent nodes, and broken lines represent communication links between two nodes. A node may be a physical device, such as a terminal device, an Access Point (AP), a relay device, or the like, or a node may be a logical device, such as a logical module disposed on the physical device. In the multi-node cooperative network 200, information transmission is possible between nodes where communication links exist. For example, the communication link information may be transmitted.

Referring to fig. 3, an exemplary flowchart of a network topology construction method according to an embodiment of the present application may include the following operations.

S301, the first node sends second information of the first node according to the first information of the first node.

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

And S302, the second node builds a network topology.

Wherein the first information of the first node may be 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 third information of the first node indicates the number of nodes perceived by the first node. Alternatively, 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 send the second information to the first node.

For example, the first node may send the second information of the first node when the number of nodes indicated by the first information of the first node is less than or equal to the first threshold. Wherein the first threshold may be set according to an empirical value, such as may be set to 0, 1, 2, etc.

For another example, the first node may 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. Optionally, the first node may send the second information of the first node when the number of nodes indicated by the first information of the first node is less than or equal to the first threshold.

Optionally, the first node may send the second information of the first node according to the first information of the first node when the carrier sense result or the energy detection result is less than or equal to the second threshold. It will be appreciated that the carrier sense result or the energy detection result may be obtained by the first node listening to the communication link. The embodiment of the application does not specifically limit the mode of acquiring the carrier sensing result and the energy monitoring result.

In a 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.

In one example, the second information includes one or more of channel state information of a communication link between the first node and a node to which the first node has a connection, long-term channel state information of a communication link between the first node and a node to which the first node has a connection, link quality indication information of a communication link between the first node and a node to which the first node has a connection, and a fading coefficient of a communication link between the first node and a node to which the first node has a connection.

In another example, the second information may include transmission request information. Alternatively, the transmission request information may be used to request transmission of one or more of the above-mentioned 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 fading coefficients of the communication link between the first node and the node to which the first node is connected.

Hereinafter, description will be made of a case where the second information includes different information, respectively. For convenience of distinction, the second information including transmission request information may be referred to as eighth information, and the second information including communication link information of the first node may be referred to as seventh information.

Referring to fig. 4A, a flowchart of a network topology construction method according to an embodiment of the present application includes the following operations.

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

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

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

In one example, each node in the first network may determine the order of transmission of the node based on a timer. For example, each node in the first network may maintain a plurality of timers and send the seventh information when the corresponding timer is started. Wherein one timer may correspond to one degree. In the first network, each node may start sequentially for a plurality of timers, where when one timer expires, the next timer is restarted. Different nodes may start timers synchronously or different nodes start the first timer at the same time. And the starting sequence of the timers is the same for different nodes, for example, each node starts the timer A1 first and then starts the timer A2. Alternatively, when the timer is started, the timer may be started sequentially from the smaller to the larger of the corresponding degrees. For example, each node in the first network starts the timer A1 in synchronization, and during the operation of the timer A1, the node with the degree A1 may transmit the seventh information. At the end of the timer A1, each node in the first network may start a timer A2 corresponding to the degree A2, and during the running of the timer A2, the node with the degree A2 may send seventh information, and so on. For the first node, the seventh information may be transmitted to the second node during the timer run corresponding to the degree of the first node.

It will be appreciated that for a node, one degree corresponds, and that node corresponds to the timer to which that degree corresponds. The node may send seventh information when the timer starts or during the running of the timer.

In another example, each node in the first network may determine the transmission order of the node according to the correspondence between the transmission time and the degree. For example, each node in the first network may store a transmission time corresponding to a different degree. Alternatively, the smaller the degree, the more forward the transmission time. For example, at time A1, a node with a degree of A1 may send seventh information, at time A2, a node with a degree of A2 may send seventh information, and so on. Wherein, the time A2 is after the time A1, and the degree A1 is smaller than the degree A2. The seventh information may be transmitted to the second node by the first node at a time corresponding to the degree of the first node.

It will be appreciated that the lower the degree of the node in the first network, the earlier the transmission order. For example, the first node is the node with the smallest degree of first network.

Alternatively, 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 fig. 4A may also include S400A and S400B, e.g., S400A and S400B may occur before S401.

And S400A, the first node sends eighth information of the first node to the second node according to the transmission sequence corresponding to the degree of the first node. Accordingly, the second node receives eighth information of the first node from the first node.

The degree of the first node may be understood as the number of nodes having communication links with the first node. For example, in fig. 1A, node 1 has a communication link with node 3, and node 1 has no communication link with other nodes, then the degree of node 1 may be 1. As another example, in fig. 1A node 3 has communication links with node 1, node 4, node 5, and node 6, and no communication links with other nodes, then the degree of node 3 may be 4.

In a possible case, 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 requesting transmission of the seventh information in S301 (i.e., the seventh information of the first node).

In S400A, the first node may transmit eighth information of the first node to the second node in a transmission order corresponding to the degree of the first node. For example, each node in the first network may store a correspondence between the degree and the transmission order, and the first node may determine the transmission order of the first node according to the correspondence between the degree and the transmission order and according to the degree of the first node. For this, reference may be made to the embodiment in S401 that the first node determines the transmission sequence according to the degree of the first node, which is not described herein.

It will be appreciated that the lower the degree of the node in the first network, the earlier the transmission order. The first node is the node with the smallest degree in the first network.

Alternatively, each node may perform a listen before talk (listen before talk, LBT) operation before unicasting the eighth information to one of the peripheral nodes. For example, taking the first node as an example of transmitting the eighth information to the second node, the first node may perform LBT to determine whether a communication link between the first node and the second node is idle before transmitting the eighth information to the second node, and transmit the eighth information to the second node when LBT is successful, i.e., it is determined that the communication link between the first node and the second node is idle.

And S400B, after receiving eighth information of the first node, the second node subtracts a preset value from the second node.

The preset value may be set according to an empirical value, for example, may be set to 1, 2, etc.

S400B may be one possible implementation of the second node determining the first information of the second node. For example, the second node may subtract the number of nodes indicated by the third information (e.g., the degree of the second node) from the number of nodes indicated by the fourth information, e.g., from the number of eighth information received.

For example, the second node is node 3 in fig. 1A. For example, the degree of the node 3 is 4, and after receiving the eighth information of the node 1, the node 3 may subtract a preset value, for example, 1, from the degree of the node 3, and then the degree of the node 3 becomes 3.

In one example, the second node may also send eighth information to one of the peripheral nodes, such as the third node. For example, the second node is node 3 in fig. 1A. After receiving the eighth information of the node 1, the node 3 changes the degree of the node 3 to 3, so the node 3 can transmit the eighth information to one of the peripheral nodes in the transmission order corresponding to the illuminance of 3.

The manner in which the second node transmits the eighth information to one of the peripheral nodes may refer to the manner in which the first node transmits the eighth information to the second node in S400A. Similarly, the third node may send eighth information to one of the peripheral nodes until the node with the highest degree can determine the nodes included in the first network and link information between the nodes.

Hereinafter, S400A and S400B are described with reference to fig. 4B.

Referring to fig. 4B, dots represent nodes, dashed lines represent communication links between two nodes, and double-headed arrows represent two-way communication, i.e., information interaction, via the links. All links shown are numbered in fig. 4B, with the numerical numbers on the corresponding links in the figure. As can be seen from fig. 4B, the degree of node 1 is 1, the degree of node 2 is 1, the degree of node 3 is 4, the degree of node 4 is 3, the degree of node 5 is 3, the degree of node 6 is 4, the degree of node 7 is 3, and the degree of node 8 is 1.

The nodes 1 to 8 may send the eighth information to the peripheral nodes in the transmission order corresponding to the illuminance, respectively. In a possible scenario, the transmission order of the nodes with smaller degree in the network is the earlier. Thus, in fig. 4B, first, the node 1, the node 2, and the node 8 of degree 1 transmit eighth information to each of the peripheral nodes. For example, node 1 may send eighth information to node 3, node 2 may send eighth information to node 4, and node 8 may send eighth information to node 7. Each node that receives the eighth information may subtract the degree by a preset value, such as subtracting 1. For example, node 3 may subtract 1 from the degree such that the degree of node 3 becomes 3. Node 4 may subtract 1 from the degree such that the degree of node 4 becomes 2. Node 7 may subtract 1 from the degree such that the degree of node 7 becomes 2. Next, the eighth information is transmitted to one of the peripheral nodes by the node 4 and the node 7 having the degree of 2. For example, node 4 may send eighth information to node 6 and node 7 may send eighth information to node 5. Each node that receives the eighth information may subtract the degree by a preset value, such as subtracting 1. For example, node 6 may subtract 1 from the degree such that the degree of node 6 becomes 3, and node 5 may subtract a preset value from the degree such that the degree of node 5 becomes 2. Since the degree of the node 5 becomes 2, when the node of the degree 2 transmits the eighth information to one of the peripheral nodes, the node 5 may also transmit the eighth information to one of the peripheral nodes, such as the node 3. Thus, the degree of the node 3 may become 2. Thus, the node 3 may also transmit the eighth information to one of the peripheral nodes, such as the node 6, when the node having the degree of 2 transmits the eighth information to the one of the peripheral nodes.

Through the link information interaction manner shown in fig. 4B, each node may transmit eighth information to one node in the peripheral nodes, and then the node with the highest degree, such as node 6, may acquire which nodes are included in the network.

Based on S400A and S400B described above, each node in the network can determine its own degree. Wherein the degree is used to indicate the amount of eighth information received. For example, the degree of the second node may be the amount of eighth information received by the second node. As shown in fig. 4B, node 3 receives the eighth information of node 1 and node 5, and thus the degree of node 3 is 2. As another example, as shown in fig. 4B, node 6 has received the eighth information of node 4 and node 6, so the degree of node 6 is 2, and so on, each node in the network may update the degree according to the amount of the eighth information received.

Thus, in S401, the first node may send seventh information to the peripheral node according to the transmission order corresponding to the degree of the first node. Wherein the first node may send the seventh information to the node, such as the second node, that received the eighth information of the first node. As shown in fig. 4B, the node 1 transmits eighth information to the node 3, and then the node 1 may transmit the eighth information to the node 3 in S401. And so on, node 5 sent the eighth information to node 3, then node 5 may send the seventh information to node 3 in S401.

And S402, after receiving the seventh information of the first node, the second node subtracts a preset value from the degree of the second node.

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

S402 may be one possible implementation of the second node determining the first information of the second node. For example, the second node may subtract the number of nodes indicated by the third information (e.g., the degree of the second node) from the number of nodes indicated by the fourth information, e.g., from the number of seventh information received.

And S403, when the degree of the second node is smaller than or equal to the first threshold value, the second node sends seventh information of the second node to the third node.

Wherein the first threshold may be set according to an empirical value, such as may be set to 0.

For example, the second node is node 3 in fig. 4B. For example, after receiving the eighth information of the node 1, the node 3 may subtract a preset value, for example, 1, from the degree so that the degree of the node 3 becomes 1. Similarly, after node 3 receives the eighth information of node 5, node 3 may subtract the degree by a preset value, for example, 1, such that the degree of node 3 becomes 0. Node 3 may send the seventh information to one of the peripheral nodes when the degree is less than or equal to 0. Wherein node 3 may send the seventh information to the node that received the eighth information of node 3, i.e. node 6.

Hereinafter, S401 to S403 are described by fig. 4C.

In the manner shown in fig. 4B, each node in the network updates its own degree. In fig. 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.

The nodes 1 to 8 may send the seventh information to the peripheral nodes in the transmission order corresponding to the illuminance, respectively. In a possible scenario, the transmission order of the nodes with smaller degree in the network is the earlier. Thus, in fig. 4C, the node 1, the node 2, and the node 8 having the degree of 0 each transmit seventh information to one of the peripheral nodes. One of the peripheral nodes may be a node that receives the eighth information. For example, node 1 may send seventh information to node 3, node 2 may send seventh information to node 4, and node 8 may send seventh information to node 7. Each node that receives the seventh information may subtract the degree by a preset value, such as subtracting 1. For example, node 3 may subtract 1 from the degree such that the degree of node 3 becomes 1. Node 4 may subtract 1 from the degree such that the degree of node 4 becomes 0. Node 7 may subtract 1 from the degree such that the degree of node 7 becomes 0. Next, the seventh information is transmitted to one of the peripheral nodes by the node 4 and the node 7 having the degree of 0. For example, node 4 may send seventh information to node 6 and node 7 may send seventh information to node 5. Each node that receives the seventh information may subtract the degree by a preset value, such as subtracting 1. For example, node 6 may subtract 1 from the degree such that the degree of node 6 becomes 1, and node 5 may subtract a preset value from the degree such that the degree of node 5 becomes 0. Next, the seventh information is transmitted to one of the peripheral nodes by the node 5 having the degree of 0. For example, node 5 may send seventh information to node 3. Thus, the degree of the node 3 may become 0. Thus, node 3 may send the seventh information to node 6.

Based on the manner shown in fig. 4C, each node may transmit seventh information to one node of the peripheral nodes, and then the node with the highest degree, such as node 6, may obtain global link information in the network.

And S404, the third node constructs network topology information according to the seventh information of the second node.

And constructing network topology information by the link information acquired by the third node. The network corresponding to the network topology information comprises a first node, a second node and a third node. For example, the third node is node 6 in fig. 4C. Through the processes shown in fig. 4B and 4C, the node 6 can acquire link information of the network, so that the node 6 can construct network topology information. The network corresponding to the network topology information comprises a node 1, a node 2, a node 3, a node 4, a node 5, a node 6, a node 7 and a node 8.

Based on the technical scheme shown in fig. 4A, in the construction process of the network topology, compared with the method of constructing the network topology based on the flooding mechanism, the redundancy of transmitted information is less, and the number of times of information interaction is less, so that the construction time of the network topology can be reduced. Moreover, when the network topology is updated, the technical scheme shown in fig. 4A is adopted, so that the time for updating the network topology can be reduced, the redundancy of information is reduced, and the interaction times of the information are reduced.

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

For example, the spatial allocation relationship of the beams, such as the spatial allocation relationship of the transmit and receive beams, may be predefined or preconfigured. For example, the transmit beam has N directions and the receive beam has M directions. It can be understood that in the spatial allocation relationship of beams between different nodes, the directions corresponding to the transmission beams with the same number are identical, and the directions corresponding to the reception beams are also identical. Wherein N is an integer greater than or equal to 1, and M is an integer greater than or equal to 1. N may be equal to M, i.e. one transmit beam corresponds to one receive beam. Alternatively, N may be different from M. For example, a transmission beam may correspond to a plurality of reception beams, and the transmission beam may be regarded as a wide beam, and the reception beam may be regarded as a narrow beam, that is, a direction of the wide beam corresponds to a direction of the plurality of narrow beams. For another example, the plurality of transmission beams may correspond to one reception beam, and the transmission beam may be regarded as one narrow beam, and the reception beam may be regarded as one wide beam, that is, the direction of one wide beam corresponds to the directions of the plurality of narrow beams.

When n=m=1, it means that each node in the network adopts omni-directional beams to transmit and receive the seventh information and/or the eighth information in the stage of network topology construction.

Referring to fig. 5A, a schematic diagram of spatial direction allocation for a transmit beam is shown. In fig. 5A, a total of 4 directions of transmission beams are illustrated as an example. Referring to fig. 5B, a schematic diagram of spatial direction allocation of a received beam is shown. In fig. 5B, a total of 4 directions of the reception beam are illustrated as an example. As can be seen from fig. 5A and fig. 5B, the beam is divided into 4 directions by a planar space, corresponding to one quadrant each. In fig. 5A and 5B, if one node is to receive in the R1 direction, only the transmit beam from the T1 direction can be received. Similarly, if a node is to receive in the R2 direction, only the transmit beam in the T2 direction can be received. It can be seen that the R1 receiving direction corresponds to the T1 transmitting direction and the R2 receiving direction corresponds to the T2 transmitting direction. Similarly, the R3 receiving direction corresponds to the T3 receiving direction, and the R4 receiving direction corresponds to the T4 receiving direction.

In one possible implementation manner, in S401 and/or S400A, when the first node transmits the seventh information and/or the eighth information, the seventh information and/or the eighth information may be transmitted to the second node through a preset transmission beam. For example, in S400A, the first node may transmit eighth information of the first node to the second node on the first transmission beam in a transmission order corresponding to the degree of the first node. Wherein the first transmit beam may be determined based on a spatial allocation relationship of the predefined or preconfigured beams. The direction of the first transmit beam matches the location of the second node. It will be appreciated that the direction or location of the peripheral node may be determined during the acquisition of the seventh information at each node in the network. Thus, each node can determine which direction of the transmission beam to transmit the eighth information when transmitting the eighth information.

For example, referring to fig. 4B, where node 3 is located in the direction of the fourth quadrant of node 1, then node 1 may send eighth information to node 3 in the direction T1. The node 3 may receive in the R1 direction upon receiving the seventh information from the node 1.

In another possible implementation manner, in combination with the spatial allocation relation of the beams, each node in the network may receive the eighth information in the same direction at a certain stage, and each node may send the eighth information in the same direction. For example, each node receives the eighth information and transmits the eighth information in the order shown in fig. 6. In fig. 6, during the R1 phase, each node in the network receives in the R1 direction, and each node in the network may transmit in the T1 direction. In the R2 phase, each node in the network receives in the R2 direction and each node in the network may transmit in the T2 direction. And so on, in the Request phase (Request, ri) phase, each node in the network may interact with eighth information. Where i takes M from 1.

For example, assume that during the R1 phase, node A receives eighth information in the R1 direction. At this time, it is assumed that there are two transmitting ends in the R1 direction, node B and node C, respectively. Node B and node C transmit eighth information in the T1 direction, respectively. Assume again that the degree of node B is d1 and the degree of node C is d2, d1> d2. The timer of node C expires first, since the transmission order is earlier the smaller the degree. Alternatively, after expiration of the node C's timer, the node C may perform a listen before talk (listen before talk, LBT) operation, and if LBT is successful, the node C may send an eighth message to the node a, e.g., if LBT is unsuccessful, the node C does not send a transmission request to the node a. After receiving the eighth information of the node C, the node a may send a reservation signal in the T1 direction. In this way, when the LBT operation is performed after the expiration of the timer of the node B, the transmission of the eighth information is not performed due to the LBT failure, so that interference can be effectively avoided.

Alternatively, when each node in the R phase sends the eighth information, a code division multiple access (code division multiple access, CDMA) manner may be adopted to transmit simultaneously by multiple nodes, where the receiving node does not need to send a reservation signal, and the sending node does not need to LBT.

After each node in the network performs the interaction of the eighth information, that is, after the R phase is completed, the request response phase (Answer, a phase) is entered. And each node in the network in the A stage is used as a receiving end, and the degree carried in the eighth information is compared with the degree of the node according to the eighth information received in the R stage. After the comparison is completed, if the degree of a certain node around is the lowest, ninth information is sent to the node in the A stage. The ninth information is used to instruct the node to transmit seventh information of the node, or the ninth information may be used to instruct the node that the degree of the node is minimum in the network.

For example, after the node a receives the eighth information of the node B and the eighth information of the node C, the degree of the node B, the degree of the node C, and the degree of the node a may be compared. If the degree of node B is the lowest, node A may send ninth information to node B. If the degree of node C is the lowest, node A may send ninth information to node C. If the degree of the node a is the lowest, the node a need not transmit the ninth information, but may receive the ninth information of the peripheral node.

It is understood that the ninth information may carry Identity (ID) information of the node, such as an identity of the node. For example, if node a sends the ninth information to node B, the ninth information may carry the identity information of node B. In this way, even if the ninth information is received at the plurality of nodes, the notified node can be determined from the identity information of the node B carried in the ninth information.

Through the R-phase and the a-phase, each node in the network may implement transmission of eighth information. Optionally, the embodiment of the application also designs a Data transmission stage (Data, D stage). In stage D, the node that received the ninth information may send a response to the node that sent the ninth information to indicate that the ninth information was received. For example, after receiving the ninth information from node a, node B may send a response to node a in stage D to indicate to node a that the ninth information was received.

After the D phase is finished, each node in the network may perform interaction of seventh information as shown in S401, S402, S403, and S404 to construct network topology information.

In the technical scheme provided by the embodiment of the application, after the network topology information is constructed, the third node can transmit the network topology information to other nodes in the network. For example, the third node acts as a source, and is transmitted via relay via the source, and reaches the sink via multiple hops via a path. For example, the third node is node 6 in fig. 4C. After the node 6 constructs the network topology information, the network topology information may be sent to the node 4, the node 3, the node 5, and the node 7 having communication links with the node 6. Node 7 may send the network topology information to node 8 having a communication link with node 7, node 4 may send the network topology information to node 2 having a communication link with node 4, and node 3 may send the network topology information to node 1 having a communication link with node 3.

Communication devices for implementing the above method in the embodiments of the present application are described below with reference to the accompanying drawings. Therefore, the above contents can be used in the following embodiments, and repeated contents are not repeated.

Fig. 7 is a schematic block diagram of a communication device 700 according to an embodiment of the present application. The communication apparatus 700 may correspond to implementing the functions or steps implemented by the first node, the second node or the third node in the above-described respective method embodiments. The communication device may include a processing unit 710 and a transceiving unit 720. Optionally, a storage unit may be included, which may be used to store instructions (code or programs) and/or data. The processing unit 710 and the transceiver unit 720 may be coupled to the storage unit, for example, the processing unit 710 may read instructions (codes or programs) and/or data in the storage unit to implement the corresponding methods. The units can be independently arranged or partially or fully integrated.

In some possible embodiments, the communications apparatus 700 can correspondingly implement the behavior and the functions of the first node in the method embodiments described above. For example, the communication device 700 may be the first node, or may be a component (e.g., a chip or a circuit) applied in the first node. The transceiving unit 720 may be used to perform all receiving or transmitting operations performed by the first node in the embodiment shown in fig. 3. Such as S301 in the embodiment shown in fig. 3 and/or other processes for supporting the techniques described herein, wherein the processing unit 710 is configured to perform all operations performed by the first node in the embodiment shown in fig. 3, except for transceiving operations, and/or other processes for supporting the techniques described herein.

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

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

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

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

In one possible implementation, the transceiver unit 720 is configured to send the second information of the first node according to the first information of the first node and the fifth information of the first node, and specifically configured to send the second information of the first node according to 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.

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

In some possible embodiments, the communications apparatus 700 can correspondingly implement the behavior and the functions of the first node in the method embodiments described above. For example, the communication device 700 may be the first node, or may be a component (e.g., a chip or a circuit) applied in the first node. The transceiving unit 720 may be used to perform all the receiving or transmitting operations performed by the first node in the embodiment shown in fig. 4A. Such as S400A, S, 401 in the embodiment shown in fig. 4A, and/or other processes for supporting the techniques described herein, wherein the processing unit 710 is configured to perform all operations performed by the first node in the embodiment shown in fig. 4A, except for transceiving operations, and/or to support other processes for the techniques described herein.

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

In some possible embodiments, the communications apparatus 700 can correspondingly implement the behavior and the functions of the second node in the method embodiments described above. For example, the communication device 700 may be the second node, or may be a component (e.g., a chip or a circuit) applied to the second node. The transceiving unit 720 may be used to perform all receiving or transmitting operations performed by the second node in the embodiment shown in fig. 4A. Such as S400A, S and S403 in the embodiment shown in fig. 4A, and/or other processes for supporting the techniques described herein, wherein the processing unit 710 is configured to perform all operations performed by the second node, except for transceiving operations, such as S400B and S402 in the embodiment shown in fig. 4A, and/or other processes for supporting the techniques described herein.

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

In some possible implementations, the communications apparatus 700 can correspondingly implement the behavior and the functions of the third node in the method embodiments described above. For example, the communication device 700 may be the third node, or may be a component (e.g., a chip or a circuit) applied in the third node. The transceiving unit 720 may be used to perform all receiving or transmitting operations performed by the third node in the embodiment shown in fig. 4A. Such as S403 in the embodiment shown in fig. 4A, and/or other processes for supporting the techniques described herein, wherein the processing unit 710 is configured to perform all operations performed by the third node except for the transceiving operations, such as S404 in the embodiment shown in fig. 4A, and/or other processes for supporting the techniques described herein.

For example, the transceiver unit 720 is configured to receive seventh information from the second node. The third node has a degree greater than the degree of the second node. The degree of the second node is determined according to the number of nodes to which the second node is connected, and the degree of the third node is determined according to the number of nodes to which the third node is connected. The processing unit 710 is configured to subtract the preset value from the degree of the third node after receiving the seventh information from the second node. It is understood that the preset value may be empirically set, such as may be set to 1,2, etc. The processing unit 710 is further configured to construct network topology information according to the seventh information of the second node when the degree is less than or equal to a first threshold, which may be set according to an empirical value, for example, may be set to 0. The network corresponding to the network topology information comprises a second node and a third node.

Regarding the operations performed by the processing unit 710 and the transceiver unit 720, reference may be made to the description of the foregoing method embodiments.

It should be appreciated that the processing unit 710 in the embodiments of the present application may be implemented by a processor or a processor-related circuit component, and the transceiver unit 720 may be implemented by a transceiver or a transceiver-related circuit component, or a communication interface.

Based on the same concept, as shown in fig. 8, an embodiment of the present application provides a communication apparatus 800. The communication device 800 includes a processor 810. Optionally, the communication device 800 may further comprise a memory 820 for storing instructions executed by the processor 810 or for storing input data required by the processor 810 to execute instructions or for storing data generated after the processor 810 executes instructions. Processor 810 may implement the methods shown in the method embodiments described above through instructions stored in memory 820.

Based on the same concept, as shown in fig. 9, an embodiment of the present application provides a communication apparatus 900, and the communication apparatus 900 may be a chip or a chip system. Alternatively, the chip system in the embodiment of the present application may be formed by a chip, and may also include a chip and other discrete devices.

The communication device 900 may include at least one processor 910, the processor 910 coupled to a memory, which may optionally be located within the device or external to the device. For example, the communications apparatus 900 can also include at least one memory 920. The memory 920 stores computer programs, configuration information, computer programs or instructions and/or data necessary to implement any of the embodiments described above, and the processor 910 may execute the computer programs stored in the memory 920 to perform the methods of any of the embodiments described above.

The coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, units, or modules, which may be in electrical, mechanical, or other forms for information interaction between the 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 embodiment of the present application.

The communication apparatus 900 may further include a transceiver 930, and the communication apparatus 900 may perform information interaction with other devices through the transceiver 930. The transceiver 930 may be a circuit, bus, transceiver, or any other device that may be used to interact with information, or referred to as a signal transceiver unit. As shown in fig. 9, the transceiver 930 includes a transmitter 931, a receiver 932, and an antenna 933. In addition, when the communication device 900 is a chip-type device or circuit, the transceiver in the communication device 900 may be an input/output circuit and/or a communication interface, may input data (or receive data) and output data (or transmit data), and the processor may be an integrated processor or a microprocessor or an integrated circuit, and the processor may determine the output data according to the input data.

In a possible implementation manner, the communication apparatus 900 may be applied to the first node, and in particular, the communication apparatus 900 may be the first node, or may be an apparatus capable of supporting the first node to implement the function of the first node in any of the foregoing embodiments. The memory 920 holds the necessary computer programs, computer programs or instructions and/or data to implement the functions of the first node in any of the embodiments described above. Processor 910 may execute a computer program stored in memory 920 to perform the method performed by the first node in any of the above embodiments.

In another possible implementation manner, the communication apparatus 900 may be applied to the second node, and the specific communication apparatus 900 may be the second node, or may be an apparatus capable of supporting the second node, and implementing the function of the second node in any of the foregoing embodiments. The memory 920 holds the necessary computer programs, computer programs or instructions and/or data to implement the functionality of the second node in any of the embodiments described above. Processor 910 may execute a computer program stored in memory 920 to perform the method performed by the second node in any of the embodiments described above.

In another possible implementation manner, the communication apparatus 900 may be applied to the third node, and the specific communication apparatus 900 may be the third node, or may be an apparatus capable of supporting the third node to implement the function of the third node in any of the foregoing embodiments. The memory 920 holds the necessary computer programs, computer programs or instructions and/or data to implement the functionality of the third node in any of the embodiments described above. Processor 910 may execute a computer program stored in memory 920 to perform the method performed by the third node in any of the above embodiments.

Since the communication apparatus 900 provided in this embodiment may be applied to a first node, a method performed by the first node is completed, or applied to a second node, a method performed by the second node is completed, or applied to a third node, a method performed by the third node is completed. Therefore, reference may be made to the above method embodiments for the technical effects, which are not described herein.

In an embodiment of the present application, the processor may be a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or execute the methods, steps, and logic blocks disclosed in the embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in the processor for execution.

In the embodiment of the present application, the memory may be a nonvolatile memory, such as a hard disk (HARD DISK DRIVE, HDD) or a solid-state disk (SSD), or may be a volatile 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 that can be accessed by a computer, but is not limited to such. The memory in embodiments of the present application may also be circuitry or any other device capable of implementing a memory function for storing a computer program, a computer program or instructions and/or data.

Based on the above embodiments, referring to fig. 10, another communication device 1000 is provided according to an embodiment of the present application, which includes an input/output interface 1010 and a logic circuit 1020, where the input/output interface 1010 is configured to receive a code instruction and transmit the code instruction to the logic circuit 1020, and the logic circuit 1020 is configured to execute the code instruction to execute the method executed by the first node, the second node, or the third node in any of the above embodiments.

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

In an alternative embodiment, the communication device 1000 may be applied to the first node, and perform the method performed by the first node, for example, the method performed by the first node in the embodiment shown in fig. 3.

Logic 1020 for obtaining first information of the first node. And the input/output interface 1010 is configured to output second information of the first node according to the first information of the first node. Wherein the first information of the first node is determined based on the third information of the first node and the fourth information of the first node. The third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node. The fourth information of the first node indicates the number of nodes that send the second information to the first node.

In an alternative embodiment, the communication device 1000 may be applied to the first node, and perform the method performed by the first node, for example, the method performed by the first node in the embodiment shown in fig. 4A.

For example, the logic 1020 is configured to determine a transmission order corresponding to the degree of the first node. And an input/output interface 1010, configured to output seventh information of the first node to the second node according to a transmission order corresponding to the degree of the first node. The seventh information of the first node includes information of nodes to which the first node is connected, and the degree of the first node is determined according to the number of nodes to which the first node is connected.

In another alternative embodiment, the communication device 1000 may be applied to the second node, and perform the method performed by the second node, for example, the method performed by the second node in the method embodiment shown in fig. 4A.

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

In another alternative embodiment, the communication apparatus 1000 may be applied to the third node, and perform the method performed by the third node, for example, the method performed by the third node in the method embodiment shown in fig. 4A.

And an input-output interface 1010 for receiving seventh information from the second node. The third node has a degree greater than the degree of the second node. The degree of the second node is determined according to the number of nodes to which the second node is connected, and the degree of the third node is determined according to the number of nodes to which the third node is connected. Logic 1020 for subtracting the preset value from the degree of the third node after receiving the seventh information from the second node. It is understood that the preset value may be empirically set, such as may be set to 1,2, etc. The logic circuit 1020 is further configured to construct network topology information according to the seventh information of the second node when the degree is less than or equal to a first threshold, which may be set according to an empirical value, for example, may be set to 0. The network corresponding to the network topology information comprises a second node and a third node.

Since the communication apparatus 1000 provided in this embodiment may be applied to a first node, a method performed by the first node is completed, or applied to a second node, a method performed by the second node is completed, or applied to a third node, a method performed by the third node is completed. Therefore, reference may be made to the above method embodiments for the technical effects, which are not described herein.

Based on the above embodiments, the embodiment of the present application further provides a communication system. The communication system comprises 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 obtained can be referred to the above method embodiments, and will not be described herein.

Based on the above embodiments, the embodiments of the present application also provide a computer readable storage medium storing a computer program or instructions that, when executed, cause a method performed by a first node or a method performed by a second node or a method performed by a third node in any of the above embodiments to be performed. The computer readable storage medium may include a usb disk, a removable hard disk, a read-only memory, a random access memory, a magnetic disk, or an optical disk, etc. that may store the program code.

In order to realize the functions of the communication device of fig. 7 to fig. 7, the embodiment of the application further provides a chip, which includes a processor, and is configured to support the communication device to implement the functions related to the first node, the second node or the third node in the method embodiment. In one possible design, the chip is connected to a memory or the chip comprises a memory for holding the necessary computer programs or instructions and data for the communication device.

It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

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

These computer programs or instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer programs or instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various modifications and variations can be made to the embodiments of the present application without departing from the scope of the embodiments of the application. Thus, if such modifications and variations of the embodiments of the present application fall within the scope of the claims and the equivalents thereof, the present application is also intended to include such modifications and variations.

Claims (19)

1. A network topology construction method, comprising:

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

   Wherein the first information of the first node is determined 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 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 of claim 1, wherein the second information comprises one or more of channel state information of a communication link between the first node and a node to which the first node is connected, long-term channel state information of a communication link between the first node and a node to which the first node is connected, link quality indication information of a communication link between the first node and a node to which the first node is connected, and fading coefficients of a communication link between the first node and a node to which the first node is connected.
3. The method of claim 1, wherein the second information comprises transmission request information.
4. The method according to any one of claims 1 to 3, wherein 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-4, wherein the first node sends the second information of the first node according to the first information of the first node, including:

   and the first node sends second information of the first node when the first information is smaller than or equal to a first threshold value.
6. The method according to any one of claims 1-5, wherein the first node sends the second information of the first node according to the first information of the first node, including:

   And when the carrier sensing result or the energy detection result of the first node is smaller than or equal to a second threshold value, the first node sends 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-6, wherein the first node sends the second information of the first node according to the first information of the first node, including:

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

   The first node receives sixth information from the second node, the fifth information indicating whether the second information of the first node is transmitted successfully.
8. The method according to any one of claims 1-7, wherein the second information of the first node further comprises second information received by the first node.
9. A communication device is characterized by comprising a processing unit and a receiving and transmitting unit

   The processing unit is used for acquiring first information of the first node;

   the receiving and transmitting unit is used for transmitting second information of the first node according to the first information of the first node;

   Wherein the first information of the first node is determined 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 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 apparatus of claim 9, wherein the second information comprises one or more of channel state information for a communication link between the first node and a node to which the first node is connected, long-term channel state information for a communication link between the first node and a node to which the first node is connected, link quality indication information for a communication link between the first node and a node to which the first node is connected, and fading coefficients for a communication link between the first node and a node to which the first node is connected.
11. The apparatus of claim 9, wherein the second information comprises transmission request information.
12. The apparatus according to any one of claims 9 to 11, wherein the processing unit is further configured to:

    And subtracting the number of nodes indicated by the fourth information from the number of nodes indicated by the third information to obtain first information of the first node.
13. The apparatus according to any one of claims 9 to 12, wherein the transceiver unit is configured to send, according to the first information of the first node, second information of the first node, specifically configured to:

    and when the first information is smaller than or equal to a first threshold value, sending second information of the first node.
14. The apparatus according to any one of claims 9 to 13, wherein the transceiver unit is configured to send, according to the first information of the first node, second information of the first node, specifically configured to:

    And when the carrier sensing result or the energy detection result is smaller than or equal to a second threshold value, transmitting second information of the first node according to the first information of the first node.
15. The apparatus according to any one of claims 9 to 14, wherein the transceiver unit is configured to send, according to the first information of the first node, second information of the first node, specifically configured to:

    According to the first information of the first node, second information of the first node is sent to a second node;

    and receiving sixth information from the second node, wherein the sixth information indicates whether the second information of the first node is successfully transmitted.
16. The apparatus according to any one of claims 9 to 15, wherein the second information of the first node further includes second information received by the first node.
17. A communication device is characterized by comprising a processor and a memory;

    The memory is used for storing a computer program or instructions;

    The processor being configured to execute a computer program or instructions in a memory to cause the apparatus to perform the method according to any one of claims 1-8.
18. A computer readable storage medium storing computer executable instructions which, when invoked by an electronic device, cause the electronic device to perform the method of any one of claims 1-8.
19. A computer program product comprising computer-executable instructions which, when run on a computer, cause the computer to perform the method of any one of claims 1 to 8.