Communication method and device

CN119547385APending Publication Date: 2025-02-28HUAWEI TECH CO LTD
View PDF 6 Cites 0 Cited by

Patent Information

Application Number
CN202280097438.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2022-07-29
Publication Date
2025-02-28

AI Technical Summary

Technical Problem

In existing Internet Protocol (IP) networks, quality of service (QoS) cannot be guaranteed when IP packets are forwarded based on ARP entries, resulting in reliability and reachability issues in packet transmission.

Method used

By obtaining the logical channel information of preset QoS parameters, a logical transmission channel is established, using the StarLight network address and layer 2 identification for network layer communication, providing QoS guarantee, and optimizing data transmission through forwarding tables and link quality levels.

Benefits of technology

It achieves service quality assurance for packets, improves the reliability and accessibility of data transmission, and solves the problem of unreliable forwarding of traditional IP packets.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119547385A_ABST
    Figure CN119547385A_ABST
Patent Text Reader

Abstract

The invention provides a communication method and device, and the method comprises the steps that a first node obtains logic channel information corresponding to a preset QoS parameter, the logic channel information is used for building a logic transmission channel between the first node and a second node, and the second node is a neighbor node of the first node; the logic transmission channel is used for providing QoS guarantee for the message corresponding to the preset QoS parameter; the first node receives a first message sent by the second node, wherein the first message comprises at least one of the following items: the SLNA of the second node and the L2ID of the interface of the second node; and the first node performs network layer communication with the second node based on the logical channel information, the SLNA of the second node and the L2ID of the interface of the second node. By implementing the embodiment of the invention, QoS guarantee can be provided for the message. Furthermore, the method can be applied to the Internet of Vehicles, such as vehicle external connection V2X, inter-vehicle communication long term evolution technology LTE-V, vehicles, vehicle V2V and the like.
Need to check novelty before this filing date? Find Prior Art

Description

Communication method and device Technical Field

[0001] The present application relates to the fields of vehicle networking and communication technology, and in particular to a communication method and device. Background Art

[0002] In traditional Internet Protocol (IP) networks, adjacent devices establish a mapping table between IP addresses and Media Access Control (MAC) addresses through the Address Resolution Protocol (ARP) learning mechanism or static ARP configuration to support single-hop forwarding of IP packets between adjacent devices. Specifically, a Layer 2 packet header containing the MAC address of the next-hop adjacent device can be encapsulated in the IP packet header to enable one-hop forwarding of the encapsulated IP packet within the subnet between adjacent devices. However, when IP packets are forwarded based on ARP table entries, it only solves the reachability problem of packet forwarding and cannot provide quality of service (QoS) guarantees for the packets. Therefore, how to provide QoS guarantees for packets has become a technical problem that needs to be solved urgently.

[0003] Summary of the Invention

[0004] The present application provides a communication method and apparatus that can provide QoS guarantee for messages.

[0005] In a first aspect, a communication method is provided, including: a first node obtains logical channel information corresponding to a preset quality of service (QoS) parameter, the logical channel information is used to establish a logical transmission channel between the first node and a second node, the second node is a neighbor node of the first node, and the logical transmission channel is used to provide QoS guarantee for a message corresponding to the preset QoS parameter; the first node receives a first message sent by the second node, the first message including at least one of the following: a spark link network address (SLNA) of the second node and a layer 2 identification (L2ID) of an interface of the second node; the first node communicates with the second node at the network layer based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node.

[0006] It can be seen that the first node can obtain the logical channel information corresponding to the preset QoS parameters. The logical channel information is used to establish a logical transmission channel between the first node and the neighboring node of the first node, so that the first node can receive the first message sent by the neighboring node, and then can communicate with the neighboring node at the network layer based on the logical channel information, the SLNA of the neighboring node, and the layer 2 identifier L2ID of the interface of the neighboring node. Because the logical transmission channel can be used to provide QoS guarantees for the messages corresponding to the preset QoS parameters, the first node can provide QoS guarantees for the messages when communicating with the neighboring node at the network layer, and can also solve the reachability problem of message forwarding, and also improve the reliability of data transmission.

[0007] The QoS parameters may be parameters predefined by the first node based on service requirements, and therefore may also be referred to as preset QoS parameters. It should be understood that, in this application, different logical channel information can be used to establish different logical transmission channels, thereby enabling the transmission of different services. That is, to meet different service requirements, the first node can use different logical channel information to establish different logical transmission channels to transmit different services. Therefore, the QoS parameters correspond to the logical channel information.

[0008] Optionally, the logical channel information includes at least one of the following: a transport channel identifier (TCID) and a logical channel identifier (LCID). The preset QoS parameters may correspond to the TCID. The TCID may be generated by the first node based on the QoS parameters or may be predefined, which is not limited here. Furthermore, the TCID corresponds to the LCID, and the LCID may be generated by the first node based on the TCID or may be predefined, which is not limited here.

[0009] The first message may be a Hello message.

[0010] Optionally, the network layer can be used to implement the transmission of data messages or control messages between two nodes, and specific functions include addressing and routing, connection establishment, maintenance and termination, etc. Further, in this application, the network layer can be, for example, the Star Flash network layer.

[0011] A neighbor node is a term used by two directly connected nodes to refer to each other. A directly connected node is a node that can establish a direct link, or a node that can establish a neighbor relationship.

[0012] Illustratively, an end node may establish a direct link with an intermediate node, and thus the intermediate node is a neighbor node of the end node, and the end node is a neighbor node of the intermediate node.

[0013] As another example, an intermediate node may establish a direct link with another intermediate node. Therefore, the intermediate node is a neighbor node of the other intermediate node, and the other intermediate node is a neighbor node of the intermediate node.

[0014] It should be understood that the L2ID of a node's interface is a unique identifier assigned to the node as a network address for communication in the Star Flash network, which is 6 bytes in total.

[0015] Optionally, in combination with the first aspect, the first node communicates with the second node at the network layer based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node, including: the first node establishes a forwarding table based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node; wherein the forwarding table includes at least one of the following: logical channel information, SLNA of the second node, and L2ID of the interface of the second node, and the logical channel information, SLNA of the second node, and L2ID of the interface of the second node correspond one to one.

[0016] The forwarding table is used for direct transmission between the first node and the neighboring nodes.

[0017] It can be seen that the first node can establish a forwarding table based on the logical channel information, the SLNA of the neighboring node, and the L2ID of the interface of the neighboring node. Because the logical transmission channel can be used to provide QoS protection for the messages corresponding to the preset QoS parameters, the first node can provide QoS protection for the messages when using the forwarding table to communicate with the neighboring node at the network layer. It can also solve the reachability problem of message forwarding and improve the reliability of data transmission.

[0018] Optionally, in combination with the first aspect, the forwarding table further includes a link quality level in the sending direction from the first node to the second node, where the link quality level is used to indicate the link quality in the sending direction from the first node to the second node.

[0019] The link quality level may be calculated by the second node based on one or more of bit error, delay, signal-to-noise ratio, transceiver rate, and the like.

[0020] It can be seen that the forwarding table also includes the link quality level in the sending direction from the first node to the second node, so that the first node can know the link quality level and then select a link with high link quality to transmit data, thereby improving the reliability of data transmission.

[0021] Optionally, in combination with the first aspect, the link quality level is included in the first message.

[0022] It can be seen that the first message also includes the link quality level in the sending direction from the first node to the second node, so that the first node can know the link quality level and then select a link with high link quality to transmit data, thereby improving the reliability of data transmission.

[0023] Optionally, in combination with the first aspect, the first message also includes the regional address of the second node, the second node is an intermediate node, and the regional address of the second node is used to indicate that the area where the second node is located is a level 1 area and / or a level 2 area; wherein the level 2 area is used to connect the level 1 area.

[0024] Illustratively, the level 1 area is a non-backbone area, and the level 2 area is a backbone area.

[0025] It can be seen that the area address of the second node can be used to indicate that the area where the second node is located is a level 1 area and / or a level 2 area, avoiding the need for multiple information to jointly indicate that the area where the second node is located is a level 1 area and / or a level 2 area, thereby saving overhead.

[0026] Optionally, in combination with the first aspect, the regional address of the second node belongs to the address range of the level 1 area, and the regional address of the second node is used to indicate that the area where the second node is located is the level 1 area; the regional address of the second node belongs to the address range of the level 2 area, and the regional address of the second node is used to indicate that the area where the second node is located is the level 2 area; the regional address of the second node belongs to the address range of the level 1 area and the level 2 area, and the regional address of the second node is used to indicate that the area where the second node is located is the overlapping area of ​​the level 1 area and the level 2 area.

[0027] The address range of the level 1 area may be 1-30000, and the address range of the level 2 area may be 30001-60000. Alternatively, the address range of the level 1 area may be 30001-60000, and the address range of the level 2 area may be 1-30000.

[0028] Exemplarily, the area address of the second node is 2, and the address range of the level 1 area is 1-30000. Therefore, 2 belongs to the address range of the level 1 area, and it can be known that the area where the second node is located is the level 1 area.

[0029] As another example, the area address of the second node is 32561, and the address range of the level 2 area is 30001-60000. Therefore, 32561 belongs to the address range of the level 2 area, and it can be known that the area where the second node is located is the level 2 area.

[0030] For example, the area addresses of the second node are 2 and 32561 respectively. The address range of the level 1 area is 1-30000, and the address range of the level 2 area is 30001-60000. 2 belongs to the address range of the level 1 area, and 32561 belongs to the address range of the level 2 area. Therefore, the second node is in both the first area and the second area, that is, the area where the second node is located is the overlapping area of ​​the level 1 area and the level 2 area.

[0031] It can be seen that the area address of the second node can be used to indicate that the area where the second node is located is a level 1 area and / or a level 2 area, avoiding the need for multiple information to jointly indicate that the area where the second node is located is a level 1 area and / or a level 2 area, thereby saving overhead.

[0032] Optionally, in combination with the first aspect, the first message is also used to indicate the type of the second node.

[0033] It can be seen that, because the first message can also indicate the type of the second node, the first node can learn the type of the second node, so that the end node can discard the Hello message sent by the end node.

