WO2024067360A1 - 通信方法及通信装置 - Google Patents

通信方法及通信装置 Download PDF

Info

Publication number
WO2024067360A1
WO2024067360A1 PCT/CN2023/120484 CN2023120484W WO2024067360A1 WO 2024067360 A1 WO2024067360 A1 WO 2024067360A1 CN 2023120484 W CN2023120484 W CN 2023120484W WO 2024067360 A1 WO2024067360 A1 WO 2024067360A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
message
type
network
configuration information
Prior art date
Application number
PCT/CN2023/120484
Other languages
English (en)
French (fr)
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 华为技术有限公司
Publication of WO2024067360A1 publication Critical patent/WO2024067360A1/zh

Links

Classifications

    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition

Definitions

  • the present application relates to the field of wireless communication technology, and in particular to a communication method and a communication device.
  • wireless battery management systems BMS
  • sensor networks smart application scenarios such as smart homes, smart cockpits, smart driving, smart manufacturing, and smart transportation
  • smart home scenario can include at least one communication domain, and a communication domain can include multiple nodes (for example, a master node and at least one slave node).
  • the network topology of the communication domain can be a single-hop network or a multi-hop network.
  • a single-hop network includes a master node and at least one slave node connected to the master node.
  • two nodes can negotiate the node type, that is, negotiate which node is the master node and which node is the slave node, to establish an adjacency relationship between the two nodes.
  • the communication method between one node and another node can be a communication method that does not pass through other nodes, or a communication method that forwards through at least one other node.
  • a multi-hop network has more nodes and more complex topological relationships. The method of establishing adjacency relationships in a single-hop network is not applicable to a multi-hop network. Therefore, in a multi-hop network, how nodes obtain their adjacency relationships is a technical problem that needs to be solved urgently.
  • the embodiments of the present application provide a communication method and a communication device, so that nodes can obtain their adjacency relationships, which helps to improve communication efficiency.
  • the present application provides a communication method, which may be executed by a first node, or by a device in the first node, such as a processor, a chip, or a chip system.
  • the method may include: the first node obtains network topology configuration information, wherein the network topology configuration information includes a node identifier, a node type, and network topology information; receives a first message, wherein the first message includes a node identifier of a second node; based on the network topology configuration information, obtains network configuration information of the second node; sends a second message, wherein the second message includes the network configuration information of the second node;
  • the network configuration information of the second node is used to indicate the node type of the second node, the adjacent nodes of the second node, and the node types of the adjacent nodes of the second node.
  • the network configuration information of the second node is used to configure the adjacency relationship of the second node, which may include the node identifier of the second node, the node type of the second node, the node identifier of the second node's adjacent node, and the node type of the second node's adjacent node.
  • the first node when it receives the node identifier of the second node, it can feed back the network configuration information of the second node to the second node based on the network topology configuration information, so that the second node can obtain its adjacency relationship.
  • the second node Compared with the second node negotiating the node type with its adjacent nodes one by one to determine the adjacency relationship, it takes less time and helps to improve communication efficiency.
  • the node types of the second node and the adjacent nodes of the second node are different to improve the stability of the network topology.
  • the first node receiving the first message includes: the first node receiving the first message from the second node; the first node sending the second message includes: the first node sending the second message to the second node.
  • the first node and the second node can communicate directly without forwarding through other nodes.
  • the neighboring nodes of the first node can directly obtain their respective network configuration information from the first node, which helps to save wireless resource overhead.
  • the first node before the first node receives the first message, the first node sends a broadcast message, which is used to indicate that the first node has the network topology configuration capability.
  • the second node that receives the broadcast message can obtain the network configuration information of the second node from the first node, which helps to save time.
  • the network topology configuration capability refers to the ability to configure network configuration information for other nodes and provide network configuration information to other nodes.
  • the first node receiving the first message includes: the first node receiving the first message from the second node through the routing node; the first node sending the second message includes: the first node sending the second message to the second node through the routing node.
  • the communication between the first node and the second node is forwarded through the routing node. Therefore, nodes other than the adjacent nodes of the first node can obtain their respective network configuration information from the first node through the routing node to expand the network topology.
  • the first node after sending the second message, can receive a third message from the third node through the second node, and the third message includes the node identifier of the third node; the first node performs security access authentication on the third node, and the node identifier of the third node is not included in the above network topology configuration information; when the third node passes the security access authentication, the first node sends a fourth message to the third node through the second node, and the fourth message includes the network configuration information of the third node.
  • the second node has a network topology configuration. The forwarding capability is set so that the third node can obtain the network configuration information of the third node from the first node through the second node.
  • the third node is not included in the network topology configuration information, indicating that the third node is not in the planned network topology. Even nodes that are not in the planned network topology can obtain network configuration information from the first node through the routing node, thereby expanding the network topology and improving the flexibility of the network topology.
  • the network topology configuration forwarding capability refers to the ability to forward the network configuration information for other nodes fed back by the first node to other nodes, and also to forward the node identifiers of other nodes to the first node.
  • the present application provides a communication method, which may be executed by a second node, or by a device in the second node, such as a processor, a chip, or a chip system.
  • the method may include: the second node sends a first message, the first message includes a node identifier of the second node; the second node receives a second message, the second message includes network configuration information of the second node;
  • the network configuration information of the second node is used to indicate the node type of the second node, the adjacent nodes of the second node, and the node types of the adjacent nodes of the second node.
  • the network configuration information of the second node is used to configure the adjacency relationship of the second node, which may include the node identifier of the second node, the node type of the second node, the node identifier of the second node's adjacent node, and the node type of the second node's adjacent node.
  • the second node obtains the adjacency relationship of the second node by sending its node identifier. Compared with the second node negotiating the node type with its adjacent nodes one by one to determine the adjacency relationship, it takes less time and helps to improve communication efficiency.
  • the node types of the second node and the adjacent nodes of the second node are different to improve the stability of the network topology.
  • the second node sending the first message includes: the second node sending the first message to the first node; the second node receiving the second message includes: the second node receiving the second message from the first node.
  • the second node and the first node can communicate directly without forwarding through other nodes.
  • the adjacent nodes of the first node can directly obtain their respective network configuration information from the first node, which helps to save wireless resource overhead.
  • the second node receives a broadcast message from the first node, where the broadcast message is used to indicate that the first node has network topology configuration capability, so that the second node can obtain the network configuration information of the second node from the first node, which helps to save time.
  • the second node before receiving the broadcast message from the first node, the second node discovers the first node through a node discovery mechanism.
  • the node discovery mechanism may be that node 1, as the discovered party, sends a system message or a broadcast message in a broadcast manner, and node 2 scans and receives the system message or the broadcast message, and it can be determined that node 2 has discovered node 1.
  • the second node sending the first message includes: the second node sending the first message to the first node through the routing node; the second node receiving the second message includes: the second node receiving the second message from the first node through the routing node.
  • the communication between the second node and the first node is forwarded through the routing node. Therefore, nodes other than the adjacent nodes of the first node can obtain their respective network configuration information from the first node through the routing node to expand the network topology.
  • the second node before sending the first message, receives a broadcast message from the routing node, where the broadcast message indicates that the routing node has the network topology configuration forwarding capability, so that the second node can obtain the network configuration information of the second node from the first node through the routing node to expand the network topology.
  • the second node before receiving the broadcast message from the routing node, the second node discovers the routing node through a node discovery mechanism.
  • the second node may manage the adjacency relationship of the second node according to the network configuration information of the second node when receiving the network configuration information of the second node.
  • Managing the adjacency relationship of the second node may include establishing a first adjacency relationship of the second node, and/or disconnecting a second adjacency relationship of the second node.
  • the first adjacency relationship is the adjacency relationship indicated by the network configuration information of the second node.
  • the second adjacency relationship is the adjacency relationship not indicated by the network configuration information of the second node.
  • the second node manages its adjacency relationship so that the second node operates in the network topology with the adjacency relationship, which helps to improve communication efficiency.
  • the second node when the second node receives the network configuration information of the second node, the second node may update the node type of the second node according to the network configuration information of the second node, so that the second node runs in the network topology with the updated node type, which helps to improve the stability of the network topology.
  • the second node after receiving the second message, receives a third message from the third node, the third message includes the node identifier of the third node; the second node sends the node identifier of the third node to the first node; the second node receives a fourth message from the first node, the fourth message includes the network configuration information of the third node; and sends the network configuration information of the third node to the third node.
  • the second node has the network topology configuration forwarding capability, so that the third node can obtain the network configuration information of the third node from the first node through the second node to expand the network topology.
  • the second node after receiving the second message, the second node receives a third message from the third node, the third message includes the node identifier of the third node; the second node sends a fourth message to the third node, the fourth message is used to indicate that the second node does not have the network topology configuration forwarding capability. It can be seen that when the second node does not have the network topology configuration forwarding capability, the second node will not forward the third node. Node identification. This can effectively control the boundary range of the network topology.
  • the present application provides a communication method, which can be executed by a first node, or by a device in the first node, such as a processor, a chip, or a chip system.
  • the method may include: the first node obtains a network topology construction rule, the network topology construction rule is used to indicate the rules that the first hop count and the second hop count need to satisfy; the first hop count is the minimum hop count from the first node to the second node in the network topology, and the second hop count is the minimum hop count from the first node to the third node in the network topology; the first node broadcasts a network path detection message, and the network path detection message is used to detect and carry the hop count between nodes.
  • the second node and the third node may be any two adjacent nodes used to construct the network topology.
  • the network topology construction rule may indicate a rule for establishing an adjacency relationship between any two adjacent nodes to construct the network topology.
  • the first node obtains the rules that need to be satisfied by the first hop count and the second hop count so that the node can dynamically obtain the adjacency relationship according to the network detection message, thereby dynamically constructing the network topology, which helps to improve the flexibility of the network topology and improve communication efficiency.
  • the above network topology construction rule is also used to indicate a rule that the node identifier of the second node and the node identifier of the third node need to satisfy.
  • the first node broadcasts the network topology construction rule, so that the node receiving the rule can establish an adjacency relationship with its adjacent node according to the rule.
  • the first node periodically broadcasts a network path detection message to dynamically construct a network topology.
  • the present application provides a communication method, which can be executed by a second node, or by a device in the second node, such as a processor, a chip, or a chip system.
  • the method may include: the second node receives a network path detection message from the first node; updates a first hop count according to the network path detection message, the first hop count being the minimum hop count from the first node to the second node; the second node obtains a second hop count from a third node, the second hop count being the minimum hop count from the first node to the third node; and determines the node type of the second node and the node type of the third node according to the first hop count and the second hop count.
  • the second node determines the node type of the second node and the node type of the third node according to the first hop number and the second hop number to establish an adjacency relationship between the second node and the third node, which helps to improve communication efficiency.
  • the first hop count is maintained locally by the second node. That is, the first hop count is the minimum hop count recorded locally by the second node, so that the second node updates the first hop count according to the received network detection message.
  • the second node can dynamically establish its adjacency relationship, which helps to improve the flexibility of the network topology.
  • the second node determines the node type of the second node and the node type of the third node according to the first hop number and the second hop number, which may include: if the first hop number is less than the second hop number, the second node determines the node type of the second node to be the first type and the node type of the third node to be the second type; or, if the first hop number is greater than the second hop number, the second node determines the node type of the second node to be the second type and the node type of the third node to be the first type; wherein the first type is different from the second type.
  • the second node determines the node type of the second node and the node type of the third node by comparing the first hop number and the second hop number, so as to establish an adjacency relationship between the second node and the third node.
  • the first hop count is equal to the second hop count
  • the second node determines the node type of the second node and the node type of the third node based on the first hop count and the second hop count, which may include: the second node determines the node type of the second node and the node type of the third node based on a preset rule, wherein the preset rule is related to the size of the node identifier.
  • the second node before the second node updates the first hop count according to the network path detection message, the second node sends a first broadcast message, the first broadcast message includes the node identifier of the second node; receives a second broadcast message from a third node, the second broadcast message includes the node identifier of the third node; and determines the initial node type of the second node and the initial node type of the third node according to the node identifier of the second node and the node identifier of the third node.
  • the second node determines the initial node type of the second node and the initial node type of the third node through the node identifier of the second node and the node identifier of the second node, so as to establish an initial adjacency relationship between the second node and the third node.
  • the initial adjacency relationship is not fixed and may be replaced by an adjacency relationship determined according to the first hop count and the second hop count, thereby realizing the dynamic establishment of an adjacency relationship.
  • the second node determines the initial node type of the second node and the initial node type of the third node according to the node identifier of the second node and the node identifier of the third node, which may include: if the node identifier of the second node is smaller than the node identifier of the third node, the second node determines the initial node type of the second node to be the first type and the initial node type of the third node to be the second type; or, if the node identifier of the second node is larger than the node identifier of the third node, the second node determines the initial node type of the second node to be the second type and the initial node type of the third node to be the first type; wherein the first type is different from the second type.
  • the second node determines the initial node type of the second node and the initial node type of the third node by comparing the size of the node identifiers, so as to establish an initial adjacency relationship between the second node and the third node.
  • the second node sends a first network path detection message to the fourth node, the hop number in the first network path detection message is the third hop number, and the third hop number is the same as the update number.
  • the difference of the first hop number after the network is connected is a preset value. This enables the network topology to be updated, which helps to improve the flexibility of the network topology. Specifically, the preset value can be 1.
  • the second node obtains a duration during which the node type of the second node is the first type; if the duration is greater than a preset duration, the second node maintains the node type of the second node as the first type, thereby reducing traffic loss caused by frequent switching of node types.
  • the present application provides a communication device, comprising a module or unit for executing the method as described in any one of the first to fourth aspects.
  • the communication device includes:
  • a processing unit used to obtain network topology configuration information, the network topology configuration information includes node identification, node type and network topology information;
  • a communication unit configured to receive a first message, wherein the first message includes a node identifier of a second node;
  • the processing unit is further used to obtain network configuration information of the second node based on the network topology configuration information
  • the communication unit is further used to send a second message, where the second message includes network configuration information of the second node;
  • the network configuration information of the second node is used to indicate: the node type of the second node; the adjacent nodes of the second node; and the node types of the adjacent nodes of the second node.
  • the node type of the second node is different from that of an adjacent node of the second node.
  • the communication unit is specifically configured to receive a first message from the second node; and send a second message to the second node.
  • the communication unit is further used to send a broadcast message, where the broadcast message is used to indicate that the first node has the network topology configuration capability.
  • the communication unit is specifically configured to receive a first message from the second node through the routing node; and send a second message to the second node through the routing node.
  • the communication unit is further configured to receive a third message from a third node through the second node, where the third message includes a node identifier of the third node;
  • the processing unit is further used to perform security access authentication on a third node, the node identifier of the third node is not included in the network topology configuration information;
  • the communication unit is further configured to send a fourth message to the third node through the second node when the third node passes the security access authentication, wherein the fourth message includes the network configuration information of the third node.
  • the communication device includes:
  • a communication unit configured to send a first message, the first message including a node identifier of a second node; and receive a second message, the second message including network configuration information of the second node;
  • the network configuration information of the second node is used to indicate: the node type of the second node; the adjacent nodes of the second node; and the node types of the adjacent nodes of the second node.
  • the node type of the second node is different from that of an adjacent node of the second node.
  • the communication unit is specifically configured to send a first message to the first node; and receive a second message from the first node.
  • the communication unit is further used to receive a broadcast message from the first node, where the broadcast message is used to indicate that the first node has the network topology configuration capability.
  • the communication unit is specifically configured to send a first message to the first node through the routing node; and receive a second message from the first node through the routing node.
  • the communication unit is further used to receive a broadcast message from a routing node, where the broadcast message is used to indicate that the routing node has a network topology configuration forwarding capability.
  • the communication device further includes a processing unit, configured to manage the adjacency relationship of the second node according to the network configuration information of the second node.
  • the processing unit is further used to update the node type of the second node according to the network configuration information of the second node.
  • the communication unit is also used to receive a third message from a third node, the third message including a node identifier of the third node; send the node identifier of the third node to the first node; receive a fourth message from the first node, the fourth message including network configuration information of the third node; and send the network configuration information of the third node to the third node.
  • the communication unit is further used to receive a third message from a third node, the third message including a node identifier of the third node; and send a fourth message to the third node, the fourth message being used to indicate that the second node does not have a network topology configuration forwarding capability.
  • the communication device includes:
  • a processing unit used for network topology construction rules, the network topology construction rules are used to indicate rules that need to be satisfied by the first hop count and the second hop count; the first hop count is the minimum hop count from the first node to the second node in the network topology, and the second hop count is the minimum hop count from the first node to the third node in the network topology;
  • the communication unit is used to broadcast a network path detection message, and the network path detection message is used to detect and carry the number of hops between nodes.
  • the network topology construction rule is also used to indicate a rule that the node identifier of the second node and the node identifier of the third node need to satisfy.
  • the communication unit is also used to broadcast network topology construction rules.
  • the communication device includes:
  • a communication unit configured to receive a network path detection message from the first node
  • a processing unit configured to update a first hop count according to a network path detection message, wherein the first hop count is the minimum hop count from the first node to the second node.
  • the communication unit is further used to obtain a second hop number from the third node, where the second hop number is a minimum hop number from the first node to the third node;
  • the processing unit is further configured to determine a node type of the second node and a node type of the third node according to the first hop count and the second hop count.
  • the processing unit is specifically used to determine that the node type of the second node is the first type and the node type of the third node is the second type when the first hop number is less than the second hop number; or, when the first hop number is greater than the second hop number, determine that the node type of the second node is the second type and the node type of the third node is the first type; wherein the first type is different from the second type.
  • the first hop count is equal to the second hop count; the processing unit is specifically used to determine the node type of the second node and the node type of the third node according to a preset rule; wherein the preset rule is related to the size of the node identifier.
  • the communication unit is further configured to send a first broadcast message, the first broadcast message including a node identifier of the second node; and receive a second broadcast message from a third node, the second broadcast message including a node identifier of the third node;
  • the processing unit is further used to determine the initial node type of the second node and the initial node type of the third node according to the node identifier of the second node and the node identifier of the third node.
  • the processing unit is specifically used to determine that the initial node type of the second node is the first type and the initial node type of the third node is the second type when the node identifier of the second node is smaller than the node identifier of the third node; or, when the node identifier of the second node is greater than the node identifier of the third node, determine that the initial node type of the second node is the second type and the initial node type of the third node is the first type; wherein the first type is different from the second type.
  • the first hop number after updating according to the network path detection message is less than the first hop number before updating; the communication unit is also used to send a first network path detection message to the fourth node, the hop number in the first network path detection message is the third hop number, and the difference between the third hop number and the updated first hop number is a preset value.
  • the processing unit is further used for the second node to obtain a duration during which the node type of the second node is the first type; when the duration is greater than a preset duration, the node type of the second node is maintained as the first type.
  • an embodiment of the present application provides a communication device, including a processor.
  • the processor is coupled to a memory and can be used to execute instructions in the memory to implement the method of any aspect of the first to fourth aspects and any possible implementation method.
  • the communication device also includes a memory.
  • the communication device also includes a communication interface, and the processor is coupled to the communication interface.
  • an embodiment of the present application provides a communication device, comprising: a logic circuit and a communication interface.
  • the communication interface is used to receive information or send information;
  • the logic circuit is used to receive information or send information through the communication interface, so that the communication device executes the method of any aspect of the first to fourth aspects and any possible implementation method.
  • an embodiment of the present application provides a computer-readable storage medium, which is used to store a computer program (also referred to as code, or instructions); when the computer program is run on a computer, the method of any one of the first to fourth aspects and any possible implementation method mentioned above is implemented.
  • a computer program also referred to as code, or instructions
  • an embodiment of the present application provides a computer program product, which includes: a computer program (also referred to as code, or instructions); when the computer program is executed, it enables the computer to execute any one of the above-mentioned first to fourth aspects and any possible implementation method.
  • a computer program also referred to as code, or instructions
  • an embodiment of the present application provides a chip, the chip including a processor, the processor being used to execute instructions, when the processor executes the instructions, the chip executes the method of any aspect of the first to fourth aspects and any possible implementation method.
  • the chip also includes a communication interface, the communication interface being used to receive or send signals.
  • an embodiment of the present application provides a terminal device, wherein the terminal device comprises at least one communication device as described in the fifth aspect.
  • the terminal device comprises at least one communication device as described in the fifth aspect.
  • an embodiment of the present application provides a system, which includes a terminal device and at least one communication device as described in the fifth aspect, or the communication device as described in the sixth aspect, or the communication device as described in the seventh aspect, or the chip as described in the tenth aspect.
  • the process of sending information and/or receiving information in the above method can be understood as a process in which the processor outputs information, and/or a process in which the processor receives input information.
  • the processor can output the information to the transceiver (or communication interface, or sending module) so that it can be transmitted by the transceiver. After the information is output by the processor, it may also need to be processed otherwise before it reaches the transceiver.
  • the transceiver or communication interface, or sending module
  • the transceiver receives the information and inputs it into the processor. Furthermore, after the transceiver receives the information, the information may need to be processed otherwise before it is input into the processor.
  • the sending information mentioned in the above method can be understood as the processor outputting information.
  • the receiving information can be understood as the processor receiving input information.
  • the processor may be a processor specifically used to execute these methods, or a processor that executes these methods by executing computer instructions in a memory, such as a general-purpose processor.
  • the memory may be a non-transitory memory, such as a read-only memory (ROM), which may be integrated with the processor on the same chip or may be separately arranged on different chips.
  • ROM read-only memory
  • the at least one memory is located outside the device.
  • the at least one memory is located within the device.
  • part of the at least one memory is located inside the device, and another part of the memory is located outside the device.
  • the processor and the memory may also be integrated into one device, that is, the processor and the memory may also be integrated together.
  • FIG1 is an example diagram of several topological structures of a communication domain
  • FIG2 is an example diagram of a wireless BMS scenario
  • FIG3 is an example diagram of a smart home scene
  • FIG4 is a diagram showing an example of a network topology structure of a multi-hop network provided by the present application.
  • FIG5 is a schematic diagram of a possible wireless communication system provided by the present application.
  • FIG6 is a flow chart of a communication method provided by the present application.
  • FIG6A is a network topology configuration information presented in a tree diagram format
  • FIG6B is an exemplary diagram of the embodiment shown in FIG6 ;
  • FIG7 is a flow chart of another communication method provided by the present application.
  • FIG. 7A is an exemplary diagram of the embodiment shown in FIG. 7 ;
  • FIG8 is a flow chart of another communication method provided by the present application.
  • FIG9 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application.
  • FIG10 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application.
  • FIG. 11 is a schematic diagram of the structure of a chip provided in an embodiment of the present application.
  • words such as “first” and “second” are used to distinguish between identical or similar items with substantially the same functions and effects. Those skilled in the art will understand that words such as “first” and “second” do not limit the quantity and execution order, and words such as “first” and “second” do not necessarily limit differences.
  • “And/or” describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and/or B may represent: A exists alone, A and B exist at the same time, and B exists alone. The character “/" generally indicates that the previously associated objects are in an "or” relationship.
  • a node is an electronic device with communication capabilities, also known as a communication node.
  • a node may include a handheld terminal, a vehicle, a vehicle-mounted device, or a network-side device, a user device, an access terminal, a user unit, a user station, a mobile station, a mobile station, a remote station, a remote terminal, a wireless communication device, a user agent, or a user device, or may be a component (such as a chip or an integrated circuit) contained in an independent device.
  • a node may be any possible intelligent terminal device (such as a mobile phone), intelligent transportation equipment (such as a vehicle, a drone, etc.), an intelligent manufacturing device, an intelligent home device (such as a large screen, a speaker, a printer, etc.), etc.
  • intelligent terminal device such as a mobile phone
  • intelligent transportation equipment such as a vehicle, a drone, etc.
  • an intelligent manufacturing device such as a robot, a robot, etc.
  • an intelligent home device such as a large screen, a speaker, a printer, etc.
  • the node when it is a vehicle-mounted device, it can be a cockpit domain device or a module in the cockpit domain device, such as one or more of the cockpit domain controller (CDC), camera, screen, microphone, audio, electronic key, keyless entry and start system controller, etc.
  • the node can also be a wireless battery management system (wBMS), or a battery management unit (BMU) in the wBMS.
  • wBMS wireless battery management system
  • BMU battery management unit
  • the node when it is a handheld terminal, it can be a mobile phone, a wearable device, a tablet computer (pad), or a computer with data receiving and sending functions (such as a laptop computer, a PDA, etc.).
  • the nodes in this application can be applied to a variety of application scenarios, such as the following application scenarios: mobile internet (MI), industrial control, self driving, transportation safety, internet of things (IoT), smart city, or smart home, etc.
  • MI mobile internet
  • IoT internet of things
  • smart city smart home
  • smart home etc.
  • the nodes in the present application can be applied to various network types, for example, one or more of the following network types: SparkLink, long term evolution (LTE) network, fifth generation mobile communication technology (5G), wireless local area network (for example, Wi-Fi), Bluetooth (BT), Zigbee, or vehicle-mounted short-range wireless communication network, etc.
  • SparkLink long term evolution (LTE) network
  • LTE long term evolution
  • 5G fifth generation mobile communication technology
  • Wi-Fi wireless local area network
  • Bluetooth Bluetooth
  • Zigbee Zigbee
  • vehicle-mounted short-range wireless communication network etc.
  • nodes In some application scenarios or certain network types, devices with similar communication capabilities may not be called nodes, but for the convenience of description, devices with communication capabilities are collectively referred to as nodes in the embodiments of the present application.
  • the node type is used to describe the type of the node.
  • the node type can also be described as a node identity or a node role, etc.
  • the node type is divided into a first type, a second type, and a third type.
  • the first type of node may be called a grant (G) node, a G node, or a control node, etc.
  • the first type of node is called a G node as an example.
  • the second type of node may be called a terminal (T) or a T-node, etc.
  • the second type of node is called a T-node as an example.
  • the third type of node may be called a dual identity node, a dual role node, or a G(T) node, etc.
  • the third type of node is called a G(T) node as an example.
  • a G(T) node has both the functions of a G node and a T node.
  • a T node can connect to a G node or a G(T) node.
  • a G(T) node When a G(T) node is a T node, it can connect to a G node.
  • a G(T) node When a G(T) node is a G node, it can connect to a T node.
  • the embodiments of the present application take G nodes, T nodes and G(T) nodes as examples.
  • G nodes, T nodes and G(T) nodes may adopt other names.
  • a communication system (such as a Star Flash communication system) usually includes multiple nodes, and the nodes can communicate with each other to transmit data.
  • the vehicle-mounted communication system as an example, there can be multiple communication domains in the vehicle.
  • a communication domain refers to a system composed of a group of nodes with a communication relationship and a communication connection relationship (i.e., a communication link) between the communication nodes, which is usually used to complete a specific function.
  • a communication domain may include a master node and at least one slave node, and the master and slave nodes, or the master node and the master node, or the slave node and the slave node can communicate with each other.
  • the master node can manage the slave node, has the function of allocating resources, and is responsible for allocating resources to the slave node; the slave node listens to the scheduling of the master node, and uses the resources allocated by the master node to communicate with the master node and/or other nodes. For a communication domain, any two nodes in the communication domain can communicate based on the communication address.
  • the master node may also be called a G node, and the slave node may also be called a T node.
  • its topology can be a star single-hop topology, a tree three-layer multi-hop topology, or a tree multi-hop topology.
  • communication domain 1 includes a G node and multiple T nodes (e.g., T1 node, T2 node, ..., Tn node), and each T node is connected to a G node.
  • T nodes e.g., T1 node, T2 node, ..., Tn node
  • the communication between them can be two-way unicast or G->T broadcast communication.
  • the structure shown in (a) of FIG1 can be applied to vehicle-mounted communication scenarios.
  • the G node can be a telematics box (T-BOX), and the T node can be a user terminal in the vehicle, and the user terminal can be, for example, a mobile phone, a headset, a stereo, a vehicle-mounted device, etc.
  • T-BOX can also be called a remote vehicle-mounted terminal or a vehicle network communication terminal.
  • T-BOX can establish a communication connection with a mobile phone to realize control such as opening and locking doors, controlling windows, and switching air conditioners.
  • communication domain 2 includes G1 node, G2 node, G3 node, T1 node, T2 node, T3 node and T4 node, T1 node and T2 node are connected to G2 node, T3 node and T4 node are connected to G3 node, and G2 node and G3 node are connected to G1 node.
  • the G1 node can be used as the general management node
  • the G2 node and the G3 node can be G(T) nodes
  • the G2 node can be expressed as G2(T)
  • the G3 node can be expressed as G3(T).
  • the G2 node for the communication between the G2 node and the node G1, the G2 node can be used as the T node, and the G1 node can be used as the G node; for the communication between the G2 node and the T1 node, the G2 node can be used as the G node, and the T1 node can be used as the T node.
  • the communication between the G node and the T node can be bidirectional unicast (for example, the bidirectional unicast between the G1 node and T1 can be expressed as G1-G2(T)-T1) or broadcast (for example, G1->G2(T)->T).
  • the structure shown in (b) of Figure 1 can be applied to wireless BMS scenarios.
  • the wireless BMS scenario can be shown in Figure 2.
  • the battery stack management system (BAMS) serves as the general management node
  • the battery cluster management system (BCMS) is the G(T) node
  • the BMU serves as the T node.
  • the structure shown in (b) of Figure 1 can also be applied to wireless tire pressure monitoring scenarios, etc.
  • the communication domain 3 includes a G1 node, a G2 node, a G3 node, a G4 node, a T1 node, a T2 node and a T3 node.
  • the T1 node is connected to the G2 node
  • the T2 node is connected to the G4 node
  • the G4 node can be connected to the G2 node and the G3 node
  • the G2 node is connected to the G1 node
  • the G3 node is connected to the G1 node.
  • the G1 node can be used as a general management node
  • the G2 node, the G3 node and the G4 node can be G(T) nodes.
  • the structure shown in (c) of FIG1 can be applied to smart home scenarios.
  • the smart home scenario can be shown in FIG3.
  • the gateway/customer premises equipment (CPE) serves as the general management node
  • the sub-router, large screen, mobile phone and air conditioner serve as G(T) nodes
  • the water heater, smart curtain, speaker, microphone, printer and smart door lock serve as T nodes.
  • the structure shown in (c) of FIG1 can also be applied to low-power large-scale sensor networks, for example, in low-power large-scale sensor networks, the root node can serve as the general management node, the backbone node can serve as the G(T), and the terminal node can serve as the T node.
  • Figure 4 is a structural example diagram of a network topology of a multi-hop network provided by the present application.
  • the network topology described in Figure 4 includes an M node 401, I nodes 402 to 407, I nodes 415, and E nodes 408 to 414. It should be noted that the number of nodes shown in Figure 4 is for example only and does not constitute a limitation on the present application.
  • I node refers to the intermediate node or intermediate routing node, which can be the sender or receiver of the message. I node does not move frequently in the network and has routing and forwarding capabilities. I node can be a wireless intermediate system (WIS) node, for example.
  • WIS wireless intermediate system
  • E-node refers to an end node or terminal node, which can be a message sender or receiver. E-node is movable in the network, for example, migrating from connecting to one I-node to connecting to another I-node. I-node does not have routing and forwarding capabilities. E-node can be, for example, a wireless end system (WES) node. I-node and E-node are physical nodes or physical units, which can be understood as actual nodes or units. In terms of power storage, the power storage capacity of I-node is higher than that of E-node, and E-node may not have a long-term power supply.
  • WES wireless end system
  • the M node 401 assumes the role of a manager and may have network topology configuration capabilities, network path detection message broadcasting capabilities, and other capabilities.
  • the M node may obtain network topology configuration information, or obtain network topology construction rules.
  • the M node may have a network topology configuration capability, and may configure and manage the network topology based on the network topology configuration information.
  • the M node may broadcast a network path detection message to its adjacent nodes (I nodes or E nodes), and the adjacent nodes of the M node may further broadcast a network detection message, so that two adjacent nodes can establish an adjacency relationship based on the number of hops in the network path detection message, thereby forming a dynamic network topology.
  • An M node is a functional node, a functional unit, a logical node or a logical unit, which can be understood as a virtual node or unit.
  • the function of the M node 401 can be implemented by an I node, that is, the I node assumes the role of a manager, and the essence of the M node is an I node.
  • An M node can also be described as a manager node.
  • the network topology shown in Figure 4 can be a communication domain, and the several topological structures shown in Figure 1 can be subsets of the network topology shown in Figure 4.
  • the G1 node, G2 node, and G3 node in Figure 1 (b) can be the I node in Figure 4
  • the T1 node to the T4 node in Figure 1 (b) can be the E node in Figure 4
  • the G1 node can have the function of the M node.
  • the gateway/CPE, sub-router, large screen, mobile phone, and air conditioner in Figure 3 can be used as I nodes
  • the gateway/CPE can have the function of an M node
  • the water heater, smart window Curtains and smart door locks can serve as E-nodes.
  • the network topology involved in the embodiments of the present application is a multi-hop network topology, such as Figure 1(b) and Figure 1(c).
  • the multi-hop network can also be described as a mesh network, a wireless multi-hop network, or a wireless mesh network.
  • the embodiments of the present application can be applied to vehicle communication scenarios, wireless BMS scenarios (as shown in Figure 2), battery pack/cell storage scenarios, smart home scenarios (as shown in Figure 3), smart cockpits, smart driving, smart manufacturing, smart transportation and other smart application scenarios.
  • the communicating nodes include a first node and a second node.
  • FIG5 is a schematic diagram of a possible wireless communication system provided by the present application, the wireless communication system includes a first node 501 and a second node 502.
  • a communication domain includes an M node
  • the first node 501 has the function of an M node.
  • the second node 502 can be any of the following modes:
  • the second node 502 may be an adjacent node of the first node 501 , and may be an I node or an E node.
  • the second node 502 may be an I node 402 , or may be an E node adjacent to the M node 401 .
  • the second node 502 may be a node that communicates with the first node 501 through an intermediate node.
  • the second node 502 may be an I node or an E node.
  • the second node 502 when the second node 502 is an E node 412, it communicates with the M node 401 through the I node 406 and the I node 415.
  • the second node 502 when the second node 502 is an I node 406, it communicates with the M node 401 through the I node 415.
  • the wireless communication system shown in FIG5 may include more nodes, and for the convenience of description, the first node and the second node are shown here.
  • a third node may also be included.
  • FIG6 is a flow chart of a communication method provided by the present application.
  • the method may include but is not limited to the following steps:
  • the first node obtains network topology configuration information.
  • the first node may be the M node 401 in FIG4.
  • the network administrator may select a node in the network topology of the multi-hop network as the M node, and set the node as the M node.
  • the network administrator may select the gateway/CPE as the M node.
  • the M node in the network topology may be a default setting, for example, when the network topology of the wireless battery management system is set at the factory, the BAMS is set as the M node by default.
  • the network topology configuration information may include a node identifier, a node type, and network topology information.
  • the node identifier is used to identify the node, for example, it may be a layer 2 identity (L2ID), and the length of the L2ID may be 48 bits.
  • the node type may be divided into a first type, a second type, and a third type. If the node type of a node is the first type, it indicates that the node is a G node; if the node type of a node is the second type, it indicates that the node is a T node; if the node type of a node is the third type, it indicates that the node is a G(T) node.
  • the network topology information is used to indicate the network topology structure, and the network topology structure may include the adjacency relationship between nodes, for example, node 1 is adjacent to node 2, node 2 is adjacent to node 3, etc.
  • the network topology configuration information of a multi-hop network it may indicate the node identifier of each node in the multi-hop network, the node type of each node, and the adjacency relationship between nodes in the multi-hop network.
  • the network topology configuration information may be presented in the form of a table or a tree diagram.
  • the network topology configuration information is presented in a table form, as shown in Table 1 below.
  • node 1 is a G node, its adjacent nodes are node 2 and node 3, node 2 is a G(T) node, and node 3 is a T node; node 2 is a G(T) node, its adjacent nodes are node 1 and node 4, node 1 is a G node, and node 4 is a T node.
  • L2ID is 48 bits
  • A, B, C, and D can represent different values of 48-bit L2ID.
  • node 1 is a G node, and its L2ID is A; node 1's adjacent nodes are node 2 and node 3; node 2 is a G(T) node, and its L2ID is B; node 3 is a T node, and its L2ID is C; node 2's adjacent nodes are node 1 and node 4; node 4 is a T node, and its L2ID is D.
  • the length of the L2ID is 48 bits
  • A, B, C, and D can represent different values of the 48-bit L2ID.
  • the network topology configuration information includes a node identifier, a node type, and network topology information, wherein the network topology information is used to configure the adjacency relationship of each node in a plurality of nodes.
  • the adjacency relationship of a node may include the node identifier of the node, the node type of the node, the neighbor relationship of the node, and the node type of the node.
  • the network configuration information includes the adjacency relationship of each node from node 1 to node 4, and the adjacent node of node 1 includes node 2, then the adjacency relationship of node 1 includes the L2ID of node 1, the node type of node 1, the L2ID of node 2, and the node type of node 2.
  • Node 1 can know that node 2 is its adjacent node, as well as the L2ID and node type of node 2 through the adjacency relationship.
  • a node can know which adjacent nodes it has, as well as the node ID and node type of its adjacent nodes through its adjacency relationship.
  • the network topology configuration information may be static, that is, the node type, node identifier, and network topology information are pre-configured in the network topology configuration information.
  • the network topology configuration information may be pre-configured in the first node by a network administrator, so that the first node can obtain the network topology configuration information.
  • the network administrator inputs the network topology configuration information to the M node, so that the M node can obtain the network topology configuration information.
  • the network topology configuration information may be a default setting.
  • the network topology configuration information of the wireless battery management system is set in the BAMS during factory settings, so that the BAMS can obtain the network topology configuration information when it is started.
  • the network topology configuration information may be generated by the first node.
  • the first node generates the network topology information according to the node identifier and node type of each node in the multi-hop network, and then generates the network topology configuration information.
  • the first node has the network topology configuration capability.
  • the first node can provide network configuration information to the node requesting to go online in the multi-hop network based on the network topology configuration information of the multi-hop network.
  • the node that goes online in the multi-hop network can also be described as a node running in the multi-hop network. It should be noted that after a multi-hop network is initialized and determines the first node, the nodes that have gone online in the multi-hop network temporarily include the first node, waiting for other nodes in the network topology configuration information of the multi-hop network to go online.
  • the second node sends a first message to the first node.
  • the first node receives the first message from the second node.
  • the first message includes a node identifier of the second node.
  • the node identifier of the second node may be, for example, an L2ID.
  • the second node can be understood as a node requesting to go online.
  • the above-mentioned network topology configuration information is the network topology configuration information of the multi-hop network 1
  • the second node can be a node requesting to go online in the multi-hop network 1.
  • the first message includes a node identifier of the second node, which can indicate that the second node requests to go online in the multi-hop network where the first node is located.
  • the node identifier of the second node may or may not be configured in the network topology configuration information.
  • the embodiment shown in Figure 6 take the example in which the node identifier of the second node is configured in the network topology configuration information and the second node is an adjacent node of the first node.
  • the second node Before the second node sends the first message to the first node, the second node establishes a connection with the first node.
  • the second node establishing a connection with the first node may include: the second node discovers the first node, or the first node discovers the second node, and then the second node accesses the wireless network where the first node is located; the broadcast message received by the second node indicates that the first node has the network topology configuration capability, then the second node establishes a connection with the first node. If the broadcast message indicates that the first node does not have the network topology configuration capability, the second node does not establish a connection with the first node.
  • the broadcast message may include an indication information, and the indication information is used to indicate whether the first node has the network topology configuration capability.
  • the indication information can be described as network configuration capability indication information or network configuration status indication information, etc., and can be a bit or a field, and the value of the bit or the value of the field is used to indicate whether the first node has the network topology configuration capability. For example, the value of the bit is 1, indicating that the first node has the network topology configuration capability; the value of the bit is 0, indicating that the first node does not have the network topology configuration capability.
  • the second node discovers the first node, which can be the first node as the discovered party sending the first system message or the first broadcast message in a broadcast manner, and the second node scans and receives the first system message or the first broadcast message, so that the second node can determine that the first node has been discovered.
  • the first system message or the first broadcast message may carry the device information of the first node, such as carrying the node identifier of the first node.
  • the first broadcast message and the above-mentioned broadcast message indicating whether the first node has the ability to configure the network topology can be the same broadcast message or different broadcast messages.
  • the first node first sends the first broadcast message in a broadcast manner, and the second node determines that the first node has been discovered when scanning and receiving the first broadcast message; then, the first node broadcasts the broadcast message indicating whether the first node has the ability to configure the network topology in a broadcast manner.
  • the second node executes a node discovery mechanism with a node type of the second type to discover the first node, that is, executes a node discovery mechanism as a T node.
  • the second node can access the network where the first node is located with a node type of the second type, that is, access the network as a T node. In other words, the second node establishes a connection with the first node as a T node.
  • the first node discovers the second node, which may be that the second node, as the discovered party, sends a second system message or a second broadcast message in a broadcast manner, and the first node scans the received second system message or second broadcast message, so that the first node can determine that the second node is discovered.
  • the second system message or the second broadcast message carries device information of the second node, such as a node identifier of the second node.
  • the node discovery mechanism is mutual.
  • the node being discovered (e.g., node 1) sends a system message or a broadcast message in a broadcasting manner, and the system message or the broadcast message carries the device information of node 1.
  • the node being discovered (e.g., node 2) scans and receives the system message or the broadcast message to determine whether to establish a connection with node 1.
  • the first node obtains network configuration information of the second node based on the network topology configuration information.
  • the first node When the first node receives the node identifier of the second node, it can search whether the node identifier of the second node is included in the network topology configuration information. If the network topology configuration information includes the node identifier of the second node, the first node obtains the network configuration information of the second node from the network topology configuration information according to the node identifier of the second node. In other words, the first node obtains the network configuration information of the second node based on the network topology configuration information.
  • the network configuration information of the second node is used to indicate the node type of the second node, the adjacent nodes of the second node, and the node type of the adjacent nodes of the second node. It can be understood that the network configuration information of the second node is used to configure the adjacency relationship of the second node, and the adjacency relationship may include the node identifier of the second node, the node type of the second node, the node identifier of the adjacent nodes of the second node, and the node type of the adjacent nodes of the second node.
  • the number of the adjacent nodes of the second node may be one or more, depending on the network topology information.
  • the node types of two directly connected nodes are different.
  • the node types of node 1 and node 2 are different, and the node types of node 1 and node 3 are different.
  • the node type of the second node is different from the node type of its adjacent node.
  • the first node is an M node, i.e., a G node
  • the second node can be a T node or a G(T) node.
  • the network configuration information of the node may include that the node type of the node is a G node, the node identifier of the node, the node type of the adjacent node of the node is a T node, and the node identifier of the T node which is the adjacent node of the node; or the node type of the node is a T node, the node identifier of the node, the node type of the adjacent node of the node is a G node, and the node identifier of the G node which is the adjacent node of the node; or the node type of the node is a G(T) node, the node identifier of the node, the node type of the adjacent node of the node is a G node, the node type of the adjacent node of the node is a T node, the node identifier of the G node which is the adjacent node;
  • the network configuration information of node 2 may include the node type of node 2 as a G(T) node, the L2ID of node 2, the adjacent node of node 2 as a T node is node 1 (G node), the L2ID of node 1, the adjacent node of node 2 as a G node is node 4 (T node), and the L2ID of node 4.
  • the first node sends a second message to the second node.
  • the second node receives the second message from the first node.
  • the second message includes network configuration information of the second node.
  • the second node When the second node receives the network configuration information of the second node, the second node runs in the multi-hop network where the first node is located with the network configuration information.
  • the operation may be running a routing protocol after going online to establish a unicast route between the first node and the second node. For example, if the network configuration information indicates that the second node is a T node, then the second node runs the routing protocol as a T node. For another example, if the network configuration information indicates that the second node is a G(T) node, then the second node runs the routing protocol as a G(T) node.
  • the second node may manage the adjacency relationship of the second node according to the network configuration information.
  • Managing the adjacency relationship of the second node may include establishing a first adjacency relationship of the second node, and/or disconnecting a second adjacency relationship of the second node.
  • the first adjacency relationship is the adjacency relationship indicated by the network configuration information of the second node.
  • the second node Before the second node obtains its network configuration information, if there is no adjacency relationship of the second node on the second node, then the second node may establish the first adjacency relationship according to the network configuration information when obtaining its network configuration information.
  • the second adjacency relationship is the adjacency relationship not indicated by the network configuration information of the second node.
  • the second node disconnects these adjacency relationships according to its network configuration information, and establishes the first adjacency relationship of the second node; if some adjacency relationships already exist on the second node, and these adjacency relationships include the first adjacency relationship, then the second node disconnects the adjacency relationships among these adjacency relationships except the first adjacency relationship, that is, disconnects the second adjacency relationship.
  • the second node may update the node type of the second node according to the network configuration information. For example, if the second node accesses the network as a T node or the second node performs a node discovery mechanism as a T node, and the network configuration information of the second node indicates that the second node is a G node or a G(T) node, then the second node may update the node type of the second node from a T node to a G node or a G(T) node.
  • the second node may maintain the second node as a T node.
  • the second node can forward information.
  • the second node (G node or G(T) node) has the network topology configuration forwarding capability.
  • the network topology configuration forwarding capability refers to the ability to forward the network configuration information for other nodes fed back by the first node to other nodes, and to forward the node identifiers of other nodes to the first node.
  • a node with a network topology configuration forwarding capability may be referred to as a routing node, and a routing node may also be described as a forwarding node or an intermediate routing node, etc.
  • the second node may send the node identifier of the third node to the first node upon receiving a third message (including the node identifier of the third node) from the third node.
  • the third message may identify the multi-hop network where the third node requests to go online and the first node is located.
  • the first node When the first node receives the node identifier of the third node through the second node, it can search whether the node identifier of the third node is included in the network topology configuration information. If the network topology configuration information includes the node identifier of the third node, the first node obtains the network configuration information of the third node from the network topology configuration information according to the node identifier of the third node, and sends a fourth message to the third node through the second node, and the fourth message includes the network configuration information of the third node.
  • the network configuration information of the third node is similar to the network configuration information of the second node, and the specific description of the network configuration information of the second node in step 603 can be referred to, which will not be repeated here.
  • the first node can perform security access authentication on the third node according to the node identifier of the third node. In the case where the third node passes the security access authentication, the first node configures the network configuration information for the third node according to the node identifier of the third node and the network topology configuration information.
  • the first node uses the third node as an adjacent node of the second node, and the node type of the third node is a T node, so that the network configuration information of the third node can include the node identifier of the third node, the node type of the third node, the node identifier of the adjacent node (i.e., the second node) of the third node, and the node type of the second node.
  • the first node sends a fourth message to the third node through the second node, and the fourth message includes the network configuration information of the third node.
  • nodes that are not in the planned network topology can obtain network configuration information from the first node through the routing node, thereby expanding the network topology and improving the flexibility of the network topology.
  • This application does not specifically limit the method of secure access authentication, but is based on the ability to confirm the identity of the third node.
  • the first node sends the fourth message to the third node through the second node, which may be: the first node sends the fourth message to the second node, the fourth message includes the network configuration information of the third node; the second node sends the fourth message to the third node, the fourth message includes the network configuration information of the third node. It may also be: the first node sends the network configuration information of the third node to the second node; the second node sends the fourth message to the third node, the fourth message includes the network configuration information of the third node.
  • the second node If the second node operates as a T node and has established a unicast route with the first node, the second node cannot forward information. In other words, the second node (T node) does not have the network topology configuration forwarding capability. Furthermore, when the second node receives a third message (including the node identifier of the third node) from the third node, it will not send the node identifier of the third node to the first node, but will send a fourth message to the third node, and the fourth message is used to indicate that the second node does not have the network topology configuration forwarding capability. The second node rejects the request of the third node by indicating that the second node does not have the network topology configuration forwarding capability. In other words, the end node accesses the wireless network as a T node and does not have the network topology configuration forwarding capability.
  • the first node is an M node
  • the second node is a planned adjacent node of the first node
  • the adjacent node of the first node obtains its network configuration information from the first node, thereby obtaining an adjacent relationship.
  • FIG. 6B is an example diagram of the embodiment shown in FIG. 6 .
  • the network administrator inputs network topology configuration information to the M node.
  • the node 1 receives a broadcast message from the M node, which indicates that the M node has the network topology configuration capability.
  • the node 1 establishes a connection with the M node, and then the node 1 sends the node identification of the node 1 to the M node.
  • the M node receives the node identification of the node 1, based on the network topology configuration information, it obtains the network configuration information of the node 1, and feeds back the network configuration information of the node 1 to the node 1.
  • FIG. 7 is a flowchart of another communication method provided by the present application.
  • the method may include but is not limited to the following steps:
  • the first node obtains network topology configuration information.
  • step 701 reference may be made to the detailed description of step 601 in the embodiment shown in FIG6, which will not be repeated here.
  • the second node sends a first message to the routing node.
  • the routing node receives the first message from the second node.
  • the first message includes a node identifier of the second node.
  • the routing node has the network topology configuration forwarding capability.
  • the number of routing nodes can be one or more.
  • the routing node can obtain its network configuration information according to the method shown in Figure 6. Further, the routing node can operate in the multi-hop network where the first node is located based on its network configuration information, and establish a unicast route with the first node.
  • the node that has been running in the multi-hop network can be called an online node, and a unicast route can be established between multiple online nodes, so that any two online nodes can communicate with each other.
  • the second node can be understood as a node requesting to go online.
  • the above-mentioned network topology configuration information is the network topology configuration information of the multi-hop network 1
  • the second node can be a node requesting to go online in the multi-hop network 1.
  • the first message includes a node identifier of the second node, which can indicate that the second node requests to go online in the multi-hop network where the first node is located.
  • the node identifier of the second node may or may not be configured in the network topology configuration information.
  • the embodiment shown in Figure 7 take the example that the node identifier of the second node is configured in the network topology configuration information, the second node is an adjacent node of the routing node, and the routing node is an adjacent node of the first node.
  • the second node Before the second node sends the first message to the routing node, the second node establishes a connection with the routing node.
  • the second node and the routing node establish a connection similar to the second node and the first node in FIG6.
  • FIG6 For details, please refer to FIG6 for the specific description of the second node and the first node establishing a connection, which will not be repeated here.
  • the difference is that the broadcast message of the first node in FIG6 is used to indicate that the first node has the network topology configuration capability; the broadcast message of the routing node in FIG7 is used to indicate that the routing node has the network topology configuration forwarding capability. If the routing node does not have the network topology configuration forwarding capability, the second node does not establish a connection with the routing node.
  • the broadcast message of the routing node may include an indication information, which is used to indicate whether the routing node has the network topology configuration forwarding capability.
  • the indication information may be described as network configuration forwarding capability indication information or network configuration status indication information, etc., and may be a bit or a field, and the value of the bit or the value of the field is used to indicate whether the routing node has the network topology configuration forwarding capability. For example, if the value of the bit is 1, it indicates that the routing node has the network topology configuration forwarding capability; if the value of the bit is 0, it indicates that the routing node does not have the network topology configuration forwarding capability.
  • the second node can access the network with a node type of the second type, that is, access the network as a T node.
  • the second node performs a node discovery mechanism with a node type of the second type, that is, performs a node discovery mechanism as a T node to discover a routing node.
  • the routing node sends a first message to the first node.
  • the first node receives the first message from the routing node.
  • the second node sends the first message to the first node through the routing node.
  • the first node receives the first message from the second node through the routing node.
  • the second node sends the node identifier of the second node to the first node through the routing node.
  • the first node obtains the network configuration information of the second node based on the network topology configuration information.
  • step 704 please refer to the detailed description of step 603 in the embodiment shown in FIG6, which will not be repeated here.
  • the first node sends a second message to the routing node.
  • the routing node receives the second message from the first node, wherein the second message includes the network configuration information of the second node.
  • the routing node sends a second message to the second node.
  • the second node receives the second message from the routing node.
  • the second message includes the network configuration information of the second node.
  • step 705 and step 706, it can be understood that the first node sends the second message to the second node through the routing node.
  • the second node receives the second message from the first node through the routing node.
  • the first node sends the network configuration information of the second node to the second node through the routing node.
  • the second node When the second node receives the network configuration information of the second node, the second node may operate in the multi-hop network where the first node is located using the network configuration information.
  • the first node is an M node
  • the second node is an adjacent node of the routing node
  • the second node obtains network configuration information from the first node through the routing node, thereby obtaining an adjacent relationship.
  • FIG. 7A is an example diagram of the embodiment shown in FIG. 7 .
  • the network administrator inputs network topology configuration information to the M node.
  • node 1 receives a broadcast message from the routing node, which indicates that the routing node has the ability to forward the network topology configuration.
  • Node 1 establishes a connection with the routing node, which is an online node, and then node 1 sends the node identifier of node 1 to the M node through the routing node.
  • the M node obtains the network configuration information of node 1 based on the network topology configuration information, and feeds back the network configuration information of node 1 to node 1 through the routing node.
  • the network topology configuration information is static, so that the M node can provide the network configuration information to the node requesting to go online, so as to quickly go online, which helps to improve communication efficiency.
  • the M node can update the network topology configuration information and send the updated network configuration information to the neighboring nodes of the node to achieve real-time update.
  • FIG8 is a flowchart of another communication method provided by the present application.
  • the method may include but is not limited to the following steps:
  • the first node obtains a network topology construction rule.
  • the first node may be the M node 401 in FIG4.
  • the network administrator may select a node in the network topology of the multi-hop network as the M node, and set the node as the M node.
  • the network administrator may select the gateway/CPE as the M node.
  • the M node in the network topology may be a default setting, for example, when the network topology of the wireless battery management system is set at the factory, the BAMS is set as the M node by default.
  • the network topology construction rules are used to indicate how to construct the network topology, such as how nodes establish adjacency relationships.
  • the network topology construction rules may include one or more rules, and the one or more rules are used to dynamically construct the network topology.
  • the network topology construction rules may include initial network topology construction rules and secondary network topology construction rules, the initial network topology construction rules are used to construct the initial network topology, and the secondary network topology construction rules are used to construct the network topology for the next time period.
  • the network topology construction rules may include rules for establishing adjacency relationships between any two adjacent nodes, thereby constructing the network topology.
  • the network topology construction rule may be used to indicate the rules that the first hop count and the second hop count need to satisfy, wherein the first hop count is the minimum hop count from the first node to the second node in the network topology, and the second hop count is the minimum hop count from the first node to the third node in the network topology.
  • the second node and the third node may be any two adjacent nodes used to construct the network topology.
  • the hop count in a network path detection message received by a node indicates the number of hops from the first node to the node.
  • the node may receive multiple network path detection messages within a certain time period, and the hop counts in different path detection messages may be different.
  • the node receives multiple network path detection messages within the time period. The minimum number of hops is determined by comparing the number of hops in the
  • the rules that the first hop number and the second hop number need to satisfy may include: the first hop number is less than the second hop number, the node type of the second node is the first type (i.e., the second node is a G node), and the node type of the third node is the second type (i.e., the third node is a T node); the first hop number is greater than the second hop number, the node type of the second node is the second type (i.e., the second node is a T node), and the node type of the third node is the first type (i.e., the third node is a G node).
  • the node types of the second node and the third node can be determined by other rules.
  • the rules that the first hop number and the second hop number need to satisfy can also be described as rules for comparing the first hop number and the second hop number to determine the node type, or rules for adjacent nodes to establish adjacency relationships, or rules for re-constructing the network topology, etc.
  • the network topology construction rule may also be used to indicate a rule that the node identifier of the second node and the node identifier of the third node need to satisfy.
  • the rules that the node identifier of the second node and the node identifier of the third node need to satisfy may include: the node identifier of the second node is less than the node identifier of the third node, the node type of the second node is the first type (i.e., the second node is a G node), and the node type of the third node is the second type (i.e., the third node is a T node); the node identifier of the second node is greater than the node identifier of the third node, the node type of the second node is the second type (i.e., the second node is a T node), and the node type of the third node is the first type (i.e., the third node is a G node).
  • the rules that the node identifier of the second node and the node identifier of the third node need to satisfy can also be described as rules for comparing node identifiers to determine node types, or rules for adjacent nodes to establish initial adjacency relationships, or rules for constructing initial network topology, etc.
  • the node types of the second node and the third node may be determined by the rules that the node identifier of the second node and the node identifier of the third node need to satisfy, or by other means.
  • the network topology construction rule may be pre-configured in the first node by a network administrator, so that the first node can obtain the network topology construction rule. For example, after selecting the M node, the network administrator inputs the network topology construction rule into the M node, so that the M node can obtain the network topology construction rule.
  • the network topology construction rule may be pre-set, so that the first node can obtain the network topology construction rule.
  • the network topology construction rule may be generated by the first node.
  • the first node may broadcast the network topology construction rule so that the node receiving the rule can establish an adjacency relationship with its adjacent node according to the rule, thereby constructing the network topology.
  • the network topology construction rule is pre-configured for the node constructing the network topology, and then the node can establish an adjacency relationship with its adjacent node according to the rule.
  • the first node broadcasts a network path detection message.
  • the network path detection message can be used to detect and carry the number of hops between nodes.
  • the network path detection message is used to detect the number of hops between nodes, which means that after receiving a network path detection message (such as network path detection message 1), the node obtains the number of hops carried by the network path detection message 1 to determine the number of hops from the first node to the node; the node broadcasts the network path detection message (such as network path detection message 2) to its adjacent nodes, and the number of hops carried by the network path detection message 2 may be the number of hops carried by the network path detection message 1 + 1.
  • a network path detection message such as network path detection message 1
  • the node broadcasts the network path detection message (such as network path detection message 2) to its adjacent nodes, and the number of hops carried by the network path detection message 2 may be the number of hops carried by the network path detection message 1 + 1.
  • the number of hops carried by the network path detection message between nodes refers to the number of hops from the first node to the node that receives the network path detection message.
  • the network path detection message can be used to detect and carry the number of hops between nodes, and can also be described as the network path detection message can be used to indicate the number of hops between nodes.
  • the initial number of hops between nodes is 1.
  • the adjacent node of the first node receives a network path detection message from the first node, and the hop count in the network path detection message is 1; if node 1 sends a network path detection message to its adjacent node, the hop count in the network path detection message is 2, and so on.
  • the first node broadcasts a network path detection message to its adjacent nodes, so that the number of hops in the network path detection message received by the adjacent nodes of the first node is 1.
  • the network path detection message broadcast by the first node can be received by its adjacent nodes.
  • the network path detection message broadcast by a node can be received by the adjacent nodes of the node.
  • the first node periodically broadcasts a network path detection message to periodically adjust the network topology.
  • the first node broadcasts a network path detection message every 10 minutes.
  • the specific period can be configured by the first node, or configured in the first node by a network administrator, etc.
  • the broadcast message sent by the node may be discarded, so after sending the network path detection message, the node needs to receive the confirmation (acknowledge, ACK) message fed back by its adjacent node, otherwise it needs to be retransmitted.
  • the number of retransmissions can be up to 3 times.
  • the second node receives a network path detection message from the first node.
  • the second node receives the network path detection message from the first node, which may be the case where the second node directly receives the network path detection message from the first node, or the case where the second node indirectly receives the network path detection message from the first node. If the second node directly receives the network path detection message from the first node, it indicates that the second node is an adjacent node of the first node. If the second node indirectly receives the network path detection message from the first node, it indicates that the second node receives the network path detection message from the first node through other nodes.
  • I node 407 may directly receive a network path detection message from M node 401, in which the number of hops in the network path detection message is 1; E node 410 may receive a network path detection message from M node 401 through I node 404 and I node 405. The number of hops in the network path detection message is 3.
  • the number of network path detection messages received by the second node may be one or more, depending on the constructed network topology. For example, based on FIG4 , E node 410 may receive a network path detection message from M node 401 through I node 404 and I node 405, and the number of hops in the network path detection message is 3; E node 410 may also receive a network path detection message from M node 401 through I node 415, I node 404, and I node 405, and the number of hops in the network path detection message is 4.
  • the second node updates the first hop count according to the network path detection message, wherein the first hop count is the minimum hop count from the first node to the second node.
  • the second node Before the second node updates the first hop count according to the network path detection message, it sends a first broadcast message including the node identifier of the second node so that other nodes can find the second node.
  • the second node receives a second broadcast message from a third node including the node identifier of the third node.
  • the second node may send the first broadcast message with the node type of the first type, that is, the second node sends the first broadcast message with the G node, expecting to be discovered by other nodes. If other nodes scan and receive the first broadcast message, then other nodes have discovered the second node. At the same time, the second node may scan and receive broadcast messages from other nodes with the node type of the second type, that is, scan and receive broadcast messages from other nodes with the T node, so as to discover other nodes. Thus, the adjacent nodes of the second node are determined.
  • the second node can obtain the node identifier of the third node by receiving the second broadcast message, and determine the initial node identifier of the second node and the initial node identifier of the third node by comparing the node identifier of the second node and the node identifier of the third node.
  • the initial node type of the second node is the first type (i.e., the second node is a G node), and the initial node type of the third node is the second type (i.e., the third node is a T node); if the node identifier of the second node is larger than the node identifier of the third node, the initial node type of the second node is the second type (i.e., the second node is a T node), and the initial node type of the third node is the first type (i.e., the third node is a G node). It can be seen that by comparing the node identifiers of adjacent nodes, an adjacency relationship can be established and the node type can be determined.
  • the process in which the second node sends the first broadcast message as a G node and scans and receives broadcast messages of other nodes as a T node may also be performed before step 802 .
  • the first hop count is maintained locally by the second node. That is, the first hop count is the minimum hop count recorded locally by the second node. As time goes by and nodes come online or leave, the hop count in the network path detection message received by the node in different time periods may change, resulting in a change in the minimum hop count. For example, in the first time period, the first hop count is 3; in the second time period, a network path detection message with a hop count of 2 is received, then the first hop count is 2.
  • the first hop count may be the minimum hop count in the network path detection message received within a period of time, and the hop count in the network path detection message indicates the hop count from the first node to the second node.
  • the second node receives 3 network path detection messages from 10:00am to 11:00am, and the hop counts in the 3 network path detection messages are 3, 4, and 2, respectively, then the first hop count is 2. That is to say, for any node, when the node receives the first network path detection message, it does not immediately update the hop count recorded locally.
  • the second node may access the wireless network between two network path detection message sending periods to update the first hop count.
  • the hop count in the network path detection message is the third hop count
  • the difference between the third hop count and the updated first hop count is a preset value, which is 1.
  • the second node sends the first network path detection message to the fourth node, and the hop count in the first network path detection message is the third hop count, which is equal to the updated first hop count+1.
  • the second node obtains a second hop count from the third node, wherein the second hop count is the minimum hop count from the first node to the third node.
  • the second node may obtain the second hop count from the third node after updating the first hop count and before the network path detection message sending cycle.
  • the second node may obtain the second hop count from the third node between two network path detection message sending cycles.
  • the second hop count is similar to the first hop count, and the specific description of the first hop count can be referred to, which will not be repeated here.
  • the second node determines a node type of the second node and a node type of the third node according to the first hop count and the second hop count.
  • the second node determines the node type of the second node and the node type of the third node based on the first hop number and the second hop number, which may include: when the first hop number is less than the second hop number, determining the node type of the second node to be the first type (i.e., the second node is a G node), and the node type of the third node to be the second type (i.e., the third node is a T node); when the first hop number is greater than the second hop number, determining the node type of the second node to be the second type (i.e., the second node is a T node), and the node type of the third node to be the first type (i.e., the third node is a G node).
  • the second node determines the node type of the second node and the third node according to a pre-set rule.
  • the pre-set rule is related to the size of the node identifier. For example, if the L2ID of the second node is smaller than the L2ID of the third node, the node type of the second node is determined to be the first type (i.e., the second node is a G node), and the node type of the third node is determined to be the second type (i.e., the third node is a T node); if the L2ID of the second node is greater than the L2ID of the third node, the node type of the second node is determined to be the second type (i.e., the second node is a T node), and the node type of the third node is determined to be the first type (i.e., the third node is a G node).
  • the node type determined in step 806 may be a node type within a time period. As the node comes online or leaves, the number of hops in the network path detection message received by the second node in the next time period may change, causing the first hop number to change, which may lead to a change in the node type.
  • the second node obtains the duration of the node type being the first type. If the duration is greater than a preset duration, the second node maintains the node type being the first type. In other words, the second node obtains the duration of the node being a G node. If the duration is greater than a preset duration, the second node maintains the G node and will not be changed to a T node.
  • the second node determines that it is a G node, it may start a timer. When the time of the timer is greater than a preset duration, the second node maintains the G node.
  • the preset duration may be pre-set, or default, or included in the network topology construction rule.
  • the network topology construction rule can also be used to instruct the end node to access the wireless network as a T node, and the end node no longer broadcasts the network detection message to its adjacent nodes after receiving the network detection message.
  • the end node defaults to no longer broadcast the network detection message to its adjacent nodes after receiving the network detection message.
  • the second node determines the node type of the second node and the node type of the third node according to the first hop count and the second hop count to establish an adjacency relationship between the second node and the third node, which helps to improve communication efficiency.
  • a device for implementing any method in the embodiments of the present application.
  • a device including a unit (or means) for implementing each step performed by a node in any of the above methods.
  • FIG. 9 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application.
  • the communication device 90 may include a communication unit 901 and a processing unit 902.
  • the communication unit 901 and the processing unit 902 may be software, hardware, or a combination of software and hardware.
  • the communication unit 901 can implement a sending function and/or a receiving function, and the communication unit 901 can also be described as a transceiver unit, an acquisition unit, or a sending unit.
  • the communication unit 901 can also be a unit integrating an acquisition unit and a sending unit, wherein the acquisition unit is used to implement a receiving function, and the sending unit is used to implement a sending function.
  • the communication unit 901 can be used to receive information sent by other devices, and can also be used to send information to other devices.
  • the communication device 90 may correspond to the first node in the above method embodiment, such as the communication device 90 may be the first node, or a chip in the first node.
  • the communication device 90 may include a unit for executing the operation performed by the first node in the above method embodiment, and each unit in the communication device 90 is respectively for implementing the operation performed by the first node in the above method embodiment.
  • the communication device 90 may correspond to the second node in the above method embodiment, such as the communication device 90 may be the second node, or a chip in the second node.
  • the communication device 90 may include a unit for executing the operation performed by the second node in the above method embodiment, and each unit in the communication device 90 is respectively for implementing the operation performed by the second node in the above method embodiment.
  • each unit in the device shown in Figure 9 can be separately or all merged into one or several other units to constitute, or some (some) units therein can also be split into multiple smaller units in function to constitute, which can achieve the same operation without affecting the realization of the technical effect of the embodiment of the present application.
  • the above-mentioned units are divided based on logical functions.
  • the function of a unit can also be realized by multiple units, or the function of multiple units is realized by one unit.
  • other units can also be included based on nodes.
  • these functions can also be assisted by other units to be realized, and can be realized by the collaboration of multiple units.
  • each unit may also refer to the corresponding description of the method embodiments shown in the above-mentioned FIG. 6 , FIG. 7 , and FIG. 8 .
  • the second node can obtain its neighbor relationship, which helps to improve communication efficiency.
  • FIG. 10 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application.
  • the communication device 100 shown in FIG. 10 is merely an example, and the communication device of the embodiment of the present application may further include other components, or include components with functions similar to those of the components in FIG. 10 , or may not include all the components in FIG. 10 .
  • the communication device 100 includes a communication interface 1001 and at least one processor 1002 .
  • the communication device 100 may correspond to the first node or the second node.
  • the communication interface 1001 is used to send and receive messages or information or packets, and at least one processor 1002 executes program instructions so that the communication device 100 implements the corresponding process of the method executed by the corresponding node in the above method embodiment.
  • the communication device 100 may correspond to the first node in the above method embodiment, such as the communication device 100 may be the first node, or may be a chip in the first node.
  • the communication device 100 may include a component for executing the operation performed by the first node in the above method embodiment, and each component in the communication device 100 is respectively for implementing the operation performed by the first node in the above method embodiment, and specifically may correspond to the corresponding description of the first node in the above method embodiment.
  • the communication device 100 may correspond to the second node in the above method embodiment, such as the communication device 100 may be the second node, or may be a chip in the second node.
  • the communication device 100 may include a component for executing the operation performed by the second node in the above method embodiment, and each component in the communication device 100 is respectively for implementing the operation performed by the second node in the above method embodiment, and specifically may correspond to the corresponding description of the second node in the above method embodiment.
  • the communication device may be a chip or a chip system
  • the chip 110 includes a processor 1101 and an interface 1102.
  • the number of the processors 1101 may be one or more, and the number of the interfaces 1102 may be multiple. It should be noted that the functions corresponding to the processors 1101 and the interfaces 1102 may be implemented by hardware design, software design, or a combination of hardware and software, which is not limited here.
  • the chip 110 may further include a memory 1103 , and the memory 1103 is used to store necessary program instructions and data.
  • the processor 1101 may be used to call the implementation program of the communication method provided by one or more embodiments of the present application at the first node or the second node from the memory 1103, and execute the instructions contained in the program.
  • the interface 1102 may be used to output the execution result of the processor 1101. In the present application, the interface 1102 may be specifically used to output various messages, information or messages of the processor 1101.
  • the processor in the embodiment of the present application may be a central processing unit (CPU), and the processor may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • the general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.
  • the memory in the embodiment of the present application is used to provide a storage space, in which data such as an operating system and a computer program can be stored.
  • the memory includes, but is not limited to, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), or a portable read-only memory (CD-ROM).
  • the embodiment of the present application also provides a computer-readable storage medium, in which a computer program is stored.
  • a computer program runs on one or more processors, the method shown in Figures 6, 7, and 8 can be implemented.
  • the embodiment of the present application also provides a computer program product, and the above-mentioned computer program product includes a computer program.
  • the above-mentioned computer program runs on a processor, it can implement the methods shown in the above-mentioned Figures 6, 7, and 8.
  • the embodiment of the present application provides a terminal device, which includes at least one of the above-mentioned communication device 90 or communication device 100 or chip 110.
  • the terminal device can be a transportation device, a household device, a wearable device, or a battery management system.
  • An embodiment of the present application also provides a system, which includes at least one terminal device, and/or at least one communication device 90 or communication device 100 or chip 110 as described above.
  • An embodiment of the present application also provides a processing device, including a processor and an interface; the processor is used to execute the method in any of the above method embodiments.
  • the processing device can be a chip.
  • the processing device can be a field programmable gate array (FPGA), a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, a system on chip (SoC), a central processor unit (CPU), a network processor (NP), a digital signal processing circuit (DSP), a microcontroller unit (MCU), a programmable logic device (PLD) or other integrated chips.
  • SoC system on chip
  • CPU central processor unit
  • NP network processor
  • DSP digital signal processing circuit
  • MCU microcontroller unit
  • PLD programmable logic device
  • the general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc.
  • the steps of the method disclosed in the embodiments of the present application can be directly embodied as being executed by a hardware decoding processor, or can be executed by a combination of hardware and software modules in the decoding processor.
  • the software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc.
  • the storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.
  • the memory in the embodiments of the present application can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories.
  • the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EPROM), or an electrically erasable programmable read-only memory (EPROM).
  • the volatile memory may be an electrically EPROM (EEPROM) or flash memory.
  • the volatile memory may be a random access memory (RAM), which is used as an external cache.
  • RAM synchronous link DRAM
  • SRAM static RAM
  • DRAM dynamic RAM
  • SDRAM synchronous DRAM
  • DDR SDRAM double data rate SDRAM
  • ESDRAM enhanced SDRAM
  • SLDRAM synchronous link DRAM
  • DR RAM direct rambus RAM
  • the computer program product includes one or more computer instructions.
  • the computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.
  • the computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium.
  • the computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or a data center that includes one or more available media integrations.
  • the available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a high-density digital video disc), or a semiconductor medium (e.g., a solid-state hard disk), etc.
  • the units in the above-mentioned various device embodiments completely correspond to the electronic devices in the method embodiments, and the corresponding modules or units perform the corresponding steps.
  • the communication unit transmits the steps of receiving or sending in the method embodiment, and other steps except sending and receiving can be performed by the processing unit (processor).
  • the functions of the specific units can refer to the corresponding method embodiments.
  • the processor can be one or more.
  • the electronic device can perform some or all of the steps in the embodiment of the present application, and these steps or operations are only examples.
  • the embodiment of the present application can also perform other operations or variations of various operations.
  • the various steps can be performed in different orders presented in the embodiment of the present application, and it is possible that not all operations in the embodiment of the present application need to be performed.
  • the disclosed systems, devices and methods can be implemented in other ways.
  • the device embodiments described above are only schematic.
  • the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed.
  • Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

