WO2024000482A1 - Procédé et appareil de construction de topologie de réseau - Google Patents

Procédé et appareil de construction de topologie de réseau Download PDF

Info

Publication number
WO2024000482A1
WO2024000482A1 PCT/CN2022/103023 CN2022103023W WO2024000482A1 WO 2024000482 A1 WO2024000482 A1 WO 2024000482A1 CN 2022103023 W CN2022103023 W CN 2022103023W WO 2024000482 A1 WO2024000482 A1 WO 2024000482A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
information
nodes
degree
send
Prior art date
Application number
PCT/CN2022/103023
Other languages
English (en)
Chinese (zh)
Inventor
张长
栗忠峰
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to PCT/CN2022/103023 priority Critical patent/WO2024000482A1/fr
Publication of WO2024000482A1 publication Critical patent/WO2024000482A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies

Definitions

  • the present application relates to the field of wireless communication technology, and in particular, to a network topology construction method and device.
  • flooding-based methods are generally used.
  • the principle of the flooding method is that during the construction of the network topology or the update process of the network topology, each node in the network broadcasts the link information of surrounding nodes obtained by the node.
  • a node A receives the link information of surrounding nodes broadcast by other nodes, the node A can have the link information of more nodes. All nodes in the network perform a broadcast, which can be understood as completing a flood.
  • this node can be used as a control node, so that the control node can build the network topology or update the network topology based on the global information.
  • This application provides a network topology construction method and device to reduce the transmission of redundant information and reduce the time to build or update network topology.
  • the first aspect provides a network topology method.
  • the method may be executed by a communication device, or a chip with functions similar to the communication device.
  • the first node sends the second information of the first node based on the first information of the first node.
  • the first information of the first node is determined based on the third information of the first node and the fourth information of the first node.
  • the third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node.
  • the fourth information of the first node indicates the number of nodes sending the second information to the first node.
  • the first node can send the second information of the first node according to one or more of the number of connected nodes, the number of sensed nodes, and the number of nodes sending the second information to the first node to perform network topology
  • the information transmitted is less redundant and the number of information interactions is less, so the transmission overhead and construction time of the network topology can be reduced.
  • using the above technical solution when updating the network topology can also reduce the time for updating the network topology, reduce information redundancy, and reduce the number of information interactions.
  • the second information includes channel state information of the communication link between the first node and the node connected to the first node, and the communication between the first node and the node connected to the first node Long-term channel state information of the link, link quality indication information of the communication link between the first node and the node connected to the first node, and communication link between the first node and the node connected to the first node One or more of the fading coefficients.
  • the first node can send the communication link information of the first node for other nodes to determine the communication link of the first node, thereby constructing a network topology.
  • the second information includes transmission request information.
  • the transmission request information may be used to request the transmission of channel state information of the communication link between the first node and the node connected to the first node, and the communication between the first node and the node connected to the first node.
  • Long-term channel state information of the link, link quality indication information of the communication link between the first node and the node connected to the first node, and communication link between the first node and the node connected to the first node One or more of the fading coefficients.
  • the first node can determine the order of transmitting the communication link information of the first node by transmitting the request information.
  • the number of information interactions can be reduced and the cost of constructing the network topology can be saved. and time.
  • the first node subtracts the number of nodes indicated by the fourth information from the number of nodes indicated by the third information to obtain the first information of the first node. Based on the above solution, the first node may send the second information of the first node after receiving the second information sent by the connected node.
  • the first node sends the second information of the first node when the first information is less than or equal to the first threshold.
  • the first threshold is preset, for example, it can be set to 0, 1, 2, etc. Based on the above solution, the first node may send the second information of the first node when the number of connected nodes is less than or equal to the first threshold.
  • 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.
  • the fifth information of the first node indicates the carrier sensing result or the energy detection result.
  • the first node sends the second information of the first node according to the first information of the first node. Based on the above solution, when sending the second information of the first node, the first node can refer to the carrier sensing result or the energy detection result, thereby reducing interference.
  • the first node sends the second information of the first node to the second node based on the first information of the first node.
  • the first node receives sixth information from the second node, and the sixth information indicates whether the second information of the first node is successfully transmitted. Based on the above solution, the first node can receive the sixth information and determine whether the second information of the first node is successfully transmitted.
  • a network topology construction method may be provided by a communication system, which may include a first node, a second node and a third node.
  • the first node sends the seventh information of the first node to the second node according to the transmission order corresponding to the degree of the first node.
  • the seventh information of the first node includes information of nodes connected to the first node, and the degree of the first node is determined based on the number of nodes connected to the first node.
  • the second node subtracts the preset value from the degree of the second node. The degree of the second node is determined based on the number of nodes connected to the second node.
  • the second node When the degree of the second node is less than or equal to the first threshold, the second node sends the seventh information of the second node to the third node.
  • the seventh information of the second node includes information of nodes connected to the second node and seventh information of the first node.
  • the third node constructs network topology information based on the seventh information of the second node.
  • the network corresponding to the network topology information includes the first node, the second node and the third node.
  • the preset value can be set based on experience value, for example, it can be set to 1, 2, etc.
  • the first threshold can be set based on experience value, for example, it can be set to 0.
  • each node can send the seventh information of each node according to the transmission order corresponding to the degree.
  • the information transmitted is less redundant and the number of information interactions is less. , thus reducing the transmission overhead and construction time of the network topology.
  • using the above technical solution when updating the network topology can also reduce the time for updating the network topology, reduce information redundancy, and reduce the number of information interactions.
  • the eighth information of the first node may include link information of the first node, and the link information of the first node may include information of the communication link known by the first node.
  • the information of a communication link may include node information, link quality information (or link quality information) and/or beam status information of the communication link.
  • the eighth information may be used to request the transmission of the seventh information.
  • the eighth information may also be called transmission request information.
  • the eighth information of the first node may be used to request transmission of the seventh information of the first node.
  • the second node calculates the corresponding transmission sequence according to the degree of the second node, and after reaching the preset condition, sends the eighth information of the second node to the third node.
  • the eighth information of the second node is used to determine the degree of the third node, and the degree of the third node is used to indicate the amount of the eighth information received by the third node.
  • the first node may also receive eighth information from other nodes.
  • the degree of the first node may be the smallest within the scope of the network to which it belongs, so the first node may not receive the eighth information from other nodes, that is, the degree of the first node may be 0.
  • the third node after receiving the eighth information from the second node, can subtract the preset value from the degree of the third node, and the third node can transmit the information to the surrounding area according to the transmission sequence corresponding to the degree of the third node.
  • the node such as the fifth node, sends the eighth message.
  • each node in the network can exchange the eighth information to update the degree, that is, determine the order of transmitting the seventh information.
  • the first node sends the eighth information of the first node on the first of the N sending beams according to the transmission order corresponding to the degree of the first node, and the direction of the first sending beam. Matches the position of the second node.
  • the second node receives the eighth information of the first node on the first receiving beam among the M receiving beams, and the first receiving beam corresponds to the first transmitting beam.
  • N and M are both integers greater than or equal to 1.
  • each node can send through the sending beam when sending the eighth information, and each node can receive through the receiving beam when receiving the eighth information.
  • the receiving beam and the transmitting beam at the same time correspond to each other, so the eighth information transmission process can be reduced. communication interference.
  • the corresponding method is predetermined or configured.
  • each node sends the eighth information, it sends within the specified sending time corresponding to the corresponding sending beam.
  • the first receiving beam has a one-to-one correspondence with the first transmitting beam.
  • the first receive beam corresponds to the first transmit beam and X transmit beams.
  • the Y receive beams and the first receive beam correspond to the first transmit beam.
  • the second node receives the eighth information of the fourth node on a second receiving beam among the M receiving beams, and the second receiving beam matches the position of the fourth node.
  • the eighth information includes information on the degree of the fourth node.
  • the second node determines that the degree of the first node is smaller than the degree of the fourth node based on the degree information of the first node and the degree information of the fourth node.
  • the eighth information of the first node includes information about the degree of the first node.
  • the second node sends ninth information to the first node, and the ninth information is used to instruct the first node to send seventh information of the first node.
  • the fourth node sends the eighth information of the fourth node to the second node on a second sending beam among the N sending beams, and the second sending beam corresponds to the second receiving beam.
  • the second node can receive the seventh information of the first node through the first receiving beam among the M receiving beams, receive the eighth information of the fourth node through the second receiving beam among the M receiving beams, and The degree of the first node is compared with the degree of the fourth node, ninth information is sent to the node with a smaller degree, and the node with a smaller degree is instructed to send seventh information.
  • the second receiving beam has a one-to-one correspondence with the second transmitting beam.
  • the second reception beam corresponds to the second transmission beam and X transmission beams.
  • the Y receive beams and the second receive beam correspond to the second transmit beam.
  • the ninth information includes an identification of the first node. Based on the above solution, through the identification of the first node, each node that receives the ninth information can confirm that the ninth information instructs the first node to send the seventh information.
  • nodes with smaller degrees have higher transmission order. Based on the above solution, nodes with smaller degrees in the network are transmitted in higher order, that is, in order from small to large, each node transmits the eighth information, which can reduce the number of times the eighth information is transmitted.
  • the first node is the node with the smallest degree in the network
  • the third node is the node with the largest degree in the network.
  • the first node can be the node with the smallest degree in the network, so the first node sends the second message first
  • the third node is the node with the largest degree in the network, so the third node can receive the eighth message from other nodes.
  • a communication device including: a processing unit and a transceiver unit.
  • a processing unit configured to obtain the first information of the first node.
  • the transceiver unit is configured to send the second information of the first node according to the first information of the first node.
  • the first information of the first node is determined based on the third information of the first node and the fourth information of the first node.
  • the third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node.
  • the fourth information of the first node indicates the number of nodes sending the second information to the first node.
  • the second information includes channel state information of the communication link between the first node and the node connected to the first node, and the communication between the first node and the node connected to the first node Long-term channel state information of the link, link quality indication information of the communication link between the first node and the node connected to the first node, and communication link between the first node and the node connected to the first node One or more of the fading coefficients.
  • the second information includes transmission request information.
  • the processing unit is further configured to: subtract the number of nodes indicated by the fourth information from the number of nodes indicated by the third information, to obtain the first information of the first node.
  • the transceiver unit is configured to send the second information of the first node according to the first information of the first node, and is specifically configured to: when the first information is less than or equal to the first threshold, send the second information of the first node.
  • the second information of a node is specifically configured to: when the first information is less than or equal to the first threshold, send the second information of the first node.
  • the transceiver unit is configured to send the second information of the first node according to the first information of the first node, specifically: according to the first information of the first node and the third information of the first node. Five messages, sending the second message of the first node. Wherein, the fifth information of the first node indicates the carrier sensing result or the energy detection result.
  • the transceiver unit sends the second information of the first node according to the first information of the first node and the fifth information of the first node, specifically for: performing carrier sensing results or energy detection results.
  • the second information of the first node is sent according to the first information of the first node.
  • the transceiver unit is configured to send the second information of the first node according to the first information of the first node, and is specifically configured to: send the second information to the second node according to the first information of the first node.
  • the second information of the first node The second information of the first node.
  • Sixth information is received from the second node, and the sixth information indicates whether the second information of the first node is successfully transmitted.
  • the second information of the first node also includes the second information received by the first node.
  • a communication device may be the communication device of any one of the first to fourth aspects in the above embodiments, or may be provided in any one of the first to second aspects. chips in communication devices.
  • the communication device includes a communication interface and a processor, and optionally, a memory. Wherein, the memory is used to store computer programs or instructions or data, and the processor is coupled to the memory and the communication interface. When the processor reads the computer program, instructions or data, the communication device is caused to execute the above first to second aspects. The method executed by the first node, the second node or the third node in any of the method embodiments.
  • the communication interface can be implemented through antennas, feeders, codecs, etc. in the communication device, or if the communication device is a chip provided in network equipment or terminal equipment, the communication interface can be the input of the chip /Output interface, such as input/output pins, etc.
  • the communication device may also include a transceiver for communicating with other devices.
  • the present application provides a computer-readable storage medium that stores a computer program or instructions.
  • the steps executed by the first node in the above aspects are implemented. method; or implement the method executed by the second node in the above aspects; or implement the method executed by the third node in the above aspects.
  • a computer program product includes: computer program code or instructions.
  • the method executed by the first node in the above aspects is caused to be executed.
  • An eighth aspect provides a communication device, which includes a unit or module that performs the methods of the above aspects.
  • Figure 1A is a schematic diagram of the first round of flooding process in the scheme of constructing network topology based on the flooding mechanism provided by the embodiment of the present application;
  • Figure 1B is a schematic diagram of the second round of flooding process in the scheme of constructing network topology based on the flooding mechanism provided by the embodiment of the present application;
  • Figure 2 is a schematic diagram of a multi-node writing network provided by an embodiment of the present application.
  • Figure 3 is one of the exemplary flow charts of a network topology construction method provided by an embodiment of the present application.
  • Figure 4A is one of the exemplary flow charts of a network topology construction method provided by an embodiment of the present application.
  • Figure 4B is a schematic diagram of the interaction process of the second information in the network topology construction method provided by the embodiment of the present application.
  • Figure 4C is a schematic diagram of the interaction process of the first information in the network topology construction method provided by the embodiment of the present application.
  • Figure 5A is a schematic diagram of spatial direction allocation of transmission beams provided by an embodiment of the present application.
  • Figure 5B is a schematic diagram of the spatial direction allocation of receiving beams provided by an embodiment of the present application.
  • Figure 6 is a schematic diagram of the information interaction process in the network topology construction method provided by the embodiment of the present application.
  • Figure 7 is one of the schematic diagrams of a communication device provided by an embodiment of the present application.
  • Figure 8 is one of the schematic diagrams of a communication device provided by an embodiment of the present application.
  • Figure 9 is a schematic diagram of a communication device provided by an embodiment of the present application.
  • Figure 10 is a schematic diagram of a communication device provided by an embodiment of the application.
  • Network topology also known as network topology structure, refers to the physical layout of various devices interconnected by transmission media.
  • the arrangement involved in the physical layout may be a specific, physical (or real) arrangement among the network members, or it may be a logical (or virtual) arrangement among the network members.
  • the control nodes may include central control nodes and distributed control nodes.
  • the central control node can schedule each node in the network where the central control node is located (ie, the network corresponding to the network topology).
  • the distributed control node can schedule one or more nodes around the distributed control node.
  • the one or more nodes and the distributed control node can form a subnet, and in a network it can Contains multiple subnets.
  • the central control node and distributed control nodes can exist in the same network at the same time.
  • the central control node can be a distributed control node in a certain subnet.
  • wireless self-organizing networks In terms of network research and future applications, wireless self-organizing networks have always been a hot topic of discussion because of their broader application scenarios and more complex and open research content. Wireless self-organizing network can achieve better performance of the overall network in different application scenarios through the self-organization and self-collaboration of multiple nodes in the network.
  • a typical wireless self-organizing network application such as wireless sensor network can transmit sensing data through the deployment of distributed sensors. Take the vehicle to vehicle (V2V) network in wireless sensor networks as an example. Distributed sensors can be deployed on vehicles in the V2V network. The distributed sensors can collect road condition information, and the vehicles can interact with each other to collect the information. Traffic information.
  • Most wireless self-organizing networks are flexible and dynamic because nodes can join or exit dynamically. For example, in a wireless sensor network, new nodes can be added by deploying distributed sensors. Old nodes may also exit the wireless sensor network due to insufficient power or failure. It is understandable that each node in the wireless self-organizing network can also move.
  • the scheduling and transmission of distributed sensors in V2V networks can be generally divided into two categories.
  • the first category includes scheduled transmissions based on deterministic network topology.
  • scheduling transmission based on deterministic network topology means that there is a central control node in the network that stores global information.
  • the central control node can establish the network topology or update the network topology based on the global information, and schedule the nodes in the network.
  • the control nodes need to store global information, it takes a long time. For highly dynamic networks where nodes move quickly, the network topology may need to be updated frequently.
  • the central control node needs to update global information frequently to achieve network topology updates.
  • the time for the central control node to update global information may be greater than the actual update time of the network topology. It can be seen that scheduling transmission based on deterministic network topology is not suitable for highly dynamic network topologies where nodes move quickly.
  • the second category of scheduled transmission of distributed sensors in V2V networks includes scheduled transmission based on random network topology.
  • Scheduling transmission based on random network topology means that there is no need for global information, but information is broadcast based on flooding until the final node. Among them, the technical solution for broadcasting information based on flooding will be introduced in detail later.
  • the construction of the entire network topology and the update of the network topology can be divided into two stages.
  • the first stage is for the nodes in the network to obtain the link information of the surrounding nodes to learn which communication links exist between the node and the surrounding nodes, and to obtain the quality parameters of the communication links, etc.
  • the second stage is for the nodes in the network to collect the network topology information to the control node based on the obtained link information of the surrounding nodes, so that the control node can obtain the link information of all nodes in the network or subnets of the network. .
  • flooding-based methods are generally used.
  • the principle of the flooding method is that during the construction of the network topology or the update process of the network topology, each node in the network broadcasts the link information of surrounding nodes obtained by the node.
  • a node A receives the link information of surrounding nodes broadcast by other nodes, the node A can have the link information of more nodes. All nodes in the network perform a broadcast, which can be understood as completing a flood.
  • this node can be used as a control node, so that the control node can build the network topology or update the network topology based on the global information.
  • each node in the network can broadcast communication link information (hereinafter also referred to as link information for short) to surrounding nodes.
  • link information hereinafter also referred to as link information for short
  • node 1 broadcasts link information. Since there is a communication link between node 1 and node 3, the link information of node 1 includes the link information of node 1 and node 3.
  • Node 3 can receive the link information broadcast by node 1.
  • node 3 can have the link information of node 3 and the link information of node 1.
  • node 3 can broadcast link information. Since node 3 has communication links with node 1, node 4, node 5 and node 6 respectively, the link information broadcast by node 3 can include the link between node 3 and node 1. Information, link information between node 3 and node 4, link information between node 3 and node 5, and link information between node 3 and node 6. Node 1, node 4, node 5 and node 6 can receive the link information broadcast by node 3.
  • node 1 can have the link information of node 3 and the link information of node 1
  • node 4 can have the link information of node 3 and the link information of node 4
  • node 5 can have the link information of node 3 and the node 5's link information
  • node 6 can have the link information of node 3 and the link information of node 6.
  • node 2, node 4, node 5, node 6, node 7 and node 8 all broadcast link information.
  • the numbers in brackets below the node in Figure 1A represent the link information owned by the node after the first flooding.
  • nodes within the network can broadcast to surrounding nodes the link information received by the node from other nodes.
  • node 1 can broadcast the link information received from node 3, that is, the link information between node 3 and node 1, the link information between node 3 and node 4, the link information between node 3 and node 5, and the link information between node 3 and node 3.
  • node 3 may broadcast link information received from node 1, node 4, node 5, and node 6, and so on.
  • the numbers in brackets below the node in Figure 1B represent the link information owned by the node after the second flooding.
  • embodiments of the present application provide a method for constructing a network topology.
  • each node in the network can send information according to a certain transmission order, which can reduce interference during information transmission, and sending information according to the transmission order can reduce the number of information interactions, reduce the transmission of redundant information, and shorten the network topology construction. The duration of time.
  • the technical solutions provided by the embodiments of this application can be applied to multi-node cooperation networks.
  • the nodes included in the multi-node cooperative network can have full-duplex capabilities.
  • FIG. 2 is a schematic diagram of a multi-node cooperation network 200 provided by an embodiment of the present application.
  • the multi-node cooperation network 200 may include one or more nodes.
  • 8 nodes are taken as an example.
  • black dots represent nodes
  • dotted lines represent the existence of communication links between two nodes.
  • a node can be a physical device, such as a terminal device, access point (AP) or relay device, etc., or a node can also be a logical device, such as a logical module set on a physical device, etc. .
  • information can be transmitted between nodes with communication links. For example, communication link information may be transmitted.
  • an exemplary flow chart of a network topology construction method provided by an embodiment of the present application may include the following operations.
  • the first node sends the second information of the first node based on the first information of the first node.
  • the second node receives the second information of the first node.
  • S302 The second node constructs the network topology.
  • the first information of the first node may be determined based on the third information of the first node and the fourth information of the first node.
  • the third information of the first node indicates the number of nodes connected to the first node, or the third information of the first node indicates the number of nodes perceived by the first node.
  • the third information of the first node may be called the degree of the first node.
  • the fourth information of the first node may indicate the number of nodes sending the second information to the first node.
  • the first node may send the second information of the first node when the number of nodes indicated by the first information of the first node is less than or equal to the first threshold.
  • the first threshold may be set based on experience values, for example, it may be set to 0, 1, 2, etc.
  • the first node may obtain the first information of the first node based on the number of nodes indicated by the third information minus the number of nodes indicated by the fourth information.
  • the first node may send the second information of the first node when the number of nodes indicated by the first information of the first node is less than or equal to the first threshold.
  • the first node may send the second information of the first node based on the first information of the first node when the carrier sensing result or the energy detection result is less than or equal to the second threshold.
  • the carrier sensing result or the energy detection result may be obtained by the first node monitoring the communication link.
  • the embodiments of this application do not specifically limit the manner in which carrier sensing results and energy monitoring results are obtained.
  • the first node may send the second information of the first node to the second node in a unicast manner.
  • 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.
  • the second information includes channel state information of the communication link between the first node and the node connected to the first node, and the length of the communication link between the first node and the node connected to the first node. time channel state information, link quality indication information of the communication link between the first node and the node connected to the first node, and fading coefficient of the communication link between the first node and the node connected to the first node of one or more.
  • the second information may include transmission request information.
  • the transmission request information may be used to request the transmission of channel state information of the communication link between the first node and the node connected to the first node, and the communication between the first node and the node connected to the first node. Long-term channel state information of the link, link quality indication information of the communication link between the first node and the node connected to the first node, and communication link between the first node and the node connected to the first node One or more of the fading coefficients.
  • the second information including the transmission request information may be called eighth information
  • the second information including the communication link information of the first node may be called seventh information.
  • a flow chart of a network topology construction method includes the following operations.
  • the first node sends the seventh information of the first node to the second node according to the transmission sequence corresponding to the degree of the first node.
  • the second node receives the seventh information of the first node from the first node.
  • the first node and the second node belong to the same network.
  • the embodiment of the present application is to construct the network topology of the network.
  • the network is called the first network.
  • the first node may send the seventh information of the first node to the second node in a unicast manner.
  • the first node may send the seventh information to the second node in a transmission sequence corresponding to the degree of the first node.
  • each node in the first network can store the corresponding relationship between the degree and the transmission order, and the first node can determine the transmission order of the first node based on the corresponding relationship between the degree and the transmission order and the degree of the first node. In this way, the first node can send the seventh information to the second node when the transmission sequence of the first node is reached.
  • each node in the first network can determine the transmission sequence of the node based on a timer. For example, each node in the first network may maintain multiple timers and send the seventh information when the corresponding timer is started. Among them, one timer can correspond to one degree. In the first network, each node can start multiple timers in sequence, wherein the next timer is started when one timer ends. Different nodes can start timers synchronously, or in other words, different nodes start the first timer at the same time. And different nodes start the timers in the same order. For example, each node starts timer A1 first and then starts timer A2. Optionally, when starting the timer, you can start it in order from the corresponding degree from small to large.
  • each node in the first network starts the timer A1 synchronously.
  • the node with degree A1 can send the seventh information.
  • each node in the first network can start timer A2 corresponding to degree A2.
  • the node with degree A2 can send the seventh information, and so on.
  • the seventh information can be sent to the second node during the running of the timer corresponding to the degree of the first node.
  • a node it will correspond to a degree, and the node will also correspond to the timer corresponding to the degree. Then when the timer starts, or during the running of the timer, the node can send the seventh information.
  • each node in the first network can determine the transmission order of the node based on the corresponding relationship between the sending time and the degree.
  • each node in the first network can store sending times corresponding to different degrees.
  • the smaller the degree the earlier the sending time.
  • the node with degree A1 can send the seventh information; at time A2, the node with degree A2 can send the seventh information, and so on.
  • time A2 is behind time A1, and degree A1 is smaller than degree A2.
  • the seventh information can be sent to the second node at a time corresponding to the degree of the first node.
  • the first node is the node with the smallest degree in the first network.
  • the degree of the first node may be updated based on the third information of the first node and the fourth information of the first node.
  • the embodiment shown in FIG. 4A may also include S400A and S400B.
  • S400A and S400B may occur before S401.
  • the first node sends the eighth information of the first node to the second node according to the transmission sequence corresponding to the degree of the first node.
  • the second node receives the eighth information of the first node from the first node.
  • the degree of the first node can be understood as the number of nodes that have communication links with the first node.
  • node 1 and node 3 have communication links, but there are no communication links between node 1 and other nodes, then the degree of node 1 can be 1.
  • node 3 has communication links with node 1, node 4, node 5 and node 6, but has no communication links with other nodes, then the degree of node 3 can be 4.
  • the eighth information may be used to request the transmission of the seventh information.
  • the eighth information may also be called transmission request information and is used to request the transmission of the seventh information in S301 (ie, the seventh information of the first node). information).
  • the first node may send the eighth information of the first node to the second node according to the transmission sequence corresponding to the degree of the first node.
  • each node in the first network can store the corresponding relationship between the degree and the transmission order, and the first node can determine the transmission order of the first node based on the corresponding relationship between the degree and the transmission order, and based on the degree of the first node.
  • the above-mentioned first node is the node with the smallest degree in the first network.
  • each node can perform a listen before talk (LBT) operation before unicasting the eighth information to one of the surrounding nodes.
  • LBT listen before talk
  • the first node may perform LBT to determine the communication link between the first node and the second node before sending the eighth information to the second node. Whether it is idle, and when the LBT is successful, that is, when it is determined that the communication link between the first node and the second node is idle, the eighth information is sent to the second node.
  • LBT listen before talk
  • the preset value can be set based on experience value, for example, it can be set to 1, 2, etc.
  • S400B may be a possible implementation manner for the second node to determine the first information of the second node.
  • the second node may subtract the number of nodes indicated by the fourth information (such as the degree of the second node) from the number of nodes indicated by the third information, such as subtracting the number of received eighth information.
  • the second node is node 3 in Figure 1A.
  • the degree of node 3 is 4.
  • node 3 can subtract the preset value from the degree of node 3.
  • the preset value is, for example, 1, then the degree of node 3 becomes 3. .
  • the second node may also send the eighth information to one of the surrounding nodes, such as the third node.
  • the second node is node 3 in Figure 1A. After node 3 receives the eighth information from node 1, the degree of node 3 becomes 3. Therefore, node 3 can send the eighth information to one of the surrounding nodes in the transmission sequence corresponding to the degree of 3.
  • the manner in which the second node sends the eighth information to one of the surrounding nodes may refer to the manner in which the first node sends the eighth information to the second node in S400A.
  • the third node can also send the eighth information to one of the surrounding nodes until the node with the highest degree can determine the nodes included in the first network and the link information between the nodes.
  • the dots represent nodes
  • the dotted lines represent the existence of a communication link between the two nodes
  • the bidirectional arrows represent that the two parties can conduct two-way communication through this link, that is, the exchange of information.
  • All links shown are numbered in Figure 4B, with numerical labels on corresponding links in the figure.
  • the degree of node 1 is 1
  • the degree of node 2 is 1
  • the degree of node 3 is 4
  • the degree of node 4 is 3
  • the degree of node 5 is 3
  • the degree of node 6 is 4, and the degree of node 7
  • the degree of node 8 is 3, and the degree of node 8 is 1.
  • node 1 to node 8 may respectively send the eighth information to the surrounding nodes according to the transmission order corresponding to the degree.
  • nodes with smaller degrees in the network have higher transmission order. Therefore, in FIG. 4B , node 1 , node 2 and node 8 with degree 1 first send the eighth information to one of the surrounding nodes respectively.
  • node 1 may send the eighth information to node 3
  • node 2 may send the eighth information to node 4
  • node 8 may send the eighth information to node 7.
  • Each node that receives the eighth information can subtract a preset value from the degree, such as minus 1.
  • node 3 can have its degree subtracted by 1 so that the degree of node 3 becomes 3.
  • Node 4 can subtract 1 from its degree, so that the degree of node 4 becomes 2.
  • Node 7 can subtract 1 from its degree, so that the degree of node 7 becomes 2.
  • node 4 and node 7 with degree 2 send the eighth information to one of the surrounding nodes.
  • node 4 may send the eighth information to node 6, and node 7 may send the eighth information to node 5.
  • Each node that receives the eighth information can subtract a preset value from the degree, such as minus 1.
  • node 6 can subtract 1 from its degree, so that the degree of node 6 becomes 3, and node 5 can subtract a preset value from its degree, so that the degree of node 5 becomes 2.
  • node 5 can also send the eighth information to one of the surrounding nodes, such as node 3. In this way, the degree of node 3 can become 2. Therefore, node 3 may also send the eighth information to one of the surrounding nodes, such as node 6, when the node with degree 2 sends the eighth information to one of the surrounding nodes.
  • each node can transmit the eighth information to one of the surrounding nodes, and then the node with the highest degree, such as node 6, can obtain which nodes are included in the network.
  • each node in the network can determine its own degree.
  • degree is used to indicate the quantity of the eighth information received.
  • the degree of the second node may be the number of eighth pieces of information received by the second node.
  • node 3 has received the eighth information of node 1 and node 5, so the degree of node 3 is 2.
  • node 6 has received the eighth information of node 4 and node 6, so the degree of node 6 is 2.
  • each node in the network can receive the eighth information according to the number of received eighth information. , update degree.
  • the first node can send the seventh information to the surrounding nodes according to the transmission sequence corresponding to the degree of the first node.
  • the first node may send the seventh information to a node that receives the eighth information of the first node, such as the second node.
  • node 1 sends the eighth information to node 3
  • node 5 sends the eighth information to node 3
  • node 5 can send the seventh information to node 3 in S401.
  • the second node is node 3 in Figure 4B.
  • the degree of node 3 is 2, then after receiving the seventh information of node 1, node 3 can subtract a preset value from the degree.
  • the preset value is, for example, 1, so that the degree of node 3 becomes 1.
  • S402 may be a possible implementation manner for the second node to determine the first information of the second node.
  • the second node may subtract the number of nodes indicated by the fourth information (such as the degree of the second node) from the number of nodes indicated by the third information, such as subtracting the number of received seventh information.
  • the first threshold may be set based on experience value, for example, it may be set to 0.
  • the second node is node 3 in Figure 4B.
  • node 3 can subtract a preset value from the degree.
  • the preset value is, for example, 1, so that the degree of node 3 becomes 1.
  • node 3 can subtract a preset value from the degree.
  • the preset value is, for example, 1, so that the degree of node 3 becomes 0.
  • Node 3 may send the seventh information to one of the surrounding nodes when the degree is less than or equal to 0. Among them, node 3 may send the seventh information to the node that receives the eighth information of node 3, that is, node 6.
  • each node in the network updates its own degree.
  • the degree of node 1 is 0, the degree of node 2 is 0, the degree of node 3 is 2, the degree of node 4 is 1, the degree of node 5 is 1, the degree of node 6 is 2, and the degree of node 7 is 1, and the degree of node 8 is 0.
  • node 1 to node 8 may respectively send the seventh information to the surrounding nodes according to the transmission order corresponding to the degree.
  • nodes with smaller degrees in the network have higher transmission order. Therefore, in Figure 4C, node 1, node 2 and node 8 with degree 0 respectively send the seventh information to one of the surrounding nodes.
  • One of the surrounding nodes may be the node that received the eighth information.
  • node 1 may send the seventh information to node 3
  • node 2 may send the seventh information to node 4
  • node 8 may send the seventh information to node 7.
  • Each node that receives the seventh information can subtract a preset value from the degree, such as minus 1.
  • node 3 can have its degree subtracted by 1 so that the degree of node 3 becomes 1.
  • Node 4 can subtract 1 from its degree, so that the degree of node 4 becomes 0.
  • Node 7 can subtract 1 from its degree, so that the degree of node 7 becomes 0.
  • the seventh information is sent from node 4 and node 7 with degree 0 to one of the surrounding nodes.
  • node 4 may send the seventh information to node 6, and node 7 may send the seventh information to node 5.
  • Each node that receives the seventh information can subtract a preset value from the degree, such as minus 1.
  • node 6 can subtract 1 from its degree, so that the degree of node 6 becomes 1, and node 5 can subtract a preset value from its degree, so that the degree of node 5 becomes 0.
  • the seventh information is sent from node 5 with degree 0 to one of the surrounding nodes.
  • node 5 may send seventh information to node 3. In this way, the degree of node 3 can become 0. Therefore, node 3 can send the seventh information to node 6.
  • each node can transmit the seventh information to one of the surrounding nodes, and then the node with the highest degree, such as node 6, can obtain the global link information in the network.
  • the third node constructs network topology information based on the seventh information of the second node.
  • the link information obtained by the third node constructs network topology information.
  • the network corresponding to the network topology information includes a first node, a second node and a third node.
  • the third node is node 6 in Figure 4C.
  • node 6 can obtain the link information of the network, so that node 6 can construct network topology information.
  • the network corresponding to the network topology information includes node 1, node 2, node 3, node 4, node 5, node 6, node 7 and node 8.
  • the information transmitted is less redundant, and the number of information interactions is less, so the network topology can be reduced.
  • Build time Moreover, using the technical solution shown in Figure 4A when updating the network topology can also reduce the time for updating the network topology, reduce information redundancy, and reduce the number of information interactions.
  • each node in order to reduce interference in the information transmission process, can send the seventh information and/or the eighth information through the sending beam, and each node can also receive the seventh information and/or the eighth information through the receiving beam. information.
  • the spatial allocation relationship of beams may be predefined or preconfigured, such as the spatial allocation relationship of transmitting beams and receiving beams.
  • the transmitting beam has N directions in total, and the receiving beam has M directions in total.
  • N is an integer greater than or equal to 1
  • M is an integer greater than or equal to 1.
  • N can be equal to M, that is, one transmit beam corresponds to one receive beam.
  • N can be different from M.
  • one transmitting beam can correspond to multiple receiving beams.
  • the transmitting beam can be regarded as a wide beam
  • the receiving beam can be regarded as a narrow beam. That is, the direction of a wide beam corresponds to the direction of multiple narrow beams.
  • multiple transmit beams can correspond to one receive beam.
  • the transmit beam can be regarded as a narrow beam
  • the receive beam can be regarded as a wide beam. That is, the direction of a wide beam corresponds to the direction of multiple narrow beams.
  • FIG. 5A is a schematic diagram of spatial direction allocation of transmission beams.
  • FIG. 5A a total of four directions of transmitting beams are used as an example for explanation.
  • Figure 5B which is a schematic diagram of the spatial direction allocation of the receiving beam.
  • Figure 5B a total of four directions of receiving beams are used as an example for explanation. It can be seen from Figure 5A and Figure 5B that the beam is divided into 4 directions by the plane space, each corresponding to a quadrant.
  • a node wants to receive in the R1 direction, it can only receive the transmit beam from the T1 direction.
  • the R1 receiving direction corresponds to the T1 transmitting direction
  • the R2 receiving direction corresponds to the T2 transmitting direction
  • the R3 receiving direction corresponds to the T3 receiving direction
  • the R4 receiving direction corresponds to the T4 receiving direction.
  • the first node when it sends the seventh information and/or the eighth information, it may send the seventh information and/or the eighth information to the second node through a preset sending beam. or eighth message.
  • the first node may send the eighth information of the first node to the second node on the first transmission beam according to the transmission sequence corresponding to the degree of the first node.
  • the first transmitting beam may be determined based on a predefined or preconfigured spatial allocation relationship of the beams.
  • the direction of the first transmit beam matches the location of the second node. It can be understood that in the process of obtaining the seventh information by each node in the network, the direction or position of the surrounding nodes can be determined. Therefore, when sending the eighth information, each node can determine which direction of sending beam to use to send the eighth information.
  • node 3 is located in the direction of the fourth quadrant of node 1, then node 1 can send the eighth information to node 3 in the T1 direction.
  • node 3 receives the seventh information from node 1, it may receive it in the R1 direction.
  • each node in the network can receive the eighth information in the same direction at a certain stage, and each node can send the eighth information in the same direction. For example, each node receives the eighth information and sends the eighth information in the order shown in FIG. 6 .
  • each node in the network receives in the R1 direction, and each node in the network can transmit in the T1 direction.
  • each node in the network receives in the R2 direction, and each node in the network can transmit in the T2 direction.
  • the request phase Request, Ri
  • each node in the network can exchange the eighth information.
  • i is taken from 1 through M.
  • node A receives the eighth information in the R1 direction.
  • node B and node C respectively send the eighth information in the T1 direction.
  • the degree of node B is d1
  • the degree of node C is d2, d1>d2. Since the smaller the degree, the higher the transmission order, so the timer of node C expires first.
  • node C can perform a listen before talk (LBT) operation. If LBT is successful, node C can send the eighth message to node A.
  • LBT listen before talk
  • node C can Node C does not send a transmission request to node A.
  • node A After receiving the eighth information from node C, node A can send a reservation signal in the T1 direction. In this way, after the timer of node B expires, when performing the LBT operation, the eighth information will not be sent due to the LBT failure, thereby effectively avoiding interference.
  • the code division multiple access (CDMA) method can be used to transmit it by multiple nodes at the same time.
  • the receiving node does not need to send a reserved signal, and sends Node does not require LBT.
  • each node in the network After each node in the network interacts with the eighth information, that is, after the R phase is completed, it enters the request response phase (Answer, A phase).
  • a phase each node in the network serves as the receiving end, and compares the degree carried in the eighth information with its own degree based on the eighth information received in phase R. After the comparison is completed, if the degree of a surrounding node is the lowest, the ninth information will be sent to the node in phase A.
  • the ninth information is used to instruct the node to send the seventh information of the node, or the ninth information may be used to indicate that the degree of the node is the smallest in the network.
  • node A can compare the degree of node B, the degree of node C and the degree of node A. If node B has the lowest degree, node A may send ninth information to node B. If node C has the lowest degree, node A can send ninth information to node C. If node A has the lowest degree, node A does not need to send the ninth information, but can receive the ninth information from surrounding nodes.
  • the ninth information may carry the identity (identity, ID) information of the node, such as the identifier of the node.
  • identity identity, ID
  • the ninth information may carry node B's identity information. In this way, even if the ninth information is received at multiple nodes, the notified node can be determined based on the identity information of Node B carried in the ninth information.
  • each node in the network can realize the transmission of the eighth information.
  • the embodiment of the present application also designs a data transmission stage (Data, D stage).
  • the node that receives the ninth information may send a response to the node that sent the ninth information to indicate receipt of the ninth information.
  • node B may send a response to node A in phase D to indicate to node A that the ninth information is received.
  • each node in the network can interact with the seventh information as shown in S401, S402, S403 and S404 to construct network topology information.
  • the third node can transfer the network topology information to other nodes in the network.
  • the third node serves as the information source and reaches the information sink via a path through multiple hops through relay transmission.
  • the third node is node 6 in Figure 4C.
  • node 6 can send the network topology information to node 4, node 3, node 5 and node 7 that have communication links with node 6.
  • Node 7 can send network topology information to node 8, which has a communication link with node 7.
  • Node 4 can send network topology information to node 2, which has a communication link with node 4.
  • Node 3 can send network topology information to node 7.
  • Node 3 has a communication link to node 1.
  • FIG. 7 is a schematic block diagram of a communication device 700 provided by an embodiment of the present application.
  • the communication device 700 can correspondingly implement the functions or steps implemented by the first node, the second node or the third node in each of the above method embodiments.
  • the communication device may include a processing unit 710 and a transceiver unit 720.
  • a storage unit may also be included, which may be used to store instructions (code or programs) and/or data.
  • the processing unit 710 and the transceiver unit 720 can be coupled with the storage unit.
  • the processing unit 710 can read instructions (codes or programs) and/or data in the storage unit to implement corresponding methods.
  • Each of the above units can be set up independently or partially or fully integrated.
  • the communication device 700 can correspondingly implement the behaviors and functions of the first node in the above method embodiment.
  • the communication device 700 may be a first node, or a component (such as a chip or a circuit) applied in the first node.
  • the transceiver unit 720 may be configured to perform all receiving or transmitting operations performed by the first node in the embodiment shown in FIG. 3 .
  • the processing unit 710 is used to obtain the first information of the first node.
  • the transceiving unit 720 is configured to send the second information of the first node according to the first information of the first node.
  • the first information of the first node is determined based on the third information of the first node and the fourth information of the first node.
  • the third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node.
  • the fourth information of the first node indicates the number of nodes sending the second information to the first node.
  • the processing unit 710 is further configured to: subtract the number of nodes indicated by the fourth information from the number of nodes indicated by the third information, to obtain the first information of the first node.
  • the transceiving unit 720 is configured to send the second information of the first node according to the first information of the first node, specifically: when the first information is less than or equal to the first threshold, send The second information of the first node.
  • the transceiver unit 720 is configured to send the second information of the first node according to the first information of the first node, and is specifically configured to: according to the first information of the first node and the first information of the first node.
  • the fifth information is to send the second information of the first node.
  • the fifth information of the first node indicates the carrier sensing result or the energy detection result.
  • the transceiver unit 720 sends the second information of the first node according to the first information of the first node and the fifth information of the first node, specifically for: performing carrier sensing results or energy detection.
  • the second information of the first node is sent according to the first information of the first node.
  • the transceiving unit 720 is configured to send the second information of the first node according to the first information of the first node, and is specifically configured to: send the second information of the first node to the second node according to the first information of the first node. Send the second information of the first node. Sixth information is received from the second node, and the sixth information indicates whether the second information of the first node is successfully transmitted.
  • the communication device 700 can correspondingly implement the behaviors and functions of the first node in the above method embodiment.
  • the communication device 700 may be a first node, or a component (such as a chip or a circuit) applied in the first node.
  • the transceiver unit 720 may be used to perform all receiving or transmitting operations performed by the first node in the embodiment shown in FIG. 4A.
  • the processing unit 710 is used to determine the transmission order corresponding to the degree of the first node.
  • the transceiver unit 720 is configured to send the seventh information of the first node to the second node according to the transmission sequence corresponding to the degree of the first node.
  • the seventh information of the first node includes information of nodes connected to the first node, and the degree of the first node is determined based on the number of nodes connected to the first node.
  • the communication device 700 can correspondingly implement the behaviors and functions of the second node in the above method embodiments.
  • the communication device 700 may be a second node, or may be a component (such as a chip or a circuit) used in the second node.
  • the transceiver unit 720 may be used to perform all receiving or transmitting operations performed by the second node in the embodiment shown in FIG. 4A.
  • the transceiver unit 720 is configured to receive the seventh information from the first node.
  • the processing unit 710 is configured to subtract a preset value from the degree of the second node after receiving the seventh information of the first node.
  • the transceiver unit 720 is also configured to send the seventh information of the second node to the third node when the degree of the second node is less than or equal to the first threshold.
  • the seventh information of the second node includes information of nodes connected to the second node and seventh information of the first node.
  • the degree of the second node is determined based on the number of nodes connected to the second node.
  • the communication device 700 can correspondingly implement the behaviors and functions of the third node in the above method embodiments.
  • the communication device 700 may be a third node, or may be a component (such as a chip or circuit) applied in the third node.
  • the transceiver unit 720 may be used to perform all receiving or transmitting operations performed by the third node in the embodiment shown in FIG. 4A.
  • the transceiver unit 720 is configured to receive the seventh information from the second node.
  • the degree of the third node is greater than the degree of the second node.
  • the degree of the second node is determined based on the number of nodes connected to the second node, and the degree of the third node is determined based on the number of nodes connected to the third node.
  • the processing unit 710 is configured to subtract a preset value from the degree of the third node after receiving the seventh information from the second node. It can be understood that the preset value can be set based on experience, for example, it can be set to 1, 2, etc.
  • the processing unit 710 is also configured to construct network topology information based on the seventh information of the second node when the degree is less than or equal to a first threshold.
  • the first threshold may be set based on an empirical value, for example, it may be set to 0.
  • the network corresponding to the network topology information includes the second node and the third node.
  • processing unit 710 in the embodiment of the present application can be implemented by a processor or processor-related circuit components
  • transceiver unit 720 can be implemented by a transceiver or transceiver-related circuit components or a communication interface.
  • an embodiment of the present application provides a communication device 800.
  • the communication device 800 includes a processor 810 .
  • the communication device 800 may also include a memory 820 for storing instructions executed by the processor 810 or input data required for the processor 810 to run the instructions or data generated after the processor 810 executes the instructions.
  • the processor 810 can implement the method shown in the above method embodiment through instructions stored in the memory 820 .
  • an embodiment of the present application provides a communication device 900.
  • the communication device 900 may be a chip or a chip system.
  • the chip system may be composed of chips, or may include chips and other discrete devices.
  • the communication device 900 may include at least one processor 910 coupled with a memory.
  • the memory may be located within the device or outside the device.
  • communication device 900 may also include at least one memory 920.
  • the memory 920 stores the computer programs, configuration information, computer programs or instructions and/or data necessary to implement any of the above embodiments; the processor 910 may execute the computer program stored in the memory 920 to complete the method in any of the above embodiments.
  • the coupling in the embodiment of this application is an indirect coupling or communication connection between devices, units or modules, which may be in electrical, mechanical or other forms, and is used for information interaction between devices, units or modules.
  • Processor 910 may cooperate with memory 920.
  • the specific connection medium between the above-mentioned transceiver 930, processor 910 and memory 920 is not limited in the embodiment of the present application.
  • the communication device 900 may also include a transceiver 930, and the communication device 900 may interact with other devices through the transceiver 930.
  • the transceiver 930 can be a circuit, a bus, a transceiver, or any other device that can be used for information exchange, or is also called a signal transceiver unit. As shown in FIG. 9 , the transceiver 930 includes a transmitter 931 , a receiver 932 and an antenna 933 .
  • the transceiver in the communication device 900 can also be an input-output circuit and/or a communication interface, which can input data (or receive data) and output data ( Or, sending data),
  • the processor is an integrated processor or microprocessor or integrated circuit, and the processor can determine the output data according to the input data.
  • the communication device 900 can be applied to the first node.
  • the specific communication device 900 can be the first node, or can be a first node that can support the first node to implement any of the above-mentioned embodiments.
  • functional device The memory 920 stores the necessary computer programs, computer programs or instructions and/or data to implement the functions of the first node in any of the above embodiments.
  • the processor 910 can execute the computer program stored in the memory 920 to complete the method executed by the first node in any of the above embodiments.
  • the communication device 900 can be applied to the second node.
  • the specific communication device 900 can be the second node, or can support the second node to implement the second node in any of the above-mentioned embodiments.
  • the memory 920 stores necessary computer programs, computer programs or instructions and/or data to implement the functions of the second node in any of the above embodiments.
  • the processor 910 can execute the computer program stored in the memory 920 to complete the method executed by the second node in any of the above embodiments.
  • the communication device 900 can be applied to a third node.
  • the specific communication device 900 can be the third node, or can support the third node, to implement the third node in any of the above-mentioned embodiments.
  • the memory 920 stores necessary computer programs, computer programs or instructions and/or data to implement the functions of the third node in any of the above embodiments.
  • the processor 910 can execute the computer program stored in the memory 920 to complete the method executed by the third node in any of the above embodiments.
  • the communication device 900 provided in this embodiment can be applied to the first node to complete the method executed by the first node, or applied to the second node to complete the method executed by the second node, or applied to the third node to complete the above method The method executed by the third node. Therefore, the technical effects that can be obtained can be referred to the above method embodiments, and will not be described again here.
  • the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or Execute each method, step and logical block diagram disclosed in the embodiment of this application.
  • a general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in conjunction with the embodiments of the present application can be directly implemented by a hardware processor for execution, or can be executed by a combination of hardware and software modules in the processor.
  • the memory may be a non-volatile memory, such as a hard disk drive (HDD) or a solid-state drive (SSD), etc., or it may be a volatile memory (volatile memory), such as Random-access memory (RAM).
  • Memory may also be, but is not limited to, any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
  • the memory in the embodiment of the present application can also be a circuit or any other device capable of performing a storage function, used to store computer programs, computer programs or instructions and/or data.
  • the embodiment of the present application also provides another communication device 1000, including: an input and output interface 1010 and a logic circuit 1020; the input and output interface 1010 is used to receive code instructions and transmit them to the logic circuit 1020; Logic circuit 1020 is used to run code instructions to execute the method executed by the first node, the second node, or the third node in any of the above embodiments.
  • the communication device 1000 can be applied to a first node to execute the method executed by the first node, specifically, for example, the method executed by the first node in the embodiment shown in FIG. 3 .
  • the input and output interface 1010 is used to output the second information of the first node according to the first information of the first node.
  • the first information of the first node is determined based on the third information of the first node and the fourth information of the first node.
  • the third information of the first node indicates the number of nodes connected to the first node, or the first information indicates the number of nodes perceived by the first node.
  • the fourth information of the first node indicates the number of nodes sending the second information to the first node.
  • the communication device 1000 can be applied to a first node to perform the method performed by the first node, specifically, for example, the method performed by the first node in the embodiment shown in FIG. 4A.
  • the logic circuit 1020 is used to determine the transmission sequence corresponding to the degree of the first node.
  • the input and output interface 1010 is configured to output the seventh information of the first node to the second node according to the transmission sequence corresponding to the degree of the first node.
  • the seventh information of the first node includes information of nodes connected to the first node, and the degree of the first node is determined based on the number of nodes connected to the first node.
  • the communication device 1000 can be applied to a second node to perform the method performed by the second node. Specifically, for example, the method performed by the second node in the method embodiment shown in FIG. 4A. method.
  • the input and output interface 1010 is used to receive the seventh information from the first node.
  • the logic circuit 1020 is configured to subtract a preset value from the degree of the second node after receiving the seventh information of the first node.
  • the input and output interface 1010 is also used to send the seventh information of the second node to the third node when the degree of the second node is less than or equal to the first threshold.
  • the seventh information of the second node includes information of nodes connected to the second node and seventh information of the first node.
  • the degree of the second node is determined based on the number of nodes connected to the second node.
  • the communication device 1000 can be applied to a third node to perform the method performed by the third node. Specifically, for example, the method performed by the third node in the method embodiment shown in FIG. 4A. method.
  • the input and output interface 1010 is used for receiving the seventh information from the second node.
  • the degree of the third node is greater than the degree of the second node.
  • the degree of the second node is determined based on the number of nodes connected to the second node, and the degree of the third node is determined based on the number of nodes connected to the third node.
  • the logic circuit 1020 is configured to subtract a preset value from the degree of the third node after receiving the seventh information from the second node. It can be understood that the preset value can be set based on experience, for example, it can be set to 1, 2, etc.
  • the logic circuit 1020 is also configured to construct network topology information based on the seventh information of the second node when the degree is less than or equal to a first threshold.
  • the first threshold may be set based on an empirical value, for example, it may be set to 0.
  • the network corresponding to the network topology information includes the second node and the third node.
  • the communication device 1000 provided in this embodiment can be applied to the first node to complete the method executed by the first node, or applied to the second node to complete the method executed by the second node, or applied to the third node to complete the above method
  • the method executed by the third node Therefore, the technical effects that can be obtained can be referred to the above method embodiments, and will not be described again here.
  • embodiments of the present application also provide a communication system.
  • the communication system includes at least one communication device applied to a first node, at least one communication device applied to a second node, and at least one communication device applied to a third node.
  • the technical effects that can be obtained may refer to the above method embodiments and will not be described again here.
  • embodiments of the present application also provide a computer-readable storage medium that stores computer programs or instructions.
  • the first node in any of the above embodiments is executed.
  • the method is implemented or the method executed by the second node is implemented or the method executed by the third node is implemented.
  • the computer-readable storage medium may include: U disk, mobile hard disk, read-only memory, random access memory, magnetic disk or optical disk and other various media that can store program codes.
  • embodiments of the present application also provide a chip including a processor to support the communication device to implement the first node, the second node or the third node in the above method embodiment.
  • the functions involved in the node In a possible design, the chip is connected to a memory or the chip includes a memory, which is used to store computer programs or instructions and data necessary for the communication device.
  • embodiments of the present application may be provided as methods, systems, or computer program products. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment that combines software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
  • computer-usable storage media including, but not limited to, disk storage, CD-ROM, optical storage, etc.
  • These computer programs or instructions may also be stored in a computer-readable memory that causes a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture that includes the instruction means,
  • the instruction means implements the functions specified in a process or processes of the flowchart and/or a block or blocks of the block diagram.
  • These computer programs or instructions may also be loaded onto a computer or other programmable data processing device, causing a series of operating steps to be performed on the computer or other programmable device to produce computer-implemented processing, thereby executing on the computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in a process or processes in the flow diagram and/or in a block or blocks in the block diagram.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente demande, qui relève du domaine technique des communications sans fil, concerne un procédé et un appareil de construction de topologie de réseau, qui sont utilisés pour réduire le temps et le surdébit pour construire ou mettre à jour une topologie de réseau. Selon le procédé, un premier nœud envoie des deuxièmes informations du premier nœud selon des premières informations du premier nœud. Les premières informations du premier nœud sont déterminées selon des troisièmes informations du premier nœud et des quatrièmes informations du premier nœud. Les troisièmes informations du premier nœud indiquent le nombre de nœuds qui sont connectés au premier nœud, ou les premières informations indiquent le nombre de nœuds qui sont perçus par le premier nœud. Les quatrièmes informations du premier nœud indiquent le nombre de nœuds qui envoient les deuxièmes informations au premier nœud. Sur la base de la solution, un premier nœud peut envoyer des deuxièmes informations de celui-ci selon des premières informations, de sorte qu'une topologie de réseau est construite. Par comparaison à un procédé de construction d'une topologie de réseau sur la base d'un mécanisme d'inondation, des informations transmises sont relativement moins redondantes et le nombre d'interactions d'informations est moindre ; par conséquent, le surdébit de transmission et le temps de construction de la topologie de réseau peuvent être réduits.