[0034] Optionally, in combination with the first aspect, the first message includes a first type-length-value TLV field, and the first TLV field includes at least one of the following: an SLNA of the second node, and an L2ID of an interface of the second node.

[0035] The number of the SLNAs of the second node may be one or more. In a possible implementation manner, the one or more SLNAs of the second node correspond to an L2ID of an interface of the second node.

[0036] It can be seen that the first TLV field includes at least one of the following: the SLNA of the second node, the L2ID of the interface of the second node, so that the first node can communicate with the second node at the network layer based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node.

[0037] Optionally, in combination with the first aspect, the first message further includes a second TLV field, and the second TLV field includes a link quality level.

[0038] It can be seen that the first message also includes a second TLV field, which includes a link quality level, so that the first node can learn the link quality level and then select a link with high link quality to transmit data, thereby improving the reliability of data transmission.

[0039] Optionally, in combination with the first aspect, the first message also includes a third TLV field, the third TLV field includes a length field and at least one area address field corresponding to the length field, the length field is used to indicate the total length of at least one area address field, and an area address field is used to indicate an area address of the second node.

[0040] For example, the second node is configured with two area addresses, 1 and 30001. The third TLV field includes a length field and two area address fields corresponding to the length fields. Each area address field is 2 bytes long, so the total length of the two area address fields is 4 bytes, i.e., the length of the length field is 4 bytes. Furthermore, the area addresses indicated by the two area address fields are 1 and 30001, respectively.

[0041] It can be seen that the third TLV field includes a length field and at least one area address field corresponding to the length field. The length field is used to indicate the total length of at least one area address field, avoiding the need to configure multiple length fields to indicate the length of the corresponding area address field respectively, saving overhead.

[0042] Optionally, in combination with the first aspect, the first message further includes a fourth TLV field, and the fourth TLV field is used to indicate the authentication algorithm used by the second node, or the fourth TLV field is used to indicate the authentication algorithm and authentication key used by the second node.

[0043] The authentication algorithm may include, for example, Hash-based message authentication code (HMAC), secure hash algorithm 256 (SHA-256), HMAC-MD5, HMAC-SHA1-12, or HMAC-SHA1-20, etc. The authentication key may be understood as an encrypted string.

[0044] It can be seen that the first message includes a fourth TLV field, which is used to indicate the authentication algorithm used by the second node, or the fourth TLV field is used to indicate the authentication algorithm and authentication key used by the second node, avoiding the need for different authentication TLV fields to indicate non-keychain classes and keychain classes respectively, thereby saving overhead.

[0045] Optionally, the first node is an end node and the second node is an intermediate node. The method also includes: the first node adds default routing information in the routing table of the first node, the default routing information includes at least one of the following: a default destination address, an outbound interface of the first node, an L2ID of an interface of the next hop node, and logical channel information; wherein the next hop node is the second node.

[0046] Optionally, the default destination address, the outbound interface of the first node, the L2ID of the interface of the next hop node, and the logical channel information correspond one to one. It can also be understood that the default routing information includes a one-to-one correspondence between the default destination address, the outbound interface of the first node, the L2ID of the interface of the next hop node, and the logical channel information.

[0047] The default destination address may be, for example, 0.0. The outbound interface of the first node may be understood as the interface of the first node connected to the second node. The next hop node is the second node.

[0048] As can be seen, because the first node adds the default route information to its routing table, when forwarding a message, if the first node cannot find the corresponding route in its routing table, it can send the message to the default destination address. This allows the first node to maintain fewer routes, saving memory, increasing energy consumption, and making it easier for the first node to move between different intermediate nodes. Furthermore, this avoids message loss and improves data transmission reliability.

[0049] According to a second aspect, a communication device is provided, which is a first node and includes a transceiver unit, which is used to: obtain logical channel information corresponding to preset quality of service QoS parameters, the logical channel information is used to establish a logical transmission channel between the first node and the second node, the second node is a neighbor node of the first node, and the logical transmission channel is used to provide QoS guarantee for the message corresponding to the preset QoS parameters; receive a first message sent by the second node, the first message includes at least one of the following: the Star Flash Network Address SLNA of the second node, the Layer 2 Identifier L2ID of the interface of the second node; based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node, communicate with the second node at the network layer.

[0050] Optionally, in combination with the second aspect, the logical channel information includes at least one of the following: a transmission channel identifier TCID, and a logical channel identifier LCID.

[0051] Optionally, in combination with the second aspect, the transceiver unit is used to communicate with the second node at the network layer based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node, including: the transceiver unit is used to establish a forwarding table based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node; wherein the forwarding table includes at least one of the following: logical channel information, SLNA of the second node, L2ID of the interface of the second node, and the logical channel information, SLNA of the second node, and L2ID of the interface of the second node correspond one to one.

[0052] Optionally, in combination with the second aspect, the forwarding table further includes a link quality level in the sending direction from the first node to the second node, where the link quality level is used to indicate the link quality in the sending direction from the first node to the second node.

[0053] Optionally, in combination with the second aspect, the link quality level is included in the first message.

[0054] Optionally, in combination with the second aspect, the first message also includes the regional address of the second node, the second node is an intermediate node, and the regional address of the second node is used to indicate that the area where the second node is located is a level 1 area and / or a level 2 area; wherein the level 2 area is used to connect the level 1 area.

[0055] Optionally, in combination with the second aspect, the level 1 area is a non-backbone area, and the level 2 area is a backbone area.

[0056] Optionally, in combination with the second aspect, the regional address of the second node belongs to the address range of the level 1 area, and the regional address of the second node is used to indicate that the area where the second node is located is the level 1 area; the regional address of the second node belongs to the address range of the level 2 area, and the regional address of the second node is used to indicate that the area where the second node is located is the level 2 area; the regional address of the second node belongs to the address range of the level 1 area and the level 2 area, and the regional address of the second node is used to indicate that the area where the second node is located is the overlapping area of ​​the level 1 area and the level 2 area.

[0057] Optionally, in combination with the second aspect, the first message is also used to indicate the type of the second node.

[0058] Optionally, in combination with the second aspect, the first message includes a first type-length-value TLV field, and the first TLV field includes at least one of the following: an SLNA of the second node, and an L2ID of an interface of the second node.

[0059] Optionally, in combination with the second aspect, one or more SLNAs of the second node correspond to an L2ID of an interface of the second node.

[0060] Optionally, in combination with the second aspect, the first message further includes a second TLV field, and the second TLV field includes a link quality level.

[0061] Optionally, in combination with the second aspect, the first message also includes a third TLV field, the third TLV field includes a length field and at least one area address field corresponding to the length field, the length field is used to indicate the total length of at least one area address field, and an area address field is used to indicate an area address of the second node.

[0062] Optionally, in combination with the second aspect, the first message further includes a fourth TLV field, and the fourth TLV field is used to indicate the authentication algorithm used by the second node, or the fourth TLV field is used to indicate the authentication algorithm and authentication key used by the second node.

[0063] Optionally, in combination with the second aspect, the first node is an end node, the second node is an intermediate node, and the communication device also includes a processing unit, which is used to add default routing information to the routing table of the first node. The default routing information includes at least one of the following: a default destination address, an outbound interface of the first node, an L2ID of the interface of the next hop node, and logical channel information; wherein the next hop node is the second node.

[0064] In a third aspect, a communication device is provided, characterized in that it includes: a processor and a memory; the memory is used to store one or more programs, and the one or more programs include computer execution instructions. When the device is running, the processor executes the one or more programs stored in the memory to enable the device to perform a method as described in any one of the first aspects.

[0065] In a fourth aspect, a computer storage medium is provided, on which a computer program is stored. When the computer program is run on a computer, the computer is caused to execute the method as described in any one of the first aspects.

[0066] In a fifth aspect, a chip is provided, comprising a processor and a communication interface, wherein the processor is configured to call and run instructions from the communication interface, and when the processor executes the instructions, the method as described in any one of the first aspects is implemented.

[0067] In a sixth aspect, a computer program product is provided, which includes a computer program. When the computer program is run on a computer, the computer is caused to execute the method as described in any one of the first aspects.

[0068] In a seventh aspect, a communication system is provided, comprising the above-mentioned first node and / or the above-mentioned second node. BRIEF DESCRIPTION OF THE DRAWINGS

[0069] The following is a brief introduction to the drawings required for describing the embodiments or prior art.

[0070] FIG1 is a schematic diagram of a connection via an interface provided in an embodiment of the present application;

[0071] FIG2 is a schematic diagram of area division of a wireless network provided in an embodiment of the present application;

[0072] FIG3 is a schematic diagram of the architecture of a system provided in an embodiment of the present application;

[0073] FIG4 is a flow chart of a communication method provided in an embodiment of the present application;

[0074] FIG5 is a schematic diagram of constructing a forwarding table provided in an embodiment of the present application;

[0075] FIG6 is a schematic structural diagram of a communication device 60 provided in an embodiment of the present application;

[0076] FIG7 is a schematic structural diagram of a communication device 70 provided in an embodiment of the present application. DETAILED DESCRIPTION

[0077] The technical solutions in the embodiments of the present application will be described below in conjunction with the accompanying drawings in the embodiments of the present application. In the embodiments of the present application, the terms "system" and "network" can be used interchangeably. Unless otherwise specified, " / " indicates that the objects associated before and after are in an "or" relationship. For example, A / B can represent A or B. "And / or" in this application is only a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. A and B can be singular or plural. In addition, in the description of this application, unless otherwise specified, "multiple" refers to two or more than two. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, c can be one or more. In addition, to facilitate the clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "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 the words "first" and "second" do not limit the quantity or execution order, and the words "first" and "second" do not necessarily mean different.

[0078] The reference to "one embodiment" or "some embodiments" etc. described in the embodiments of the present application means that one or more embodiments of the present application include the specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the sentences "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments" etc. that appear in different places in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways. The terms "including", "comprising", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized in other ways. The following specific embodiments further explain the purpose, technical solutions and beneficial effects of the present application in detail. It should be understood that the following are only specific embodiments of the present application and are not intended to limit the scope of protection of the present application. Any modifications, equivalent replacements, improvements, etc. made on the basis of the technical solutions of the present application should be included in the scope of protection of the present application.