Landscapes

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

Abstract

本申请提供一种通信方法及通信装置，应用在多跳网络中，使得多跳网络中的节点可以获得其邻接关系，有助于提高通信效率。该方法可包括：第一节点获取网络拓扑配置信息，所述网络拓扑配置信息包含节点标识、节点类型和网络拓扑信息；第一节点接收第一消息，第一消息包含第二节点的节点标识；基于网络拓扑配置信息，获取第二节点的网络配置信息；发送第二消息，第二消息包含第二节点的网络配置信息；其中，第二节点的网络配置信息用于指示第二节点的节点类型，第二节点的邻接节点，以及第二节点的邻接节点的节点类型。其中，第二节点的网络配置信息用于配置第二节点的邻接关系，以使第二节点获取其邻接关系。

Description

通信方法及通信装置
本申请要求于2022年9月30日提交中国专利局、申请号为202211214639.0、申请名称为“通信方法及通信装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及无线通信技术领域，尤其涉及一种通信方法及通信装置。
背景技术
随着无线通信技术的不断发展，无线电池管理系统(battery management system，BMS)，传感器网络，以及智能家居、智能座舱、智能驾驶、智能制造、智能运输等智能应用场景应运而生。以智能家居场景为例，其可以包括至少一个通信域，一个通信域可以包括多个节点(例如一个主节点和至少一个从节点)。通信域的网络拓扑结构可以是单跳网络或多跳网络。
单跳网络包括一个主节点和连接该主节点的至少一个从节点。在单跳网络中，两个节点可协商节点类型，即协商哪个节点为主节点，哪个节点为从节点，以建立这两个节点之间的邻接关系。
在多跳网络中，一个节点与另一个节点的通信方式可以是不通过其他节点的通信方式，也可以是通过至少一个其他节点进行转发的通信方式。多跳网络相比单跳网络，节点更多，拓扑关系更复杂，单跳网络中建立邻接关系的方式不适用于多跳网络。因此，在多跳网络中，节点如何获得其邻接关系是亟待解决的技术问题。
发明内容
本申请实施例提供一种通信方法及通信装置，使得节点可以获得其邻接关系，有助于提高通信效率。
第一方面，本申请提供一种通信方法，该方法可由第一节点执行，或由第一节点中的装置执行，例如处理器、芯片或芯片系统等。该方法可包括：第一节点获取网络拓扑配置信息，所述网络拓扑配置信息包含节点标识、节点类型和网络拓扑信息；接收第一消息，第一消息包含第二节点的节点标识；基于网络拓扑配置信息，获取第二节点的网络配置信息；发送第二消息，第二消息包含第二节点的网络配置信息；
其中，第二节点的网络配置信息用于指示第二节点的节点类型，第二节点的邻接节点，以及第二节点的邻接节点的节点类型。
可以理解的是，第二节点的网络配置信息用于配置第二节点的邻接关系，该邻接关系可包含第二节点的节点标识、第二节点的节点类型、第二节点的邻接节点的节点标识以及第二节点的邻接节点的节点类型。
可见，第一节点在接收到第二节点的节点标识的情况下，可基于网络拓扑配置信息，向第二节点反馈第二节点的网络配置信息，从而第二节点可以获得其邻接关系。相比第二节点逐个与其邻接节点协商节点类型以确定邻接关系，耗时更少，有助于提高通信效率。
可选的，第二节点与第二节点的邻接节点的节点类型不同，以提高网络拓扑的稳定性。
在一种可能的实现方式中，第一节点接收第一消息包括：第一节点接收来自第二节点的第一消息；第一节点发送第二消息包括：第一节点向第二节点发送第二消息。该方式下，第一节点与第二节点可以直接通信，无需通过其他节点转发。从而第一节点的邻接节点可直接从第一节点获取各自的网络配置信息，有助于节省无线资源开销。
可选的，第一节点接收第一消息之前，第一节点发送广播消息，该广播消息用于指示第一节点具有网络拓扑配置能力。从而接收到该广播消息的第二节点可从第一节点获取第二节点的网络配置信息，有助于节省时间。具体的，网络拓扑配置能力指的是能够为其他节点配置网络配置信息，并向其他节点提供网络配置信息的能力。
在另一种可能的实现方式中，第一节点接收第一消息包括：第一节点通过路由节点接收来自第二节点的第一消息；第一节点发送第二消息包括：第一节点通过路由节点向第二节点发送第二消息。该种方式下，第一节点与第二节点之间的通信，通过路由节点转发。从而除第一节点的邻接节点之外的节点可通过路由节点从第一节点获取各自的网络配置信息，以扩大网络拓扑。
在一种可能的实现方式中，第一节点在发送第二消息之后，第一节点可通过第二节点接收来自第三节点的第三消息，第三消息包含第三节点的节点标识；第一节点对第三节点进行安全接入认证，第三节点的节点标识未包含在上述网络拓扑配置信息中；在第三节点通过安全接入认证的情况下，第一节点通过第二节点向第三节点发送第四消息，第四消息包含第三节点的网络配置信息。可见，第二节点具有网络拓扑配 置转发能力，从而第三节点可通过第二节点从第一节点获取第三节点的网络配置信息。第三节点未包含在网络拓扑配置信息中，表明第三节点不在规划的网络拓扑中。即使不在规划的网络拓扑中的节点也能通过路由节点从第一节点获取网络配置信息，从而可扩展网络拓扑，可提高网络拓扑的灵活性。其中，网络拓扑配置转发能力指的是能够将第一节点反馈的针对其他节点的网络配置信息转发至其他节点，也能将其他节点的节点标识转发至第一节点。
第二方面，本申请提供一种通信方法，该方法可由第二节点执行，或由第二节点中的装置执行，例如处理器、芯片或芯片系统等。该方法可包括：第二节点发送第一消息，第一消息包含第二节点的节点标识；第二节点接收第二消息，第二消息包含第二节点的网络配置信息；
其中，第二节点的网络配置信息用于指示第二节点的节点类型，第二节点的邻接节点，以及第二节点的邻接节点的节点类型。
可以理解的是，第二节点的网络配置信息用于配置第二节点的邻接关系，该邻接关系可包含第二节点的节点标识、第二节点的节点类型、第二节点的邻接节点的节点标识以及第二节点的邻接节点的节点类型。
可见，第二节点通过发送其节点标识，以获得第二节点的邻接关系。相比第二节点逐个与其邻接节点协商节点类型以确定邻接关系，耗时更少，有助于提高通信效率。
可选的，第二节点与第二节点的邻接节点的节点类型不同，以提高网络拓扑的稳定性。
在一种可能的实现方式中，第二节点发送第一消息包括：第二节点向第一节点发送第一消息；第二节点接收第二消息包括：第二节点接收来自第一节点的第二消息。该方式下，第二节点与第一节点可以直接通信，无需通过其他节点转发。从而第一节点的邻接节点可直接从第一节点获取各自的网络配置信息，有助于节省无线资源开销。
可选的，第二节点发送第一消息之前，第二节点接收来自第一节点的广播消息，该广播消息用于指示第一节点具有网络拓扑配置能力。从而第二节点可从第一节点获取第二节点的网络配置信息，有助于节省时间。
可选的，第二节点在接收来自第一节点的广播消息之前，第二节点通过节点发现机制发现第一节点。节点发现机制可以是节点1作为被发现方以广播方式发送系统消息或广播消息，节点2扫描接收到系统消息或广播消息，可以确定节点2发现了节点1。
在另一种可能的实现方式中，第二节点发送第一消息包括：第二节点通过路由节点向第一节点发送第一消息；第二节点接收第二消息包括：第二节点通过路由节点接收来自第一节点的第二消息。该种方式下，第二节点与第一节点之间的通信，通过路由节点转发。从而除第一节点的邻接节点之外的节点可通过路由节点从第一节点获取各自的网络配置信息，以扩大网络拓扑。
可选的，第二节点在发送第一消息之前，第二节点接收来自路由节点的广播消息，该广播消息用于指示路由节点具有网络拓扑配置转发能力。从而第二节点可通过路由节点从第一节点获取第二节点的网络配置信息，以扩大网络拓扑。
可选的，第二节点在接收来自路由节点的广播消息之前，第二节点通过节点发现机制发现路由节点。
在一种可能的实现方式中，第二节点在接收到第二节点的网络配置信息的情况下，可根据第二节点的网络配置信息，管理第二节点的邻接关系。管理第二节点的邻接关系可包括建立第二节点的第一邻接关系，和/或断开第二节点的第二邻接关系。第一邻接关系即第二节点的网络配置信息指示的邻接关系。第二邻接关系即第二节点的网络配置信息未指示的邻接关系。第二节点管理其邻接关系，以便第二节点以该邻接关系在网络拓扑中运行，有助于提高通信效率。
在一种可能的实现方式中，第二节点在接收到第二节点的网络配置信息的情况下，可根据第二节点的网络配置信息，更新第二节点的节点类型。从而第二节点以更新后的节点类型在网络拓扑中运行，有助于提高网络拓扑的稳定性。
在一种可能的实现方式中，第二节点在接收第二消息之后，第二节点接收来自第三节点的第三消息，第三消息包含第三节点的节点标识；第二节点向第一节点发送第三节点的节点标识；第二节点接收来自第一节点的第四消息，第四消息包含第三节点的网络配置信息；向第三节点发送第三节点的网络配置信息。可见，第二节点具有网络拓扑配置转发能力，从而第三节点可通过第二节点从第一节点获取第三节点的网络配置信息，以扩大网络拓扑。
在另一种可能的实现方式中，第二节点在接收第二消息之后，第二节点接收来自第三节点的第三消息，第三消息包含第三节点的节点标识；第二节点向第三节点发送第四消息，第四消息用于指示第二节点不具有网络拓扑配置转发能力。可见，第二节点不具有网络拓扑配置转发能力时，第二节点不会转发第三节点 的节点标识。从而可以有效控制网络拓扑的边界范围。
第三方面，本申请提供一种通信方法，该方法可由第一节点执行，或由第一节点中的装置执行，例如处理器、芯片或芯片系统等。该方法可包括：第一节点获取网络拓扑构建规则，网络拓扑构建规则用于指示第一跳数和第二跳数需要满足的规则；第一跳数为第一节点至网络拓扑中的第二节点的最小跳数，第二跳数为第一节点至网络拓扑中的第三节点的最小跳数；第一节点广播网络路径探测报文，网络路径探测报文用于探测并携带节点间的跳数。
其中，第二节点和第三节点可以是用于构建网络拓扑的任意两个相邻的节点。网络拓扑构建规则可指示任意两个相邻节点建立邻接关系的规则，以构建网络拓扑。
可见，第一节点通过获取第一跳数和第二跳数需要满足的规则，以便节点根据网络探测报文可以动态获取邻接关系，从而动态构建网络拓扑，有助于提高网络拓扑的灵活性和提高通信效率。
在一种可能的实现方式中，上述网络拓扑构建规则还用于指示第二节点的节点标识和第三节点的节点标识需要满足的规则。
在一种可能的实现方式中，第一节点广播网络拓扑构建规则，以便接收到该规则的节点可根据该规则与其邻接节点建立邻接关系。
在一种可能的实现方式中，第一节点周期性地广播网络路径探测报文，以动态构建网络拓扑。
第四方面，本申请提供一种通信方法，该方法可由第二节点执行，或由第二节点中的装置执行，例如处理器、芯片或芯片系统等。该方法可包括：第二节点接收来自第一节点的网络路径探测报文；根据网络路径探测报文更新第一跳数，第一跳数为第一节点至第二节点的最小跳数；第二节点从第三节点获取第二跳数，第二跳数为第一节点至第三节点的最小跳数；根据第一跳数和第二跳数，确定第二节点的节点类型和第三节点的节点类型。
可见，第二节点根据第一跳数和第二跳数，确定第二节点的节点类型和第三节点的节点类型，以建立第二节点与第三节点之间的邻接关系，有助于提高通信效率。
可选的，第一跳数由第二节点在本地维护。也就是说，第一跳数是第二节点在本地记录的最小跳数，以便第二节点根据接收到的网络探测报文更新第一跳数。从而第二节点可以动态建立其邻接关系，有助于提高网络拓扑的灵活性。
在一种可能的实现方式中，第二节点根据第一跳数和第二跳数，确定第二节点的节点类型和第三节点的节点类型，可包括：若第一跳数小于第二跳数，则第二节点确定第二节点的节点类型为第一类型，第三节点的节点类型为第二类型；或，若第一跳数大于第二跳数，第二节点确定第二节点的节点类型为第二类型，第三节点的节点类型为第一类型；其中，第一类型不同于第二类型。可见，第二节点通过比较第一跳数和第二跳数的大小，确定出第二节点的节点类型和第三节点的节点类型，以便建立第二节点与第三节点之间的邻接关系。
在另一种可能的实现方式中，第一跳数等于第二跳数，第二节点根据第一跳数和第二跳数，确定第二节点的节点类型和第三节点的节点类型，可包括：第二节点根据预先设置的规则确定第二节点的节点类型和第三节点的节点类型，其中，预先设置的规则与节点标识的大小有关。
在一种可能的实现方式中，第二节点根据网络路径探测报文更新第一跳数之前，第二节点发送第一广播消息，第一广播消息包含第二节点的节点标识；接收来自第三节点的第二广播消息，第二广播消息包含第三节点的节点标识；根据第二节点的节点标识和第三节点的节点标识，确定第二节点的初始节点类型和第三节点的初始节点类型。可见，第二节点通过第二节点的节点标识和第二节点的节点标识，确定第二节点的初始节点类型和第三节点的初始节点类型，以便建立第二节点与第三节点之间的初始邻接关系。初始邻接关系并不是固定的，可能会被根据第一跳数和第二跳数确定的邻接关系替换，从而实现动态建立邻接关系。
进一步的，第二节点根据第二节点的节点标识和第三节点的节点标识，确定第二节点的初始节点类型和第三节点的初始节点类型，可包括：若第二节点的节点标识小于第三节点的节点标识，则第二节点确定第二节点的初始节点类型为第一类型，第三节点的初始节点类型为第二类型；或，若第二节点的节点标识大于第三节点的节点标识，则第二节点确定第二节点的初始节点类型为第二类型，第三节点的初始节点类型为第一类型；其中，第一类型不同于第二类型。可见，第二节点通过比较节点标识的大小，确定出第二节点的初始节点类型和第三节点的初始节点类型，以便建立第二节点与第三节点之间的初始邻接关系。
在一种可能的实现方式中，根据网络路径探测报文更新后的第一跳数小于更新前的第一跳数，第二节点向第四节点发送第一网络路径探测报文，第一网络路径探测报文中的跳数为第三跳数，第三跳数与更新 后的第一跳数的差值为预设值。从而实现对网络拓扑的更新，有助于提高网络拓扑的灵活性。具体的，所述预设值可以为1。
在一种可能的实现方式中，第二节点获取第二节点的节点类型为第一类型的持续时间；该持续时间大于预设时长，第二节点维持第二节点的节点类型为第一类型。从而减少因节点类型频繁切换导致的流量丢失。
第五方面，本申请提供一种通信装置，该通信装置包括用于执行如第一方面至第四方面中任一方面所述方法的模块或单元。
在一种可能的设计中，该通信装置包括：
处理单元，用于获取网络拓扑配置信息，网络拓扑配置信息包含节点标识、节点类型和网络拓扑信息；
通信单元，用于接收第一消息，第一消息包含第二节点的节点标识；
处理单元，还用于基于网络拓扑配置信息，获取第二节点的网络配置信息；
通信单元，还用于发送第二消息，第二消息包含第二节点的网络配置信息；
其中，第二节点的网络配置信息用于指示：第二节点的节点类型；第二节点的邻接节点；以及第二节点的邻接节点的节点类型。
可选的，第二节点与第二节点的邻接节点的节点类型不同。
可选的，通信单元，具体用于接收来自第二节点的第一消息；向第二节点发送第二消息。
可选的，通信单元，还用于发送广播消息，广播消息用于指示第一节点具有网络拓扑配置能力。
可选的，通信单元，具体用于通过路由节点接收来自第二节点的第一消息；通过路由节点向第二节点发送第二消息。
可选的，通信单元，还用于通过第二节点接收来自第三节点的第三消息，第三消息包含第三节点的节点标识；
处理单元，还用于对第三节点进行安全接入认证，第三节点的节点标识未包含在网络拓扑配置信息中；
通信单元，还用于在第三节点通过安全接入认证的情况下，通过第二节点向第三节点发送第四消息，第四消息包含第三节点的网络配置信息。
关于第五方面以及任一项可能的实施方式所带来的技术效果，可参考对应于第一方面以及相应的实施方式的技术效果的介绍。
在另一种可能的设计中，该通信装置包括：
通信单元，用于发送第一消息，第一消息包含第二节点的节点标识；接收第二消息，第二消息包含第二节点的网络配置信息；
其中，第二节点的网络配置信息用于指示：第二节点的节点类型；第二节点的邻接节点；以及第二节点的邻接节点的节点类型。
可选的，第二节点与第二节点的邻接节点的节点类型不同。
可选的，通信单元，具体用于向第一节点发送第一消息；接收来自第一节点的第二消息。
可选的，通信单元，还用于接收来自第一节点的广播消息，广播消息用于指示第一节点具有网络拓扑配置能力。
可选的，通信单元，具体用于通过路由节点向第一节点发送第一消息；通过路由节点接收来自第一节点的第二消息。
可选的，通信单元，还用于接收来自路由节点的广播消息，广播消息用于指示路由节点具有网络拓扑配置转发能力。
可选的，该通信装置还包括处理单元，用于根据第二节点的网络配置信息，管理第二节点的邻接关系。
可选的，处理单元，还用于根据第二节点的网络配置信息，更新第二节点的节点类型。
可选的，通信单元，还用于接收来自第三节点的第三消息，第三消息包含第三节点的节点标识；向第一节点发送第三节点的节点标识；接收来自第一节点的第四消息，第四消息包含第三节点的网络配置信息；向第三节点发送第三节点的网络配置信息。
可选的，通信单元，还用于接收来自第三节点的第三消息，第三消息包含第三节点的节点标识；向第三节点发送第四消息，第四消息用于指示第二节点不具有网络拓扑配置转发能力。
关于第五方面以及任一项可能的实施方式所带来的技术效果，可参考对应于第二方面以及相应的实施方式的技术效果的介绍。
在又一种可能的设计中，该通信装置包括：
处理单元，用于网络拓扑构建规则，网络拓扑构建规则用于指示第一跳数和第二跳数需要满足的规则；第一跳数为第一节点至网络拓扑中的第二节点的最小跳数，第二跳数为第一节点至网络拓扑中的第三节点的最小跳数；
通信单元，用于广播网络路径探测报文，网络路径探测报文用于探测并携带节点间的跳数。
可选的，网络拓扑构建规则还用于指示第二节点的节点标识和第三节点的节点标识需要满足的规则。
可选的，通信单元，还用于广播网络拓扑构建规则。
关于第五方面以及任一项可能的实施方式所带来的技术效果，可参考对应于第三方面以及相应的实施方式的技术效果的介绍。
在又一种可能的设计中，该通信装置包括：
通信单元，用于接收来自第一节点的网络路径探测报文；
处理单元，用于根据网络路径探测报文更新第一跳数，第一跳数为第一节点至第二节点的最小跳数
通信单元，还用于从第三节点获取第二跳数，第二跳数为第一节点至第三节点的最小跳数；
处理单元，还用于根据第一跳数和第二跳数，确定第二节点的节点类型和第三节点的节点类型。
可选的，处理单元，具体用于第一跳数小于第二跳数，确定第二节点的节点类型为第一类型，第三节点的节点类型为第二类型；或，第一跳数大于第二跳数，确定第二节点的节点类型为第二类型，第三节点的节点类型为第一类型；其中，第一类型不同于第二类型。
可选的，第一跳数等于第二跳数；处理单元，具体用于根据预先设置的规则确定第二节点的节点类型和第三节点的节点类型；其中，预先设置的规则与节点标识的大小有关。
可选的，通信单元，还用于发送第一广播消息，第一广播消息包含第二节点的节点标识；接收来自第三节点的第二广播消息，第二广播消息包含第三节点的节点标识；
处理单元，还用于根据第二节点的节点标识和第三节点的节点标识，确定第二节点的初始节点类型和第三节点的初始节点类型。
可选的，处理单元，具体用于第二节点的节点标识小于第三节点的节点标识，确定第二节点的初始节点类型为第一类型，第三节点的初始节点类型为第二类型；或，第二节点的节点标识大于第三节点的节点标识，确定第二节点的初始节点类型为第二类型，第三节点的初始节点类型为第一类型；其中，第一类型不同于第二类型。
可选的，根据网络路径探测报文更新后的第一跳数小于更新前的第一跳数；通信单元，还用于向第四节点发送第一网络路径探测报文，第一网络路径探测报文中的跳数为第三跳数，第三跳数与更新后的第一跳数的差值为预设值。
可选的，处理单元，还用于第二节点获取第二节点的节点类型为第一类型的持续时间；持续时间大于预设时长，维持第二节点的节点类型为第一类型。
关于第五方面以及任一项可能的实施方式所带来的技术效果，可参考对应于第四方面以及相应的实施方式的技术效果的介绍。
第六方面，本申请实施例提供了一种通信装置，包括处理器。该处理器与存储器耦合，可用于执行存储器中的指令，以实现上述第一方面至第四方面任一方面以及任一项可能的实施方式的方法。可选地，该通信装置还包括存储器。可选地，该通信装置还包括通信接口，处理器与通信接口耦合。
第七方面，本申请实施例提供了一种通信装置，包括：逻辑电路和通信接口。所述通信接口，用于接收信息或者发送信息；所述逻辑电路，用于通过所述通信接口接收信息或者发送信息，使得所述通信装置执行上述第一方面至第四方面任一方面以及任一项可能的实施方式的方法。
第八方面，本申请实施例提供了一种计算机可读存储介质，所述计算机可读存储介质用于存储计算机程序(也可以称为代码，或指令)；当所述计算机程序在计算机上运行时，使得上述第一方面至第四方面任一方面以及任一项可能的实施方式的方法被实现。
第九方面，本申请实施例提供了一种计算机程序产品，所述计算机程序产品包括：计算机程序(也可以称为代码，或指令)；当所述计算机程序被运行时，使得计算机执行上述第一方面至第四方面任一方面以及任一项可能的实施方式的方法。
第十方面，本申请实施例提供一种芯片，该芯片包括处理器，所述处理器用于执行指令，当该处理器执行所述指令时，使得该芯片执行上述第一方面至第四方面任一方面以及任一项可能的实施方式的方法。可选的，该芯片还包括通信接口，所述通信接口用于接收信号或发送信号。
第十一方面，本申请实施例提供一种终端设备，所述终端设备包括至少一个如第五方面所述的通信装 置，或第六方面所述的通信装置，或第七方面所述的通信装置，或第十方面所述的芯片。
第十二方面，本申请实施例提供一种系统，所述系统包括终端设备以及至少一个如第五方面所述的通信装置，或第六方面所述的通信装置，或第七方面所述的通信装置，或第十方面所述的芯片。
此外，在执行上述第一方面至第四方面任一方面以及任一项可能的实施方式所述的方法的过程中，上述方法中有关发送信息和/或接收信息等的过程，可以理解为由处理器输出信息的过程，和/或，处理器接收输入的信息的过程。在输出信息时，处理器可以将信息输出给收发器(或者通信接口、或发送模块)，以便由收发器进行发射。信息在由处理器输出之后，还可能需要进行其他的处理，然后才到达收发器。类似的，处理器接收输入的信息时，收发器(或者通信接口、或发送模块)接收信息，并将其输入处理器。更进一步的，在收发器收到该信息之后，该信息可能需要进行其他的处理，然后才输入处理器。
基于上述原理，举例来说，前述方法中提及的发送信息可以理解为处理器输出信息。又例如，接收信息可以理解为处理器接收输入的信息。
可选的，对于处理器所涉及的发射、发送和接收等操作，如果没有特殊说明，或者，如果未与其在相关描述中的实际作用或者内在逻辑相抵触，则均可以更加一般性的理解为处理器输出和接收、输入等操作。
可选的，在执行上述第一方面至第四方面任一方面以及任一项可能的实施方式所述的方法的过程中，上述处理器可以是专门用于执行这些方法的处理器，也可以是通过执行存储器中的计算机指令来执行这些方法的处理器，例如通用处理器。上述存储器可以为非瞬时性(non-transitory)存储器，例如只读存储器(read only memory，ROM)，其可以与处理器集成在同一块芯片上，也可以分别设置在不同的芯片上，本申请实施例对存储器的类型以及存储器与处理器的设置方式不做限定。
在一种可能的实施方式中，上述至少一个存储器位于装置之外。
在又一种可能的实施方式中，上述至少一个存储器位于装置之内。
在又一种可能的实施方式之中，上述至少一个存储器的部分存储器位于装置之内，另一部分存储器位于装置之外。
本申请中，处理器和存储器还可能集成于一个器件中，即处理器和存储器还可以被集成在一起。
附图说明
图1是一个通信域的几种拓扑结构的示例图；
图2是一种无线BMS场景的示例图；
图3是一种智能家居场景的示例图；
图4是本申请提供的一种多跳网络的网络拓扑的结构示例图；
图5是本申请提供的一种可能的无线通信系统的示意图；
图6是本申请提供的一种通信方法的流程示意图；
图6A是一种树状图形式呈现的网络拓扑配置信息；
图6B是图6所示实施例的一种示例图；
图7是本申请提供的另一种通信方法的流程示意图；
图7A是图7所示实施例的一种示例图；
图8是本申请提供的又一种通信方法的流程示意图；
图9为本申请实施例提供的一种通信装置的结构示意图；
图10为本申请实施例提供的一种通信装置的结构示意图；
图11为本申请实施例提供的一种芯片的结构示意图。
具体实施方式
在本申请中，“第一”、“第二”等字样用于对功能和作用基本相同的相同项或相似项进行区分。本领域技术人员可以理解“第一”、“第二”等字样并不对数量和执行次序进行限定，并且“第一”、“第二”等字样也并不限定一定不同。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。字符“/”一般表示前后关联对象是一种“或”的关系。
应当理解，本申请中，“至少一个”指的是一个或多个；“多个”是指两个或两个以上。此外，本申请的“等于”可以与“大于”连用，也可以与“小于”连用。在“等于”与“大于”连用的情况下，采用“大于”的技术方案；在“等于”与“小于”连用的情况下，采用“小于”的技术方案。
首先，对本申请涉及的相关名称或术语进行阐述，以便于本领域技术人员理解。
1.节点(node)
节点是具有通信能力的电子设备，也称为通信节点。例如，节点可以包括手持终端、车辆、车载设备、或网络侧设备、用户设备、接入终端、用户单元、用户站、移动站、移动台、远方站、远程终端、无线通信设备、用户代理或用户装置等独立设备，也可以是包含在独立设备中的部件(例如芯片或集成电路)。节点可以为任一可能的智能终端设备(如手机)、智能运输设备(如车辆、无人机等)、智能制造设备、智能家居设备(例如大屏、音箱、打印机等)等。
示例性地，当节点为车载设备时，可以是汽车座舱(cockpit domain)设备，或者汽车座舱设备中的一个模块，例如：座舱域控制器(cockpit domain controller，CDC)、摄像头、屏幕、麦克风、音响、电子钥匙、无钥匙进入和启动系统控制器等模块中的一个或者多个。在车辆内，节点还可以为无线电池管理系统(wireless battery management system，wBMS)，或wBMS中的电池管理单元(battery management unit，BMU)等。
示例性地，当节点为手持终端时，可以是手机(mobile phone)、可穿戴设备、平板电脑(pad)、或带数据收发功能的电脑(如笔记本电脑、掌上电脑等)等。
本申请中的节点可以应用于多种应用场景中，例如以下应用场景：移动互联网(mobile internet，MI)、工业控制(industrial control)、无人驾驶(self driving)、运输安全(transportation safety)、物联网(internet of things，IoT)、智慧城市(smart city)、或智慧家庭(smart home)等。
本申请中的节点可以应用于多种网络类型中，例如应用于以下一种或者多种网络类型中：星闪(SparkLink)、长期演进(long term evolution，LTE)网络、第五代移动通信技术(5th-generation mobile communication technology，5G)、无线局域网(例如，Wi-Fi)、蓝牙(Bluetooth，BT)、紫峰(Zigbee)、或车载短距无线通信网络等。
在某些应用场景、或某些网络类型中，具备类似通信能力的设备的名称也可能不称为节点，但是为了方便描述，本申请实施例中将具有通信能力的设备统称为节点。
2.节点类型
节点类型用于描述节点的类型。节点类型也可以描述为节点身份或节点角色等。在本申请实施例中，将节点类型分为第一类型、第二类型和第三类型。
第一类型的节点可以称为授权(grant，G)节点、G节点或者控制节点等。本申请实施例以第一类型的节点称为G节点为例。
第二类型的节点可以称为终端(terminal，T)或者T节点等。本申请实施例以第二类型的节点称为T节点为例。
第三类型的节点可以称为双身份节点、双角色节点或者G(T)节点等。本申请实施例以第三类型的节点称为G(T)节点为例。G(T)节点表示既具有G节点的功能，又具有T节点的功能。
T节点可以连接G节点或G(T)节点。G(T)节点作为T节点时，可以连接G节点。G(T)节点作为G节点时，可以连接T节点。
本申请实施例以G节点、T节点和G(T)节点为例，随着短距无线通信技术或星闪技术的发展，G节点、T节点以及G(T)节点可能采用其他的名称。
3.通信域
通信系统(例如星闪通信系统)通常包含多个节点，节点之间可以通信，以传输数据。以车载通信系统为例，车辆内可以存在多个通信域，通信域是指由一组具有通信关系的节点以及信节点之间的通信连接关系(即通信链路)组成的系统，通常用于完成一种特定的功能。示例性地，一个通信域可以包括一个主节点和至少一个从节点，主从节点间、或主节点与主节点间、或从节点与从节点间可以互相通信。其中主节点可以管理从节点，具有分配资源的功能，负责为从节点分配资源；从节点听从主节点的调度，使用主节点分配的资源与主节点、和/或与其他节点进行通信。对一个通信域而言，该通信域内的任意两个节点可基于通信地址进行通信。
在一些具体的实施场景中，主节点也可以称为G节点，从节点也可以称为T节点。
4.通信域的拓扑结构
对一个通信域而言，其拓扑结构可以星型单跳拓扑结构、树状三层多跳拓扑结构、或树状多跳拓扑结构等。
示例性的，可参见图1的(a)所示的一种星型单跳拓扑结构。图1的(a)中，通信域1包括G节点和多个T节点(例如T1节点，T2节点，…，Tn节点)，每个T节点均与G节点连接。G节点与T节点之 间的通信可以是双向单播，也可以是G->T的广播通信。
可选的，图1的(a)所示的结构可以适用于车载通信场景。例如，在车载通信场景中，G节点可以是远程通信箱(Telematics BOX，T-BOX)，T节点可以是车内的用户终端，用户终端例如可以是手机、耳机、音响、车载设备等。T-BOX也可以称作远程车载终端或车联网通讯终端。例如，T-BOX可与手机建立通信连接，从而实现开门、锁门、车窗控制、空调开关等控制。
示例性的，可参见图1的(b)所示的一种树状三层多跳拓扑结构。图1的(b)中，通信域2包括G1节点，G2节点，G3节点，T1节点，T2节点，T3节点和T4节点，T1节点和T2节点连接G2节点，T3节点和T4节点连接G3节点，G2节点和G3节点连接G1节点。
G1节点可作为总管理节点，G2节点和G3节点可为G(T)节点，G2节点可表示为G2(T)，G3节点可表示为G3(T)。以G2节点为例，对于G2节点与节点G1的通信，G2节点可作为T节点，G1节点可作为G节点；对于G2节点与T1节点的通信，G2节点可作为G节点，T1节点可作为T节点。对于树状三层多跳拓扑结构，G节点与T节点之间的通信可以是双向单播(例如G1节点与T1之间的双向单播可表示为G1-G2(T)-T1)，也可以是广播(例如G1->G2(T)->T)。
可选的，图1的(b)所示的结构可以适用于无线BMS场景。无线BMS场景可参见图2所示。图2中，电池堆管理系统(BAMS)作为总管理节点，电池簇管理系统(BCMS)为G(T)节点，BMU作为T节点。图1的(b)所示的结构还可以适用于无线胎压监测场景等。
示例性的，可参见图1的(c)所示的一种树状多跳拓扑结构。图1的(c)中，通信域3包括G1节点，G2节点，G3节点，G4节点，T1节点，T2节点和T3节点，T1节点连接G2节点，T2节点连接G4节点，G4节点可连接G2节点和G3节点，G2节点连接G1节点，G3节点连接G1节点。其中，G1节点可作为总管理节点，G2节点、G3节点和G4节点可为G(T)节点。
可选的，图1的(c)所示的结构可以适用于智能家居场景。智能家居场景可参见图3所示。图3中，网关/客户终端设备(customer premises equipment，CPE)作为总管理节点，子路由器、大屏、手机和空调为G(T)节点，热水器、智能窗帘、音箱、麦克风、打印机和智能门锁作为T节点。图1的(c)所示的结构还可以适用于低功耗大规模传感网络等，例如在低功耗大规模传感网络中，根(root)节点可作为总管理节点，骨干节点可作为G(T)，末梢节点可作为T节点。
下面对本申请应用的场景和系统架构进行介绍。
请参见图4，是本申请提供的一种多跳网络的网络拓扑的结构示例图。图4所述的网络拓扑包括M节点401，I节点402至I节点407，I节点415，E节点408至E节点414。需要说明的是，图4所示的节点数量用于举例，并不构成对本申请的限定。
其中，I节点指的是中间节点或中间路由节点，可以是报文发送者或接收者。I节点在网络中不频繁移动，具有路由能力和转发能力。I节点例如可以是无线中间系统(wireless intermediate system，WIS)节点。
E节点指的是端节点或末梢节点，可以是报文发送者或接收者。E节点在网络中可移动，例如从与一个I节点连接迁移至与另一个I节点连接。I节点不具有路由能力和转发能力。E节点例如可以是无线终端系统(wireless end system，WES)节点。I节点和E节点是物理节点或物理单元，可以理解为实际存在的节点或单元。在蓄电方面，I节点的蓄电能力高于E节点的蓄电能力，E节点可能没有长期的电源供给。
M节点401承担管理者(manager)的角色，可具有网络拓扑配置能力，网络路径探测报文广播能力等能力。在本申请实施例中，在网络初始化时，M节点可获取网络拓扑配置信息，或获取网络拓扑构建规则。对于M节点获取网络拓扑配置信息而言，M节点可具有网络拓扑配置能力，可基于该网络拓扑配置信息对网络拓扑进行配置和管理。对于M节点获取网络拓扑构建规则而言，M节点可向其邻接节点(I节点或E节点)广播网络路径探测报文，M节点的邻接节点可进一步广播网络探测报文，从而相邻两个节点可根据网络路径探测报文中的跳数来建立邻接关系，从而构成动态的网络拓扑。
考虑网络管理的可靠性，网络中可以还存在备份的一个或多个M节点。M节点是功能节点、功能单元、逻辑节点或逻辑单元，可以理解为虚拟的节点或单元。M节点401的功能可通过某个I节点实现，也就是说该I节点承担管理者的角色，M节点的本质是I节点。M节点也可以描述为manager节点。
可以理解的是，图4所示的网络拓扑可以是一个通信域，图1所示的几种拓扑结构可以是图4所示的网络拓扑的子集。例如，图1的(b)中的G1节点、G2节点和G3节点可以是图4中的I节点，图1的(b)中的T1节点至T4节点可以是图4中的E节点，G1节点可以具有M节点的功能。再例如，图3中的网关/CPE、子路由器、大屏、手机和空调可作为I节点，网关/CPE可以具有M节点的功能；热水器、智能窗 帘和智能门锁可作为E节点。
本申请实施例涉及的网络拓扑为多跳网络的网络拓扑，例如图1的(b)和图1的(c)。多跳网络也可以描述为网状(mesh)网络、无线多跳网络或无线网格网络等。
进一步的，本申请实施例可以应用于车载通信场景，无线BMS场景(如图2所示)，电池包/电芯仓储场景，智能家居场景(如图3所示)，智能座舱、智能驾驶、智能制造、智能运输等智能应用场景。
示例性地，以通信的节点包含第一节点与第二节点为例。图5是本申请提供的一种可能的无线通信系统的示意图，该无线通信系统包括第一节点501和第二节点502。本申请实施例以一个通信域包括一个M节点，第一节点501具有M节点的功能为例，第二节点502可以是以下任一种方式：
方式1：第二节点502可以是第一节点501的邻接节点，可以是I节点或E节点。例如，基于图4，第二节点502可以是I节点402，或者可以是与M节点401邻接的E节点。
方式2：第二节点502可以是通过中间节点与第一节点501通信的节点。第二节点502可以是I节点或E节点。例如，基于图4，第二节点502为E节点412时，通过I节点406和I节点415与M节点401通信。再例如，基于图4，第二节点502为I节点406时，通过I节点415与M节点401通信。
应理解，图5所示的无线通信系统中包括的节点还可以为更多个，此处为了便于描述故示出为第一节点和第二节点。例如，还可以包括第三节点等。
下面对本申请提供的通信方法进行介绍。
请参见图6，是本申请提供的一种通信方法的流程示意图，该方法可以包括但不限于如下步骤：
601，第一节点获取网络拓扑配置信息。
其中，第一节点可以是图4中的M节点401。可选的，对一个多跳网络而言，该多跳网络在初始化时，网络管理员可在该多跳网络的网络拓扑中选择一个节点作为M节点，并将该节点设置为M节点。例如，图3所示的多跳网络，网络管理员可选择将网关/CPE作为M节点。可选的，网络拓扑中的M节点可以是默认设置的，例如无线电池管理系统的网络拓扑在出厂设置时，默认将BAMS设置为M节点。
网络拓扑配置信息可包含节点标识、节点类型和网络拓扑信息。其中，节点标识用于标识节点，例如可以是层2标识(layer 2identity，L2ID)，L2ID的长度可以是48比特(bits)。节点类型可分为第一类型、第二类型和第三类型。某个节点的节点类型为第一类型，表示该节点为G节点；某个节点的节点类型为第二类型，表示该节点为T节点；某个节点的节点类型为第三类型，表示该节点为G(T)节点。网络拓扑信息用于指示网络拓扑结构，网络拓扑结构可包含节点之间的邻接关系，例如节点1邻接节点2，节点2邻接节点3等。对于某个多跳网络的网络拓扑配置信息而言，其可以指示该多跳网络中各个节点的节点标识，各个节点的节点类型以及该多跳网络中节点之间的邻接关系。可选的，网络拓扑配置信息可以通过表格或者树状图等形式呈现。
示例性的，网络拓扑配置信息以表格形式呈现，可参见下表1所示。
表1
表1中，节点1为G节点，节点1的邻接节点有节点2和节点3，节点2为G(T)节点，节点3为T节点；节点2为G(T)节点，节点2的邻接节点有节点1和节点4，节点1为G节点，节点4为T节点。在L2ID的长度为48比特的情况下，表1中，A，B，C，D可以表示48bits的L2ID的不同取值。
示例性的，网络拓扑配置信息以树状图形式呈现，可参见图6A所示。图6A中，节点1为G节点，L2ID为A；节点1的邻接节点有节点2和节点3；节点2为G(T)节点，L2ID为B；节点3为T节点，L2ID为C；节点2的邻接节点有节点1和节点4；节点4为T节点，L2ID为D。在L2ID的长度为48比特的情况下，A，B，C，D可以表示48bits的L2ID的不同取值。
网络拓扑配置信息包含节点标识、节点类型和网络拓扑信息，其中，网络拓扑信息用于配置多个节点中每个节点的邻接关系，一个节点的邻接关系可包含该节点的节点标识、该节点的节点类型、该节点的邻 接节点的节点标识以及该节点的邻接节点的节点类型。例如，网络配置信息包括节点1至节点4中每个节点的邻接关系，节点1的邻接节点包括节点2，那么节点1的邻接关系包括节点1的L2ID、节点1的节点类型、节点2的L2ID以及节点2的节点类型。节点1通过该邻接关系可获知节点2为其邻接节点，以及节点2的L2ID和节点类型。也就是说，某个节点通过其邻接关系可获知其邻接节点有哪些，以及其邻接节点的节点标识和节点类型。
网络拓扑配置信息可以是静态的，即节点类型、节点标识以及网络拓扑信息被预先配置在网络拓扑配置信息中。
可选的，网络拓扑配置信息可以是网络管理员预先配置在第一节点中，从而第一节点可获取网络拓扑配置信息。例如，网络管理员在选择M节点之后，向M节点输入网络拓扑配置信息，从而M节点可获取网络拓扑配置信息。
可选的，网络拓扑配置信息可以是默认设置的。例如无线电池管理系统的网络拓扑配置信息在出厂设置时，被设置在BAMS中，从而BAMS在启动时便能获取网络拓扑配置信息。
可选的，网络拓扑配置信息可以是第一节点生成的。例如第一节点根据多跳网络中各个节点的节点标识和节点类型生成网络拓扑信息，进而生成网络拓扑配置信息。
在图6所示的实施例中，第一节点具有网络拓扑配置能力。对于某个多跳网络而言，第一节点可根据该多跳网络的网络拓扑配置信息，向请求上线该多跳网络的节点提供网络配置信息。上线该多跳网络的节点也可以描述为在该多跳网络中运行的节点。需要说明的是，某个多跳网络在初始化确定第一节点之后，该多跳网络已上线的节点暂时就包括第一节点，等待该多跳网络的网络拓扑配置信息中的其他节点上线。
602，第二节点向第一节点发送第一消息。相应的，第一节点接收来自第二节点的第一消息。其中，第一消息包含第二节点的节点标识。第二节点的节点标识，例如可以是L2ID。
其中，第二节点可以理解为请求上线的节点。例如，上述网络拓扑配置信息为多跳网络1的网络拓扑配置信息，第二节点可以是请求上线多跳网络1的节点。第一消息包含第二节点的节点标识，可表示第二节点请求上线第一节点所在的多跳网络。第二节点的节点标识可能被配置在网络拓扑配置信息中，也可能未被配置在网络拓扑配置信息中。在图6所示的实施例中，以第二节点的节点标识被配置在网络拓扑配置信息中，第二节点为第一节点的邻接节点为例。
第二节点在向第一节点发送第一消息之前，第二节点与第一节点建立连接。第二节点与第一节点建立连接可包括：第二节点发现了第一节点，或第一节点发现了第二节点，进而第二节点接入第一节点所在的无线网络；第二节接收的广播消息指示第一节点具有网络拓扑配置能力，则第二节点与第一节点建立连接。若该广播消息指示第一节点不具有网络拓扑配置能力，则第二节点不与第一节点建立连接。可选的，广播消息可包括一个指示信息，该指示信息用于指示第一节点是否具有网络拓扑配置能力。该指示信息可以描述为网络配置能力指示信息或网络配置状态指示信息等，可以是一个比特或一个字段，该比特的取值或该字段的取值用于指示第一节点是否具有网络拓扑配置能力。例如，该比特的取值为1，指示第一节点具有网络拓扑配置能力；该比特的取值为0，指示第一节点不具有网络拓扑配置能力。
其中，第二节点发现了第一节点可以是第一节点作为被发现方以广播方式发送第一系统消息或第一广播消息，第二节点扫描接收到第一系统消息或第一广播消息，从而第二节点可以确定发现了第一节点。第一系统消息或第一广播消息可携带第一节点的设备信息，例如携带第一节点的节点标识等。第一广播消息与上述指示第一节点是否具有网络拓扑配置能力的广播消息可以是同一广播消息，也可以是不同的广播消息。例如，第一节点先以广播方式发送第一广播消息，第二节点在扫描接收到第一广播消息时，确定发现了第一节点；之后，第一节点又以广播方式广播指示第一节点是否具有网络拓扑配置能力的广播消息。可选的，第二节点以节点类型为第二类型执行节点发现机制以发现第一节点，即以T节点身份执行节点发现机制。或者，第二节点可以节点类型为第二类型接入第一节点所在的网络，即以T节点身份接入网络。也就是说，第二节点以T节点身份与第一节点建立连接。
其中，第一节点发现了第二节点可以是第二节点作为被发现方以广播方式发送第二系统消息或第二广播消息，第一节点扫描接收到的第二系统消息或第二广播消息，从而第一节点可以确定发现了第二节点。第二系统消息或第二广播消息携带第二节点的设备信息，例如第二节点的节点标识。
可以理解的是，节点发现机制是相互的。作为被发现方的节点(例如节点1)以广播方式发送系统消息或广播消息，系统消息或广播消息携带节点1的设备信息。发现方的节点(例如节点2)扫描接收该系统消息或该广播消息，以确定是否与节点1建立连接。
603，第一节点基于网络拓扑配置信息，获取第二节点的网络配置信息。
第一节点在接收到第二节点的节点标识时，可在网络拓扑配置信息中查找是否包含第二节点的节点标识。网络拓扑配置信息包含第二节点的节点标识，那么第一节点根据第二节点的节点标识从网络拓扑配置信息中获取第二节点的网络配置信息。也就是说，第一节点基于网络拓扑配置信息，获取第二节点的网络配置信息。
其中，第二节点的网络配置信息用于指示第二节点的节点类型、第二节点的邻接节点以及第二节点的邻接节点的节点类型。可以理解的是，第二节点的网络配置信息用于配置第二节点的邻接关系，该邻接关系可包含第二节点的节点标识、第二节点的节点类型、第二节点的邻接节点的节点标识以及第二节点的邻接节点的节点类型。其中，第二节点的邻接节点的数量可以是一个或多个，视网络拓扑信息而定。
通常，直接连接的两个节点的节点类型不同。例如，基于表1，节点1与节点2的节点类型不同，节点1与节点3的节点类型不同。也就是说，第二节点的节点类型与其邻接节点的节点类型不同。例如，第一节点为M节点，即G节点，第二节点可以是T节点或G(T)节点。
可以理解的是，对网络拓扑配置信息中的任意一个节点而言，该节点的网络配置信息可包含该节点的节点类型为G节点，该节点的节点标识，该节点的邻接节点的节点类型为T节点，以及作为该节点的邻接节点的T节点的节点标识；或该节点的节点类型为T节点，该节点的节点标识，该节点的邻接节点的节点类型为G节点，以及作为该节点的邻接节点的G节点的节点标识；或该节点的节点类型为G(T)节点，该节点的节点标识，该节点的邻接节点的节点类型为G节点，该节点的邻接节点的节点类型为T节点，作为该节点的邻接节点的G节点的节点标识，以及作为该节点的邻接节点的T节点的节点标识。例如，基于表1，节点2的网络配置信息可包含节点2的节点类型为G(T)节点，节点2的L2ID，节点2作为T节点的邻接节点为节点1(G节点)，节点1的L2ID，节点2作为G节点的邻接节点为节点4(T节点)，以及节点4的L2ID。
604，第一节点向第二节点发送第二消息。相应的，第二节点接收来自第一节点的第二消息。其中，第二消息包含第二节点的网络配置信息。
第二节点在接收到第二节点的网络配置信息的情况下，以该网络配置信息在第一节点所在的多跳网络中运行。运行可以是上线后运行路由协议，以建立第一节点与第二节点之间的单播路由。例如，该网络配置信息指示第二节点为T节点，那么第二节点以T节点运行路由协议。再例如，该网络配置信息指示第二节点为G(T)节点，那么第二节点以G(T)节点运行路由协议。
可选的，第二节点在接收到第二节点的网络配置信息的情况下，可根据该网络配置信息，管理第二节点的邻接关系。管理第二节点的邻接关系可包括建立第二节点的第一邻接关系，和/或断开第二节点的第二邻接关系。其中，第一邻接关系即第二节点的网络配置信息指示的邻接关系。在第二节点获得其网络配置信息之前，若第二节点上不存在第二节点的任何邻接关系，那么第二节点在获得其网络配置信息时，可根据该网络配置信息，建立第一邻接关系。第二邻接关系即第二节点的网络配置信息未指示的邻接关系。在第二节点获得其网络配置信息之前，若第二节点上已经存在一些邻接关系，且这些邻接关系在第二节点的网络配置信息中未指示，那么第二节点根据其网络配置信息，断开这些邻接关系，并建立第二节点的第一邻接关系；若第二节点上已经存在一些邻接关系，且这些邻接关系包括第一邻接关系，那么第二节点断开这些邻接关系中除第一邻接关系之外的邻接关系，即断开第二邻接关系。
可选的，第二节点在接收到第二节点的网络配置信息的情况下，可根据该网络配置信息，更新第二节点的节点类型。例如，若第二节点以T节点的身份接入网络或第二节点以T节点的身份执行节点发现机制，且第二节点的网络配置信息指示第二节点为G节点或G(T)节点，那么第二节点可将第二节点的节点类型从T节点更新为G节点或G(T)节点。再例如，若第二节点以T节点的身份接入网络或第二节点以T节点的身份执行节点发现机制，且第二节点的网络配置信息指示第二节点为T节点，那么第二节点可维持第二节点为T节点。
若第二节点以G节点或G(T)节点运行，并且已与第一节点建立单播路由，那么第二节点能够转发信息。也就是说，第二节点(G节点或G(T)节点)具有网络拓扑配置转发能力。网络拓扑配置转发能力指能够将第一节点反馈的针对其他节点的网络配置信息转发至其他节点，也能将其他节点的节点标识转发至第一节点。在本申请实施例中，可以将具有网络拓扑配置转发能力的节点称为路由节点，路由节点也可以描述为转发节点或中间路由节点等。
对于第二节点为路由节点，且已与第一节点建立单播路由，那么第二节点可在接收到来自第三节点的第三消息(包含第三节点的节点标识)时，向第一节点发送第三节点的节点标识。第三消息可标识第三节点请求上线第一节点所在的多跳网络。
第一节点在通过第二节点接收到第三节点的节点标识时，可在网络拓扑配置信息中查找是否包含第三节点的节点标识。若网络拓扑配置信息包含第三节点的节点标识，那么第一节点根据第三节点的节点标识从网络拓扑配置信息中获取第三节点的网络配置信息，并通过第二节点向第三节点发送第四消息，第四消息包含第三节点的网络配置信息。第三节点的网络配置信息与第二节点的网络配置信息类似，可参考步骤603中对第二节点的网络配置信息的具体描述，在此不再赘述。若网络拓扑配置信息不包含第三节点的节点标识，那么第一节点可根据第三节点的节点标识对第三节点进行安全接入认证。在第三节点通过安全接入认证的情况下，第一节点根据第三节点的节点标识以及网络拓扑配置信息，为第三节点配置网络配置信息。例如，第一节点将第三节点作为第二节点的邻接节点，第三节点的节点类型为T节点，从而第三节点的网络配置信息可包含第三节点的节点标识、第三节点的节点类型、第三节点的邻接节点(即第二节点)的节点标识以及第二节点的节点类型。第一节点通过第二节点向第三节点发送第四消息，第四消息包含第三节点的网络配置信息。使得即使不在规划的网络拓扑中的节点也能通过路由节点从第一节点获取网络配置信息，从而可扩展网络拓扑，可提高网络拓扑的灵活性。本申请不对安全接入认证的方式做具体限定，以能确认第三节点的身份为准。
其中，第一节点通过第二节点向第三节点发送第四消息，可以是：第一节点向第二节点发送第四消息，第四消息包含第三节点的网络配置信息；第二节点向第三节点发送第四消息，第四消息包含第三节点的网络配置信息。也可以是：第一节点向第二节点发送第三节点的网络配置信息；第二节点向第三节点发送第四消息，第四消息包含第三节点的网络配置信息。
若第二节点以T节点运行，并且已与第一节点建立单播路由，那么第二节点不能转发信息。也就是说，第二节点(T节点)不具有网络拓扑配置转发能力。进而，第二节点可在接收到来自第三节点的第三消息(包含第三节点的节点标识)时，不会向第一节点发送第三节点的节点标识，而是向第三节点发送第四消息，第四消息用于指示第二节点不具有网络拓扑配置转发能力。第二节点通过指示第二节点不具有网络拓扑配置转发能力，以拒绝第三节点的请求。也就是说，端节点以T节点接入无线网络，并且不具有网络拓扑配置转发能力。
在图6所示的实施例中，第一节点为M节点，第二节点为规划的第一节点的邻接节点，第一节点的邻接节点从第一节点获取其网络配置信息，从而获得邻接关系。该实施例耗时较少，有助于提高通信效率。
示例性的，可参见图6B，是图6所示实施例的一种示例图。图6B中，网络管理员向M节点输入网络拓扑配置信息。节点1在发现M节点之后，接收来自M节点的广播消息，该广播消息指示M节点具有网络拓扑配置能力。节点1与M节点建立连接，进而节点1向M节点发送节点1的节点标识。M节点在接收到节点1的节点标识时，基于网络拓扑配置信息，获取节点1的网络配置信息，并向节点1反馈节点1的网络配置信息。
请参见图7，是本申请提供的另一种通信方法的流程示意图，该方法可以包括但不限于如下步骤：
701，第一节点获取网络拓扑配置信息。步骤701可参见图6所示实施例中对步骤601的具体描述，在此不再赘述。
702，第二节点向路由节点发送第一消息。相应的，路由节点接收来自第二节点的第一消息。其中，第一消息包含第二节点的节点标识。
其中，路由节点具有网络拓扑配置转发能力。路由节点的数量可以是一个或多个。路由节点可按照图6所示的方法获得其网络配置信息。进一步的，路由节点可基于其网络配置信息在第一节点所在的多跳网络中运行，与第一节点建立单播路由。可以将已在多跳网络中运行的节点称为已上线节点，多个已上线节点之间可建立单播路由，使得任意两个已上线节点可以互相通信。
其中，第二节点可以理解为请求上线的节点。例如，上述网络拓扑配置信息为多跳网络1的网络拓扑配置信息，第二节点可以是请求上线多跳网络1的节点。第一消息包含第二节点的节点标识，可表示第二节点请求上线第一节点所在的多跳网络。第二节点的节点标识可能被配置在网络拓扑配置信息中，也可能未被配置在网络拓扑配置信息中。在图7所示的实施例中，以第二节点的节点标识被配置在网络拓扑配置信息中，第二节点为路由节点的邻接节点，路由节点为第一节点的邻接节点为例。
第二节点在向路由节点发送第一消息之前，第二节点与路由节点建立连接。第二节点与路由节点建立连接与图6中第二节点与第一节点建立连接类似，具体可参见图6对第二节点与第一节点建立连接的具体描述，在此不再赘述。不同之处在于，图6中第一节点的广播消息用于指示第一节点具有网络拓扑配置能力；图7中路由节点的广播消息用于指示路由节点具有网络拓扑配置转发能力。若路由节点不具有网络拓扑配置转发能力，则第二节点不与路由节点建立连接。
可选的，路由节点的广播消息可包括一个指示信息，该指示信息用于指示路由节点是否具有网络拓扑配置转发能力。该指示信息可以描述为网络配置转发能力指示信息或网络配置状态指示信息等，可以是一个比特或一个字段，该比特的取值或该字段的取值用于指示路由节点是否具有网络拓扑配置转发能力。例如，该比特的取值为1，指示路由节点网络拓扑配置转发能力；该比特的取值为0，指示路由节点不具有网络拓扑配置转发能力。
可选的，第二节点可以节点类型为第二类型接入网络，即以T节点身份接入网络。或者，第二节点以节点类型为第二类型执行节点发现机制，即以T节点身份执行节点发现机制，以发现路由节点。
703，路由节点向第一节点发送第一消息。相应的，第一节点接收来自路由节点的第一消息。
结合步骤702和步骤703，可以理解为第二节点通过路由节点向第一节点发送第一消息。相应的，第一节点通过路由节点接收来自第二节点的第一消息。也就是说，第二节点通过路由节点向第一节点发送，第二节点的节点标识。
704，第一节点基于网络拓扑配置信息，获取第二节点的网络配置信息。步骤704可参见图6所示实施例中对步骤603的具体描述，在此不再赘述。
705，第一节点向路由节点发送第二消息。相应的，路由节点接收来自第一节点的第二消息。其中，第二消息包含第二节点的网络配置信息。
706，路由节点向第二节点发送第二消息。相应的，第二节点接收来自路由节点的第二消息。其中，第二消息包含第二节点的网络配置信息。
结合步骤705和步骤706，可以理解为第一节点通过路由节点向第二节点发送第二消息。相应的，第二节点通过路由节点接收来自第一节点的第二消息。也就是说，第一节点通过路由节点向第二节点发送，第二节点的网络配置信息。
第二节点在接收到第二节点的网络配置信息的情况下，可以该网络配置信息在第一节点所在的多跳网络中运行。
在图7所示的实施例中，第一节点为M节点，第二节点为路由节点的邻接节点，第二节点通过路由节点从第一节点获取网络配置信息，从而获得邻接关系。该实施例耗时较少，有助于提高通信效率。
示例性的，可参见图7A，是图7所示实施例的一种示例图。图7A中，网络管理员向M节点输入网络拓扑配置信息。节点1在发现路由节点之后，接收来自路由节点的广播消息，该广播消息指示路由节点具有网络拓扑配置转发能力。节点1与路由节点建立连接，路由节点为已上线节点，进而节点1通过路由节点向M节点发送节点1的节点标识。M节点在接收到节点1的节点标识时，基于网络拓扑配置信息，获取节点1的网络配置信息，并通过路由节点向节点1反馈节点1的网络配置信息。
可以理解的是，图6和图7所示实施例中，网络拓扑配置信息是静态的，从而M节点可向请求上线的节点提供网络配置信息，以便快速上线，有助于提高通信效率。可选的，M节点在检测到已上线的某个节点离开网络拓扑时，M节点可更新网络拓扑配置信息，并向该节点的邻接节点发送更新后的网络配置信息，以实现实时更新。
请参见图8，是本申请提供的又一种通信方法的流程示意图，该方法可以包括但不限于如下步骤：
801，第一节点获取网络拓扑构建规则。
其中，第一节点可以是图4中的M节点401。可选的，对一个多跳网络而言，该多跳网络在初始化时，网络管理员可在该多跳网络的网络拓扑中选择一个节点作为M节点，并将该节点设置为M节点。例如，图3所示的多跳网络，网络管理员可选择将网关/CPE作为M节点。可选的，网络拓扑中的M节点可以是默认设置的，例如无线电池管理系统的网络拓扑在出厂设置时，默认将BAMS设置为M节点。
网络拓扑构建规则用于指示如何构建网络拓扑，例如节点如何建立邻接关系等。网络拓扑构建规则可包含一个或多个规则，这一个或多个规则用于动态构建网络拓扑。可选的，网络拓扑构建规则可包含初始网络拓扑构建规则和再次网络拓扑构建规则，初始网络拓扑构建规则用于构建初始的网络拓扑，再次网络拓扑构建规则用于构建下一时间段的网络拓扑。可选的，网络拓扑构建规则可包含任意两个相邻节点建立邻接关系的规则，从而构建网络拓扑。
在一种实现方式中，网络拓扑构建规则可用于指示第一跳数和第二跳数需要满足的规则，第一跳数为第一节点至网络拓扑中的第二节点的最小跳数，第二跳数为第一节点至网络拓扑中的第三节点的最小跳数。其中，第二节点和第三节点可以是用于构建网络拓扑的任意两个相邻的节点。一个节点接收到的网络路径探测报文中的跳数，指示第一节点至该节点经历的跳数，该节点在某个时间段内可能会收到多个网络路径探测报文，不同路径探测报文中的跳数可能不同。该节点通过对该时间段内收到的多个网络路径探测报文 中的跳数进行比较，从而确定出最小跳数。
可选的，第一跳数和第二跳数需要满足的规则可以包括：第一跳数小于第二跳数，第二节点的节点类型为第一类型(即第二节点为G节点)，第三节点的节点类型为第二类型(即第三节点为T节点)；第一跳数大于第二跳数，第二节点的节点类型为第二类型(即第二节点为T节点)，第三节点的节点类型为第一类型(即第三节点为G节点)。若第一跳数与第二跳数相同，则可通过其他规则来确定第二节点和第三节点的节点类型。第一跳数和第二跳数需要满足的规则，也可以描述为比较第一跳数和第二跳数以确定节点类型的规则，或相邻节点建立邻接关系的规则，或再次网络拓扑构建规则等。
进一步的，网络拓扑构建规则还可用于指示第二节点的节点标识与第三节点的节点标识需要满足的规则。
可选的，第二节点的节点标识与第三节点的节点标识需要满足的规则可以包括：第二节点的节点标识小于第三节点的节点标识，第二节点的节点类型为第一类型(即第二节点为G节点)，第三节点的节点类型为第二类型(即第三节点为T节点)；第二节点的节点标识大于第三节点的节点标识，第二节点的节点类型为第二类型(即第二节点为T节点)，第三节点的节点类型为第一类型(即第三节点为G节点)。第二节点的节点标识与第三节点的节点标识需要满足的规则，也可以描述为比较节点标识以确定节点类型的规则，或相邻节点建立初始邻接关系的规则，或初始网络拓扑构建规则等。
对于第一跳数与第二跳数相同的情况，可通过第二节点的节点标识与第三节点的节点标识需要满足的规则来确定第二节点和第三节点的节点类型，或通过其他方式来确定第二节点和第三节点的节点类型。
可选的，网络拓扑构建规则可以是网络管理员预先配置在第一节点中，从而第一节点可获取网络拓扑构建规则。例如，网络管理员在选择M节点之后，向M节点输入网络拓扑构建规则，从而M节点可获取网络拓扑构建规则。可选的，网络拓扑构建规则可以是预先设置的，从而第一节点可获取网络拓扑构建规则。可选的，网络拓扑构建规则可以是第一节点生成的。
在一种可选的实施方式中，第一节点可广播网络拓扑构建规则，以便接收到该规则的节点可根据该规则与其邻接节点建立邻接关系，从而构建网络拓扑。在另一种可选的实施方式中，网络拓扑构建规则对于构建网络拓扑的节点而言是预先配置的，进而节点可根据该规则与其邻接节点建立邻接关系。
802，第一节点广播网络路径探测报文。
其中，网络路径探测报文可用于探测并携带节点间的跳数。网络路径探测报文用于探测节点间的跳数，指的是节点在收到某个网络路径探测报文(例如网络路径探测报文1)后，获取网络路径探测报文1携带的跳数，以确定第一节点至该节点的跳数；该节点向其邻接节点广播网络路径探测报文(例如网络路径探测报文2)，网络路径探测报文2携带的跳数可能是网络路径探测报文1携带的跳数+1。用于探测节点间的跳数，可以理解为基于收到的网络路径探测报文携带的跳数，确定发送的网络路径探测报文携带的跳数。网络路径探测报文携带节点间的跳数，指的是第一节点至收到网络路径探测报文的节点的跳数。网络路径探测报文可用于探测并携带节点间的跳数，也可以描述为网络路径探测报文可用于指示节点间的跳数。节点间的初始跳数为1。例如第一节点的邻接节点(如节点1)接收到来自第一节点的网络路径探测报文，该网络路径探测报文中的跳数为1；若节点1向其邻接节点发送网络路径探测报文，该网络路径探测报文中的跳数为2，以此类推。
可选的，第一节点向其邻接节点广播网络路径探测报文，这样第一节点的邻接节点收到的网络路径探测报文中的跳数为1。也就是说，第一节点广播的网络路径探测报文可由其邻接节点接收。进而，某个节点广播的网络路径探测报文可由该节点的邻接节点接收。
可选的，第一节点周期性地广播网络路径探测报文，以便周期性地调整网络拓扑。例如，第一节点每10分钟广播网络路径探测报文。具体的周期可由第一节点配置，或由网络管理员配置在第一节点中等。
需要说明的是，节点发送的广播消息存在丢弃的可能，因此节点在发送网络路径探测报文之后，需要收到其邻接节点反馈的确认(acknowledge，ACK)消息，否则需要重传。重传的次数最多可以是3次。
803，第二节点接收来自第一节点的网络路径探测报文。
第二节点接收来自第一节点的网络路径探测报文，可以是第二节点直接地接收来自第一节点的网络路径探测报文，也可以是第二节点间接地接收来自第一节点的网络路径探测报文。若第二节点直接地接收来自第一节点的网络路径探测报文，表示第二节点为第一节点的邻接节点。若第二节点间接地接收来自第一节点的网络路径探测报文，表示第二节点通过其他节点接收来自第一节点的网络路径探测报文。
示例性的，基于图4，I节点407可直接接收来自M节点401的网络路径探测报文，该网络路径探测报文中的跳数为1；E节点410可通过I节点404和I节点405接收来自M节点401的网络路径探测报文， 该网络路径探测报文中的跳数为3。
第二节点接收的网络路径探测报文的数量可以是一个或多个，视已构建的网络拓扑而定。例如，基于图4，E节点410可通过I节点404和I节点405接收来自M节点401的网络路径探测报文，该网络路径探测报文中的跳数为3；E节点410也可通过I节点415、I节点404和I节点405接收来自M节点401的网络路径探测报文，该网络路径探测报文中的跳数为4。
804，第二节点根据网络路径探测报文更新第一跳数。其中，第一跳数为第一节点至第二节点的最小跳数。
第二节点根据网络路径探测报文更新第一跳数之前，发送第一广播消息，第一广播消息包括第二节点的节点标识，以便其他节点发现第二节点。第二节点接收来自第三节点的第二广播消息，第二广播消息包括第三节点的节点标识。
可选的，第二节点可以节点类型为第一类型发送第一广播消息，即第二节点以G节点发送第一广播消息，期待被其他节点发现。若其他节点扫描接收到第一广播消息，那么其他节点发现了第二节点。同时，第二节点可以节点类型为第二类型扫描接收其他节点的广播消息，即以T节点扫描接收其他节点的广播消息，以便发现其他节点。从而确定第二节点的邻接节点。
第二节点通过接收第二广播消息可以获得第三节点的节点标识，通过比较第二节点的节点标识和第三节点的节点标识，确定第二节点的初始节点标识与第三节点的初始节点标识。例如，第二节点的节点标识小于第三节点的节点标识，确定第二节点的初始节点类型为第一类型(即第二节点为G节点)，第三节点的初始节点类型为第二类型(即第三节点为T节点)；第二节点的节点标识大于第三节点的节点标识，第二节点的初始节点类型为第二类型(即第二节点为T节点)，第三节点的初始节点类型为第一类型(即第三节点为G节点)。可见，通过相邻节点比较节点标识，可以建立邻接关系，并且确定节点类型。
可选的，第二节点以G节点发送第一广播消息，以T节点扫描接收其他节点的广播消息的过程也可以在步骤802之前执行。
其中，第一跳数由第二节点在本地维护。也就是说，第一跳数是第二节点在本地记录的最小跳数。随着时间的推移以及节点的上线或离开等，节点在不同时间段内接收到的网络路径探测报文中的跳数可能会发生变化，导致最小跳数发生变化。例如，在第一时间段内，第一跳数为3；在第二时间段内，接收到跳数为2的网络路径探测报文，那么第一跳数为2。
可选的，第一跳数可以是一段时间内，接收到的网络路径探测报文中的跳数最小值，该网络路径探测报文中的跳数指示第一节点至第二节点的跳数。例如，第二节点在10:00am-11:00am接收到3个网络路径探测报文，这3个网络路径探测报文中的跳数分别为3,4,2，那么第一跳数为2。也就是说，对任意一个节点而言，该节点在收到第一个网络路径探测报文时，不立即更新本地记录的跳数。
可选的，第二节点可以在两个网络路径探测报文发送周期之间接入无线网络，更新第一跳数。
进一步的，若更新后的第一跳数小于更新前的第一跳数，则第二节点向其他节点广播网络路径探测报文时，该网络路径探测报文中的跳数为第三跳数，第三跳数与更新后的第一跳数的差值为预设值，预设值即为1。也就是说，第二节点向第四节点发送第一网络路径探测报文，第一网络路径探测报文中的跳数为第三跳数，第三跳数等于更新后的第一跳数+1。
805，第二节点从第三节点获取第二跳数。其中，第二跳数为第一节点至第三节点的最小跳数。
可选的，第二节点可在更新第一跳数之后，网络路径探测报文发送周期之前，从第三节点获取第二跳数。或，第二节点可在两个网络路径探测报文发送周期之间，从第三节点获取第二跳数。第二跳数与第一跳数类似，具体可参见对第一跳数的具体描述，在此不再赘述。
806，第二节点根据第一跳数和第二跳数，确定第二节点的节点类型和第三节点的节点类型。
可选的，第二节点根据第一跳数和第二跳数，确定第二节点的节点类型和第三节点的节点类型可包括：第一跳数小于第二跳数，确定第二节点的节点类型为第一类型(即第二节点为G节点)，第三节点的节点类型为第二类型(即第三节点为T节点)；第一跳数大于第二跳数，确定第二节点的节点类型为第二类型(即第二节点为T节点)，第三节点的节点类型为第一类型(即第三节点为G节点)。
若第一跳数与第二跳数相同，则第二节点根据预先设置的规则确定第二节点和第三节点的节点类型。其中，预先设置的规则与节点标识的大小有关。例如，第二节点的L2ID小于第三节点的L2ID，确定第二节点的节点类型为第一类型(即第二节点为G节点)，第三节点的节点类型为第二类型(即第三节点为T节点)；第二节点的L2ID大于第三节点的L2ID，确定第二节点的节点类型为第二类型(即第二节点为T节点)，第三节点的节点类型为第一类型(即第三节点为G节点)。
步骤806确定的节点类型可以是一个时间段内的节点类型，随着节点的上线或离开，第二节点在下一个时间段收到的网络路径探测报文中的跳数可能会发生变化，导致第一跳数可能会发生变化，从而可能导致节点类型的变化。
可选的，第二节点获取其节点类型为第一类型的持续时间，若该持续时间大于预设时长，则第二节点维持节点类型为第一类型。也就是说，第二节点获取其为G节点的持续时间，若持续时间大于预设时长，则第二节点维持G节点，不会被改变为T节点。第二节点在确定其为G节点时，可启动一个计时器，当该计时器的时间大于预设时长时，第二节点维持G节点。其中，预设时长可以是预先设置的，或默认的，或包含在网络拓扑构建规则中。
可选的，网络拓扑构建规则还可用于指示端节点以T节点接入无线网络，并且端节点收到网络探测报文后不再向其邻接节点广播网络探测报文。或者，端节点默认收到网络探测报文后不再向其邻接节点广播网络探测报文。
在图8所示的实施例中，第二节点根据第一跳数和第二跳数，确定第二节点的节点类型和第三节点的节点类型，以建立第二节点与第三节点之间的邻接关系，有助于提高通信效率。
上述详细阐述了本申请实施例提供的方法，下面提供用于实现本申请实施例中任一种方法的装置，例如，提供一种装置包括用以实现以上任一种方法中节点所执行的各步骤的单元(或手段)。
请参阅图9，图9为本申请实施例提供的一种通信装置的结构示意图。
如图9所示，该通信装置90可以包括通信单元901以及处理单元902。通信单元901以及处理单元902可以是软件，也可以是硬件，或者是软件和硬件结合。
其中，通信单元901可以实现发送功能和/或接收功能，通信单元901也可以描述为收发单元、获取单元或发送单元。通信单元901还可以是集成了获取单元和发送单元的单元，其中，获取单元用于实现接收功能，发送单元用于实现发送功能。可选的，通信单元901可以用于接收其他装置发送的信息，还可以用于向其他装置发送信息。
在一种可能的设计中，该通信装置90可对应于上述方法实施例中的第一节点，如该通信装置90可以是第一节点，也可以是第一节点中的芯片。该通信装置90可以包括用于执行上述方法实施例中由第一节点所执行的操作的单元，并且，该通信装置90中的各单元分别为了实现上述方法实施例中由第一节点所执行的操作。
在另一种可能的设计中，该通信装置90可对应于上述方法实施例中的第二节点，如该通信装置90可以是第二节点，也可以是第二节点中的芯片。该通信装置90可以包括用于执行上述方法实施例中由第二节点所执行的操作的单元，并且，该通信装置90中的各单元分别为了实现上述方法实施例中由第二节点所执行的操作。
根据本申请实施例，图9所示的装置中的各个单元可以分别或全部合并为一个或若干个另外的单元来构成，或者其中的某个(些)单元还可以再拆分为功能上更小的多个单元来构成，这可以实现同样的操作，而不影响本申请的实施例的技术效果的实现。上述单元是基于逻辑功能划分的，在实际应用中，一个单元的功能也可以由多个单元来实现，或者多个单元的功能由一个单元实现。在本申请的其它实施例中，基于节点也可以包括其它单元，在实际应用中，这些功能也可以由其它单元协助实现，并且可以由多个单元协作实现。
需要说明的是，各个单元的实现还可以对应参照上述图6、图7、图8所示的方法实施例的相应描述。
在图9所描述的通信装置90中，第二节点可以获得其邻接关系，有助于提高通信效率。
请参阅图10，图10为本申请实施例提供的一种通信装置的结构示意图。
应理解，图10示出的通信装置100仅是示例，本申请实施例的通信装置还可包括其他部件，或者包括与图10中的各个部件的功能相似的部件，或者并非要包括图10中所有部件。
通信装置100包括通信接口1001和至少一个处理器1002。
该通信装置100可以对应第一节点或第二节点。通信接口1001用于收发消息或信息或报文，至少一个处理器1002执行程序指令，使得通信装置100实现上述方法实施例中由对应节点所执行的方法的相应流程。
在一种可能的设计中，该通信装置100可对应于上述方法实施例中的第一节点，如该通信装置100可以是第一节点，也可以是第一节点中的芯片。该通信装置100可以包括用于执行上述方法实施例中由第一节点所执行的操作的部件，并且，该通信装置100中的各部件分别为了实现上述方法实施例中由第一节点所执行的操作，具体可以对应参照上述方法实施例的第一节点的相应描述。
在另一种可能的设计中，该通信装置100可对应于上述方法实施例中的第二节点，如该通信装置100可以是第二节点，也可以是第二节点中的芯片。该通信装置100可以包括用于执行上述方法实施例中由第二节点所执行的操作的部件，并且，该通信装置100中的各部件分别为了实现上述方法实施例中由第二节点所执行的操作，具体可以对应参照上述方法实施例的第二节点的相应描述。
对于通信装置可以是芯片或芯片系统的情况，可参阅图11所示的芯片的结构示意图。
如图11所示，芯片110包括处理器1101和接口1102。其中，处理器1101的数量可以是一个或多个，接口1102的数量可以是多个。需要说明的是，处理器1101、接口1102各自对应的功能既可以通过硬件设计实现，也可以通过软件设计来实现，还可以通过软硬件结合的方式来实现，这里不作限制。
可选的，芯片110还可以包括存储器1103，存储器1103用于存储必要的程序指令和数据。
本申请中，处理器1101可用于从存储器1103中调用本申请的一个或多个实施例提供的通信方法在第一节点或第二节点的实现程序，并执行该程序包含的指令。接口1102可用于输出处理器1101的执行结果。本申请中，接口1102可具体用于输出处理器1101的各个消息或信息或报文。
关于本申请的一个或多个实施例提供的通信方法可参考前述图6、图7、图8所示各个实施例，这里不再赘述。
本申请实施例中的处理器可以是中央处理单元(Central Processing Unit，CPU)，该处理器还可以是其他通用处理器、数字信号处理器(digital signal processor，DSP)、专用集成电路(application specific integrated circuit，ASIC)、现成可编程门阵列(field programmable gate array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。
本申请实施例中的存储器用于提供存储空间，存储空间中可以存储操作系统和计算机程序等数据。存储器包括但不限于是随机存储记忆体(random access memory，RAM)、只读存储器(read-only memory，ROM)、可擦除可编程只读存储器(erasable programmable read only memory，EPROM)、或便携式只读存储器(compact disc read-only memory，CD-ROM)。
根据本申请实施例提供的方法，本申请实施例还提供一种计算机可读存储介质，上述计算机可读存储介质中存储有计算机程序，当上述计算机程序在一个或多个处理器上运行时，可以实现上述图6、图7、图8所示的方法。
根据本申请实施例提供的方法，本申请实施例还提供一种计算机程序产品，上述计算机程序产品包括计算机程序，当上述计算机程序在处理器上运行时，可以实现上述图6、图7、图8所示的方法。
本申请实施例提供一种终端设备，该终端设备包括至少一个如上述通信装置90或通信装置100或芯片110。该终端设备可以为运输设备、家居设备、可穿戴设备或者电池管理系统等。
本申请实施例还提供了一种系统，该系统包括至少一个终端设备，和/或至少一个如上述通信装置90或通信装置100或芯片110。
本申请实施例还提供了一种处理装置，包括处理器和接口；所述处理器用于执行上述任一方法实施例中的方法。
应理解，上述处理装置可以是一个芯片。例如，该处理装置可以是现场可编程门阵列(field programmable gate array，FPGA)，可以是通用处理器、数字信号处理器(digital signal processor，DSP)、专用集成电路(application specific integrated circuit，ASIC)、现成可编程门阵列(field programmable gate array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件，还可以是系统芯片(system on chip，SoC)，还可以是中央处理器(central processor unit，CPU)，还可以是网络处理器(network processor，NP)，还可以是数字信号处理电路(digital signal processor，DSP)，还可以是微控制器(micro controller unit，MCU)，还可以是可编程控制器(programmable logic device，PLD)或其他集成芯片。可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成，或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。
可以理解，本申请实施例中的存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(read-only memory，ROM)、可编程只读存储器(programmable ROM，PROM)、可擦除可编程只读存储器(erasable PROM，EPROM)、电可擦除可编 程只读存储器(electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(random access memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(static RAM，SRAM)、动态随机存取存储器(dynamic RAM，DRAM)、同步动态随机存取存储器(synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(direct rambus RAM，DR RAM)。应注意，本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机指令时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质(例如，软盘、硬盘、磁带)、光介质(例如，高密度数字视频光盘)、或者半导体介质(例如，固态硬盘)等。
上述各个装置实施例中的单元和方法实施例中的电子设备完全对应，由相应的模块或单元执行相应的步骤，例如通信单元(收发器)执行方法实施例中接收或发送的步骤，除发送、接收外的其它步骤可以由处理单元(处理器)执行。具体单元的功能可以参考相应的方法实施例。其中，处理器可以为一个或多个。
可以理解的，本申请实施例中，电子设备可以执行本申请实施例中的部分或全部步骤，这些步骤或操作仅是示例，本申请实施例还可以执行其它操作或者各种操作的变形。此外，各个步骤可以按照本申请实施例呈现的不同的顺序来执行，并且有可能并非要执行本申请实施例中的全部操作。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。

Claims (31)

  1. 一种通信方法，其特征在于，所述方法包括：
    第一节点获取网络拓扑配置信息，所述网络拓扑配置信息包含节点标识、节点类型和网络拓扑信息；
    所述第一节点接收第一消息，所述第一消息包含第二节点的节点标识；
    所述第一节点基于所述网络拓扑配置信息，获取所述第二节点的网络配置信息；
    所述第一节点发送第二消息，所述第二消息包含所述第二节点的网络配置信息；
    其中，所述第二节点的网络配置信息用于指示：
    所述第二节点的节点类型；
    所述第二节点的邻接节点；以及
    所述第二节点的邻接节点的节点类型。
  2. 根据权利要求1所述的方法，其特征在于，所述第二节点与所述第二节点的邻接节点的节点类型不同。
  3. 根据权利要求1或2所述的方法，其特征在于：
    所述第一节点接收第一消息，包括：
    所述第一节点接收来自所述第二节点的所述第一消息；
    所述第一节点发送第二消息，包括：
    所述第一节点向所述第二节点发送所述第二消息。
  4. 根据权利要求1至3任一项所述的方法，其特征在于，所述第一节点接收第一消息之前，还包括：
    所述第一节点发送广播消息，所述广播消息用于指示所述第一节点具有网络拓扑配置能力。
  5. 根据权利要求1或2所述的方法，其特征在于，
    所述第一节点接收第一消息，包括：
    所述第一节点通过路由节点接收来自所述第二节点的所述第一消息；
    所述第一节点发送第二消息，包括：
    所述第一节点通过所述路由节点向所述第二节点发送所述第二消息。
  6. 根据权利要求1至5任一项所述的方法，其特征在于，所述方法还包括：
    所述第一节点通过所述第二节点接收来自第三节点的第三消息，所述第三消息包含所述第三节点的节点标识；
    所述第一节点对所述第三节点进行安全接入认证，所述第三节点的节点标识未包含在所述网络拓扑配置信息中；
    在所述第三节点通过安全接入认证的情况下，所述第一节点通过所述第二节点向所述第三节点发送第四消息，所述第四消息包含所述第三节点的网络配置信息。
  7. 一种通信方法，其特征在于，所述方法包括：
    第二节点发送第一消息，所述第一消息包含所述第二节点的节点标识；
    所述第二节点接收第二消息，所述第二消息包含所述第二节点的网络配置信息；
    其中，所述第二节点的网络配置信息用于指示：
    所述第二节点的节点类型；
    所述第二节点的邻接节点；以及
    所述第二节点的邻接节点的节点类型。
  8. 根据权利要求7所述的方法，其特征在于，所述第二节点与所述第二节点的邻接节点的节点类型不同。
  9. 根据权利要求7或8所述的方法，其特征在于：
    所述第二节点发送第一消息，包括：
    所述第二节点向第一节点发送所述第一消息；
    所述第二节点接收第二消息，包括：
    所述第二节点接收来自所述第一节点的所述第二消息。
  10. 根据权利要求7至9任一项所述的方法，其特征在于，所述第二节点发送第一消息之前，还包括：
    所述第二节点接收来自第一节点的广播消息，所述广播消息用于指示所述第一节点具有网络拓扑配置能力。
  11. 根据权利要求7或8所述的方法，其特征在于：
    所述第二节点发送第一消息，包括：
    所述第二节点通过路由节点向第一节点发送所述第一消息；
    所述第二节点接收第二消息，包括：
    所述第二节点通过所述路由节点接收来自所述第一节点的所述第二消息。
  12. 根据权利要求7至9任一项所述的方法，其特征在于，所述第二节点发送第一消息之前，包括：
    所述第二节点接收来自路由节点的广播消息，所述广播消息用于指示所述路由节点具有网络拓扑配置转发能力。
  13. 根据权利要求7至12任一项所述的方法，其特征在于，所述方法还包括：
    所述第二节点根据所述第二节点的网络配置信息，管理所述第二节点的邻接关系。
  14. 根据权利要求7-13任一项所述的方法，其特征在于，所述方法还包括：
    所述第二节点根据所述第二节点的网络配置信息，更新所述第二节点的节点类型。
  15. 根据权利要求14所述的方法，其特征在于，所述方法还包括：
    所述第二节点接收来自第三节点的第三消息，所述第三消息包含所述第三节点的节点标识；
    所述第二节点向所述第一节点发送所述第三节点的节点标识；
    所述第二节点接收来自所述第一节点的第四消息，所述第四消息包含所述第三节点的网络配置信息；
    所述第二节点向所述第三节点发送所述第三节点的网络配置信息。
  16. 根据权利要求7至13任一项所述的方法，其特征在于，所述方法还包括：
    所述第二节点接收来自所述第三节点的第三消息，所述第三消息包含所述第三节点的节点标识；
    所述第二节点向所述第三节点发送第四消息，所述第四消息用于指示所述第二节点不具有网络拓扑配置转发能力。
  17. 一种通信方法，其特征在于，所述方法包括：
    第一节点获取网络拓扑构建规则，所述网络拓扑构建规则用于指示第一跳数和第二跳数需要满足的规则；所述第一跳数为所述第一节点至所述网络拓扑中的第二节点的最小跳数，所述第二跳数为所述第一节点至所述网络拓扑中的第三节点的最小跳数；
    所述第一节点广播网络路径探测报文，所述网络路径探测报文用于探测并携带节点间的跳数。
  18. 根据权利要求17所述的方法，其特征在于，所述网络拓扑构建规则还用于指示所述第二节点的节点标识和所述第三节点的节点标识需要满足的规则。
  19. 根据权利要求17或18所述的方法，其特征在于，所述方法还包括：
    所述第一节点广播所述网络拓扑构建规则。
  20. 一种通信方法，其特征在于，所述方法包括：
    第二节点接收来自第一节点的网络路径探测报文；
    所述第二节点根据所述网络路径探测报文更新第一跳数，所述第一跳数为所述第一节点至所述第二节点的最小跳数；
    所述第二节点从第三节点获取第二跳数，所述第二跳数为所述第一节点至所述第三节点的最小跳数；
    所述第二节点根据所述第一跳数和所述第二跳数，确定所述第二节点的节点类型和所述第三节点的节点类型。
  21. 根据权利要求20所述的方法，其特征在于，所述第二节点根据所述第一跳数和所述第二跳数，确定所述第二节点的节点类型和所述第三节点的节点类型，包括：
    所述第一跳数小于所述第二跳数，所述第二节点确定所述第二节点的节点类型为第一类型，所述第三节点的节点类型为第二类型；或，
    所述第一跳数大于所述第二跳数，所述第二节点确定所述第二节点的节点类型为第二类型，所述第三节点的节点类型为第一类型；
    其中，所述第一类型不同于所述第二类型。
  22. 根据权利要求20所述的方法，其特征在于，所述第一跳数等于所述第二跳数，
    所述第二节点根据所述第一跳数和所述第二跳数，确定所述第二节点的节点类型和所述第三节点的节点类型，包括：
    所述第二节点根据预先设置的规则确定所述第二节点的节点类型和所述第三节点的节点类型；
    其中，所述预先设置的规则与节点标识的大小有关。
  23. 根据权利要求20至22任一项所述的方法，其特征在于，所述第二节点根据所述网络路径探测报文 更新第一跳数之前，还包括：
    所述第二节点发送第一广播消息，所述第一广播消息包括所述第二节点的节点标识；
    所述第二节点接收来自所述第三节点的第二广播消息，所述第二广播消息包括所述第三节点的节点标识；
    所述第二节点根据所述第二节点的节点标识和所述第三节点的节点标识，确定所述第二节点的初始节点类型和所述第三节点的初始节点类型。
  24. 根据权利要求23所述的方法，其特征在于，所述第二节点根据所述第二节点的节点标识和所述第三节点的节点标识，确定所述第二节点的初始节点类型和所述第三节点的初始节点类型，包括：
    所述第二节点的节点标识小于所述第三节点的节点标识，所述第二节点确定所述第二节点的初始节点类型为第一类型，所述第三节点的初始节点类型为第二类型；或，
    所述第二节点的节点标识大于所述第三节点的节点标识，所述第二节点确定所述第二节点的初始节点类型为第二类型，所述第三节点的初始节点类型为第一类型；
    其中，所述第一类型不同于所述第二类型。
  25. 根据权利要求20至24任一项所述的方法，其特征在于，所述方法还包括：
    根据所述网络路径探测报文更新后的所述第一跳数小于更新前的所述第一跳数；
    所述第二节点向第四节点发送第一网络路径探测报文，所述第一网络路径探测报文中的跳数为第三跳数，所述第三跳数与所述更新后的第一跳数的差值为预设值。
  26. 根据权利要求20至25任一项所述的方法，其特征在于，所述方法还包括：
    所述第二节点获取所述第二节点的节点类型为第一类型的持续时间；
    所述持续时间大于预设时长，所述第二节点维持所述第二节点的节点类型为所述第一类型。
  27. 一种通信装置，其特征在于，包括：处理器；
    当所述处理器调用存储器中的计算机程序或指令时，使如权利要求1至6中任一项所述的方法被执行，或如权利要求7至16中任一项所述的方法被执行，或如权利要求17至19中任一项所述的方法被执行，或如权利要求20至26中任一项所述的方法被执行。
  28. 一种通信装置，其特征在于，包括：逻辑电路和通信接口；
    所述通信接口，用于接收信息或者发送信息；
    所述逻辑电路，用于通过所述通信接口接收信息或者发送信息，使如权利要求1至6中任一项所述的方法被执行，或如权利要求7至16中任一项所述的方法被执行，或如权利要求17至19中任一项所述的方法被执行，或如权利要求20至26中任一项所述的方法被执行。
  29. 一种终端设备，其特征在于，所述终端设备包含第一节点和/或第二节点，其中：
    所述第一节点包含用于实现如权利要求1-6任一项所述的方法的装置或如权利要求17-19任一项所述的方法的装置；
    所述第二节点包含用于实现如权利要求7-16任一项所述的方法的装置或如权利要求20-26任一项所述的方法的装置。
  30. 一种计算机可读存储介质，其特征在于，包括：
    所述计算机可读存储介质用于存储指令或计算机程序；当所述指令或所述计算机程序被执行时，使如权利要求1至6中任一项所述的方法被实现，或权利要求7至16中任一项所述的方法被实现，或权利要求17至19中任一项所述的方法被实现，或权利要求20至26中任一项所述的方法被实现。
  31. 一种计算机程序产品，其特征在于，包括：指令或计算机程序；
    所述指令或所述计算机程序被执行时，使如权利要求1至6中任一项所述的方法被实现，或权利要求7至16中任一项所述的方法被实现，或权利要求17至19中任一项所述的方法被实现，或权利要求20至26中任一项所述的方法被实现。
PCT/CN2023/120484 2022-09-30 2023-09-21 通信方法及通信装置 WO2024067360A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211214639.0A CN117858114A (zh) 2022-09-30 2022-09-30 通信方法及通信装置
CN202211214639.0 2022-09-30

Publications (1)

Publication Number Publication Date
WO2024067360A1 true WO2024067360A1 (zh) 2024-04-04

Family

ID=90476228

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/120484 WO2024067360A1 (zh) 2022-09-30 2023-09-21 通信方法及通信装置

Country Status (2)

Country Link
CN (1) CN117858114A (zh)
WO (1) WO2024067360A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110185084A1 (en) * 2010-01-27 2011-07-28 Brother Kogyo Kabushiki Kaisha Information communication system, relay node device, information communication method, and computer readable recording medium
WO2014121478A1 (zh) * 2013-02-07 2014-08-14 华为技术有限公司 获取网络节点相邻关系的方法、装置和网络设备
WO2018033216A1 (en) * 2016-08-19 2018-02-22 Huawei Technologies Co., Ltd. Network nodes, and methods thereof
CN113873678A (zh) * 2020-09-10 2021-12-31 华为技术有限公司 传输数据的方法和电子设备
CN114650254A (zh) * 2021-12-10 2022-06-21 中国联合网络通信集团有限公司 一种确定业务路径的方法、装置以及计算机可读存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110185084A1 (en) * 2010-01-27 2011-07-28 Brother Kogyo Kabushiki Kaisha Information communication system, relay node device, information communication method, and computer readable recording medium
WO2014121478A1 (zh) * 2013-02-07 2014-08-14 华为技术有限公司 获取网络节点相邻关系的方法、装置和网络设备
WO2018033216A1 (en) * 2016-08-19 2018-02-22 Huawei Technologies Co., Ltd. Network nodes, and methods thereof
CN113873678A (zh) * 2020-09-10 2021-12-31 华为技术有限公司 传输数据的方法和电子设备
CN114650254A (zh) * 2021-12-10 2022-06-21 中国联合网络通信集团有限公司 一种确定业务路径的方法、装置以及计算机可读存储介质

Also Published As

Publication number Publication date
CN117858114A (zh) 2024-04-09

Similar Documents

Publication Publication Date Title
JP7274582B2 (ja) ローカルエリアネットワーク（ｌａｎ）をサポートする方法および装置
JP5855760B2 (ja) ハイブリッド通信ネットワークにおける無線ブリッジング
US10075831B2 (en) Method and apparatus for transmitting and receiving data in mesh network using Bluetooth
EP2962431B1 (en) Spanning tree in fabric switches
US7522540B1 (en) Extended service set mesh topology discovery
US20210112001A1 (en) Communication method and communications apparatus
US10397850B2 (en) Method and device for transmitting/receiving data in mesh network using bluetooth
US20180160301A1 (en) Method and device for allocating address of device in bluetooth mesh network
US20170230784A1 (en) Method and apparatus for transmitting and receiving a data in a mesh network using bluetooth
US10547995B2 (en) Method and device for transmitting/receiving data using Bluetooth mesh network
KR102098156B1 (ko) 원격 저전력 ble 메쉬 네트워크 시스템 및 그 구성 방법
WO2023005128A1 (zh) 节点加入方法、对讲机、系统及存储介质
US20180176851A1 (en) Method and device for transmitting/receiving data in mesh network using bluetooth
CN111615220B (zh) 一种基于邻居感知网络的设备连接方法及设备
CN112105088A (zh) 多播通信方法、装置及系统
CN112073920A (zh) 一种无线网格网络节点的组网方法、网络节点设备
WO2023272981A1 (zh) 窄带通信方法、对讲机、设备、存储介质及自组网系统
WO2019149035A9 (zh) 一种mesh网络内设备发现方法
WO2022151420A1 (zh) 一种数据包传输的方法、装置和系统
WO2024067360A1 (zh) 通信方法及通信装置
WO2023040590A1 (zh) 通道配置方法及装置
US10674565B2 (en) Communication method
CN113645072B (zh) 主备网关部署方法及装置
CN114599018A (zh) 一种基于自动信道调度的蓝牙Mesh网络路由方法
WO2024021094A1 (zh) 通信方法及装置

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: 23870592

Country of ref document: EP

Kind code of ref document: A1