PCT/CN2022/103023 2022-06-30 2022-06-30 Procédé et appareil de construction de topologie de réseau WO2024000482A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2022/103023 WO2024000482A1 (fr) 2022-06-30 2022-06-30 Procédé et appareil de construction de topologie de réseau

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2022/103023 WO2024000482A1 (fr) 2022-06-30 2022-06-30 Procédé et appareil de construction de topologie de réseau

Publications (1)

Publication Number Publication Date
WO2024000482A1 true WO2024000482A1 (fr) 2024-01-04

Family

ID=89383768

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/103023 WO2024000482A1 (fr) 2022-06-30 2022-06-30 Procédé et appareil de construction de topologie de réseau

Country Status (1)

Country Link
WO (1) WO2024000482A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102984715A (zh) * 2012-12-11 2013-03-20 武汉邮电科学研究院 无线传感器网络的组网方法
CN105847159A (zh) * 2016-03-31 2016-08-10 乐视控股（北京）有限公司 Cdn网络的拓扑结构生成方法和系统
US20200162335A1 (en) * 2018-04-04 2020-05-21 Arista Networks, Inc. Computation of network flooding topologies
US20220173973A1 (en) * 2020-11-30 2022-06-02 Google Llc Connecting processors using twisted torus configurations

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102984715A (zh) * 2012-12-11 2013-03-20 武汉邮电科学研究院 无线传感器网络的组网方法
CN105847159A (zh) * 2016-03-31 2016-08-10 乐视控股（北京）有限公司 Cdn网络的拓扑结构生成方法和系统
US20200162335A1 (en) * 2018-04-04 2020-05-21 Arista Networks, Inc. Computation of network flooding topologies
US20220173973A1 (en) * 2020-11-30 2022-06-02 Google Llc Connecting processors using twisted torus configurations