[0079] In the various embodiments of the present application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0080] The following is an explanation of some of the terms involved in this application.

[0081] 1. Node

[0082] In this application, a node is an electronic device with communication capabilities, also known as a communication node. Nodes can be divided into end nodes and intermediate nodes.

[0083] The end node can be called a wireless end system (WES). For WES, reference can be made to the definition of end system in (International Telecommunication Union-Telecommunication Sector, ITU-T) Rec.X.200I ISO / IEC 7498-1. It should be understood that in this application, the end node is movable, such as the end node can migrate from one intermediate node to another intermediate node. It can also be understood that the end node can access one intermediate node at a certain moment and access another intermediate node at another moment. In addition, the end node does not have a routing function and may not have permanent power, that is, the end node does not have a continuous power supply and requires battery power. It can also be powered by various forms of power such as solar energy, wind energy, thermal energy, capacitors, etc.

[0084] Intermediate nodes can be referred to as wireless intermediate systems (WIS). For more information about WIS, please refer to the definition of intermediate systems by the International Organization for Standardization (ISO). It should be understood that in this application, intermediate nodes generally do not move frequently. At the same time, intermediate nodes have routing and forwarding functions.

[0085] It should be understood that in the present application, the end node and the intermediate node can be connected through an interface to form a logical link (referred to as link), and the intermediate node and the intermediate node can also be connected through an interface to form a logical link. Among them, the interface of the embodiment of the present application can be called an air interface, or other names can be used, which are not limited here. The interface can be implemented through short-range connection technology, such as Bluetooth (blue tooth), Zigbee, wireless fidelity (WiFi), vehicle-mounted short-range wireless communication technology, etc. In addition, the interface of the embodiment of the present application can also be implemented through long-range connection technology, such as long term evolution (LTE), fifth-generation mobile communication technology (5th generation mobile networks or 5th generation wireless systems, 5th-Generation, referred to as 5G or 5G technology), vehicle-mounted wireless communication technology and other technologies.

[0086] A node may include one or more interfaces, such as an end node may include one or more interfaces, and an intermediate node may also include one or more interfaces. Different interfaces of a node may be implemented using different technologies, that is, the types of multiple interfaces of a node may be different. Exemplarily, an end node includes three interfaces, which are implemented via Bluetooth, ZigBee, and Wi-Fi respectively. It should be understood that different interface identifiers can be used to distinguish the types of interfaces. In one possible embodiment, interfaces of the same type on different nodes may use the same or different interface identifiers, which is not limited here.

[0087] Generally speaking, different types of interfaces cannot communicate with each other at the bottom layer due to differences in the physical layer and link layer. Therefore, different nodes need to be connected through the same type of interface to form a link, and then data can be transmitted on the link.

[0088] For example, refer to Figure 1, which is a schematic diagram of a connection through an interface provided by an embodiment of the present application. In Figure 1, A, B and C respectively represent an intermediate node, and if ID is the interface identifier of the intermediate node. In 1-1 of Figure 1, the interface with the interface identifier 1 in A is connected to the interface with the interface identifier 1 in B, forming link 1. That is, the interface with the interface identifier 1 in A is of the same type as the interface with the interface identifier 1 in B. In 1-2 of Figure 1, the interface with the interface identifier 1 in A is connected to the interface with the interface identifier 1 in B, forming link 1, and the interface with the interface identifier 1 in A is connected to the interface with the interface identifier 1 in C, forming link 2. That is, the interface with the interface identifier 1 in A is of the same type as the interface with the interface identifier 1 in B, and the interface with the interface identifier 1 in A is of the same type as the interface with the interface identifier 1 in C. In 1-3 of Figure 1 , the interface with interface ID 1 in A is connected to the interface with interface ID 1 in B, forming link 1; the interface with interface ID 2 in A is connected to the interface with interface ID 2 in B, forming link 2. That is, the interface with interface ID 1 in A and the interface with interface ID 1 in B are of the same type, and the interface with interface ID 2 in A and the interface with interface ID 2 in B are of the same type. In 1-4 of Figure 1 , the interface with interface ID 1 in A and the interface with interface ID 1 in B are connected to form link 1, and the interface with interface ID 2 in A is connected to the interface with interface ID 1 in C, forming link 2. That is, the interface with interface ID 1 in A and the interface with interface ID 1 in B are of the same type, and the interface with interface ID 2 in A and the interface with interface ID 1 in C are of the same type. In addition, combining 1-1 and 1-2 of Figure 1 , it can be seen that an interface of the same node can be connected to one or more interfaces of the same type on another node. With reference to 1 - 3 and 1 - 4 in FIG. 1 , it can be seen that multiple interfaces of the same node can be connected to interfaces of the same type of multiple nodes respectively.

[0089] Considering the scalability of large networks, embodiments of the present application can divide and conquer the wireless network. That is, the wireless network can be divided into one or more level-1 areas and one level-2 area. The level-1 area can be a non-backbone area, and the level-2 area can be a backbone area.

[0090] It should be noted that, in this application, a level 1 region may include one or more of an end node and an intermediate node, and a level 2 region may include an intermediate node. The number of nodes in any region is not limited.

[0091] For example, see Figure 2, which is a schematic diagram of the regional division of a wireless network provided in an embodiment of the present application. Figure 2 includes three Level 1 areas and one Level 2 area. End nodes can be located in any Level 1 area, but end nodes are not included in the Level 2 area.

[0092] It should be understood that in the present application, a level 2 region can be used to connect one or more level 1 regions, thereby enabling data between different level 1 regions to be interoperable.

[0093] To uniquely identify an entity in a wireless network, a network entity title (NET) may be defined. Table 1 shows the format of a NET provided in an embodiment of the present application. As can be seen, a NET consists of a 2-byte area address and a 6-byte system ID. One byte is 8 bits.

[0094] Table 1

[0095]

[0096] In this application, the area address may be referred to as an area identifier (area ID), or other names may be used, without limitation. A node's area address may be used to indicate whether the area in which the node is located is a level 1 area and / or a level 2 area. This avoids the need for multiple pieces of information to jointly indicate whether the area in which the node is located is a level 1 area and / or a level 2 area, saving overhead.

[0097] Regional addresses can be divided into four categories: 0, 1-30000, 30001-60000, and 60001-65535. 0 and 60001-65535 are reserved regional addresses. 1-30000 is the address range of the level 1 region, and 30001-60000 is the address range of the level 2 region; alternatively, 1-30000 is the address range of the level 2 region, and 30001-60000 is the address range of the level 1 region. This makes it possible to determine whether a node is located in a level 1 region and / or a level 2 region through the regional address, avoiding the need for multiple pieces of information to jointly indicate whether a node is located in a level 1 region and / or a level 2 region, thus saving overhead.

[0098] End nodes are not configured with a regional address, but only with a system identifier. In this case, the regional address in the NET of the end node is 0. The system identifier of the end node is used to uniquely identify the end node.

[0099] An intermediate node can be configured with one or more regional addresses. It should be understood that when the area where an intermediate node is located is an overlapping area of ​​a level 1 area and a level 2 area, the intermediate node can be configured with multiple regional addresses. In one possible embodiment, an intermediate node can be configured with up to 3 regional addresses. Optionally, the regional addresses of different intermediate nodes can be all the same, partially the same, or completely different. Exemplarily, the regional address of one intermediate node can be 1, and the regional address of another intermediate node can also be 1, that is, the regional addresses of the two intermediate nodes are the same. As another example, the regional address of an intermediate node can include 1 and 30001, and the regional address of another intermediate node can be 1, that is, the regional addresses of the two intermediate nodes are partially the same. As another example, the regional address of one intermediate node can be 1, and the regional address of another intermediate node can be 30001, that is, the regional addresses of the two intermediate nodes are completely different.

[0100] The intermediate node may also be configured with a system identifier, wherein the system identifier of the intermediate node is used to uniquely identify the intermediate node.

[0101] Exemplarily, the NET of the intermediate node is 0001.1234.5678.0123 (hexadecimal), wherein the area address of the intermediate node is 0001, and the system identifier of the intermediate node is 1234.5678.0123.

[0102] To reduce configuration errors, in this application, the system identifier of an end node can reuse the layer 2 identification (L2ID) of the interface of the end node. Of course, the system identifier of an intermediate node can also reuse the L2ID of the interface of the intermediate node. Optionally, in this application, the system identifier of a node can reuse the largest or smallest L2ID among multiple interfaces of the node.

[0103] It should be understood that the L2ID of a node's interface is a unique identifier assigned to the node as a network address for communication in the Star Flash network, which is 6 bytes in total.

[0104] 2. Neighboring nodes

[0105] Neighbor nodes are the names that two directly connected nodes use to refer to each other. A directly connected node is a node that can establish a direct link, or a node that can establish a neighbor relationship.

[0106] Illustratively, an end node may establish a direct link with an intermediate node, and thus the intermediate node is a neighbor node of the end node, and the end node is a neighbor node of the intermediate node.

[0107] As another example, an intermediate node may establish a direct link with another intermediate node. Therefore, the intermediate node is a neighbor node of the other intermediate node, and the other intermediate node is a neighbor node of the intermediate node.

[0108] In this application, an end node does not have a regional address. The neighbor node of the end node is an intermediate node. The end node can be connected to the intermediate node. The regional address of the intermediate node belongs to the address range of the level 1 region, or the regional address of the intermediate node belongs to the address range of the level 1 region and the level 2 region. Therefore, the neighbor type of the end node and the intermediate node can be called the first neighbor type.

[0109] In this application, the neighbor type between an intermediate node and a neighbor node (the neighbor node is another intermediate node) can be one of the following: first neighbor type, second neighbor type, and third neighbor type. Specifically:

[0110] When the area address of the address range belonging to the level 1 area in the intermediate node and the area address of the address range belonging to the level 1 area in the neighboring node intersect, and the area address of the address range belonging to the level 2 area in the intermediate node and the area address of the address range belonging to the level 2 area in the neighboring node do not intersect, the neighbor type of the intermediate node and the neighboring node is the first neighbor type.

[0111] When the area address of the address range belonging to the level 1 area in the intermediate node has no intersection with the area address of the address range belonging to the level 1 area in the neighboring node, and the area address of the address range belonging to the level 2 area in the intermediate node has an intersection with the area address of the address range belonging to the level 2 area in the neighboring node, the neighbor type of the intermediate node and the neighboring node is the second neighbor type.

[0112] When the area address of the address range belonging to the level 1 area in the intermediate node intersects with the area address of the address range belonging to the level 1 area in the neighboring node, and the area address of the address range belonging to the level 2 area in the intermediate node intersects with the area address of the address range belonging to the level 2 area in the neighboring node, the neighbor type of the intermediate node and the neighboring node is the third neighbor type.

[0113] For example, the area address of intermediate node #A is 1, and the area addresses of intermediate node #B are 1 and 30002. The address range of the level 1 area is 1-30000, and the address range of the level 2 area is 30001-60000. The intersection of the area addresses of intermediate nodes #A and #B is 1, and 30002 is not the intersection of the area addresses of intermediate nodes #A and #B. 1 belongs to the address range of the level 1 area, and 30002 belongs to the address range of the level 2 area. Therefore, the neighbor type of intermediate nodes #A and #B is the first neighbor type.

[0114] For example, the area address of intermediate node #C is 30002, and the area addresses of intermediate node #D are 1 and 30002. The address range of the level 1 area is 1-30000, and the address range of the level 2 area is 30001-60000. The intersection of the area addresses of intermediate nodes #C and #D is 30002, and 1 is not the intersection of the area addresses of intermediate nodes #A and #B. 1 belongs to the address range of the level 1 area, and 30002 belongs to the address range of the level 2 area. Therefore, the neighbor type of intermediate nodes #C and #D is the second neighbor type.

[0115] For example, the area addresses of intermediate node #E are 1 and 30002, and the area addresses of intermediate node #F are 1 and 30002. The address range of the level 1 area is 1-30000, and the address range of the level 2 area is 30001-60000. The intersection of the area addresses of intermediate node #E and intermediate node #F is 1 and 30002. 1 belongs to the address range of the level 1 area, and 30002 belongs to the address range of the level 2 area. Therefore, the neighbor type of intermediate node #E and intermediate node #F is the third neighbor type.

[0116] 3. Quality of service (QoS) parameters

[0117] In this application, QoS parameters are parameters predefined by end nodes or intermediate nodes according to business requirements, and therefore can also be called preset QoS parameters.

[0118] Exemplarily, the QoS parameters may include one or more of a default priority value, a delay, a packet loss rate, a burst data size, an average window, and the like.

[0119] QoS parameters correspond to TCIDs. The TCID can be generated by an end node or an intermediate node based on the QoS parameters, or it can be predefined, and this is not limited here. Furthermore, the TCID corresponds to the LCID. The LCID can be generated by an end node or an intermediate node based on the TCID, or it can be predefined, and this is not limited here.

[0120] Optionally, one or more of the TCID and LCID may be used to establish a logical transmission channel between an end node or an intermediate node and a neighboring node. The logical transmission channel may be used to provide QoS guarantees for messages corresponding to the QoS parameters.

[0121] 4. Hello message

[0122] In the present application, an end node or an intermediate node can establish a neighbor relationship with one or more neighbor nodes through a Hello message to exchange one or more of the following: a Spark Link Network Address (SLNA), an interface layer 2 identifier, etc., and then communicate with the neighbor node at the network layer. It is understandable that a neighbor relationship cannot be established between different end nodes, that is, an end node does not receive a Hello message from an end node.

[0123] The network layer can be used to implement the transmission of data messages or control messages between two nodes, and its specific functions include addressing and routing, connection establishment, maintenance and termination, etc. Further, in this application, the network layer can be, for example, the Xingshan network layer.

[0124] The Hello message may include a message header and one or more type-length values ​​(TLVs). The message header may be called a Hello protocol data unit (PDU) header or other names, which are not limited here.

[0125] The following table describes the format of the Hello message.

[0126] See Table 2, which shows the format of a Hello message header provided by an embodiment of the present application. As shown in Table 2, the meaning and length of each field in the message header are as follows:

[0127] Network layer protocol identifier: Routing protocol constant used to identify the Hello message. The value is to be determined (TBD). This field is 1 byte long.

[0128] Version: 1. The length of this field is 1 byte.

[0129] PDU Type (type): The type of Hello message. It should be understood that a Hello message generated by an end node is referred to as a WEH message, and a Hello message generated by an intermediate node is referred to as a WIH message. Therefore, this field can be used to determine the type of node generating the Hello message. The length of this field is 1 byte. It should be understood that this field allows the node receiving the Hello message to know the type of the node sending the Hello message, allowing the end node to discard the Hello message sent by the end node.

[0130] Source System ID: The system ID of the node sending the Hello message. This field is 6 bytes long.

[0131] Source Interface ID: The ID of the interface on the node that sends the Hello message. This field is 1 byte long.

[0132] Holding time: If no Hello message is received from a neighboring node within this time, the established neighbor relationship is terminated. The unit can be seconds. This field is 2 bytes long.

[0133] PDU Length: The length of the Hello message. The unit can be bytes. This field is 2 bytes long.

[0134] Checksum: The checksum of the Hello message, used to verify the integrity of the Hello message. This field is 2 bytes long.

[0135] Sequence number: Used to prevent replay attacks. A replay attack occurs when an attacker sends a data packet that a node has already received in order to deceive the system. This is primarily used during the authentication process to compromise authentication accuracy. This field is 4 bytes long.

[0136] Variable length fields: can be used to carry newly added TLV fields. The length of a variable length field can be variable.

[0137] Table 2

[0138]

[0139] See Table 3, which shows the format of a TLV field in a Hello message provided in an embodiment of the present application. As shown in Table 3, the meaning and length of each field in the TLV field are as follows:

[0140] Type: The type used for this TLV field. The value is TBD. The length of the type field is 1 byte.

[0141] Length: The total length of the area address field, the number of this field is 1. The length of an area address field is 2 bytes. An intermediate node can be configured with one or more area addresses, so the length of the length field is variable. Optionally, an intermediate node can be configured with up to 3 area addresses, so the length of the length field can be 2 bytes, 4 bytes, or 6 bytes. Exemplarily, when the TLV field includes one area address field, the length of the length field can be 2 bytes; when the TLV field includes two area address fields, the length of the length field can be 4 bytes; when the TLV field includes three area address fields, the length of the length field can be 6 bytes. This avoids the need to configure multiple length fields to indicate the length of the corresponding area address fields, saving overhead.

[0142] Area address: This field can contain one or more fields. Optionally, if an intermediate node can be configured with up to three area addresses, then this field can contain up to three fields.

[0143] Table 3

[0144]

[0145] In this application, the TLV field shown in Table 3 may be referred to as the area address TLV field, or may be referred to by other names, which are not limited here.

[0146] It should be understood that a Hello message can include one area address TLV field. Furthermore, a Hello message sent by an intermediate node contains one and only one area address TLV field; an end node cannot contain an area address TLV field; an intermediate node discards a Hello message received from an intermediate node if the message contains no or multiple area address TLV fields; an intermediate node discards a Hello message received from an end node if the message contains an area address TLV field; and an end node discards a Hello message received from an intermediate node if the message contains no or multiple area address TLV fields.

[0147] See Table 4, which shows another format of a TLV field in a Hello message according to an embodiment of the present application. As shown in Table 4, the meaning and length of each field in the TLV field are as follows:

[0148] type: The type of the TLV field. The value is TBD. The type field is 1 byte long.

[0149] Length: The length of the TLV field. The length of the TLV field can be 6-254 bytes, that is, the length of the TLV field is variable. The length field can be 1 byte.

[0150] Authentication type: If the value of this field is 0, it is reserved. If the value of this field is any value between 1 and 200, it indicates the non-keychain type, that is, it is used to indicate the authentication algorithm. Authentication algorithms can include, for example, hash-based message authentication code (HMAC), secure hash algorithm 256 (SHA-256), HMAC-MD5, HMAC-SHA1-12, or HMAC-SHA1-20. If the value of this field is any value between 201 and 60000, it indicates the keychain type, that is, it is used to indicate the authentication algorithm and authentication key. Optionally, the security association (SA) identifier can be used to indicate the authentication algorithm and authentication key. The authentication key can be understood as an encrypted string. If the value of this field is 60001-65535, it is reserved. This avoids the need for different authentication TLV fields to indicate non-keychain and keychain types, saving overhead.

[0151] Authentication Value: This field indicates summary authentication information. This summary information can be the information calculated by the node sending the Hello message using an authentication algorithm, which is calculated based on the Hello message and the authentication key. This field has a variable length.

[0152] Table 4

[0153]

[0154]

[0155] In this application, the TLV field shown in Table 4 may be referred to as an authentication TLV field, or may be referred to by other names, which are not limited here.

[0156] It should be understood that a Hello message can include one Authentication TLV field. If no authentication algorithm is configured, or if neither the authentication algorithm nor the authentication key are configured, the Hello message does not carry the Authentication TLV field. A Hello message sent by a node may contain at most one Authentication TLV field. If a node receives a Hello message containing multiple Authentication TLV fields, it will discard the Hello message.

[0157] In addition, the relationship between the Authentication TLV field and the Checksum field in Table 1 is as follows: when encoding a Hello message, the node first sets the Checksum field value to zero, then calculates the authentication summary information, and finally encodes the Authentication TLV field before calculating the Checksum field value. When decoding a Hello message, the node first checks whether the Checksum field value is correct, then sets the Checksum field value to zero, and finally performs authentication.

[0158] See Table 5, which shows another format of a TLV field in a Hello message according to an embodiment of the present application. As shown in Table 5, the meaning and length of each field in the TLV field are as follows:

[0159] type: The type of the TLV field. The value is TBD. The type field is 1 byte long.