Similar Documents

Publication Publication Date Title
Demirkol et al. MAC protocols for wireless sensor networks: a survey
US8098615B2 (en) Network protocol
US7911978B1 (en) Adaptive topology discovery in communication networks
US8331282B2 (en) Apparatus and method for adaptive channel hopping in mesh networks
CN107040878B (zh) 一种多链型无线传感器网络的无分层通信方法
Barroso et al. /spl mu/-MAC: an energy-efficient medium access control for wireless sensor networks
KR100902873B1 (ko) 양방향 데이터 통신이 가능한 선형 구조를 갖는 무선 센서네트워크 및 그 방법
US8837354B2 (en) Apparatus and method for supporting wireless actuators and other devices in process control systems
US20080159358A1 (en) Unknown Destination Traffic Repetition
CN108353464B (zh) 网状网络连接性
JP2018535565A (ja) ランダムアクセス中継器、中継システム及びその中継方法
US20220232449A1 (en) Method of Waking up a Mesh Node in a Wireless Mesh Network as Well as a Related Mesh Node and a Computer Program Product
CN110582060B (zh) 通信方法、装置、节点设备及其存储介质
Saravanan An Efficient Multi Channel Query Scheduling In Wireless Sensor Networks
WO2024000482A1 (fr) Procédé et appareil de construction de topologie de réseau
Trelsmo et al. Evaluating IPv6 connectivity for IEEE 802.15. 4 and Bluetooth low energy
US20220337358A1 (en) Overloading broadcast dwell intervals in unsynchronized channel hopping mesh networks
Montero et al. Link scheduling scheme with shared links and virtual tokens for industrial wireless sensor networks
KR20210085646A (ko) 저전력 광역통신망에서 멀티캐스트 업링크 데이터 전송 방법
CN113784413B (zh) 拦阻中继传输协议中的控制帧传输方法及系统
KR101761369B1 (ko) 듀티 사이클 무선 센서 네트워크에서의 시스템, 듀티 사이클 무선 센서 네트워크에서의 노드 및 듀티 사이클 무선 센서 네트워크에서의 전송 스케줄링 설정 방법
JP2023500171A (ja) ハイブリッドネットワークに基づく無線制御システム
Wang et al. Cluster-based Handoff Scheme Design for Platoons in Cellular V2X Networks
KR20240049379A (ko) 통신 방법 및 장치
JP2022141387A (ja) 無線通信システム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22948585

Country of ref document: EP

Kind code of ref document: A1