[0160] Length: The length of the TLV field. The length of the TLV field is 9 bytes. The length of the length field can be 1 byte.

[0161] Adjacency State: If this field is 0, the neighbor state is down, indicating that there is no neighbor relationship between the adjacent nodes. If this field is 1, the neighbor state is initialization, indicating that only one node has learned one or more of the adjacent node's SLNA, interface layer 2 identifier, etc. If this field is 2, the neighbor state is up, indicating that both adjacent nodes have learned one or more of the other's SLNA, interface layer 2 identifier, etc. This field is 1 byte long.

[0162] Neighbor ID: The neighbor node's system ID. This field is 6 bytes long.

[0163] Neighbor Interface ID: The ID of the neighbor node's interface. This field is 1 byte long.

[0164] Link Quality Level (LQL): The link quality level from the neighboring node to the node sending the Hello message. The LQL indicates the link quality from the neighboring node to the node sending the Hello message. Generally, the LQL is calculated by the node based on one or more of the following: bit error, latency, signal-to-noise ratio, and transceiver rate. A value of 0 in the LQL field indicates that the node has not enabled link detection; a value of 1 in the LQL field indicates that the link quality level is high; a value of 2 in the LQL field indicates that the link quality level is medium; a value of 3 in the LQL field indicates that the link quality level is low; values ​​between 5 and 254 in the LQL field are reserved; and a value of 255 in the LQL field indicates that the neighboring node does not transmit on the link between the node and the neighboring node. This can also be understood as instructing the neighboring node to set a maximum metric of -1 on the link between the node and the neighboring node, preventing the neighboring node from forwarding traffic to the node. The maximum metric is 65535. This allows the node that receives the Hello message to learn the link quality level and then select a link with high link quality to transmit data, thereby improving the reliability of data transmission.

[0165] Table 5

[0166]

[0167] In this application, the TLV field shown in Table 5 can be called the neighbor status TLV field, or other names can be used, which are not limited here.

[0168] It should be understood that a Hello message may include one neighbor status TLV field. When a node receives a Hello message containing multiple neighbor status TLV fields, the node will discard the Hello message.

[0169] See Table 6, which shows another format of a TLV field in a Hello message according to an embodiment of the present application. As shown in Table 6, the meaning and length of each field in the TLV field are as follows:

[0170] type: The type of the TLV field. The value is TBD. The type field is 1 byte long.

[0171] Length: The length of the TLV field. The length of the TLV field can be 0-255 bytes. The length of the length field can be 1 byte.

[0172] L2ID: The L2ID of the interface of the node sending the Hello message. This field can be 6 bytes long. This allows the node receiving the Hello message to know the L2ID of the interface of the node sending the Hello message.

[0173] SLNA: This field can be understood as the SLNA of the interface on the node that sent the Hello message. This field can be 2 bytes long. This allows the node that receives the Hello message to know the SLNA of the interface of the node that sent the Hello message.

[0174] Table 6

[0175]

[0176] In this application, the TLV field shown in Table 6 may be referred to as an SLNA TLV field, or may be referred to by other names, which are not limited here.

[0177] It should be understood that a Hello message may include one or more SLNA TLV fields. Optionally, an interface through which a node sends a Hello message may be configured with one or more SLNAs. In one possible embodiment, a Hello message may include one SLNA TLV field, and one SLNA TLV field may include one or more SLNAs. In another possible embodiment, a Hello message may include multiple SLNA TLV fields, and one SLNA TLV field may include one SLNA. It should be noted that when a Hello message from a neighboring node includes multiple SLNAs of the neighboring node, the node may use the union of the multiple SLNAs as the SLNA for network layer communication with the neighboring node.

[0178] In addition, after a node obtains the SLNA, it needs to carry the SLNA TLV field in the Hello message.

[0179] The above content briefly explains the meanings of some terms involved in the embodiments of the present application. It is for a better understanding of the technical solutions provided in the embodiments of the present application and does not constitute a limitation on the technical solutions provided in the embodiments of the present application.

[0180] It should be understood that the technical solutions of the embodiments of the present application can be applied to long term evolution (LTE), fifth generation mobile communication technology (5G), wireless local area networks (WLAN) systems, etc. The technical solutions of the embodiments of the present application can also be applied to other future communication systems, such as 6G communication systems, etc. In future communication systems, the functions may remain the same, but the names may change. In addition, the technical solutions of the embodiments of the application can also be applied to vehicle networks, such as vehicle external connection V2X, vehicle-to-vehicle communication long-term evolution technology LTE-V, vehicle-to-vehicle V2V, etc.

[0181] Referring to Figure 3, Figure 3 is a schematic diagram of the architecture of a system provided in an embodiment of the present application, which may include one or more end nodes and one or more intermediate nodes. Among them, an end node can be connected to one or more intermediate nodes, and an intermediate node can also be connected to one or more intermediate nodes to form corresponding links. Of course, data can also be transmitted between these nodes through the corresponding links. It should be understood that Figure 3 is only a schematic diagram and does not constitute a limitation on the applicable scenarios of the technical solution provided by this application.

[0182] Optionally, the architecture shown in Figure 3 can be applied to one or more scenarios, including mobile internet (MI), industrial control, self-driving, transportation safety, the Internet of Things (IoT), smart cities, smart homes, and in-vehicle communications. For example, in an in-vehicle communications scenario, intermediate nodes may include gateways (GWs) and telematics boxes (Tboxes or TCUs). The GW is a core component in the vehicle's electrical and electronic architecture. As the data exchange hub for the vehicle network, it routes network data from different networks, such as the controller area network (CAN), local interconnect network (LIN), media-oriented system transport (MOST), and FlexRay. The Tbox is primarily used to communicate with the vehicle's external systems, backend systems, and mobile applications. End nodes may include mobile data centers (MDCs), human-machine interaction (HMIs), and electronic control units (ECUs). MDC is the car's intelligent onboard computing platform. HMI is the car's infotainment system. ECU is a dedicated microcomputer controller for the car.

[0183] See Figure 4, which is a flow chart of a communication method provided by an embodiment of the present application. In Figure 4, the first node may be an end node, and the second node may be an intermediate node; or, the first node may be an intermediate node, and the second node may be an end node; or, the first node and the second node may both be intermediate nodes. As shown in Figure 4, the method includes, but is not limited to, the following steps:

[0184] 401. A first node obtains logical channel information corresponding to preset QoS parameters. The logical channel information is used to establish a logical transmission channel between the first node and a second node, where the second node is a neighbor node of the first node. The logical transmission channel is used to provide QoS guarantee for messages corresponding to the preset QoS parameters.

[0185] Regarding the preset QoS parameters and neighboring nodes, please refer to the above description and will not be elaborated here. It should be understood that in this application, different logical channel information can be used to establish different logical transmission channels, thereby transmitting different services. That is, to meet different service requirements, the first node can use different logical channel information to establish different logical transmission channels to transmit different services. Therefore, the preset QoS parameters correspond to the logical channel information.

[0186] Optionally, the logical channel information may include at least one of the following: TCID, LCID.

[0187] 402. The second node sends a first message to the first node. The first message includes at least one of the following: an SLNA of the second node and an L2ID of an interface of the second node.

[0188] Correspondingly, the first node receives the first message sent by the second node.

[0189] The first message may be, for example, a Hello message. For details about the Hello message, please refer to the above description, which will not be elaborated here.

[0190] Optionally, the first message may include a first TLV field, where the first TLV field includes at least one of the following: an SLNA of the second node and an L2ID of an interface of the second node. The number of SLNAs of the second node may be one or more. In one possible implementation, the one or more SLNAs of the second node correspond to an L2ID of an interface of the second node.

[0191] It should be noted that the first TLV field may be the SLNA TLV field in Table 6. For details, please refer to the above related description, which will not be repeated here.

[0192] It can be seen that the first TLV field includes at least one of the following: the SLNA of the second node, the L2ID of the interface of the second node, so that the first node can communicate with the second node at the network layer based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node.

[0193] Optionally, the first message also includes a link quality level in the transmission direction from the first node to the second node. The link quality level indicates the quality of the link in the transmission direction from the first node to the second node. For details about the link quality level, refer to the relevant description in Table 5 and are not further described here. It should be understood that the link quality level is calculated by the second node based on one or more of bit error, latency, signal-to-noise ratio, and transceiver rate.

[0194] In a possible implementation, the first message may further include a second TLV field including a link quality level. It should be noted that the second TLV field may be the neighbor status TLV field in Table 5. For details, please refer to the above related description and will not be repeated here.

[0195] It can be seen that the first message also includes the link quality level in the sending direction from the first node to the second node, so that the first node can know the link quality level and then select a link with high link quality to transmit data, thereby improving the reliability of data transmission.

[0196] Optionally, the second node is an intermediate node, and the first message further includes a regional address of the second node. The regional address of the second node is used to indicate whether the region in which the second node is located is a level 1 region and / or a level 2 region. The number of regional addresses of the second node can be one or more, and is not limited here. Regarding level 1 regions and level 2 regions, please refer to the above description and are not further elaborated here.

[0197] In one possible implementation, the area address of the second node belongs to the address range of the level 1 area, and the area address of the second node is used to indicate that the area where the second node is located is the level 1 area. For example, the area address of the second node is 2, and the address range of the level 1 area is 1-30000. Therefore, 2 belongs to the address range of the level 1 area, and it can be determined that the area where the second node is located is the level 1 area.

[0198] In another possible implementation, the area address of the second node belongs to the address range of the level 2 area, and the area address of the second node is used to indicate that the area where the second node is located is a level 2 area. For example, the area address of the second node is 32561, and the address range of the level 2 area is 30001-60000. Therefore, 32561 belongs to the address range of the level 2 area, and thus it can be determined that the area where the second node is located is a level 2 area.

[0199] In another possible embodiment, the area address of the second node belongs to the address range of the level 1 area and the level 2 area, and the area address of the second node is used to indicate that the area where the second node is located is the overlapping area of ​​the level 1 area and the level 2 area. For example, the area addresses of the second node are 2 and 32561 respectively, the address range of the level 1 area is 1-30000, and the address range of the level 2 area is 30001-60000. 2 belongs to the address range of the level 1 area, and 32561 belongs to the address range of the level 2 area. Therefore, the second node is in both the first area and the second area, that is, the area where the second node is located is the overlapping area of ​​the level 1 area and the level 2 area.

[0200] It should be noted that in this application, end nodes do not have regional addresses. Therefore, when the second node is an end node, the first message does not include the second node's regional address. In this application, the region in which the end node resides is a Level 1 region. It should be understood that an end node can be connected to an intermediate node, and the region in which the intermediate node resides is a Level 1 region, or the region in which the intermediate node resides is the overlapping region of a Level 1 region and a Level 2 region.

[0201] For example, as shown in Figure 2, one end node can connect to an intermediate node with a regional address of 1, while the other end node can connect to intermediate nodes with regional addresses of 2 and 30002, respectively. The intermediate node with regional address 1 is located in a Level 1 region, while the intermediate nodes with regional addresses of 2 and 30002 are located in the overlapping region of Level 1 and Level 2 regions. Furthermore, in Figure 2, the intermediate node with regional address 30002 is located in a Level 2 region.

[0202] Optionally, the first message further includes a third TLV field. The third TLV field includes a length field and at least one area address field corresponding to the length field. The length field is used to indicate the total length of the at least one area address field. The area address field is used to indicate an area address of the second node. The third TLV field may be the area address TLV field in Table 3. For details, refer to the above related description and are not repeated here.

[0203] For example, the second node is configured with two area addresses, 1 and 30001. The third TLV field includes a length field and two area address fields corresponding to the length fields. Each area address field is 2 bytes long, so the total length of the two area address fields is 4 bytes, i.e., the length of the length field is 4 bytes. Furthermore, the area addresses indicated by the two area address fields are 1 and 30001, respectively.

[0204] As can be seen, the area address of the second node can be used to indicate whether the area in which the second node is located is a Level 1 area and / or a Level 2 area, avoiding the need for multiple pieces of information to jointly indicate whether the area in which the second node is located is a Level 1 area and / or a Level 2 area, thus saving overhead. Furthermore, the third TLV field includes a length field and at least one area address field corresponding to the length field. The length field is used to indicate the total length of the at least one area address field, thus avoiding the need to configure multiple length fields to indicate the lengths of the corresponding area address fields, thus saving overhead.

[0205] Optionally, the first message also includes a fourth TLV field, which is used to indicate the authentication algorithm used by the second node, or the fourth TLV field is used to indicate the authentication algorithm and authentication key used by the second node. The fourth TLV field may be the authentication TLV field in Table 4. For details, refer to the above-mentioned related description and are not further described here. Furthermore, for details on the authentication algorithm and authentication key, refer to the above-mentioned related description and are not further described here.

[0206] It can be seen that the first message includes a fourth TLV field, which is used to indicate the authentication algorithm used by the second node, or the fourth TLV field is used to indicate the authentication algorithm and authentication key used by the second node, avoiding the need for different authentication TLV fields to indicate non-keychain classes and keychain classes respectively, thereby saving overhead.

[0207] Optionally, the first message may further indicate the type of the second node. It should be understood that the type of the second node may be an end node or an intermediate node.

[0208] In a possible implementation, the first message may include a PDU type field, and the PDU type field may indicate the type of the second node. The PDU type field may be described with reference to FIG. 3 , and will not be described in detail here.

[0209] It can be seen that, because the first message can also indicate the type of the second node, the first node can learn the type of the second node, so that the end node can discard the Hello message sent by the end node.

[0210] After step 402 , the method may further include step 403 .

[0211] 403. The first node performs network layer communication with the second node based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node.

[0212] For the network layer, please refer to the relevant description in Table 6 and will not be elaborated on here.

[0213] Optionally, step 403 may include: the first node establishing a forwarding table based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node, wherein the forwarding table is used for direct transmission between the first node and the neighboring node.

[0214] It should be understood that the forwarding table may include at least one of the following: logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node; and the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node are in a one-to-one correspondence. Of course, it can also be understood that the forwarding table includes a one-to-one correspondence between the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node.

[0215] In one possible implementation, the forwarding table may further include at least one of the following: a link quality level and an interface identifier of the first node. The logical channel information, the SLNA of the second node, the L2ID of the interface of the second node, the link quality level, and the interface identifier of the first node have a one-to-one correspondence. Alternatively, the forwarding table may include a one-to-one correspondence between the logical channel information, the SLNA of the second node, the L2ID of the interface of the second node, the link quality level, and the interface identifier of the first node.

[0216] For example, see Figure 5, which is a schematic diagram of a forwarding table construction provided by an embodiment of the present application. In Figure 5, node A is an end node, the SLNA of node A is 4.4, the L2ID of the interface of node A is 4444.4444.4444, and the interface identifier of node A is if1. Node B is an intermediate node, the SLNA of node B is 2.2, the L2ID of the interface of node B is 2222.2222.2222, and the interface identifier of node B is if1. Node C is an intermediate node, the SLNA of node C is 3.3, the L2ID of the interface of node C is 3333.3333.3333, and the interface identifier of node C is if1. Node H is an intermediate node, the SLNA of node H is 5.5, the L2ID of the interface of node H is 5555.5555.5555, and the interface identifier of node H is if1. For example, node B can receive Hello messages from node A, node C, and node H, respectively. Therefore, node B can obtain a forwarding table, which can include node B's interface identifier, the SLNA of the neighboring node, the L2ID of the interface of the neighboring node, node B's logical channel information, and the LQL in the transmission direction from node B to the neighboring node. The interface identifier of node B, the SLNA of the neighboring node, the L2ID of the interface of the neighboring node, the logical channel information of node B, and the LQL correspond one to one. For details, see Table 7. In conjunction with Figure 5, it can be seen that the SLNA of the neighboring nodes in Table 7 includes the SLNA of node A, the SLNA of node C, and the SLNA of node H, and the L2ID of the interface of the neighboring node includes the L2ID of the interface of node A, the L2ID of the interface of node C, and the L2ID of the interface of node H. Secondly, the logical channel information for node B includes the TCID and LCID. The TCIDs are 3030, 4020, and 5001, respectively, and the LCIDs are 10, 12, and 13, respectively. This means that node B has established different logical transmission channels with nodes A, C, and H, respectively. Furthermore, the LQLs in the transmission directions from node B to nodes A, C, and H are also different. It should be understood that Table 7 is merely an example and other forms are possible, and this is not intended to be limiting.

[0217] Table 7

[0218]

[0219] It can be seen that the first node can obtain the logical channel information corresponding to the preset QoS parameters. The logical channel information is used to establish a logical transmission channel between the first node and the neighboring node of the first node, so that the first node can receive the first message sent by the neighboring node, and then can communicate with the neighboring node at the network layer based on the logical channel information, the SLNA of the neighboring node, and the L2ID of the interface of the neighboring node. Because the logical transmission channel can be used to provide QoS protection for the message corresponding to the preset QoS parameters, the first node can provide QoS protection for the message when communicating with the neighboring node at the network layer, and can also solve the reachability problem of message forwarding, and also improve the reliability of data transmission.

[0220] Optionally, the first node is an end node and the second node is an intermediate node. The method may further include: the first node adding default routing information to the routing table of the first node. The default routing information may include at least one of the following: a default destination address, an outbound interface of the first node, an L2ID of an interface of a next-hop node, and logical channel information. The default destination address, the outbound interface of the first node, the L2ID of an interface of the next-hop node, and the logical channel information correspond one-to-one. This can also be understood as: the default routing information includes a one-to-one correspondence between the default destination address, the outbound interface of the first node, the L2ID of an interface of the next-hop node, and the logical channel information.

[0221] The default destination address may be, for example, 0.0. The outbound interface of the first node may be understood as the interface of the first node connected to the second node. The next hop node is the second node.

[0222] For example, the routing table of the first node can be seen in Table 8, where the default destination address is 0.0, the outbound interface of the first node is the interface identified as if1, the L2ID of the interface of the next hop node is 2222.2222.2222, and the logical channel information includes TCID and LCID, TCID is 20, and LCID is 2.

[0223] Table 8

[0224]

[0225] It should be understood that when a first node forwards a message, if it cannot find a corresponding route in its routing table, it can send the message to a default destination address. For example, referring to Figure 5 , suppose node A needs to send a message to node H. However, because node A's routing table does not contain a route for node H, such as node H's SLNA or the L2ID of node H's interface, node A can obtain default routing information. Assuming that the L2ID of the next-hop node's interface in the default routing information is the L2ID of node B's interface, node A can forward the message to node H to node B.

[0226] As can be seen, because the first node adds the default route information to its routing table, when forwarding a message, if the first node cannot find the corresponding route in its routing table, it can send the message to the default destination address. This allows the first node to maintain fewer routes, saving memory, increasing energy consumption, and making it easier for the first node to move between different intermediate nodes. Furthermore, this avoids message loss and improves data transmission reliability.

[0227] The above describes in detail the method of the embodiment of the present application, and the following provides an apparatus of the embodiment of the present application.

[0228] The embodiments of the present application also provide an apparatus for implementing any of the above methods. For example, a communication apparatus is provided that includes units (or means) for implementing each step performed by the first node in any of the above methods.

[0229] For example, please refer to Figure 6, which is a structural diagram of a communication device 60 provided in an embodiment of the present application. The communication device 60 includes a processing unit 601 and a transceiver unit 602, for example, implementing the communication method of any embodiment shown in Figure 4.

[0230] It should be understood that the division of the various units in the above device is only a division of logical functions. In actual implementation, they can be fully or partially integrated into a physical entity, or they can be physically separated. In addition, the units in the device can be implemented in the form of a processor calling software; for example, the device includes a processor, the processor is connected to a memory, and the memory stores instructions. The processor calls the instructions stored in the memory to implement any of the above methods or realize the functions of the various units of the device, wherein the processor is, for example, a general-purpose processor, such as a central processing unit (CPU) or a microprocessor, and the memory is a memory within the device or a memory outside the device. Alternatively, the units in the device can be implemented in the form of hardware circuits, and the functions of some or all of the units can be realized by designing the hardware circuits. The hardware circuit can be understood as one or more processors. For example, in one implementation, the hardware circuit is an application-specific integrated circuit (ASIC), which realizes the functions of some or all of the above units by designing the logical relationship of the components in the circuit. For another example, in another implementation, the hardware circuit can be implemented by a programmable logic device (PLD). Taking a field programmable gate array (FPGA) as an example, it can include a large number of logic gate circuits, and the connection relationship between the logic gate circuits is configured by configuring the configuration file, thereby realizing the functions of some or all of the above units. All units of the above devices can be implemented in the form of software called by the processor, or in the form of hardware circuits, or in part by the form of software called by the processor, and the rest by hardware circuits.

[0231] In an embodiment of the present application, a processor is a circuit with the ability to process signals. In one implementation, the processor may be a circuit with the ability to read and execute instructions, such as a central processing unit (CPU), a microprocessor, a graphics processing unit (GPU) (which can be understood as a microprocessor), or a digital signal processor (DSP); in another implementation, the processor may implement certain functions through the logical relationship of a hardware circuit, and the logical relationship of the hardware circuit is fixed or reconfigurable, such as a hardware circuit implemented by an application-specific integrated circuit (ASIC) or a programmable logic device (PLD), such as an FPGA. In a reconfigurable hardware circuit, the process of the processor loading a configuration document to implement the hardware circuit configuration can be understood as the process of the processor loading instructions to implement the functions of some or all of the above units. In addition, it can also be a hardware circuit designed for artificial intelligence, which can be understood as an ASIC, such as a neural network processing unit (NPU), a tensor processing unit (TPU), a deep learning processing unit (DPU), etc.

[0232] It can be seen that each unit in the above device can be one or more processors (or processing circuits) configured to implement the above method, such as: CPU, GPU, NPU, TPU, DPU, microprocessor, DSP, ASIC, FPGA, or a combination of at least two of these processor forms.

[0233] In addition, the various units in the above devices can be fully or partially integrated together, or can be implemented independently. In one implementation, these units are integrated together and implemented in the form of a system-on-a-chip (SOC). The SOC may include at least one processor for implementing any of the above methods or implementing the functions of the various units of the device. The type of the at least one processor can be different, for example, including a CPU and an FPGA, a CPU and an artificial intelligence processor, a CPU and a GPU, etc.

[0234] Regardless of whether these functional modules are subdivided or combined, the general process executed by the device 60 during the communication process is the same. For example, the transceiver unit 602 in the above-mentioned device 60 can also be referred to as a communication unit. Generally, each unit corresponds to its own program code (or program instructions). When the program code corresponding to each unit is executed on the processor, it causes the unit to execute the corresponding process and thus realize the corresponding function. It should be noted that the implementation of each unit described below can correspond to the corresponding description of the embodiment shown in Figure 4.

[0235] In one possible implementation, the communication device 60 may be the first node in the embodiment shown in FIG4 , or a module in the first node, such as a chip or an integrated circuit. The communication device includes a processing unit 601 and a transceiver unit 602, wherein each unit is described as follows:

[0236] The transceiver unit 602 is used to: obtain logical channel information corresponding to preset quality of service QoS parameters, the logical channel information is used to establish a logical transmission channel between a first node and a second node, the second node is a neighbor node of the first node, and the logical transmission channel is used to provide QoS guarantee for the message corresponding to the preset QoS parameters; receive a first message sent by the second node, the first message includes at least one of the following: the Star Flash Network Address SLNA of the second node, the Layer 2 Identifier L2ID of the interface of the second node; based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node, communicate with the second node at the network layer.

[0237] Optionally, the logical channel information includes at least one of the following: a transmission channel identifier TCID and a logical channel identifier LCID.

[0238] Optionally, the transceiver unit 602 is used to communicate with the second node at the network layer based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node, including: the transceiver unit 602 is used to establish a forwarding table based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node; wherein the forwarding table includes at least one of the following items: logical channel information, SLNA of the second node, L2ID of the interface of the second node, and the logical channel information, SLNA of the second node, and L2ID of the interface of the second node correspond one to one.

[0239] Optionally, the forwarding table further includes a link quality level in the sending direction from the first node to the second node, where the link quality level is used to indicate the link quality in the sending direction from the first node to the second node.

[0240] Optionally, the link quality level is included in the first message.

[0241] Optionally, the first message also includes the area address of the second node, the second node is an intermediate node, and the area address of the second node is used to indicate that the area where the second node is located is a level 1 area and / or a level 2 area; wherein the level 2 area is used to connect to the level 1 area.

[0242] Optionally, the level 1 area is a non-backbone area, and the level 2 area is a backbone area.

[0243] Optionally, the regional address of the second node belongs to the address range of the level 1 area, and the regional address of the second node is used to indicate that the area where the second node is located is the level 1 area; the regional address of the second node belongs to the address range of the level 2 area, and the regional address of the second node is used to indicate that the area where the second node is located is the level 2 area; the regional address of the second node belongs to the address range of the level 1 area and the level 2 area, and the regional address of the second node is used to indicate that the area where the second node is located is the overlapping area of ​​the level 1 area and the level 2 area.

[0244] Optionally, the first message is also used to indicate the type of the second node.

[0245] Optionally, the first message includes a first type-length-value TLV field, and the first TLV field includes at least one of the following: an SLNA of the second node and an L2ID of an interface of the second node.

[0246] Optionally, one or more SLNAs of the second node correspond to an L2ID of an interface of the second node.

[0247] Optionally, the first message further includes a second TLV field, and the second TLV field includes a link quality level.

[0248] Optionally, the first message also includes a third TLV field, the third TLV field includes a length field and at least one area address field corresponding to the length field, the length field is used to indicate the total length of at least one area address field, and an area address field is used to indicate an area address of the second node.

[0249] Optionally, the first message further includes a fourth TLV field, where the fourth TLV field is used to indicate an authentication algorithm used by the second node, or the fourth TLV field is used to indicate an authentication algorithm and an authentication key used by the second node.

[0250] Optionally, the first node is an end node and the second node is an intermediate node. The communication device 60 also includes a processing unit 601, which is used to add default routing information to the routing table of the first node. The default routing information includes at least one of the following: a default destination address, an outbound interface of the first node, an L2ID of the interface of the next hop node, and logical channel information; wherein the next hop node is the second node.

[0251] Referring to Figure 7, Figure 7 is a schematic diagram of the structure of a communication device 70 provided in an embodiment of the present application. The device 70 may include at least one memory 701 and at least one processor 702. Optionally, it may also include a bus 703. Further optionally, it may also include a communication interface 704, wherein the memory 701, the processor 702, and the communication interface 704 are connected via the bus 703.

[0252] Memory 701 is used to provide storage space for storing data such as an operating system and computer programs. Memory 701 can be one or a combination of random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), or compact disc read-only memory (CD-ROM).

[0253] The processor 702 is a module that performs arithmetic operations and / or logical operations, and can specifically be one or more combinations of processing modules such as a central processing unit (CPU), a graphics processing unit (GPU), a microprocessor unit (MPU), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), and a complex programmable logic device (CPLD).

[0254] The communication interface 704 is used to receive data sent externally and / or send data externally. It can be a wired link interface such as an Ethernet cable, or a wireless link interface (Wi-Fi, Bluetooth, general wireless transmission, etc.). Optionally, the communication interface 704 can also include a transmitter (such as a radio frequency transmitter, antenna, etc.) or a receiver coupled to the interface.

[0255] The processor 702 in the device 70 is used to read the computer program stored in the memory 701 to execute the aforementioned communication method, such as the communication method described in any embodiment of FIG. 4 .

[0256] In some possible implementations, the communication device 70 may be the first node in the embodiment shown in FIG. 4 , or a module in the first node, such as a chip or an integrated circuit. The processor 702 in the device 70 is configured to read a computer program stored in the memory 701 to perform the following operations:

[0257] Obtain logical channel information corresponding to preset quality of service QoS parameters, where the logical channel information is used to establish a logical transmission channel between a first node and a second node, where the second node is a neighbor node of the first node, and the logical transmission channel is used to provide QoS guarantee for messages corresponding to the preset QoS parameters; receive a first message sent by the second node, where the first message includes at least one of the following: the Star Flash Network Address SLNA of the second node and the Layer 2 Identifier L2ID of the interface of the second node; and communicate with the second node at the network layer based on the logical channel information, the SLNA of the second node and the L2ID of the interface of the second node.

[0258] Optionally, the logical channel information includes at least one of the following: a transmission channel identifier TCID and a logical channel identifier LCID.

[0259] Optionally, the processor 1202 is specifically used to perform the following operations: establish a forwarding table based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node; wherein the forwarding table includes at least one of the following items: the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node, and the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node correspond one to one.

[0260] Optionally, the forwarding table further includes a link quality level in the sending direction from the first node to the second node, where the link quality level is used to indicate the link quality in the sending direction from the first node to the second node.

[0261] Optionally, the link quality level is included in the first message.

[0262] Optionally, the first message also includes the area address of the second node, the second node is an intermediate node, and the area address of the second node is used to indicate that the area where the second node is located is a level 1 area and / or a level 2 area; wherein the level 2 area is used to connect to the level 1 area.

[0263] Optionally, the level 1 area is a non-backbone area, and the level 2 area is a backbone area.

[0264] Optionally, the regional address of the second node belongs to the address range of the level 1 area, and the regional address of the second node is used to indicate that the area where the second node is located is the level 1 area; the regional address of the second node belongs to the address range of the level 2 area, and the regional address of the second node is used to indicate that the area where the second node is located is the level 2 area; the regional address of the second node belongs to the address range of the level 1 area and the level 2 area, and the regional address of the second node is used to indicate that the area where the second node is located is the overlapping area of ​​the level 1 area and the level 2 area.

[0265] Optionally, the first message is also used to indicate the type of the second node.

[0266] Optionally, the first message includes a first type-length-value TLV field, and the first TLV field includes at least one of the following: an SLNA of the second node and an L2ID of an interface of the second node.

[0267] Optionally, one or more SLNAs of the second node correspond to an L2ID of an interface of the second node.

[0268] Optionally, the first message further includes a second TLV field, and the second TLV field includes a link quality level.

[0269] Optionally, the first message also includes a third TLV field, the third TLV field includes a length field and at least one area address field corresponding to the length field, the length field is used to indicate the total length of at least one area address field, and an area address field is used to indicate an area address of the second node.

[0270] Optionally, the first message further includes a fourth TLV field, where the fourth TLV field is used to indicate an authentication algorithm used by the second node, or the fourth TLV field is used to indicate an authentication algorithm and an authentication key used by the second node.

[0271] Optionally, the first node is an end node and the second node is an intermediate node, and the processor 1202 is also used to perform the following operations: add default routing information in the routing table of the first node, the default routing information includes at least one of the following: the default destination address, the outbound interface of the first node, the L2ID of the interface of the next hop node, and the logical channel information; wherein the next hop node is the second node.

[0272] An embodiment of the present application provides a computer storage medium, on which a computer program is stored. When the computer program runs on a computer, the computer executes the method as shown in any one of FIG. 4 .

[0273] An embodiment of the present application provides a chip, which includes a processor and a communication interface. The processor is used to call and run instructions from the communication interface. When the processor executes the instructions, the method shown in any one of Figure 4 is implemented.

[0274] An embodiment of the present application provides a computer program product, which includes a computer program. When the computer program runs on a computer, the computer is enabled to execute the method as shown in any one of FIG. 4 .

[0275] When the computer instruction is loaded and executed on a computer, the process or function described in the embodiment of the present application can be realized in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network or other programmable devices. The computer instruction can be stored in a computer-readable storage medium or transmitted by a 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. Available media can be magnetic media, (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a DVD) or a semiconductor medium (for example, a solid-state drive (SSD)).

[0276] The steps in the method embodiments of the present application can be adjusted in sequence, combined, or deleted according to actual needs.

[0277] The modules in the embodiment of the device of the present application can be merged, divided and deleted according to actual needs.

Claims

1. A communication method, characterized in that: include: A first node obtains logical channel information corresponding to preset quality of service (QoS) parameters, where the logical channel information is used to establish a logical transmission channel between the first node and a second node, where the second node is a neighbor node of the first node, and the logical transmission channel is used to provide QoS guarantee for messages corresponding to the preset QoS parameters; The first node receives a first message sent by the second node, where the first message includes at least one of the following: a Star Flash Network Address (SLNA) of the second node and a Layer 2 Identifier (L2ID) of an interface of the second node; The first node performs network layer communication with the second node based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node.

2. The method according to claim 1, characterized in that The logical channel information includes at least one of the following: a transmission channel identifier TCID and a logical channel identifier LCID.

3. The method according to claim 1 or 2, characterized in that The first node performs network layer communication with the second node based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node, including: The first node establishes a forwarding table based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node; The forwarding table includes at least one of the following: the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node, and the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node are in one-to-one correspondence.

4. The method according to claim 3, characterized in that The forwarding table further includes a link quality level in the sending direction from the first node to the second node, where the link quality level is used to indicate the link quality in the sending direction from the first node to the second node.

5. The method according to claim 4, characterized in that The link quality level is included in the first message.

6. The method according to any one of claims 1 to 5, characterized in that The first message further includes an area address of the second node, where the second node is an intermediate node, and the area address of the second node is used to indicate whether the area where the second node is located is a level 1 area and / or a level 2 area; The level 2 area is used to connect to the level 1 area.

7. The method according to claim 6, characterized in that The level 1 area is a non-backbone area, and the level 2 area is a backbone area.

8. The method according to claim 6 or 7, characterized in that The area address of the second node belongs to the address range of the level 1 area, and the area address of the second node is used to indicate that the area where the second node is located is the level 1 area; The area address of the second node belongs to the address range of the level 2 area, and the area address of the second node is used to indicate that the area where the second node is located is the level 2 area; The area address of the second node belongs to the address range of the level 1 area and the level 2 area, and the area address of the second node is used to indicate that the area where the second node is located is an overlapping area of ​​the level 1 area and the level 2 area.

9. The method according to any one of claims 1 to 8, characterized in that The first message is also used to indicate the type of the second node.

10. The method according to any one of claims 1 to 9, characterized in that: The first message includes a first type-length-value TLV field, and the first TLV field includes at least one of the following: the SLNA of the second node and the L2ID of the interface of the second node.

11. The method according to claim 10, characterized in that The one or more SLNAs of the second node correspond to an L2ID of an interface of the second node.

12. The method according to claim 5 or 10, characterized in that The first message also includes a second TLV field, and the second TLV field includes the link quality level.

13. The method according to claim 6, 10 or 12, characterized in that: The first message also includes a third TLV field, which includes a length field and at least one area address field corresponding to the length field, the length field is used to indicate the total length of the at least one area address field, and an area address field is used to indicate an area address of the second node.

14. The method according to claim 10, 12 or 13, characterized in that The first message further includes a fourth TLV field, where the fourth TLV field is used to indicate the authentication algorithm used by the second node, or the fourth TLV field is used to indicate the authentication algorithm and authentication key used by the second node.

15. The method according to any one of claims 1 to 14, characterized in that: The first node is an end node, the second node is an intermediate node, and the method further includes: The first node adds default routing information to a routing table of the first node, where the default routing information includes at least one of the following: a default destination address, an outbound interface of the first node, an L2ID of an interface of a next-hop node, and the logical channel information; The next hop node is the second node.

16. A communication device, characterized in that: The communication device is a first node, and includes a transceiver unit, wherein the transceiver unit is configured to: Obtaining logical channel information corresponding to preset quality of service (QoS) parameters, where the logical channel information is used to establish a logical transmission channel between the first node and a second node, where the second node is a neighbor node of the first node, and the logical transmission channel is used to provide QoS guarantee for the message corresponding to the preset QoS parameters; receiving a first message sent by the second node, where the first message includes at least one of the following: a Star Flash Network Address (SLNA) of the second node and a Layer 2 Identifier (L2ID) of an interface of the second node; Perform network layer communication with the second node based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node.

17. The device according to claim 16, characterized in that The logical channel information includes at least one of the following: a transmission channel identifier TCID and a logical channel identifier LCID.

18. The device according to claim 16 or 17, characterized in that The transceiver unit is configured to perform network layer communication with the second node based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node, including: The transceiver unit is configured to establish a forwarding table based on the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node; The forwarding table includes at least one of the following: the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node, and the logical channel information, the SLNA of the second node, and the L2ID of the interface of the second node are in one-to-one correspondence.

19. The device according to claim 18, characterized in that The forwarding table further includes a link quality level in the sending direction from the first node to the second node, where the link quality level is used to indicate the link quality in the sending direction from the first node to the second node.

20. The device according to claim 19, characterized in that The link quality level is included in the first message.

21. The device according to any one of claims 16 to 20, characterized in that The first message further includes an area address of the second node, where the second node is an intermediate node, and the area address of the second node is used to indicate whether the area where the second node is located is a level 1 area and / or a level 2 area; The level 2 area is used to connect to the level 1 area.

22. The device according to claim 21, characterized in that The level 1 area is a non-backbone area, and the level 2 area is a backbone area.

23. The device according to claim 21 or 22, characterized in that The area address of the second node belongs to the address range of the level 1 area, and the area address of the second node is used to indicate that the area where the second node is located is the level 1 area; The area address of the second node belongs to the address range of the level 2 area, and the area address of the second node is used to indicate that the area where the second node is located is the level 2 area; The area address of the second node belongs to the address range of the level 1 area and the level 2 area, and the area address of the second node is used to indicate that the area where the second node is located is an overlapping area of ​​the level 1 area and the level 2 area.

24. The device according to any one of claims 16 to 23, characterized in that The first message is also used to indicate the type of the second node.

25. The device according to claim 16, characterized in that The first message includes a first type-length-value TLV field, and the first TLV field includes at least one of the following: the SLNA of the second node and the L2ID of the interface of the second node.

26. The device according to claim 25, characterized in that The one or more SLNAs of the second node correspond to an L2ID of an interface of the second node.

27. The device according to claim 19 or 25, characterized in that The first message also includes a second TLV field, and the second TLV field includes the link quality level.

28. The device according to claim 21, 25 or 27, characterized in that The first message also includes a third TLV field, which includes a length field and at least one area address field corresponding to the length field, the length field is used to indicate the total length of the at least one area address field, and an area address field is used to indicate an area address of the second node.

29. The device according to claim 25, 27 or 28, characterized in that The first message further includes a fourth TLV field, where the fourth TLV field is used to indicate the authentication algorithm used by the second node, or the fourth TLV field is used to indicate the authentication algorithm and authentication key used by the second node.

30. The device according to any one of claims 16 to 29, characterized in that The first node is an end node, the second node is an intermediate node, and the communication device further includes a processing unit, the processing unit being configured to add default routing information to a routing table of the first node, the default routing information including at least one of the following: a default destination address, an outbound interface of the first node, an L2ID of an interface of a next-hop node, and the logical channel information; The next hop node is the second node.

31. A communication device, characterized in that: include: processor and memory; The memory is used to store one or more programs, and the one or more programs include computer-executable instructions. When the device is running, the processor executes the one or more programs stored in the memory to enable the device to perform the method according to any one of claims 1 to 15.

32. A computer storage medium, characterized in that The computer storage medium stores a computer program, and when the computer program is run on a computer, the computer is enabled to execute the method according to any one of claims 1 to 15.

33. A chip, characterized in that: The chip includes a processor and a communication interface, the processor is used to call and run instructions from the communication interface, and when the processor executes the instructions, the method according to any one of claims 1 to 15 is implemented.

Citation Information

Patent Citations

  • Transmission control method and device

    CN111107010A

  • Data packet transmission method based on network service quality and related equipment

    CN113630902A

  • Switching method, storage medium and wireless communication device

    CN114449602A

  • Message transmission method, apparatus and device, and computer readable storage medium

    CN114553699A

  • Information flooding method and equipment

    CN114793208A