Data transmission method and apparatus

By generating broadcast service frames carrying routing request information at the initiating node, the shortcomings of proactive and reactive routing protocols are addressed, achieving data transmission with low resource consumption and low latency.

WO2024245329A1PCT designated stage expired Publication Date: 2024-12-05HUAWEI TECH CO LTD

Patent Information

Application Number
PCT/CN2024/096274
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-05-31
Filing Date
2024-05-30
Publication Date
2024-12-05

AI Technical Summary

Technical Problem

In existing technologies, the use of proactive routing protocols results in high wireless resource overhead, while reactive routing protocols suffer from route establishment delays, leading to longer service data transmission delays.

Method used

By initiating a node to generate a broadcast service frame, routing request information is carried to establish a route in the form of broadcast, while transmitting service data, thereby reducing network resource consumption and waiting latency.

Benefits of technology

This reduces network resource overhead and latency in the transmission of the first packet of service data, thereby improving data transmission efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2024096274_05122024_PF_FP_ABST
    Figure CN2024096274_05122024_PF_FP_ABST
Patent Text Reader

Abstract

Disclosed in the present application are a data transmission method and apparatus. The method comprises: an initiating node generating a broadcast service frame, and broadcasting the broadcast service frame, wherein the broadcast service frame is used for transmitting first service data from the initiating node to a target node in a broadcast form, the broadcast service frame further comprises first information, the first information is used for requesting the establishment of a route from the initiating node to the target node, and the route is used for transmitting second service data from the initiating node to the target node in a non-broadcast form. In this way, a route from an initiating node to a target node is established, and the transmission of first service data is also realized; compared with the method in which a route is established by using a reactive routing protocol, the present application can reduce the waiting delay for the transmission of first-packet service data; and compared with the method in which a route is established by using a first-hop routing protocol, the present application can also reduce the overheads of network resources.
Need to check novelty before this filing date? Find Prior Art

Description

Data transmission method and device

[0001] This application claims priority to the Chinese patent application filed with the China National Intellectual Property Administration on May 31, 2023, with application number 202310639149.3 and application name “A Data Transmission Method and Device”, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of communications, and in particular to a data transmission method and device. Background Art

[0003] When using proactive routing protocols to establish routes, routing nodes need to periodically send control messages to maintain their local routing tables, resulting in high wireless resource consumption and rapid power loss for routing nodes. Reactive routing protocols, on the other hand, introduce delays in route establishment, leading to longer latency periods for service data transmission.

[0004] Therefore, how to ensure that data transmission between nodes in the network consumes less network resources and has low transmission delay of business data is a technical problem that needs to be solved urgently.

[0005] Summary of the Invention

[0006] The present application discloses a data transmission method and device, which can reduce the overhead of network resources and reduce the waiting delay of the first packet business data transmission.

[0007] In a first aspect, the present application provides a data transmission method, which is applied to an initiating node, and the method includes: generating a broadcast service frame, wherein the broadcast service frame is used to transmit first service data from the initiating node to the target node in a broadcast form, and the broadcast service frame also includes first information, and the first information is used to request the establishment of a route from the initiating node to the target node, and the route is used to transmit second service data from the initiating node to the target node in a non-broadcast form; broadcasting the broadcast service frame.

[0008] Here, the initiating node can be a network device with routing and forwarding capabilities, such as a wireless router, a wireless access point (AP), etc., or a component within the network device, such as a single board, a line card, a chip, etc. The initiating node can also be a terminal device with routing and forwarding capabilities, such as a smart home device (such as a television, a sweeping robot, a smart desk lamp, a sound system, a smart lighting system, an appliance control system, home background music, a home theater system, an intercom system, a video surveillance system, etc.), an intelligent transportation device (such as a car, a ship, a drone, a train, a van, a truck, etc.), an intelligent manufacturing device (such as a robot, an industrial equipment, intelligent logistics, an intelligent factory, etc.), a user device (a mobile phone, a computer, a tablet computer, a PDA, a desktop computer, a headset, a speaker, a wearable device, an in-vehicle device, a virtual reality device, an augmented reality device, etc.), or a component within the terminal device (such as a chip or an integrated circuit).

[0009] Here, the initiating node can be understood as the starting node of route discovery, and the target node is the end node of route discovery; or, the initiating node is the starting sending node of the service data or the broadcast service frame carrying the service data and the first information, and the target node is the final processing node of the service data or the broadcast service frame.

[0010] Exemplarily, the first information may also be referred to as routing request information.

[0011] In this application, routing can also be understood as path.

[0012] Exemplarily, the method is applied to an initiating node, and the method can also be described as: generating a broadcast service frame, the broadcast service frame including first information and first service data, the first information being used to request establishment of a route from the initiating node to the target node, and the route being used to transmit the second service data from the initiating node to the target node; broadcasting the broadcast service frame.

[0013] In the above method, the initiating node starts route discovery based on the transmission of business data, that is, the route is established by broadcasting business frames carrying route request information and business data in a broadcast flooding manner. While establishing the route, the transmission of business data can also be achieved. Compared with the use of reactive routing protocols to establish routes, the transmission waiting delay of the first packet of business data can be reduced; compared with the use of proactive routing protocols to establish routes, there is no need to establish routes when there is no business data to be sent, and there is no need to regularly send routing control messages to maintain the routing table. This not only saves the power consumption of network equipment, but also greatly reduces the overhead of network resources.

[0014] Optionally, the method further includes: receiving a routing response frame, the routing response frame including second information, the second information being used to indicate that a route from the initiating node to the target node has been established and for indicating the route; and sending the second service data according to the route.

[0015] Here, the second information is used to indicate the route from the initiating node to the target node. The second information may indicate the route by recording the number of hops and the cost of the route from the initiating node to the target node, or by recording each node through which the route from the initiating node to the target node passes. The second information may also indicate the route by recording the next hop node on the route of the current sender of the route response frame, or the second information may indicate the route in other ways, which are not specifically limited here. The initiating node can achieve addressing of the initiating node on the route based on the route response frame, and the way in which the second information indicates the route is not limited.

[0016] Exemplarily, sending the second service data according to the route includes: determining a next hop node of the initiating node on the route according to the route; and sending the second service data to the next hop node of the initiating node.

[0017] Here, the routing response frame is received by the initiating node from its neighboring node.

[0018] Exemplarily, the second service data is sent in a non-broadcast form (eg, unicast or multicast).

[0019] Here, the initiating node receives the routing response frame. The so-called established routing can be understood as: the routing can realize the sending of the second business data from the initiating node to the target node, which also means that each node in the routing path from the initiating node to the target node has completed the establishment of a reverse routing table locally, and when the routing response frame is transmitted from the target node to the initiating node, each node in the path has established a forward routing table locally. The forward routing table can guide the local node to send business data.

[0020] Exemplarily, the second information may also be referred to as routing response information.

[0021] It can be understood that the broadcast of the broadcast service frame can realize the establishment of reverse routing. Reverse routing refers to the route from the target node to the initiating node. Reverse routing enables the routing response frame to be sent back from the target node to the initiating node, thereby realizing the establishment of forward routing. Forward routing refers to the route from the initiating node to the target node. Forward routing can be used to transmit the second service data from the initiating node to the target node.

[0022] By implementing the above implementation method, the initiating node can know that the route from the initiating node to the target node has been established through the received route response frame, and can subsequently realize the transmission of the second service data along the established route in a non-broadcast form (such as unicast or multicast). In this way, compared with the flooding transmission of service data, the number of times the service data is sent or forwarded by the nodes in the network can be reduced, thereby reducing the power consumption of the nodes in the network and the wireless communication resource overhead.

[0023] Optionally, the route response frame includes a first route response frame and a second route response frame, the first route response frame is used to indicate that a first route from the initiating node to the target node has been established and is used to indicate the first route, and the second route response frame is used to indicate that a second route from the initiating node to the target node has been established and is used to indicate the second route; sending the second business data through the route includes: sending the second business data through at least one of the first route and the second route.

[0024] Here, the initiating node receives multiple route response frames (i.e., a first route response frame and a second route response frame), which means that multiple routes have been established from the initiating node to the target node, and each of the multiple routes corresponds to a route response frame in the multiple route response frames. It is understood that the sequence number of the second information in the multiple route response frames is the same as the sequence number of the first information in the broadcast service frame, and the second information in different route response frames has different values ​​for the path hop count field and / or different values ​​for the path cost field. Here, the path hop count field and the path cost field can be found in the description of the corresponding content below and will not be repeated here.

[0025] Here, the first route is different from the second route, which is manifested in that the number of hops of the first route is different from the number of hops of the second route and / or the cost of the first route is different from the cost of the second route.

[0026] Here, the cost of a route from the initiating node to the target node refers to the sum of the costs of each link in the route from the initiating node to the target node. This route cost measures the cost of reaching the target node from the initiating node. When multiple routes exist from the initiating node to the target node, the route with the lowest route cost is considered the optimal route from the initiating node to the target node. Here, the route cost can also be referred to as the path cost.

[0027] Link overhead is a link metric. For example, link overhead can be the link's power consumption, transmission delay, or packet loss rate. In another implementation, link overhead can also be determined based on at least one of the link's power consumption, transmission delay, or packet loss rate.

[0028] Exemplarily, sending the second service data through at least one of the first route and the second route may be any one of the following methods:

[0029] Method 1: Send the second service data through the first route. In this case, the second route can serve as a backup or redundant route for the first route. For example, if the first route fails, the second service data can be sent from the first route to the second route, thus improving the reliability of data transmission.

[0030] Method 2: Send the second service data via the second route. In this case, the first route can serve as a backup or redundant route for the second route. For example, if the second route fails, the second service data can be sent from the second route to the first route, thereby improving the reliability of data transmission.

[0031] Method 3: Send the second service data through the first and second routes. In this case, even if one of the first and second routes fails, the second service data can still be transmitted to the target node through the remaining route, achieving redundant data transmission and improving data transmission reliability.

[0032] Optionally, the broadcast service frame includes an extension field, and the first information is carried in the extension field in the broadcast service frame.

[0033] In this case, the broadcast service frame is encapsulated in the format of the basic service layer basic frame. For example, in the Star Flash wireless communication system, the basic service layer is composed of several functional units. The Star Flash wireless communication system can support upper-layer application functions and system management and maintenance by calling different functional units.

[0034] The basic service layer basic frame is a basic service layer protocol data unit (PDU) transmitted in a transmission channel, wherein the transmission mode of the transmission channel is a basic mode.

[0035] Here, a transmission channel is the basic path for transmission at the basic service layer, and the transmission process is based on this transmission channel. A transmission channel can be mapped to a logical link at the Star Flash access layer. This mapping can be one-to-one, many-to-one, or one-to-many. A transmission mode is a series of data processing methods performed by the basic service layer during transmission, including packet splitting, packet aggregation, acknowledgment, and retransmission. Each transmission channel uses a transmission mode for transmission.

[0036] Optionally, the broadcast service frame includes a network layer broadcast protocol message, the network layer broadcast protocol message includes a routing request message header, and the first information is carried in the routing request message header.

[0037] Optionally, the network layer broadcast protocol message also includes a network layer message header and a network layer broadcast protocol message header, wherein the network layer message header indicates that the message header of the next layer message is the network layer broadcast protocol message header, and the network layer broadcast protocol message header indicates that the message header of the next layer message is the routing request message header.

[0038] The implementation of the above-mentioned implementation manner provides multiple references for the carrying form of the first information in the broadcast service frame.

[0039] Optionally, the first information includes at least one of the following fields:

[0040] A type field, where the type field is used to indicate that the type of the first information is a routing request;

[0041] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the first information determined by the initiating node;

[0042] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0043] A target node address field, wherein the target node address field is used to indicate the network address of the target node;

[0044] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0045] a forwarding hop number field, the forwarding hop number field being used to indicate the number of hops required for the first information to travel from the initiating node to the current sender of the first information; and

[0046] A link overhead field is used to indicate the total overhead of the link that the first information passes through from the initiating node to the current sender of the first information.

[0047] Here, the above-mentioned type field, message sequence number field, initiating node address field, target node address field and path identification field are determined by the initiating node.

[0048] For example, when the initiating node generates the first message, the forwarding hop count field is set to 0 and the link cost field is set to 0. The value of the forwarding hop count field in the first message will increase by 1 for each node as the forwarding node broadcasts the message during the route discovery process from the initiating node to the target node. Accordingly, the value of the link cost field in the first message will also change as the value of the forwarding hop count field changes. However, the values ​​of the type field, message sequence number field, initiating node address field, target node address field, and path identifier field in the first message remain unchanged during the route discovery process.

[0049] For example, for the above-mentioned path identifier field, there may be multiple paths (or routes) between the same initiating node and the same target node, and these multiple paths may share the same path identifier.

[0050] Optionally, the route response frame includes an extension field, and the second information is carried in the extension field in the route response frame.

[0051] In this case, the routing response frame is encapsulated in the format of the basic service layer basic frame. The basic service layer and the basic service layer basic frame can be referred to the description of the corresponding content above, which will not be repeated here.

[0052] Optionally, the routing response frame includes a first network layer unicast message, the first network layer unicast message includes a routing response message header, and the second information is carried in the routing response message header.

[0053] Optionally, the first network layer unicast message further includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing response message header.

[0054] The implementation of the above-mentioned implementation manner provides multiple references for the carrying form of the second information in the routing response frame.

[0055] Optionally, the second information includes at least one of the following fields:

[0056] a type field, where the type field is used to indicate that the type of the second information is a routing response;

[0057] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the second information determined by the target node;

[0058] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0059] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0060] A path hop count field, the path hop count field being used to indicate the number of hops in the path from the initiating node to the target node; and

[0061] A path cost field, where the path cost field is used to indicate the cost of the path from the initiating node to the target node.

[0062] For example, the second information indicates the route from the initiating node to the destination node through the path identifier field and the path hop count field. It can be seen that if there are multiple routes from the initiating node to the destination node, the path hop count field and the path cost field can be used to distinguish different routes from the initiating node to the destination node.

[0063] Optionally, the method also includes: receiving a routing fault frame from the first node, the routing fault frame including third information, the third information being used to indicate that the route from the initiating node to the target node is faulty; and according to the routing fault frame, deleting the route in the routing table that leads to the target node and whose next hop node of the initiating node is the first node.

[0064] Exemplarily, the third information may also be referred to as routing failure information.

[0065] Here, the failure may be, for example, a link failure or a node failure.

[0066] Here, the first node is the neighbor node of the initiating node.

[0067] Exemplarily, the local routing table of the initiating node is used to record a set of routes from the initiating node to the target node. The routing table can be used by the initiating node to send the second service data to the next hop node of the initiating node leading to the target node.

[0068] Exemplarily, the routing table records the route from the initiating node to the target node, which can also be understood as the routing table storing the route from the initiating node to the target node. The routing table stores the route from the initiating node to the target node. For example, it can store the next hop node of the initiating node on the route. In addition, it can also store the number of hops of the route and the cost of the route. In some possible implementations, relevant information of each node along the route (such as network address, identification, etc.) can also be stored. It can be understood that the initiating node can implement the addressing of the initiating node on the first route through the routing table, and there is no specific limitation on the storage form of the first route in the routing table.

[0069] As an example, the local routing table of the initiating node can be used to record the correspondence between the identifier of the path from the initiating node to the target node, the network address of the target node, the network address of the next hop node of the initiating node, the number of hops of the first path from the initiating node to the target node, and the cost of the first path. Here, the local routing table of the initiating node is not limited to recording the correspondence between the identifier of the path from the initiating node to the target node, the network address of the target node, the network address of the next hop node of the initiating node, the number of hops of the first path from the initiating node to the target node, and the cost of the first path. This routing table enables the initiating node to determine the next hop node of the initiating node leading to the target node based on the network address of a given target node, and does not limit the specific form of the local routing table of the initiating node.

[0070] By implementing the above implementation method, the initiating node can know that the route from the initiating node to the target node is faulty through the routing fault frame. Based on the routing fault frame, the local routing table can be updated in time to delete the route that has become invalid due to the fault, so that the initiating node can accurately handle the fault.

[0071] Optionally, the routing failure frame includes an extension field, and the third information is carried in the extension field in the routing failure frame.

[0072] In this case, the routing fault frame is encapsulated in the format of the basic service layer basic frame. The basic service layer and the basic service layer basic frame can be referred to the description of the corresponding content above, which will not be repeated here.

[0073] Optionally, the routing fault frame includes a second network layer unicast message, the second network layer unicast message includes a routing fault message header, and the third information is carried in the routing fault message header.

[0074] Optionally, the second network layer unicast message further includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing fault message header.

[0075] The implementation of the above-mentioned implementation provides multiple references for the carrying form of the third information in the routing fault frame.

[0076] Optionally, the third information includes at least one of the following fields:

[0077] a type field, where the type field is used to indicate that the type of the third information is a routing failure;

[0078] A first field, the first field being used for the number of target nodes affected by the fault in the network;

[0079] a second field for indicating a network address of a target node affected by the failure; and

[0080] The third field is used to indicate an identifier of a path where a target node affected by the fault is located.

[0081] By implementing the above implementation, the initiating node can at least know the target node affected by the fault through the third information, and thus can effectively deal with the fault.

[0082] In second aspect, the present application provides a data transmission method, which is applied to a first node, and the method includes: receiving a first broadcast service frame, the first broadcast service frame is used to transmit first service data from an initiating node to a target node in a broadcast form, and the target node is not the first node, the first broadcast service frame also includes first information, the first information is used to request to establish a route from the initiating node to the target node, and the route is used to transmit second service data from the initiating node to the target node in a non-broadcast form; generating a second broadcast service frame based on the first broadcast service frame; and broadcasting the second broadcast service frame.

[0083] Here, the first node is a forwarding node in the process of route discovery from the initiating node to the target node.

[0084] Illustratively, the first node may be a network device with routing and forwarding capabilities, such as a wireless router, a wireless access point (AP), etc., or a component within the network device, such as a single board, a line card, a chip, etc. The first node may also be a terminal device with routing and forwarding capabilities, such as a smart home device (such as a television, a sweeping robot, a smart desk lamp, a sound system, a smart lighting system, an appliance control system, home background music, a home theater system, an intercom system, a video surveillance system, etc.), an intelligent transportation device (such as a car, a ship, a drone, a train, a van, a truck, etc.), an intelligent manufacturing device (such as a robot, an industrial equipment, intelligent logistics, an intelligent factory, etc.), a user device (a mobile phone, a computer, a tablet computer, a PDA, a desktop computer, a headset, a speaker, a wearable device, an in-vehicle device, a virtual reality device, an augmented reality device, etc.), or a component within the terminal device (such as a chip or an integrated circuit).

[0085] Exemplarily, the first information may also be referred to as routing request information.

[0086] In one implementation, in order to avoid repeated processing of the first information by the forwarding node, the second broadcast service frame is broadcasted, which can be: when the sequence number of the first information in the first broadcast service frame is greater than the sequence number of the first information in the historical record in the local message cache table, the second broadcast service frame is broadcasted.

[0087] Here, the message cache table is used to record the routing request information received in the past. The message cache table is used by the local node to determine whether it has processed the routing request information received this time, so as to avoid the same node from repeatedly processing the routing request information with the same sequence number.

[0088] As an example, the local message cache table of the first node is used to record the correspondence between the sequence number of the first information, the network address of the target node, the network address of the initiating node, the total number of hops from the initiating node to the first node, and the total overhead of the link from the initiating node to the first node.

[0089] For example, if the first node has not received the first information in the past or the local message cache table has been cleared, it can be considered that the sequence number of the historical routing request information recorded in the message cache table is 0.

[0090] In the above method, during the route discovery process, if a forwarding node receives a broadcast service frame carrying service data and route request information, it will continue to broadcast the broadcast service frame carrying the service data and updated route request information, thereby simultaneously establishing the route and transmitting the service data. Compared to using a reactive routing protocol to establish a route, this method can reduce the waiting delay for the first packet of service data transmission; compared to using a proactive routing protocol to establish a route, local nodes do not need to regularly send routing control messages to maintain the routing table, which not only saves power consumption of network equipment but also significantly reduces network resource overhead.

[0091] Optionally, the method also includes: determining the previous hop node of the first node on the first route from the first node to the initiating node based on the first broadcast service frame; receiving a first route response frame, the first route response frame including second information, the second information being used to indicate that the route from the initiating node to the target node has been established and to indicate the route; sending a second route response frame to the previous hop node of the first node, the second route response frame being generated based on the first route response frame.

[0092] Exemplarily, the second information may also be referred to as routing response information.

[0093] For example, assume that the route from the initiating node to the target node is expressed as S->A->B->D, where node S is the initiating node and node D is the target node. Assuming that node B is the first node, the previous hop node of the first node on the first route from the first node to the initiating node is node A.

[0094] Exemplarily, the second routing response frame is generated based on the first routing response frame, which means that: compared with the first routing response frame, the transmission channel identifier, logical channel identifier and sender's layer 2 identifier in the second routing response frame are all associated with the first node. In this way, the receiver of the second routing response frame identifies that the sender of the second routing response frame is the first node based on at least one of the transmission channel identifier, logical channel identifier and sender's layer 2 identifier in the second routing response frame.

[0095] When the above implementation method is implemented, when the first node receives the first route response frame, the first node sends a second route response frame to the previous hop node of the first node on the first route from the first node to the initiating node, thereby realizing the transmission of the route response frame to the initiating node along the reverse route in the form of unicast, which can reduce the overhead of network resources.

[0096] Optionally, the method also includes: receiving a first routing response frame, the first routing response frame including second information, the second information being used to indicate that the route from the initiating node to the target node has been established and to indicate the route; determining, based on the first routing response frame, the next hop node of the first node on the second route from the first node to the target node; receiving second service data; and sending the second service data to the next hop node of the first node.

[0097] For example, assume that the route from the initiating node to the target node is expressed as S->A->B->D, where node S is the initiating node and node D is the target node. Assuming that node A is the first node, the next hop node of the first node on the second route from the first node to the target node is node B.

[0098] By implementing the above-mentioned implementation method, after the first node receives the second service data, the first node sends the second service data to the next-hop node of the first node on the second route from the first node to the target node, thereby realizing the transmission of the second service data to the target node along the forward route. In this way, the second service data is transmitted in a non-broadcast form. Compared with the flooding transmission of service data, the number of times the service data is sent or forwarded by nodes in the network can be reduced, thereby reducing the power consumption of nodes in the network and the wireless communication resource overhead.

[0099] Optionally, the method also includes: determining that a first link from the first node to the second node has a fault, wherein the second node is the next hop node of the first node on the second route; if the next hop nodes of the first node in the routes recorded in the routing table are all the second nodes, generating and sending a first route fault frame, the first route fault frame includes third information, and the third information is used to indicate that the route from the initiating node to the target node has a fault.

[0100] Exemplarily, the third information may also be referred to as routing failure information.

[0101] Exemplarily, sending the first routing fault frame includes: sending the first routing fault frame to a previous-hop node of the first node on a route from the first node to the initiating node.

[0102] Exemplarily, the local routing table of the first node is used to record a set of routes from the first node to the target node. Here, the local routing table of the first node can be used by the first node to send subsequently received second service data to the next hop node of the first node leading to the target node.

[0103] As an example, the local routing table of the first node is used to record the identifier of the path from the initiating node to the target node, the network address of the target node, the network address of the next hop node of the first node, the number of hops from the first node to the target node on the first path from the initiating node to the target node, and the correspondence between the overhead from the first node to the target node on the first path.

[0104] Here, the local routing table of the first node is not limited to recording only the identifier of the path from the initiating node to the target node, the network address of the target node, the network address of the next hop node of the first node, the number of hops from the first node to the target node on the first path from the initiating node to the target node, and the cost of the first node to the target node on the first path. The routing table only needs to enable the first node to determine the next hop node of the first node leading to the target node based on the network address of a given target node, and the specific form of the local routing table of the first node is not limited.

[0105] It can be understood that when the first node determines that the first link from the first node to the second node fails, the first node can determine that the route in the local routing table where the next hop node of the first node is the second node is invalid (or unusable). In this case, the first node can, for example, delete the invalid route in the routing table or mark it as unusable.

[0106] For example, deleting an invalid route from the routing table requires that the first node delete the route whose next hop is the second node from the routing table. Assuming the routing table includes Route 1, which leads to Node E and whose next hop is the second node, and Route 2, which leads to Node D and whose next hop is the second node, deleting the route whose next hop is the second node from the routing table means deleting both Route 1 and Route 2 from the routing table.

[0107] When the above-mentioned implementation method is implemented, when the first node detects that the link on which it is located has a fault, when the next-hop node of the first node in the route recorded in the local routing table has no other node except the second node, the first node can send a routing fault frame to the upstream node of the first node along the reverse route, so that the upstream node of the first node can perform fault path switching or rebuild the route in time.

[0108] Optionally, the method also includes: receiving a second routing fault frame from a third node, the second routing fault frame being used to indicate that the route from the initiating node to the target node is faulty; the third node being the next-hop node of the first node on the route from the first node to the target node; based on the second routing fault frame, when the next-hop node of the first node in the route to the target node recorded in the routing table is all the third node, sending a third routing fault frame, the third routing fault frame being used to indicate that the route from the initiating node to the target node is faulty.

[0109] It can be understood that the first node receives the second routing failure frame from the third node, and the first node determines based on the second routing failure frame that the route in the local routing table leading to the target node and the next hop node of the first node is the third node is invalid (or unusable). In this case, the first node can, for example, delete the invalid route in the routing table or mark it as unusable.

[0110] Taking the example of deleting invalid routes from the routing table, the first node needs to delete from the routing table the routes that lead to the target node and whose next hop node is the second node. Assume that the routing table includes Route 1, which leads to Node E and whose next hop node is the second node, and Route 2, which leads to Node D and whose next hop node is the second node. If the target node is Node D, then deleting the routes that lead to the target node and whose next hop node is the second node from the routing table means that only Route 2 is deleted from the routing table.

[0111] Exemplarily, the third routing failure frame is generated based on the second routing failure frame. Compared to the second routing failure frame, the transmission channel identifier, logical channel identifier, and sender's layer 2 identifier in the third routing failure frame are all associated with the first node. Thus, a receiver of the third routing failure frame identifies the sender of the third routing failure frame as the first node based on at least one of the transmission channel identifier, logical channel identifier, and sender's layer 2 identifier in the third routing failure frame.

[0112] By implementing the above implementation method, when the first node receives a routing fault frame from a neighboring node, when the local routing table records that the next hop node of the first node in the route to the target node has no other node except the third node, the first node can send a routing fault frame to the upstream node of the first node along the reverse route, so that the upstream node of the first node can perform fault path switching or rebuild the route in time.

[0113] The beneficial effects of the technical features of the second aspect described below can be referred to the description of the beneficial effects of the corresponding technical features in the first aspect described above, and will not be repeated here.

[0114] Optionally, the first broadcast service frame includes an extension field, and the first information is carried in the extension field in the first broadcast service frame.

[0115] Optionally, the first broadcast service frame includes a network layer broadcast protocol message, the network layer broadcast protocol message includes a routing request message header, and the first information is carried in the routing request message header.

[0116] Optionally, the network layer broadcast protocol message also includes a network layer message header and a network layer broadcast protocol message header, the network layer message header indicates that the message header of the next layer message is the network layer broadcast protocol message header, and the network layer broadcast protocol message header indicates that the message header of the next layer message is the routing request message header.

[0117] Optionally, the first information includes at least one of the following fields:

[0118] A type field, where the type field is used to indicate that the type of the first information is a routing request;

[0119] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the first information determined by the initiating node;

[0120] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0121] A target node address field, wherein the target node address field is used to indicate the network address of the target node;

[0122] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0123] a forwarding hop number field, the forwarding hop number field being used to indicate the number of hops required for the first information to travel from the initiating node to the current sender of the first information; and

[0124] A link overhead field is used to indicate the total overhead of the link that the first information passes through from the initiating node to the current sender of the first information.

[0125] Optionally, the first route response frame includes an extension field, and the second information is carried in the extension field in the first route response frame.

[0126] Optionally, the first routing response frame includes a first network layer unicast message, the first network layer unicast message includes a routing response message header, and the second information is carried in the routing response message header.

[0127] Optionally, the first network layer unicast message further includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing response message header.

[0128] Optionally, the second information includes at least one of the following fields:

[0129] a type field, where the type field is used to indicate that the type of the second information is a routing response;

[0130] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the second information determined by the target node;

[0131] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0132] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0133] A path hop count field, the path hop count field being used to indicate the number of hops in the path from the initiating node to the target node; and

[0134] A path cost field, where the path cost field is used to indicate the cost of the path from the initiating node to the target node.

[0135] Optionally, the first routing failure frame includes an extension field, and the third information is carried in the extension field in the first routing failure frame.

[0136] Optionally, the first routing fault frame includes a second network layer unicast message, the second network layer unicast message includes a routing fault message header, and the third information is carried in the routing fault message header.

[0137] Optionally, the second network layer unicast message further includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing fault message header.

[0138] Optionally, the third information includes at least one of the following fields:

[0139] a type field, where the type field is used to indicate that the type of the third information is a routing failure;

[0140] A first field, the first field being used for the number of target nodes affected by the fault in the network;

[0141] a second field for indicating a network address of a target node affected by the failure; and

[0142] The third field is used to indicate an identifier of a path where a target node affected by the fault is located.

[0143] In a third aspect, the present application provides a data transmission method, which is applied to a target node, and the method includes: receiving a broadcast service frame, wherein the broadcast service frame is used to transmit first service data from an initiating node to the target node in a broadcast form, and the broadcast service frame also includes first information, and the first information is used to request the establishment of a route from the initiating node to the target node, and the route is used to transmit second service data from the initiating node to the target node in a non-broadcast form; sending a route response frame based on the broadcast service frame, and the route response frame includes second information, and the second information is used to indicate that the route from the initiating node to the target node has been established and to indicate the route.

[0144] Exemplarily, the target node is the application party or final processing node of the service data (eg, first service data or second service data), and the target node is also the end node of route discovery, ie, the final processing node of the broadcast service frame.

[0145] Here, the target node can be a network device with routing and forwarding capabilities, such as a wireless router, a wireless access point (AP), etc., or a component within the network device, such as a single board, a line card, a chip, etc. The target node can also be a terminal device with routing and forwarding capabilities, such as a smart home device (such as a television, a robot vacuum, a smart desk lamp, a sound system, a smart lighting system, an appliance control system, a home background music system, a home theater system, an intercom system, a video surveillance system, etc.), an intelligent transportation device (such as a car, a ship, a drone, a train, a van, a truck, etc.), an intelligent manufacturing device (such as a robot, an industrial equipment, an intelligent logistics system, an intelligent factory, etc.), a user device (a mobile phone, a computer, a tablet computer, a PDA, a desktop computer, a headset, a speaker, a wearable device, an in-vehicle device, a virtual reality device, an augmented reality device, etc.), or a component within the terminal device (such as a chip or an integrated circuit).

[0146] In the above method, during the route discovery process from the initiating node to the target node, if the target node receives a broadcast service frame, it will send a route response frame in response to the broadcast service frame. The route response frame will be sent back to the initiating node along the reverse route (i.e., the route from the target node to the initiating node) to inform the initiating node that the route from the initiating node to the target node has been established. In this way, compared to using a reactive routing protocol to establish a route, the waiting delay for the first packet of service data transmission can be reduced; compared to using a proactive routing protocol to establish a route, the local node does not need to regularly send routing control messages to maintain the routing table, which not only saves energy consumption of network equipment, but also greatly reduces the overhead of network resources.

[0147] Optionally, the method further includes: acquiring the first service data from the broadcast service frame.

[0148] By implementing the above implementation method, a broadcast service frame carrying the service data and routing request information is transmitted in the form of broadcast, and while establishing the route, the transmission of the first service data is also realized, thereby reducing the waiting delay of the first packet service data transmission.

[0149] Optionally, the broadcast service frame includes a first broadcast service frame and a second broadcast service frame, the first broadcast service frame comes from a first node, the second broadcast service frame comes from a second node, and the first node and the second node are neighbor nodes of the target node; sending a route response frame based on the broadcast service frame includes: sending a first route response frame to the first node based on the first broadcast service frame, and sending a second route response frame to the second node based on the second broadcast service frame; wherein, the second information in the first route response frame is used to indicate that a first route from the initiating node to the target node has been established and is used to indicate the first route, and the second information in the second route response frame is used to indicate that a second route from the initiating node to the target node has been established and is used to indicate the second route, the first route passes through the first node, and the second route passes through the second node.

[0150] Here, the first route is different from the second route, which is manifested in that: the number of hops of the first route is different from the number of hops of the second route and / or the cost of the first route is different from the cost of the second route. Here, the cost of the route can be referred to the description of the corresponding content in the first aspect above, and will not be repeated here.

[0151] Here, the first node and the second node may be the same node or different nodes, which is not specifically limited here.

[0152] By implementing the above implementation method, the target node can respond to the received multiple broadcast service frames to establish multiple routes from the initiating node to the target node, which can realize redundant transmission of service data (such as second service data) and is conducive to improving the reliability of data transmission.

[0153] The beneficial effects of the technical features of the following third aspect can refer to the description of the beneficial effects of the corresponding technical features in the above-mentioned first aspect, and will not be repeated here.

[0154] Optionally, the broadcast service frame includes an extension field, and the first information is carried in the extension field in the broadcast service frame.

[0155] Optionally, the broadcast service frame includes a network layer broadcast protocol message, the network layer broadcast protocol message includes a routing request message header, and the first information is carried in the routing request message header.

[0156] Optionally, the network layer broadcast protocol message also includes a network layer message header and a network layer broadcast protocol message header, the network layer message header indicates that the message header of the next layer message is the network layer broadcast protocol message header, and the network layer broadcast protocol message header indicates that the message header of the next layer message is the routing request message header.

[0157] Optionally, the first information includes at least one of the following fields:

[0158] A type field, where the type field is used to indicate that the type of the first information is a routing request;

[0159] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the first information determined by the initiating node;

[0160] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0161] A target node address field, wherein the target node address field is used to indicate the network address of the target node;

[0162] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0163] a forwarding hop number field, the forwarding hop number field being used to indicate the number of hops required for the first information to travel from the initiating node to the current sender of the first information; and

[0164] A link overhead field is used to indicate the total overhead of the link that the first information passes through from the initiating node to the current sender of the first information.

[0165] Optionally, the route response frame includes an extension field, and the second information is carried in the extension field in the route response frame.

[0166] Optionally, the routing response frame includes a first network layer unicast message, the first network layer unicast message includes a routing response message header, and the second information is carried in the routing response message header.

[0167] Optionally, the first network layer unicast message further includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing response message header.

[0168] Optionally, the second information includes at least one of the following fields:

[0169] a type field, where the type field is used to indicate that the type of the second information is a routing response;

[0170] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the second information determined by the target node;

[0171] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0172] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0173] A path hop count field, the path hop count field being used to indicate the number of hops in the path from the initiating node to the target node; and

[0174] A path cost field, where the path cost field is used to indicate the cost of the path from the initiating node to the target node.

[0175] In a fourth aspect, the present application provides a data transmission device, which is an initiating node or is included in the initiating node, and the device includes: a generating unit for generating a broadcast service frame, wherein the broadcast service frame is used to transmit the first service data from the initiating node to the target node in a broadcast form, and the broadcast service frame also includes first information, and the first information is used to request the establishment of a route from the initiating node to the target node, and the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form; a sending unit for broadcasting the broadcast service frame.

[0176] Optionally, the receiving unit is further used to: receive a routing response frame, the routing response frame including second information, the second information being used to indicate that a route from the initiating node to the target node has been established and to indicate the route; the sending unit is further used to: send the second service data through the route.

[0177] Optionally, the route response frame includes a first route response frame and a second route response frame, the first route response frame is used to indicate that a first route from the initiating node to the target node has been established and is used to indicate the first route, and the second route response frame is used to indicate that a second route from the initiating node to the target node has been established and is used to indicate the second route; the sending unit is specifically used to: send the second business data through at least one of the first route and the second route.

[0178] Optionally, the broadcast service frame includes an extension field, and the first information is carried in the extension field in the broadcast service frame.

[0179] Optionally, the broadcast service frame includes a network layer broadcast protocol message, the network layer broadcast protocol message includes a routing request message header, and the first information is carried in the routing request message header.

[0180] Optionally, the network layer broadcast protocol message also includes a network layer message header and a network layer broadcast protocol message header, the network layer message header indicates that the message header of the next layer message is the network layer broadcast protocol message header, and the network layer broadcast protocol message header indicates that the message header of the next layer message is the routing request message header.

[0181] Optionally, the first information includes at least one of the following fields:

[0182] A type field, where the type field is used to indicate that the type of the first information is a routing request;

[0183] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the first information determined by the initiating node;

[0184] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0185] A target node address field, wherein the target node address field is used to indicate the network address of the target node;

[0186] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0187] a forwarding hop number field, the forwarding hop number field being used to indicate the number of hops required for the first information to travel from the initiating node to the current sender of the first information; and

[0188] A link overhead field is used to indicate the total overhead of the link that the first information passes through from the initiating node to the current sender of the first information.

[0189] Optionally, the route response frame includes an extension field, and the second information is carried in the extension field in the route response frame.

[0190] Optionally, the routing response frame includes a first network layer unicast message, the first network layer unicast message includes a routing response message header, and the second information is carried in the routing response message header.

[0191] Optionally, the first network layer unicast message further includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing response message header.

[0192] Optionally, the second information includes at least one of the following fields:

[0193] a type field, where the type field is used to indicate that the type of the second information is a routing response;

[0194] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the second information determined by the target node;

[0195] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0196] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0197] A path hop count field, the path hop count field being used to indicate the number of hops in the path from the initiating node to the target node; and

[0198] A path cost field, where the path cost field is used to indicate the cost of the path from the initiating node to the target node.

[0199] Optionally, the receiving unit is also used to: receive a routing fault frame from the first node, the routing fault frame including third information, the third information being used to indicate that the route from the initiating node to the target node is faulty; the device also includes a processing unit, the processing unit being used to: based on the routing fault frame, delete the route in the routing table that leads to the target node and whose next hop node of the initiating node is the first node.

[0200] Optionally, the routing failure frame includes an extension field, and the third information is carried in the extension field in the routing failure frame.

[0201] Optionally, the routing fault frame includes a second network layer unicast message, the second network layer unicast message includes a routing fault message header, and the third information is carried in the routing fault message header.

[0202] Optionally, the second network layer unicast message further includes a network layer message header, wherein, in the second network layer unicast message, the network layer message header indicates that the message header of the next layer message is the routing fault message header.

[0203] Optionally, the third information includes at least one of the following fields:

[0204] a type field, where the type field is used to indicate that the type of the third information is a routing failure;

[0205] A first field, the first field being used for the number of target nodes affected by the fault in the network;

[0206] a second field for indicating a network address of a target node affected by the failure; and

[0207] The third field is used to indicate an identifier of a path where a target node affected by the fault is located.

[0208] In a fifth aspect, the present application provides a data transmission device, which is a first node or is included in the first node, and the device includes: a receiving unit for receiving a first broadcast service frame, the first broadcast service frame being used to transmit first service data from an initiating node to a target node in a broadcast form, the target node being not the first node, the first broadcast service frame also including first information, the first information being used to request establishment of a route from the initiating node to the target node, the route being used to transmit second service data from the initiating node to the target node in a non-broadcast form; a processing unit for generating a second broadcast service frame based on the first broadcast service frame; and a sending unit for broadcasting the second broadcast service frame.

[0209] Optionally, the processing unit is also used to: determine the previous hop node of the first node on the first route from the first node to the initiating node based on the first broadcast service frame; the receiving unit is also used to receive a first route response frame, the first route response frame including second information, the second information being used to indicate that the route from the initiating node to the target node has been established and to indicate the route; the sending unit is also used to send a second route response frame to the previous hop node of the first node, the second route response frame being generated based on the first route response frame.

[0210] Optionally, the receiving unit is also used to receive a first route response frame, the first route response frame including second information, the second information being used to indicate that the route from the initiating node to the target node has been established and to indicate the route; the processing unit is also used to determine the next hop node of the first node on the second route from the first node to the target node based on the first route response frame; the receiving unit is also used to receive second business data; and the sending unit is also used to send the second business data to the next hop node of the first node.

[0211] Optionally, the processing unit is also used to: determine that a first link from the first node to the second node has a fault, wherein the second node is the next hop node of the first node on the second route; the processing unit is also used to: if the next hop nodes of the first node in the routes recorded in the routing table are all the second nodes, generate a first route fault frame, the first route fault frame including third information, the third information being used to indicate that the route from the initiating node to the target node has a fault; the sending unit is also used to send the first route fault frame.

[0212] Optionally, the receiving unit is also used to: receive a second routing fault frame from a third node, the second routing fault frame being used to indicate that the route from the initiating node to the target node is faulty; the third node is the next hop node of the first node on the route from the first node to the target node; the sending unit is also used to: based on the second routing fault frame, when the next hop node of the first node in the route to the target node recorded in the routing table is the third node, send a third routing fault frame, the third routing fault frame being used to indicate that the route from the initiating node to the target node is faulty.

[0213] Optionally, the first broadcast service frame includes an extension field, and the first information is carried in the extension field in the first broadcast service frame.

[0214] Optionally, the first broadcast service frame includes a network layer broadcast protocol message, the network layer broadcast protocol message includes a routing request message header, and the first information is carried in the routing request message header.

[0215] Optionally, the network layer broadcast protocol message also includes a network layer message header and a network layer broadcast protocol message header, the network layer message header indicates that the message header of the next layer message is the network layer broadcast protocol message header, and the network layer broadcast protocol message header indicates that the message header of the next layer message is the routing request message header.

[0216] Optionally, the first information includes at least one of the following fields:

[0217] A type field, where the type field is used to indicate that the type of the first information is a routing request;

[0218] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the first information determined by the initiating node;

[0219] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0220] A target node address field, wherein the target node address field is used to indicate the network address of the target node;

[0221] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0222] a forwarding hop number field, the forwarding hop number field being used to indicate the number of hops required for the first information to travel from the initiating node to the current sender of the first information; and

[0223] A link overhead field is used to indicate the total overhead of the link that the first information passes through from the initiating node to the current sender of the first information.

[0224] Optionally, the first route response frame includes an extension field, and the second information is carried in the extension field in the first route response frame.

[0225] Optionally, the first routing response frame includes a first network layer unicast message, the first network layer unicast message includes a routing response message header, and the second information is carried in the routing response message header.

[0226] Optionally, the first network layer unicast message further includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing response message header.

[0227] Optionally, the second information includes at least one of the following fields:

[0228] a type field, where the type field is used to indicate that the type of the second information is a routing response;

[0229] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the second information determined by the target node;

[0230] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0231] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0232] A path hop count field, the path hop count field being used to indicate the number of hops in the path from the initiating node to the target node; and

[0233] A path cost field, where the path cost field is used to indicate the cost of the path from the initiating node to the target node.

[0234] Optionally, the first routing failure frame includes an extension field, and the third information is carried in the extension field in the first routing failure frame.

[0235] Optionally, the first routing fault frame includes a second network layer unicast message, the second network layer unicast message includes a routing fault message header, and the third information is carried in the routing fault message header.

[0236] Optionally, the second network layer unicast message further includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing fault message header.

[0237] Optionally, the third information includes at least one of the following fields:

[0238] a type field, where the type field is used to indicate that the type of the third information is a routing failure;

[0239] A first field, the first field being used for the number of target nodes affected by the fault in the network;

[0240] a second field for indicating a network address of a target node affected by the failure; and

[0241] The third field is used to indicate an identifier of a path where a target node affected by the fault is located.

[0242] In a sixth aspect, the present application provides a data transmission device, which is a target node or is included in the target node, and the device includes: a receiving unit, used to receive a broadcast service frame, wherein the broadcast service frame is used to transmit the first service data from the initiating node to the target node in a broadcast form, and the broadcast service frame also includes first information, and the first information is used to request the establishment of a route from the initiating node to the target node, and the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form; a sending unit, which sends a route response frame based on the broadcast service frame, and the route response frame includes second information, and the second information is used to indicate that the route from the initiating node to the target node has been established and to indicate the route.

[0243] Optionally, the device further includes a processing unit, configured to obtain the first service data from the broadcast service frame.

[0244] Optionally, the broadcast service frame includes a first broadcast service frame and a second broadcast service frame, the first broadcast service frame comes from a first node, the second broadcast service frame comes from a second node, and the first node and the second node are neighbor nodes of the target node; the sending unit is specifically used to: send a first route response frame to the first node based on the first broadcast service frame, and send a second route response frame to the second node based on the second broadcast service frame; wherein, the second information in the first route response frame is used to indicate that a first route from the initiating node to the target node has been established and is used to indicate the first route, and the second information in the second route response frame is used to indicate that a second route from the initiating node to the target node has been established and is used to indicate the second route, the first route passes through the first node, and the second route passes through the second node.

[0245] Optionally, the broadcast service frame includes an extension field, and the first information is carried in the extension field in the broadcast service frame.

[0246] Optionally, the broadcast service frame includes a network layer broadcast protocol message, the network layer broadcast protocol message includes a routing request message header, and the first information is carried in the routing request message header.

[0247] Optionally, the network layer broadcast protocol message also includes a network layer message header and a network layer broadcast protocol message header, the network layer message header indicates that the message header of the next layer message is the network layer broadcast protocol message header, and the network layer broadcast protocol message header indicates that the message header of the next layer message is the routing request message header.

[0248] Optionally, the first information includes at least one of the following fields:

[0249] A type field, where the type field is used to indicate that the type of the first information is a routing request;

[0250] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the first information determined by the initiating node;

[0251] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0252] A target node address field, wherein the target node address field is used to indicate the network address of the target node;

[0253] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0254] a forwarding hop number field, the forwarding hop number field being used to indicate the number of hops required for the first information to travel from the initiating node to the current sender of the first information; and

[0255] A link overhead field is used to indicate the total overhead of the link that the first information passes through from the initiating node to the current sender of the first information.

[0256] Optionally, the route response frame includes an extension field, and the second information is carried in the extension field in the route response frame.

[0257] Optionally, the routing response frame includes a first network layer unicast message, the first network layer unicast message includes a routing response message header, and the second information is carried in the routing response message header.

[0258] Optionally, the first network layer unicast message further includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing response message header.

[0259] Optionally, the second information includes at least one of the following fields:

[0260] a type field, where the type field is used to indicate that the type of the second information is a routing response;

[0261] a message sequence number field, where the message sequence number field is used to indicate a sequence number of the second information determined by the target node;

[0262] An initiating node address field, wherein the initiating node address field is used to indicate the network address of the initiating node;

[0263] A path identification field, wherein the path identification field is used to indicate an identifier of a path from the initiating node to the target node;

[0264] A path hop count field, the path hop count field being used to indicate the number of hops in the path from the initiating node to the target node; and

[0265] A path cost field, where the path cost field is used to indicate the cost of the path from the initiating node to the target node.

[0266] In the seventh aspect, the present application provides a communication device, which includes a processor and a memory, wherein the memory is used to store program instructions; the processor calls the program instructions in the memory so that the device executes the method in the first aspect or any possible implementation of the first aspect, or executes the method in the second aspect or any possible implementation of the second aspect, or executes the method in the third aspect or any possible implementation of the third aspect.

[0267] In an eighth aspect, the present application provides a communication system comprising a first device, at least one second device, and a third device, wherein the first device is used to execute the method in the first aspect or any possible implementation of the first aspect, the second device is used to execute the method in the second aspect or any possible implementation of the second aspect, and the third device is used to execute the method in the third aspect or any possible implementation of the third aspect.

[0268] In a ninth aspect, the present application provides a vehicle comprising the communication system described in the eighth aspect.

[0269] In the tenth aspect, the present application provides a computer-readable storage medium comprising computer instructions, which, when executed by a processor, implement the method of the first aspect or any possible implementation of the first aspect, or implement the method of the second aspect or any possible implementation of the second aspect, or implement the method of the third aspect or any possible implementation of the third aspect.

[0270] In the eleventh aspect, the present application provides a computer program product, which, when executed by a processor, implements the method in the first aspect or any possible embodiment of the first aspect, or implements the method in the second aspect or any possible implementation of the second aspect, or implements the method in the third aspect or any possible implementation of the third aspect.

[0271] Exemplarily, the computer program product may be a software installation package. BRIEF DESCRIPTION OF THE DRAWINGS

[0272] FIG1 is a schematic diagram of the architecture of a communication system provided in an embodiment of the present application;

[0273] FIG2A is a schematic diagram of a format of routing request information provided in an embodiment of the present application;

[0274] FIG2B is a schematic diagram of a format of routing response information provided in an embodiment of the present application;

[0275] FIG3 is a flow chart of a data transmission method provided in an embodiment of the present application;

[0276] FIG4 is a schematic diagram of the format of a basic service layer basic frame provided in an embodiment of the present application;

[0277] 5 is a schematic diagram of the format of a network layer broadcast protocol message for carrying routing request information and service data provided in an embodiment of the present application;

[0278] FIG6 is a schematic diagram of another communication system provided in an embodiment of the present application;

[0279] 7 is a schematic diagram of the format of a network layer unicast message carrying routing response information provided in an embodiment of the present application;

[0280] FIG8 is a schematic diagram of a format of routing fault information provided in an embodiment of the present application;

[0281] FIG9 is a flowchart of another data transmission method provided in an embodiment of the present application;

[0282] 10 is a schematic diagram of the format of a network layer unicast message carrying routing fault information provided in an embodiment of the present application;

[0283] FIG11 is a schematic diagram of a network failure provided in an embodiment of the present application;

[0284] FIG12 is a schematic diagram of another network failure provided in an embodiment of the present application;

[0285] FIG13 is a schematic structural diagram of a communication device provided in this embodiment of the present application;

[0286] FIG14 is a schematic structural diagram of another communication device provided in this embodiment of the present application;

[0287] FIG15 is a schematic structural diagram of another communication device provided in this embodiment of the present application;

[0288] FIG16 is a schematic structural diagram of a communication device provided in this embodiment of the present application. DETAILED DESCRIPTION

[0289] It should be noted that the prefixes such as "first" and "second" used in this application are only for distinguishing different description objects, and do not have any limiting effect on the position, order, priority, quantity or content of the described objects. For example, if the described object is a "field", then the ordinal number before the "field" in the "first field" and the "second field" does not limit the position or order between the "fields", and "first" and "second" do not limit whether the "fields" they modify are in the same message, nor do they limit the order of the "first field" and the "second field". For another example, if the described object is a "level", then the ordinal number before the "level" in the "first level" and the "second level" does not limit the priority between the "levels". For another example, the number of described objects is not limited by the prefix and can be one or more. Taking "first device" as an example, the number of "devices" can be one or more. In addition, the objects modified by different prefixes can be the same or different. For example, if the described object is a "device," then the "first device" and the "second device" can be the same device, the same type of device, or different types of devices. For another example, if the described object is "information," then the "first information" and the "second information" can be information of the same content or information of different contents. In short, the use of prefixes to distinguish the described objects in the embodiments of this application does not constitute a limitation on the described objects. For the description of the described objects, please refer to the description in the context of the claims or embodiments, and the use of such prefixes should not constitute an unnecessary limitation.

[0290] It should be noted that the descriptions used in the embodiments of the present application, such as "at least one of a1, a2, ..., and an" and the like, include any one of a1, a2, ..., and an existing alone, and any combination of any multiple of a1, a2, ..., and an, each of which can exist alone. For example, the description "at least one of a, b, and c" includes a alone, b alone, c alone, a combination of a and b, a combination of a and c, a combination of b and c, or a combination of ab and c.

[0291] Refer to Figure 1, which is a schematic diagram of the architecture of a communication system provided in an embodiment of the present application. The communication system is used to establish a route from an initiating node to a target node and forward service data. Here, the initiating node is the starting sending node of the service data or the broadcast service frame carrying the service data and routing request information, and the target node is the final processing node of the service data or the service broadcast frame; or it can be understood that the initiating node is the starting node of route discovery and the target node is the end node of route discovery.

[0292] In Figure 1, the communication system includes an initiating node, at least one forwarding node, and a target node. Here, the initiating node, forwarding node, or target node can be a network device with routing and forwarding capabilities, such as a wireless router, a wireless access point (AP), etc., or a component within the network device, such as a single board, a line card, a chip, etc.; or a terminal device with routing and forwarding capabilities, such as smart home devices (such as televisions, robot vacuums, smart desk lamps, audio systems, smart lighting systems, appliance control systems, home background music, home theater systems, intercom systems, video surveillance, etc.), smart transportation equipment (such as cars, ships, drones, trains, vans, trucks, etc.), smart manufacturing equipment (such as robots, industrial equipment, smart logistics, smart factories, etc.), user devices (mobile phones, computers, tablets, PDAs, desktops, headphones, speakers, wearable devices, in-vehicle devices, virtual reality devices, augmented reality devices, etc.), or a component within the terminal device (such as a chip or integrated circuit).

[0293] For example, in Figure 1, assuming that node S is the initiating node and node D is the target node, then other nodes with routing forwarding capabilities on the possible path from node S to node D are all forwarding nodes, that is, at least one forwarding node in Figure 1 includes node A, node B, node C, node R, node E and node F.

[0294] For example, in FIG1 , node S triggers the establishment of a route based on service data. For example, when node S needs to send service data to node D, but node S has not yet established a route from node S to node D locally, node S can start route discovery based on the transmission of service data to establish a route from node S to node D. The process may be:

[0295] Node S generates a broadcast service frame carrying service data and first information and sends the broadcast service frame, wherein the first information is used to request establishment of a route from node S to node D;

[0296] For any forwarding node in FIG1 , if the forwarding node receives a broadcast service frame, it indicates that the forwarding node is a neighbor node of node S. If the sequence number of the first information in the broadcast service frame is greater than the sequence number of the route request information recorded in the local history, the forwarding node generates a reverse routing table locally based on the broadcast service frame. The reverse routing table is used to record the set of routes from the forwarding node to the initiating node. The forwarding node also updates the broadcast service frame and broadcasts the updated broadcast service frame. For the update of the broadcast service frame by the forwarding node, reference may be made to the relevant description of the embodiment of FIG3 below.

[0297] According to the above method, the above broadcast service frame is broadcast through node S and at least one forwarding node, and finally node D can receive the broadcast service frame broadcast by the neighbor node from its own neighbor node (the neighbor node belongs to at least one forwarding node in Figure 1). Node D sends a route response frame to the neighbor node based on the broadcast service frame. The route response frame includes a second information. The second information is used to indicate that the route from the initiating node to the target node has been established and is used to indicate the route. In the process of transmitting the route response frame from node D to node S based on the node's local reverse routing table, each node passed along the way also establishes a forward routing table locally. The node's local forward routing table is used to record the set of routes from the node to the target node. The node's local forward routing table can be used to guide the sending of subsequent business data. In this way, both the establishment of the route from node S to node D and the transmission of business data are realized. Here, the specific process of establishing the route from the initiating node to the target node can refer to the description of the following method embodiment. For the sake of brevity of the specification, it will not be repeated here.

[0298] The communication system shown in FIG1 can be applied to a variety of application scenarios, such as the following application scenarios: mobile internet (MI), industrial control (industrial control), self-driving, transportation safety (transportation safety), Internet of Things (IoT), smart city (smart city), or smart home (smart home).

[0299] The communication system shown in Figure 1 can be applied to various network types, for example, one or more of the following network types: SparkLink, long term evolution (LTE) network, 5th generation mobile communication technology (5G), wireless local area network (for example, Wi-Fi), Bluetooth (BT), Zigbee, or vehicle-mounted short-range wireless communication network, etc.

[0300] It is understood that the initiating node, target node, and forwarding node described above are all nodes, which is a name for electronic devices with forwarding capabilities. In some application scenarios or certain network types, devices with similar forwarding capabilities may not be called nodes, for example, but may be called devices. This is not specifically limited here.

[0301] Here, the network address of the node shown in Figure 1 can be a network layer address, for example, its length can be 2 bytes (i.e., 16 bits), which can be used for addressing in the corresponding communication system. For example, in the Star Flash communication system, the address type of the initiating node, forwarding node, and target node shown in Figure 1 can be a Star Flash network address. It can be understood that the Star Flash network address is another address type different from the IP address.

[0302] It should be noted that Figure 1 is merely an exemplary architecture diagram and does not limit the number of network elements included in the system shown in Figure 1. Although not shown in Figure 1, Figure 1 may also include other functional entities in addition to the functional entities shown in Figure 1. Furthermore, the methods provided in the embodiments of the present application can be applied to the communication system shown in Figure 1. Of course, the methods provided in the embodiments of the present application can also be applied to other communication systems, and the embodiments of the present application are not limited in this regard.

[0303] Based on the architectural diagram shown in Figure 1, an embodiment of the present application provides a data transmission method that can realize the establishment of routes and the transmission of business data at the same time. Compared with the method of establishing routes using a proactive routing protocol, the embodiment of the present application can reduce the overhead of network resources; compared with the method of establishing routes using a reactive routing protocol, the embodiment of the present application can also reduce the waiting delay for the transmission of the first packet of business data.

[0304] The data transmission method provided in the embodiments of the present application requires at least routing request (RREQ) information and routing response (RREP) information to be implemented. Before introducing the data transmission method provided in the embodiments of the present application, the formats of the routing request information and routing response information involved in the embodiments of the present application are first introduced. In some possible embodiments, the routing request information may also be referred to as an RREQ message, and the routing response information may also be referred to as an RREP message.

[0305] The following describes the routing request information based on FIG2A. Referring to FIG2A, FIG2A is a schematic diagram of the format of a routing request information provided in an embodiment of the present application:

[0306] In an embodiment of the present application, a route request message is generated by an initiating node in the network. The route request message is used to request the establishment of a route from the initiating node to the target node. The forwarding node that receives the route request message can continue to broadcast it until the target node also receives the route request message. The broadcast of the route request message can establish a reverse route. Reverse routing refers to the route from the target node to the initiating node. Reverse routing can be used to send back the route response message sent by the target node in response to the route request message to the initiating node. Here, the initiating node, forwarding node, and target node can refer to the description of the corresponding content in Figure 1 and will not be repeated here.

[0307] For example, as shown in FIG2A , the routing request information includes at least one of the following fields:

[0308] Type: This field indicates that the type of information is routing request;

[0309] Message sequence number: This field indicates the sequence number of the routing request information, that is, it identifies the initiating node sending a routing request information;

[0310] Initiating node address: This field indicates the network address of the initiating node;

[0311] Target node address: This field indicates the network address of the target node;

[0312] Path ID: This field indicates the ID of the path from the initiating node to the target node;

[0313] Forward Hop Count: This field indicates the number of hops the route request information needs to go through from the originating node to the current sender of the route request information; and

[0314] Link cost: This field indicates the total cost of the link that the route request information passes through from the initiating node to the current sender of the route request information.

[0315] Here, link cost is a metric value of the link. For example, link cost can be the link's power consumption, the link's transmission delay, or the link's packet loss rate. In some possible embodiments, link cost can also be determined based on at least one of the link's power consumption, the link's transmission delay, or the link's packet loss rate.

[0316] Here, the above-mentioned type field, message sequence number field, initiating node address field, target node address field and path identification field are determined by the initiating node.

[0317] It is understood that when the initiating node generates the route request message, the forwarding hop count field is set to 0 and the link cost field is set to 0. However, the value of the forwarding hop count field in the route request message will increase by 1 for each forwarding node along the path from the initiating node to the target node. Accordingly, the value of the link cost field in the route request message will change accordingly with the change in the value of the forwarding hop count field. The values ​​of the type field, message sequence number field, initiating node address field, target node address field, and path identifier field in the route request message remain unchanged during the route discovery process.

[0318] For example, for the path identifier field in the routing request information, there may be multiple paths (or routes) between the same initiating node and the same target node, and these multiple paths may share the same path identifier.

[0319] In some possible embodiments, the routing request information further includes at least one of the following fields:

[0320] Message validity period: This field indicates the current maximum number of times the route request message can be forwarded; and

[0321] Reserved: This field is used for future function extension.

[0322] In some possible embodiments, routing request information may be represented by a type-length-value TLV field, as shown in FIG2A , where the type field is used to indicate that the type of information is a routing request, the length field is used to indicate the total length of the value field of the routing request information, and the value field is used to carry the content of the routing request information, and the value field includes fields such as message sequence number, reservation, initiating node address, target node address, path identifier, message validity period, forwarding hop count, and link overhead.

[0323] Exemplarily, in FIG2A , the length of each field in the route request information may be: type (8 bits), length (8 bits), message sequence number (8 bits), reservation (8 bits), initiating node address (16 bits), target node address (16 bits), path identifier (8 bits), message validity period (8 bits), forwarding hop count (8 bits), and link overhead (8 bits).

[0324] It should be understood that the format of the route request information shown in FIG2A is merely an example, and embodiments of the present application do not limit the format of the route request information to that shown in FIG2A . In some possible embodiments, the number of fields in the route request information may be less than the number of fields shown in FIG2A . For example, one or more of the reserved field and the message validity period field may be omitted. In some possible embodiments, the number of fields in the route request information may be greater than the number of fields shown in FIG2A , and this is not specifically limited herein.

[0325] The following describes the routing response information in the embodiment of the present application based on FIG2B. Referring to FIG2B, FIG2B is a schematic diagram of the format of a routing response information provided in the embodiment of the present application:

[0326] In the embodiments of the present application, a route response message is generated by a target node in the network. The route response message indicates that a route from the initiating node to the target node has been established and indicates the route. The route response message is sent by the target node along the reverse route. When the route response message is sent back to the initiating node, it establishes a forward route. The forward route refers to the route from the initiating node to the target node, and the forward route guides the transmission of service data.

[0327] For example, as shown in FIG2B , the routing response information includes at least one of the following fields:

[0328] Type: This field indicates that the type of information is routing response;

[0329] Message Sequence Number: This field indicates the sequence number of the routing response information, that is, it identifies the target node sending a routing response information. The value of this field is the same as the value of the message sequence number field in the routing request information;

[0330] Initiating node address: This field indicates the network address of the initiating node;

[0331] Target node address: This field indicates the network address of the target node;

[0332] Path ID: This field indicates the ID of the path from the initiating node to the target node;

[0333] Path Hop Count: This field indicates the number of hops in the path from the originating node to the target node; and

[0334] Path Cost: This field indicates the cost of the path from the initiating node to the target node.

[0335] Here, path cost refers to the sum of the costs of each link in a path from the initiating node to the target node. Path cost measures the cost of reaching the target node from the initiating node. When multiple paths exist to reach the target node, the path with the lowest path cost is considered the optimal path from the initiating node to the target node.

[0336] Exemplarily, the route response information indicates the route from the initiating node to the target node via the aforementioned path identification field and path hop count field. It will be appreciated that when there are multiple paths (or routes) from the initiating node to the target node, the path identification field and path hop count field can be used to distinguish between the different paths from the initiating node to the target node.

[0337] For example, when the route response information is sent back to the initiating node along the reverse route, the values ​​of the message sequence number field, the initiating node address field, the target node address field, the path identifier field, the path hop count field, and the path cost field remain unchanged.

[0338] In some possible embodiments, the content of the routing response information or the value field of the routing response information further includes at least one of the following fields:

[0339] Message validity period: This field indicates the time (e.g., in milliseconds) that the receiver of the route response message considers the route valid; and

[0340] Reserved: This field is used for future function extension.

[0341] In some possible embodiments, the routing response information can be represented by a type-length-value TLV field, as shown in Figure 2B, where the type field is used to indicate that the type of the information is a routing response, the length field is used to indicate the total length of the value field of the routing response information, and the value field is used to carry the content of the routing response information. The value field includes fields such as message sequence number, reservation, initiating node address, target node address, path identifier, message validity period, path hop count, and path overhead.

[0342] Exemplarily, in FIG2B , the length of each field in the routing response information may be: type (8 bits), length (8 bits), message sequence number (8 bits), reservation (8 bits), initiating node address (16 bits), target node address (16 bits), path identifier (8 bits), message validity period (8 bits), path hop count (8 bits), and path overhead (8 bits).

[0343] It is understood that the format of the routing response information shown in FIG2B is merely an example, and the embodiments of the present application do not limit the format of the routing response information to that shown in FIG2B . In some possible embodiments, the number of fields in the routing response information may be less than the number of fields shown in FIG2B . For example, one or more of the reserved fields and the message validity period field may be omitted. In some possible embodiments, the number of fields in the routing response information may be greater than the number of fields shown in FIG2B , and this is not specifically limited herein.

[0344] Based on the routing request information shown in FIG2A and the routing response information shown in FIG2B, see FIG3, which is a flow chart of a data transmission method provided by an embodiment of the present application. The method can be applied to a communication system consisting of an initiating node, at least one forwarding node, and a target node, for example, the communication system shown in FIG1. ​​The method includes but is not limited to the following steps:

[0345] S301: The initiating node generates a broadcast service frame 1, which is used to transmit first service data from the initiating node to the target node in the form of broadcast. The broadcast service frame 1 also includes first information, which is used to request the establishment of a route from the initiating node to the target node.

[0346] Here, routing is used to transmit the second service data from the initiating node to the target node in a non-broadcast form (such as unicast or multicast). For the initiating node and the target node, please refer to the description of the corresponding content in Figure 1 above. For the sake of brevity, it will not be repeated here.

[0347] For example, the first information is the routing request information, and reference may be made to the relevant description of the routing request information. The format of the first information may be, for example, the format shown in FIG2A , which will not be described in detail here.

[0348] In one implementation, generating a broadcast service frame includes: generating the broadcast service frame based on a demand for sending service data to a target node. In this manner, route establishment is triggered based on the service data, i.e., by carrying route request information in the broadcast service frame, compared to reactive routing protocols that use broadcast route request information to establish routes, while achieving route establishment, the latency for transmitting the first packet of service data can be reduced.

[0349] The following specifically describes the manner in which the first information is carried in the broadcast service frame 1, with the following two exemplary embodiments provided:

[0350] Carrying mode 1: Using the basic service layer basic frame format to carry business data and routing request information

[0351] For example, in the Starflash wireless communication system, the basic service layer is composed of several functional units. The Starflash wireless communication system can support upper-layer application functions and system management and maintenance by calling different functional units.

[0352] The basic service layer basic frame is a basic service layer protocol data unit (PDU) transmitted in a transmission channel, wherein the transmission mode of the transmission channel is a basic mode.

[0353] Here, a transmission channel is the basic path for transmission at the basic service layer, and the transmission process is based on this transmission channel. A transmission channel can be mapped to a logical link at the Star Flash access layer. The mapping can be one-to-one, many-to-one, or one-to-many. A transmission mode is a series of data processing methods performed by the basic service layer during transmission, including packet splitting, packet aggregation, acknowledgment, and retransmission. Each transmission channel uses a transmission mode for transmission.

[0354] See Figure 4, which is a schematic diagram of the format of a basic service layer basic frame provided by an embodiment of the present application. As can be seen from Figure 4, the basic service layer basic frame includes the following fields:

[0355] Transmission Channel Identifier (TCID): This field is used to identify the transmission channel and is 8 bits long. For example, a value of 0x01 to 0x1F indicates a fixed transmission channel identifier; a value of 0x20 to 0x4F indicates broadcast dynamic allocation; a value of 0x50 to 0x7F indicates multicast dynamic allocation; and a value of 0x80 to 0xDF indicates unicast dynamic allocation.

[0356] Frame type: used to indicate the type of frame, with a length of 4 bits; for example, a value of 0b0000 indicates a basic frame;

[0357] O: 1 bit in length. A value of 1 indicates that the frame structure carries an extension field. A value of 0 indicates that the frame structure does not contain an extension field.

[0358] C: 1 bit in length. A value of 1 indicates that the frame structure carries a 2-byte CRC check value at the end. A value of 0 indicates that there is no CRC check value in the frame structure.

[0359] RFU: 2 bits long, reserved field;

[0360] Length indication: The length is 2 bytes, indicating the total length of the remaining fields in the entire frame minus the first 8 bytes;

[0361] Protocol Identifier (PI): 1 byte in length, indicating the type of upper layer protocol;

[0362] Extension field: variable length, can be used for subsequent function extension;

[0363] Data information: variable length, used to carry business data; and

[0364] CRC: Used to carry the CRC check value.

[0365] Exemplarily, the first information in the broadcast service frame 1 can be carried in the extended field of the basic service layer basic frame shown in Figure 4, and the service data in the broadcast service frame 1 is carried in the data information field of the basic service layer basic frame shown in Figure 4.

[0366] In one implementation, when the broadcast service frame 1 is encapsulated using the format of the basic service layer basic frame shown in FIG4 , the broadcast service frame 1 includes an extension field, and the first information can be carried in the extension field of the broadcast service frame 1. In this case, the broadcast service frame 1 also includes a data information field, and the first service data can be carried in the data information field of the broadcast service frame 1, for example.

[0367] Carrying mode 2: Using network layer broadcast protocol messages to carry business data and routing request information

[0368] In one implementation, the broadcast service frame 1 includes a network layer broadcast protocol message, the network layer broadcast protocol message includes a routing request message header, and the first information is carried in the routing request message header.

[0369] Furthermore, the network layer broadcast protocol message also includes a network layer message header and a network layer broadcast protocol message header, the network layer message header indicates that the message header of the next layer message is the network layer broadcast protocol message header, and the network layer broadcast protocol message header indicates that the message header of the next layer message is the routing request message header.

[0370] See Figure 5, which is a schematic diagram of the format of a network layer broadcast protocol message for carrying routing request information and service data provided in an embodiment of the present application. As can be seen from Figure 5, the network layer broadcast protocol message includes a network layer message header, a network layer broadcast protocol message header (referred to as the broadcast header), a routing request message header (referred to as the routing request header), and a payload field, wherein the first information (i.e., including the content shown in the gray rectangular box in Figure 5) is carried in the routing request header.

[0371] In FIG5 , the positional relationship among the network layer header, the broadcast header, and the routing request header may be as follows: the next header field in the network layer header indicates the broadcast header, and the next header field in the broadcast header indicates the routing request header.

[0372] Exemplarily, the first service data may be carried in a payload field of a network layer broadcast protocol message, where the payload field is located after the routing request header.

[0373] The following describes the meaning of each field in the network layer message header, broadcast header, and routing request header in Figure 5.

[0374] In Figure 5, the network layer header includes the following fields:

[0375] Version number (version): indicates the version number of the network communication protocol; the length is, for example, 3 bits;

[0376] Type of service (ToS): indicates the service type, which is related to the quality of service (QoS); the length is, for example, 8 bits;

[0377] Topology ID (Topo ID): indicates the type of forwarding path. For example, a value of 0 indicates a standard topology; a value of 1 indicates a unicast advanced topology, which provides a topology that meets QoS requirements for applications. The length is, for example, 2 bits.

[0378] Flow label: a flow label that indicates the data flow to which the packet belongs; its length is, for example, 19 bits.

[0379] Payload length: indicates the length of the payload of the message; for example, the length is 16 bits;

[0380] Next header: indicates the header of the next layer of the message; in Figure 5, this field indicates the broadcast header; the length is, for example, 8 bits;

[0381] Hop limit: indicates the maximum number of hops for a message; the length is, for example, 8 bits;

[0382] Source address: indicates the source node address of the sent message; in Figure 5, this field indicates the network address of the initiating node; the length is, for example, 16 bits;

[0383] Destination address: indicates the address of the destination node that receives and processes the message; in FIG5 , this field indicates a broadcast address; the length is, for example, 16 bits.

[0384] In Figure 5, the broadcast header includes the following fields:

[0385] Next header: indicates the header of the next layer of the message; in Figure 5, this field indicates the routing request header; the length is, for example, 8 bits;

[0386] Type: indicates the type of broadcast message. For example, a value of 0 indicates a non-reliable broadcast, and a value of 1 indicates a reliable broadcast. The length is, for example, 2 bits.

[0387] ACK: In the case of reliable broadcast, the receiving end sends a unicast response ACK message to the sending end. ACK is set to 1, and in other cases, ACK is set to 0. The length is, for example, 1 bit.

[0388] Reserved: used for future functional expansion; the length is, for example, 21 bits;

[0389] Alive time: indicates the maximum survival time of a broadcast message in the network; the length is, for example, 20 bits;

[0390] Sequence number: indicates the sequence number of the broadcast message, used to distinguish broadcast messages; the length is, for example, 32 bits.

[0391] In FIG5 , the routing request header includes a next header field and first information. The message format of the first information may be specifically described in the description of FIG2A , and will not be described again for the sake of brevity.

[0392] Exemplarily, for any of the above-mentioned carrying modes, when the initiating node generates a broadcast service frame, the way to fill in each field in the first information can be: based on the routing request information shown in Figure 2A, the initiating node sets the "initiating node address" field to its own network address, sets the "target node address" to the network address of the target node, sets the "forwarding hop count" field to "0" and sets the "link overhead field" to "0". In addition, the initiating node also fills in fields such as "type", "message sequence number", "path identifier", and "message validity period".

[0393] S302: The initiating node broadcasts the broadcast service frame 1.

[0394] S303: For any forwarding node among the at least one forwarding node, if a broadcast service frame is received, the forwarding node updates the broadcast service frame and broadcasts the updated broadcast service frame.

[0395] Here, the broadcast service frame may be the broadcast service frame 1 mentioned above, or may be a broadcast service frame broadcast by a forwarding node in the at least one forwarding node mentioned above.

[0396] For example, for any two forwarding nodes in at least one forwarding node, taking node 1 and node 2 as an example, if node 2 receives a broadcast service frame broadcast by node 1, it indicates that node 2 is a neighbor node of node 1, or node 2 is the next hop node of node 1 in the direction from the initiating node to the target node. Similarly, if node 1 receives a broadcast service frame 1 broadcast by the initiating node, it indicates that node 1 is a neighbor node of the initiating node, or node 1 is the next hop node of the initiating node.

[0397] Exemplarily, a forwarding node receives a broadcast service frame and, based on at least one of the transport channel identifier (TCID), logical channel identifier (LCID), and layer 2 identifier of the node broadcasting the broadcast service frame carried in the broadcast service frame, and a local node neighbor table, can determine the node broadcasting the broadcast service frame, i.e., the forwarding node knows which neighboring node of the forwarding node the broadcast service frame comes from. Here, the node neighbor table is used, for example, to record the correspondence between the local interface, the network address of the neighboring node, the layer 2 identifier of the neighboring node, the transport channel identifier, and the logical channel identifier.

[0398] Exemplarily, node 2 receives a broadcast service frame broadcast by node 1, and node 2 updates the broadcast service frame, including: in the broadcast service frame, increasing the value of the "forwarding hop count" field in the first information by 1, and updating the value of the "link overhead" field in the first information to the sum of the current value of the "link overhead" field and the overhead of the link from node 1 to node 2. Furthermore, node 2 can also update the transmission channel identifier LCID in the broadcast service frame, so that the receiver of the updated broadcast service frame can identify the sender of the updated broadcast service frame through the transmission channel identifier.

[0399] In one implementation, to avoid repeated processing of the first information by the forwarding node, the aforementioned updating of the broadcast service frame and broadcasting the updated broadcast service frame by any of the at least one forwarding node upon receiving a broadcast service frame includes: updating the broadcast service frame and broadcasting the updated broadcast service frame by any of the at least one forwarding node upon receiving a broadcast service frame when the sequence number of the first information in the broadcast service frame is greater than the sequence number of the first information in the historical record in the local message cache table. Here, the sequence number of the first information in the broadcast service frame is indicated by a message sequence number field in the first information.

[0400] In an embodiment of the present application, a message cache table is used to record historically received route request information. The first node is any forwarding node among at least one forwarding node. As an example, the local message cache table of the first node is used to record the correspondence between the sequence number of the first information, the network address of the target node, the network address of the initiating node, the total number of hops from the initiating node to the first node, and the total overhead of the link from the initiating node to the first node. It is understood that the message cache table can be used by the local node to determine whether it has processed the route request information received this time, thereby avoiding the same node from repeatedly processing the route request information with the same sequence number.

[0401] In some possible embodiments, if a forwarding node receives a broadcast service frame, but the sequence number of the first information in the broadcast service frame is the same as the sequence number of the first information in the historical record in the local message cache table, the forwarding node ignores the broadcast service frame.

[0402] See Figure 6, which is a schematic diagram of another communication system provided by an embodiment of the present application. In Figure 6, it is assumed that node S is the initiating node and node D is the target node. At least one forwarding node includes node A, node B, and node C. Figure 6 shows the overhead of some links, for example, the overhead of link SA is 2, the overhead of link AB is 1, and so on. Using Figure 6 as an example, the broadcast process of a broadcast service frame in at least one forwarding node is described, as shown in steps A1-A3 below:

[0403] Step A1: Node S generates a broadcast service frame 1, wherein, in the first information of the broadcast service frame 1, the "type" field takes a first value, for example, indicating that the type of the first information is a routing request, the "initiating node address" field is filled in with the network address of node S, the "target node address" field is filled in with the network address of node D, the value of the "forwarding hop count" field is filled in as "0", and the value of the "link overhead" field is filled in as "0". In addition, node S also fills in the "message sequence number" field in the first information, for example, fills in as "1", and the "path identifier" field is filled in as 1, for example. Here, the carrying method of the first information in the broadcast service frame 1 can refer to the description of the corresponding content in the above S301, and will not be repeated here.

[0404] Step A2: Node S broadcasts the above-mentioned broadcast service frame 1. Assuming that only node A among at least one forwarding node receives the broadcast service frame 1, it means that node A is the next hop node of node S in the direction from node S to node D. If the sequence number of the first information in the broadcast service frame 1 is greater than the sequence number of the routing request information recorded in the local message cache table of node A (if node A has not received routing request information in the history or the local message cache table has been cleared, it can be considered that the sequence number of the historical routing request information recorded in the message cache table is 0), node A will update the broadcast service frame 1, that is, fill in the value of the "forwarding hop count" field in the first information of the broadcast service frame 1 with "1" and fill in the value of the "link overhead" field with "2" (because the overhead of the link SA is 2). The updated broadcast service frame 1 can be called broadcast service frame 2, that is, broadcast service frame 2 is generated by node A based on broadcast service frame 1.

[0405] Step A3: Node A broadcasts the above-mentioned broadcast service frame 2. Assuming that only node B and node C in at least one forwarding node receive the broadcast service frame 2, it means that node B and node C are both the next hop nodes of node A in the direction from node S to node D.

[0406] For node B, if the sequence number of the first information in broadcast service frame 2 is greater than the sequence number of the route request information previously recorded in the local message cache table of node B (i.e., node B processes broadcast service frame 2 for the first time), node B will update broadcast service frame 2, i.e., fill in the value of the "forwarding hop count" field in the first information of broadcast service frame 2 with "2" and the value of the "link overhead" field with "3" (since the sum of the overhead of link SA and the overhead of link AB is 3). The broadcast service frame 2 updated by node B can be called broadcast service frame 3, i.e., broadcast service frame 3 is generated by node B based on broadcast service frame 2, and then, node B broadcasts the broadcast service frame 3.

[0407] For node C, if the sequence number of the first information in the broadcast service frame 2 is greater than the sequence number of the routing request information recorded in the historical record in the local message cache table of node C (that is, node C processes broadcast service frame 2 for the first time), node C will update broadcast service frame 2, that is, fill in the value of the "forwarding hop count" field in the first information of broadcast service frame 2 with "2" and fill in the value of the "link overhead" field with "4" (because the sum of the overhead of link SA and the overhead of link AC is 4). The broadcast service frame 2 updated by node C can be called broadcast service frame 4, that is, broadcast service frame 4 is generated by node C based on broadcast service frame 2, and then, node C broadcasts the broadcast service frame 4.

[0408] S304: For any forwarding node among the at least one forwarding node, if a broadcast service frame is received, a reverse routing table is generated according to the broadcast service frame.

[0409] Here, the execution order of S303 and S304 is not limited. For example, S303 and S304 may be executed simultaneously, S303 may be executed first and then S304, or S304 may be executed first and then S303.

[0410] In one implementation, in order to avoid repeated processing of the first information by the forwarding node, the above-mentioned reverse routing table is generated based on the broadcast service frame for any forwarding node among the at least one forwarding node, which can be: the above-mentioned reverse routing table is generated based on the broadcast service frame for any forwarding node among the at least one forwarding node, when the sequence number of the first information in the broadcast service frame is greater than the sequence number of the first information in the historical record in the local message cache table.

[0411] Furthermore, if the forwarding node receives a broadcast service frame and the sequence number of the first information in the broadcast service frame is greater than the sequence number of the first information in the historical record in the local message cache table, the forwarding node also updates the local message cache table based on the broadcast service frame. The message cache table is described in the above-mentioned S303 and will not be further described here.

[0412] In an embodiment of the present application, for any forwarding node (e.g., the first node) among the at least one forwarding node, the first node receives a broadcast service frame and can determine the previous hop node of the first node on the route from the first node to the initiating node based on the broadcast service frame. In this way, the first node knows that the sender of the broadcast service frame is the previous hop node of the first node on the route from the first node to the initiating node, and the relevant information of the route (e.g., the previous hop node of the first node) is included in the local reverse routing table of the first node.

[0413] Exemplarily, the reverse routing table of the first node is used to record the set of routes from the first node to the initiating node. Here, the reverse routing table of the first node can be used by the first node to send a subsequently received routing response frame to the previous hop node of the first node leading to the initiating node, wherein the routing response frame carries routing response information and can also assist subsequent nodes in generating a local forward routing table. Please refer to the description of S307 below, which will not be repeated here.

[0414] In one implementation, the reverse routing table local to the first node is used to record the correspondence between the sequence number of the first information, the network address of the destination node, the network address of the previous hop node of the first node, the number of hops from the first node to the destination node, and the path cost from the first node to the destination node, wherein, when the first node is the next hop node of the initiating node on the route from the initiating node to the target node, the destination node is the initiating node; or, when the first node is not the next hop node of the initiating node on the route from the initiating node to the target node, the destination node includes the previous hop node of the first node and the initiating node.

[0415] Here, the reverse routing table of the first node is not limited to recording the correspondence between the sequence number of the first information, the network address of the destination node, the network address of the previous hop node of the first node, the number of hops from the first node to the destination node, and the path cost from the first node to the destination node. In other words, the reverse routing table of the first node can be used to enable the first node to determine the next hop node of the first node leading to the initiating node based on the network address of the initiating node, and the specific form of the reverse routing table of the first node is not limited.

[0416] The following describes the message cache table and reverse routing table generated locally by at least one forwarding node (i.e., node A, node B, and node C in FIG6 ) in conjunction with the description of FIG6 in S303 , assuming that each forwarding node in the at least one forwarding node has not received routing request information in the history.

[0417] For Node A:

[0418] The message cache table after local update of node A is shown in Table 1 below. Table 1 shows the correspondence between the message sequence number, the network address of the target node, the network address of the initiating node, the forwarding hop count and the link cost. For example, a correspondence recorded in the message cache table can be called a cache table entry. As can be seen from Table 1, node A generates a cache table entry "message sequence (1) - network address of the target node (network address of D) - network address of the initiating node (network address of S) - forwarding hop count (1) - link cost (2)" based on the above-mentioned broadcast service frame 1, wherein the message sequence number "1" comes from the "message sequence number" field in the first information of the broadcast service frame 1, the network address of the target node "network address of D" comes from the "target node address" field in the first information of the broadcast service frame 1, and the network address of the initiating node "network address of S" comes from the "initiating node address" field in the first information of the broadcast service frame 1. The value of the forwarding hop count and the value of the link cost are determined by node A. It can be seen that there is 1 hop from node S to node A and the link cost is 2.

[0419] Table 1

[0420] Here, Table 1 is only an example of the local message cache table of node A, and the local message cache table of node A is not limited to that shown in Table 1.

[0421] For example, the reverse routing table generated locally by node A is shown in Table 2 below. Table 2 shows the correspondence between the message sequence number, the network address of the destination node, the network address of the previous hop node, the number of hops, and the path cost. For example, a correspondence recorded in the reverse routing table can be called a reverse routing table entry. As can be seen from Table 2, node A generates a reverse routing table entry "message sequence number (1) - network address of the destination node (network address of S) - network address of the previous hop node (network address of S) - number of hops (1) - path cost (2)" based on the above-mentioned broadcast service frame 1, that is, there is 1 hop from node A to node S and the cost is 2.

[0422] Table 2

[0423] Here, Table 2 is only an example of the local reverse routing table of node A, and the local reverse routing table of node A is not limited to that shown in Table 2.

[0424] For Node B:

[0425] For example, the message cache table after local update of node B is shown in Table 3 below. Table 3 can refer to the description of Table 1. As can be seen from Table 3, node B generates a cache table entry "message sequence (1) - target node network address (D's network address) - initiating node network address (S's network address) - forwarding hop count (2) - link cost (3)" based on the above-mentioned broadcast service frame 2. That is, from node S to node B, there are 2 hops and the total cost is 3.

[0426] Table 3

[0427] Here, Table 3 is only an example of the local message cache table of Node B, and the local message cache table of Node B is not limited to that shown in Table 3.

[0428] For example, the reverse routing table generated locally by node B is shown in Table 4 below, and Table 4 can refer to the description of Table 2 above. As can be seen from Table 4, in response to the broadcast service frame 2, the reverse routing table generated locally by node B includes two reverse routing table entries, one of which is "message sequence number (1) - network address of destination node (network address of A) - network address of previous hop node (network address of A) - number of hops (1) - path cost (1)", that is, there is 1 hop from node B to node A and the cost is 1, and the other reverse routing table entry is "message sequence number (1) - network address of destination node (network address of S) - network address of previous hop node (network address of A) - number of hops (2) - path cost (3)", that is, node B passes through node A to node S, with a total of 2 hops and a total cost of 3.

[0429] Table 4

[0430] Here, Table 4 is only an example of the local reverse routing table of Node B, and the local reverse routing table of Node B is not limited to that shown in Table 4.

[0431] For Node C:

[0432] For example, the message cache table after local update of node C is shown in Table 5 below, which can refer to the description of Table 1. As can be seen from Table 5, node C generates a cache table entry "message sequence (1) - target node network address (D's network address) - initiating node network address (S's network address) - forwarding hop count (2) - link cost (4)" based on the broadcast service frame 2, that is, there are 2 hops from node S to node C and the total cost is 4.

[0433] Table 5

[0434] Here, Table 5 is only an example of the local message cache table of node C, and the local message cache table of node C is not limited to that shown in Table 5.

[0435] For example, the reverse routing table generated locally by node C is shown in Table 6 below, and Table 6 can refer to the description of Table 2 above. As can be seen from Table 6, in response to the broadcast service frame 2, the reverse routing table generated locally by node C includes two reverse routing table entries, one of which is "message sequence number (1) - network address of destination node (network address of A) - network address of previous hop node (network address of A) - number of hops (1) - path cost (2)", that is, there is 1 hop from node C to node A and the cost is 2, and the other reverse routing table entry is "message sequence number (1) - network address of destination node (network address of S) - network address of previous hop node (network address of A) - number of hops (2) - path cost (4)", that is, there are 2 hops from node C to node S via node A and the total cost is 4.

[0436] Table 6

[0437] Here, Table 6 is only an example of the local reverse routing table of node C, and the local reverse routing table of node C is not limited to that shown in Table 6.

[0438] S305: The target node receives the second broadcast service frame, which comes from a neighboring node of the target node. The neighboring node belongs to the at least one forwarding node, and generates a routing response frame based on the second broadcast service frame.

[0439] Here, broadcast service frame 2 is also used to transmit the first service data from the initiating node to the target node in a broadcast form. Broadcast service frame 2 also includes first information. The first information is used to request the establishment of a route from the initiating node to the target node. The route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form.

[0440] Here, compared to the aforementioned broadcast service frame 1 and the broadcast service frames broadcast by other forwarding nodes, the differences include: in the first information of the broadcast service frame 2, the forwarding hop count field indicates the total number of hops from the initiating node to the neighboring node, and the link cost field indicates the total cost of the link from the initiating node to the neighboring node. For example, the transmission channel identifier in the broadcast service frame 2 indicates the identifier of the neighboring node.

[0441] Exemplarily, the target node receives broadcast service frame 2, and based on at least one of the transport channel identifier (TCID), logical channel identifier (LCID), and layer 2 identifier of the node broadcasting the broadcast service frame 2 carried in the broadcast service frame 2, and the local node neighbor table, the network address of the node broadcasting the broadcast service frame 2 can be determined, so that the target node can determine which neighbor node of the target node is the sender of the broadcast service frame 2. Here, the node neighbor table is used to record the correspondence between the local interface, the network address of the neighbor node, the layer 2 identifier of the neighbor node, the transport channel identifier, and the logical channel identifier.

[0442] Here, the number of broadcast service frames 2 is not limited.

[0443] For example, the number of broadcast service frames 2 is one. If the target node responds to the broadcast service frame 2, the number of route response frames is also one, thereby establishing a route (or path) between the initiating node and the target node.

[0444] For another example, the number of broadcast service frames 2 can also be multiple, and the sequence numbers of the first information in these multiple broadcast service frames 2 are the same, but the values ​​of the "forwarding hop count" field and / or the "link overhead" field in the first information in different broadcast service frames 2 are different. If the target node responds to these multiple broadcast service frames 2 respectively, the number of routing response frames is also multiple, that is, each routing response frame in the multiple routing response frames corresponds to a broadcast service frame 2 in the multiple broadcast service frames 2, thereby establishing multiple routes (or paths) between the initiating node and the target node. In this way, not only can redundant transmission of service data be achieved, but it is also beneficial to improve the reliability of transmitting service data.

[0445] Furthermore, when there are multiple broadcast service frames 2, these multiple broadcast service frames 2 may be obtained by the target node from one of its own neighbor nodes, or the target node may obtain them from multiple neighbor nodes. In this case, the number of broadcast service frames 2 obtained by the target node from each of these multiple neighbor nodes is not limited.

[0446] The following describes the routing response frame in detail.

[0447] In an embodiment of the present application, the route response frame includes second information, and the second information is used to indicate that a route from the initiating node to the target node has been established and to indicate the route.

[0448] Here, the target node generates a routing response frame. The so-called established routing can be understood as the target node successfully receiving the routing request information from the initiating node, and each node in the routing path from the initiating node to the target node establishes a reverse routing table locally based on the received routing request information.

[0449] Exemplarily, the second information is used to indicate the route. The second information may indicate the route by recording the number of hops and the cost of the route from the initiating node to the target node, or the second information may indicate the route by recording the nodes passed by the route from the initiating node to the target node, or the second information may indicate the route by recording the next hop node of the sender of the route response frame on the route, or the second information may indicate the route in other ways, which are not specifically limited here.

[0450] Exemplarily, the second information is the routing response information, and reference may be made to the relevant description of the routing response information. The format of the second information may be, for example, the format shown in FIG2B , which will not be described in detail here.

[0451] Exemplarily, the carrying form of the second information in the route response frame is associated with the carrying form of the first information in the second broadcast service frame.

[0452] One implementation method is that if the broadcast service frame 2 adopts the basic service layer basic frame format shown in Figure 4 to carry the first service data and the first information, then the routing response frame is also encapsulated using the basic service layer basic frame format shown in Figure 4. In this case, the routing response frame includes an extension field, and the second information can be carried in the extension field in the routing response frame.

[0453] In another implementation, if the broadcast service frame 2 includes a network layer broadcast protocol message, the routing response frame includes a first network layer unicast message, the first network layer unicast message includes a routing response message header, and the second information is carried in the routing response message header.

[0454] Furthermore, the first network layer unicast message also includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is a routing response message header.

[0455] See Figure 7, which is a schematic diagram of the format of a network layer unicast message carrying routing response information provided in an embodiment of the present application. In Figure 7, the routing response frame includes a network layer message header and a routing response message header (referred to as the routing response header), wherein the second information (i.e., including the content shown in the gray rectangle in Figure 7) is carried in the routing response header.

[0456] Regarding the network layer header in Figure 7, the following fields are described:

[0457] Source address: This field is used to indicate the network address of the target node;

[0458] Destination Address: This field indicates the network address of the originating node; and

[0459] Next Header: This field indicates the header of the next layer of the message; for example, in FIG7 , this field indicates the routing response header.

[0460] It can be understood that the remaining fields in Figure 7: version number (version), service type (ToS), topology identifier (Topo ID), flow label (flow label), payload length (payload length) and hop limit (hop limit) can be specifically referred to the description of the corresponding fields in the network layer message header of Figure 5, and will not be repeated here.

[0461] Based on the description of FIG6 in S303 above, the route response frame generated by node D is described. In FIG6, the target node is node D. Assuming that node D receives broadcast service frame 3 and broadcast service frame 4, broadcast service frame 3 and broadcast service frame 4 are the aforementioned broadcast service frame 2. The sequence number of the first information in broadcast service frame 3 is the same as the sequence number of the first information in broadcast service frame 4. The value of the "forwarding hop count" field in the first information of broadcast service frame 3 is "2" and the value of the "link cost" field is "3". The value of the "forwarding hop count" field in the first information of broadcast service frame 4 is "2" and the value of the "link cost" field is "4". Assuming that the route response frame generated by node D adopts the format shown in FIG7:

[0462] In Figure 6, node D can, for example, determine that the broadcast service frame 3 comes from node B based on the local node neighbor list and the broadcast service frame 3, and generate a routing response frame 1 based on the broadcast service frame 3. In the routing response frame 1, the source address field is filled in with "node D's network address", the destination address field is filled in with "node S's network address", the initiating node address field is filled in with "node S's network address", the target node address field is filled in with "node D's network address", the path identification field is also filled in with "1", the path hop count field is filled in with "3" (that is, the value of the "forwarding hop count" field in the broadcast service frame 3 plus 1), and the path overhead field is filled in with "4" (that is, the value of the "link overhead" field in the broadcast service frame 3 plus the overhead of link BD).

[0463] Similarly, in Figure 6, node D can, for example, determine that the broadcast service frame 4 comes from node C based on the local node neighbor list and the broadcast service frame 4, and generate a routing response frame 2 based on the broadcast service frame 4. In the routing response frame 2, the source address field is filled in with "the network address of node D", the destination address field is filled in with "the network address of node S", the initiating node address field is filled in with "the network address of node S", the target node address field is filled in with "the network address of node D", the path identification field is also filled in with "1", the path hop number field is filled in with "3" (that is, the value of the "forwarding hop number" field in the broadcast service frame 4 plus 1), and the path overhead field is filled in with "6" (that is, the value of the "link overhead" field in the broadcast service frame 4 plus the overhead of link CD).

[0464] In some possible embodiments, the target node may also generate a reverse routing table locally based on the received broadcast service frame 2. For example, the reverse routing table may be specifically described in the description of the corresponding content in S304 above.

[0465] In an embodiment of the present application, the target node receives a broadcast service frame, and based on the broadcast service frame, the previous hop node of the target node on the route from the target node to the initiating node can be determined. In this way, the target node knows the sender of the broadcast service frame, and the relevant information of the route (for example, the previous hop node of the target node) is included in the local reverse routing table of the target node.

[0466] Exemplarily, the reverse routing table of the target node is used to record the set of routes from the target node to the initiating node. Here, the reverse routing table of the target node can be used to guide the target node to send the generated route response frame to the previous hop node of the target node leading to the initiating node.

[0467] As an example, the local reverse routing table of the target node is used to record the correspondence between the sequence number of the first information, the network address of the destination node, the network address of the previous hop node of the target node, the number of hops from the target node to the destination node, and the path cost from the target node to the destination node, wherein the destination node includes the initiating node and the previous hop node of the target node leading to the initiating node.

[0468] Here, the target node's local reverse routing table is not limited to recording only the correspondence between the sequence number of the first information, the network address of the destination node, the network address of the previous hop node of the target node, the number of hops from the target node to the destination node, and the path cost from the target node to the destination node. In other words, the target node's local reverse routing table can be used to enable the target node to determine the next hop node leading to the initiating node based on the initiating node's network address, and the specific form of the target node's local reverse routing table is not limited.

[0469] The reverse routing table generated locally by node D is described below in conjunction with the description of FIG6 in S303. Assuming that node D has not received routing request information in the past, based on the description of FIG6 in S303 above, it is assumed that node D receives broadcast service frame 3 sent by node B and receives broadcast service frame 4 sent by node C, that is, node D is both the next hop node of node B and the next hop node of node C in the direction from node S to node D. Then, the reverse routing table generated locally by node D can be referred to as Table 7 below, which can refer to the description of Table 2 above. For example, a corresponding relationship recorded in the reverse routing table can be called a reverse routing table entry. As can be seen from Table 7, in response to broadcast service frame 3 and broadcast service frame 4, the reverse routing table generated locally by node D includes four reverse routing table entries. Taking one of the reverse routing table entries "message sequence number (1) - network address of destination node (network address of S) - network address of previous hop node (network address of B) - number of hops (3) - path cost (4)" as an example, it indicates that node D passes through node B to node S, with a total of 3 hops and a total cost of 4.

[0470] Table 7

[0471] Here, Table 7 is only an example of the local reverse routing table of node D, and the local reverse routing table of node D is not limited to that shown in Table 7.

[0472] S306: In response to the second broadcast service frame, the target node sends a routing response frame.

[0473] Exemplarily, the target node receives broadcast service frame 2. Assuming the target node determines that the sender of broadcast service frame 2 is node n, the target node generates a routing response frame based on broadcast service frame 2. In response to broadcast service frame 2, the target node sends the routing response frame to node n, where node n is the previous hop node of the target node on the route from the target node to the initiating node. In some possible embodiments, the sender of broadcast service frame 2 may also be determined by the target node based on broadcast service frame 2 and the reverse routing table generated in S305.

[0474] In one implementation, there are multiple broadcast service frames two, the sequence numbers of the first information in different broadcast service frames two are the same, and in the first information of different broadcast service frames two, the values ​​of the forwarding hop number field and / or the values ​​of the link overhead field are different. Accordingly, there are also multiple routing response frames, and each routing response frame in the multiple routing response frames corresponds to one broadcast service frame two in the multiple broadcast service frames two, the sequence numbers of the second information in different routing response frames are the same, and in the second information of different routing response frames, the values ​​of the path hop number field and / or the values ​​of the path overhead field are different.

[0475] For example, based on the description of FIG6 in S305 above, the plurality of broadcast service frames 2 include the aforementioned broadcast service frame 3 and broadcast service frame 4, wherein broadcast service frame 3 is from node B and broadcast service frame 4 is from node C, and nodes B and C are neighboring nodes of node D. The plurality of route response frames include route response frame 1 and route response frame 2, wherein route response frame 1 is used to indicate that route 1 from node S to node D has been established and indicates route 1 (e.g., indicating that route 1 has a hop count of 3 and a cost of 4), and route response frame 2 is used to indicate that route 2 from node S to node D has been established and indicates route 2 (e.g., indicating that route 2 has a hop count of 3 and a cost of 6). In this case, the target node sends the route response frame, including: in response to broadcast service frame 3, node D sends route response frame 1 to node B; in response to broadcast service frame 4, node D sends route response frame 2 to node C. It can be understood that route 1 passes through node B, and route 2 passes through node C. Exemplarily, based on FIG6 , route 1 may be represented as S->A->B->D, and route 2 may be represented as S->A->C->D.

[0476] For example, assuming that the routes from the initiating node to the target node include route 1 and route 2 mentioned above, where route 1 is S->A->B->D and route 2 is S->A->C->D, then node B and node C can both be called the previous hop node of node D on the route from node D to node S.

[0477] S307: For the forwarding node among the at least one forwarding node, upon receiving the routing response frame, the forwarding node generates a forward routing table locally, and sends an updated routing response frame based on the local reverse routing table.

[0478] In an embodiment of the present application, for any forwarding node (e.g., the first node) among the at least one forwarding node, the first node receives a route response frame, and based on the route response frame, the next hop node of the first node on the route from the first node to the target node can be determined. In this way, the first node can know that the sender of the route response frame is also the next hop node of the first node on the route from the first node to the target node. It can be understood that the relevant information of the route (e.g., the next hop node of the first node) is included in the local forward routing table of the first node.

[0479] Exemplarily, the forward routing table of the first node is used to record a set of routes from the first node to the target node. Here, the forward routing table of the first node can be used by the first node to send the subsequently received second service data to the next hop node of the first node leading to the target node.

[0480] As an example, the local forward routing table of the first node is used to record the identifier of the path from the initiating node to the target node, the network address of the target node, the network address of the next hop node of the first node, the number of hops from the first node to the target node on the first path from the initiating node to the target node, and the correspondence between the overhead from the first node to the target node on the first path.

[0481] Here, the local forward routing table of the first node is not limited to recording only the identifier of the path from the initiating node to the target node, the network address of the target node, the network address of the next hop node of the first node, the number of hops from the first node to the target node on the first path from the initiating node to the target node, and the correspondence between the overhead from the first node to the target node on the first path. The local forward routing table of the first node can enable the first node to determine the next hop node of the first node leading to the target node based on the network address of a given target node, and the specific form of the local forward routing table of the first node is not limited.

[0482] It can be understood that the local forward routing table of the forwarding node can guide the forwarding node to send subsequently received service data, and can also assist in handling faults in the network.

[0483] Exemplarily, the forwarding node receives a routing response frame and sends an updated routing response frame based on a local reverse routing table, including: the forwarding node receives a routing response frame, determines the previous hop node of the forwarding node on the route from the forwarding node to the initiating node based on the routing response frame and the local reverse routing table, and sends the updated routing response frame to the previous hop node of the forwarding node.

[0484] Here, there is no limit on the number of route response frames that a forwarding node can receive. It is understood that during the route discovery process, if a forwarding node receives only one route response frame, it means that there is only one route (or path) for the initiating node to reach the target node via the forwarding node; if a forwarding node receives multiple route response frames, it means that there are multiple routes (or paths) for the initiating node to reach the target node via the forwarding node.

[0485] Exemplarily, after the forwarding node receives the routing response frame, since the forwarding node is not the initiating node, the forwarding node updates the routing response frame before sending it. The update here can, for example, be to update at least one of the transmission channel identifier, logical channel identifier, and layer 2 identifier of the current sender of the routing response frame in the routing response frame, while the value of the "path hop count" field and the value of the "path overhead" in the routing response frame remain unchanged. The updated information can enable the recipient of the updated routing response frame to identify that the currently received routing response frame comes from the forwarding node.

[0486] Referring to FIG. 6 , based on the description of FIG. 6 in S303-S306 above, it can be seen that when node D receives broadcast service frame 3 broadcast by node B, it sends route response frame 1 to node B in response to broadcast service frame 3, and when node D receives broadcast service frame 4 broadcast by node C, it sends route response frame 2 to node C in response to broadcast service frame 4. FIG. 6 is used as an example to illustrate the transmission process of route response frame 1 and route response frame 2 in at least one forwarding node:

[0487] For Node B:

[0488] Node B receives the routing response frame 1. Since node B is not the initiating node, node B sends a routing response frame A1 to the previous hop node of node B (i.e., node A) based on the local reverse routing table (as shown in Table 4). The routing response frame A1 is the updated routing response frame 1, or the routing response frame A1 is generated by node B based on the routing response frame 1.

[0489] Node B can also generate a forward routing table based on the routing response frame 1 and the local message cache table (i.e., as shown in Table 3). For example, the forward routing table can be found in Table 8 below, which shows the correspondence between the path identifier, the network address of the target node, the network address of the next hop node, the number of hops, and the path cost. For example, a correspondence recorded in the forward routing table can be called a forward routing table entry. As can be seen from Table 8, node B generates a forward routing table entry "path identifier (1) - network address of the target node (network address of D) - network address of the next hop node (network address of D) - number of hops (1) - path cost (1)" based on the above routing response frame 1, that is, there is 1 hop from node B to node D and the cost is 1.

[0490] Table 8

[0491] Here, Table 8 is an example of a forward routing table generated locally by Node B, but the local forward routing table of Node B is not limited to that shown in Table 8. In some possible embodiments, the forward routing table may further record the correspondence between the path identifier, the network address of the target node, the network address of the next hop node, the number of hops, the path cost, and the survival time.

[0492] For Node C:

[0493] Node C receives the routing response frame 2. Since node C is not the initiating node, node C sends a routing response frame A2 to the previous hop node of node C (i.e., node A) based on the local reverse routing table (as shown in Table 6). The routing response frame A2 is the updated routing response frame 2, or the routing response frame A2 is generated by node C based on the routing response frame 2.

[0494] Node C can also generate a forward routing table based on the routing response frame 2 and the local message cache table (i.e., as shown in Table 5). For example, the forward routing table can be found in Table 9 below, which can be found in the description of Table 8 above. As can be seen from Table 9, node C generates a forward routing table entry "path identifier (1) - target node network address (D's network address) - next hop node network address (D's network address) - hop count (1) - path cost (2)" based on the routing response frame 2 above, that is, there is 1 hop from node C to node D and the cost is 2.

[0495] Table 9

[0496] Here, Table 9 is an example of a forward routing table generated locally by node C, but the local forward routing table of node C is not limited to that shown in Table 9.

[0497] For Node A:

[0498] Node A receives the routing response frame A1. Since node A is not the initiating node, node A sends the routing response frame S1 to the previous hop node of node A (i.e., node S) based on the local reverse routing table (i.e., as shown in Table 2). The routing response frame S1 is the updated routing response frame A1, or the routing response frame S1 is generated by node A based on the routing response frame A1. Similarly, node A receives the routing response frame A2. Since node A is not the initiating node, node A forwards the routing response frame S2 to the previous hop node of node A (i.e., node S) based on the local reverse routing table (i.e., as shown in Table 2). The routing response frame S2 is the updated routing response frame A2, or the routing response frame S2 is generated by node A based on the routing response frame A2.

[0499] Node A can also generate a forward routing table based on the routing response frame A1, the routing response frame A2 and the local message cache table (i.e., as shown in Table 1). For example, the forward routing table can be found in Table 10 below. Table 10 can be found in the description of Table 8 above. As can be seen from Table 10, node C generates a forward routing table entry "path identifier (1) - network address of target node (network address of D) - network address of next hop node (network address of B) - number of hops (2) - path cost (2)" based on routing response frame 1, that is, node A passes through node B to node D, with a total of 2 hops and a total cost of 2; node A generates a forward routing table entry "path identifier (1) - network address of target node (network address of D) - network address of next hop node (network address of C) - number of hops (2) - path cost (4)" based on response message 2, that is, node A passes through node C to node D, with a total of 2 hops and a cost of 4.

[0500] Table 10

[0501] Here, Table 10 is an example of a forward routing table generated locally by node A, but the local forward routing table of node A is not limited to that shown in Table 10.

[0502] It can be understood that the received route response frame is sent to the previous hop node of the forwarding node leading to the initiating node based on the local reverse routing table through at least one forwarding node, and the route response frame will eventually be sent back to the initiating node along the reverse route.

[0503] S308: The initiating node receives a routing response frame sent by its neighboring node, and generates a routing table locally according to the routing response frame.

[0504] In an embodiment of the present application, the initiating node receives a route response frame, and the next hop node of the initiating node on the route from the initiating node to the target node can be determined based on the route response frame. In this way, the initiating node can know that the sender of the route response frame is also the next hop node of the first node on the route from the initiating node to the target node. It can be understood that the relevant information of the route (for example, the next hop node of the initiating node) is included in the local routing table of the initiating node, which can also be called the local forward routing table of the initiating node.

[0505] Exemplarily, the local routing table of the initiating node is used to record a set of routes from the initiating node to the target node. Here, the local routing table of the initiating node can be used for the initiating node to send the second service data to the next hop node of the initiating node leading to the target node.

[0506] As an example, the routing table generated by the initiating node can be used to record the correspondence between the identifier of the path from the initiating node to the target node, the network address of the target node, the network address of the next hop node of the initiating node, the number of hops of the first path from the initiating node to the target node, and the overhead of the first path.

[0507] Here, the initiating node's local routing table is not limited to recording the corresponding relationship between the identifier of the path from the initiating node to the target node, the network address of the target node, the network address of the initiating node's next hop node, the number of hops in the first path from the initiating node to the target node, and the cost of the first path. The initiating node's local routing table can be used to enable the initiating node to determine the initiating node's next hop node leading to the target node based on a given target node's network address, and the specific form of the initiating node's local routing table is not limited.

[0508] It can be understood that the local routing table of the initiating node can guide the initiating node to send subsequent service data and can also assist in handling faults in the network.

[0509] Here, there is no limit on the number of route response frames that the initiating node can receive from its neighboring nodes. In one embodiment, if the initiating node receives multiple route response frames, it means that there are multiple routes from the initiating node to the target node, and each of the multiple route response frames corresponds to one of the multiple routes from the initiating node to the target node.

[0510] Illustratively, when there are multiple route response frames, the multiple route response frames may be received by the initiating node from the same next-hop node (or neighboring node) of the initiating node, or may be received by the initiating node from multiple next-hop nodes of the initiating node.

[0511] For example, based on the description of Figure 6 in S307, node S will receive routing response frames S1 and S2 from node A. In response to routing response frames S1 and S2, the routing table generated locally by node S can be seen in Table 11 below. For example, a corresponding relationship recorded in the routing table can be called a routing table entry. As can be seen from Table 11, node S generates two routing table entries, wherein the routing table entry corresponding to routing response frame S1 is "path identifier (1) - target node network address (D's network address) - next hop node network address (A's network address) - hop count (3) - path cost (4)", that is, node S passes through node A to node D, with a total of 3 hops and a cost of 4; the routing table entry corresponding to routing response frame S2 is "path identifier (1) - target node network address (D's network address) - next hop node network address (A's network address) - hop count (3) - path cost (6)", that is, node S passes through node A to node D, with a total of 3 hops and a cost of 6.

[0512] Here, Table 11 is an example of a routing table generated locally by the node S, but the local routing table of the node S is not limited to that shown in Table 11.

[0513] Table 11

[0514] It can be understood that each time the initiating node receives a routing response frame, it can generate a routing table entry based on the routing response frame. For example, the initiating node is node S in Figure 6. Node S receives the above-mentioned routing response frame S1 and generates a routing table entry "path identifier (1) - target node network address (D's network address) - next hop node network address (A's network address) - hop count (3) - path cost (4)", where the value of "hop count" in the routing table entry comes from the "path hop count" field in the routing response frame S1, and the value of "path cost" comes from the "path cost" field in the routing response frame S1.

[0515] After the initiating node receives the routing response frame, since its own network address matches the network address indicated by the initiating node address field in the second information of the routing response frame, the initiating node generates a routing table locally based on the above method, thereby knowing that the route from the initiating node to the target node has been successfully established.

[0516] It can be seen that the implementation of the embodiment of the present application triggers the start of route discovery based on the transmission of business data, that is, when there is business data to be sent, a broadcast business frame carrying route request information establishes a route through a broadcast method. Compared with the reactive routing protocol to establish a route, this method can reduce the waiting delay for the transmission of the first packet of business data while achieving route establishment; compared with the proactive routing protocol to establish a route, this method does not need to establish a route when there is no business data to be sent, nor does it need to regularly send routing control messages to maintain the routing table. This not only saves the power consumption of network equipment, but also greatly reduces the overhead of network resources.

[0517] In some possible embodiments, after the initiating node locally generates a routing table based on the routing response frame, the routing table may guide the transmission of subsequent service data.

[0518] Exemplarily, the initiating node receives a first route response frame and a second route response frame, wherein the first route response frame is used to indicate that a first route from the initiating node to the target node has been established and is used to indicate the first route, and the second route response frame is used to indicate that a second route from the initiating node to the target node has been established and is used to indicate the second route. Accordingly, the local routing table of the initiating node stores the above-mentioned first route and second route. Taking the routing table storing the first route as an example, for example, the next hop node of the initiating node on the first route can be stored. In addition, the number of hops of the first route and the overhead of the first route can also be stored. In some possible embodiments, relevant information of each node along the first route (such as network address, identification, etc.) can also be stored. It can be understood that the initiating node can realize the addressing of the initiating node on the first route through the routing table, and there is no specific limitation on the storage form of the first route in the routing table.

[0519] Here, the initiating node receives a routing response frame (e.g., a first routing response frame), which means that the initiating node knows that the first route has been established. In this case, it can be understood that each node along the first routing path has not only completed the establishment of a reverse routing table locally, but also completed the establishment of a forward routing table.

[0520] Furthermore, if the initiating node needs to send the second service data to the target node, the initiating node may send the second service data through at least one of the first route and the second route.

[0521] For example, the initiating node sends the second business data through the first route, and the second route serves as a redundant route or a backup route. That is, when the first route fails, the second business data can be sent by switching from the first route to the second route. In this way, the reliability of data transmission can be improved.

[0522] For another example, the initiating node sends the second business data through the second route, and the first route serves as a redundant route or a backup route. That is, when the second route fails, the second business data can be sent by switching from the second route to the first route. In this way, the reliability of data transmission can be improved.

[0523] For another example, the initiating node can also send the second business data through the first route and the second route. Even if one of the first route and the second route fails, the second business data can also be transmitted to the target node through the non-faulty route of the first route and the second route, thereby realizing redundant transmission of data and improving the reliability of data transmission.

[0524] Correspondingly, after receiving the second service data, the forwarding node on the route where the initiating node and the target node are located also forwards the second service data through a locally pre-established forward routing table, which will not be described in detail here.

[0525] It can be seen that, by implementing the embodiment of the present application, after completing the establishment of the route from the initiating node to the target node by broadcasting the service frame in a broadcast manner, the second service data can be transmitted along the established route in a non-broadcast form (such as unicast or multicast). In this way, compared with the flooding transmission of service data, the number of times the service data is sent or forwarded by the nodes in the network can be reduced, thereby reducing the power consumption of the nodes in the network and the wireless communication resource overhead.

[0526] In some possible embodiments, after the route from the initiating node to the target node is established, the initiating node starts transmitting business data from the initiating node to the target node. During the transmission process, a link failure or a node failure may occur in the network where the initiating node and the target node are located. In this case, the faulty node or the upstream node of the faulty link can send route failure information to the initiating node along the reverse route to inform the initiating node that the route where it is located has a fault, making data transmission unreachable.

[0527] The following describes routing error (RERR) information in an embodiment of the present application based on FIG8. Referring to FIG8, FIG8 is a schematic diagram of a format of routing error information provided in an embodiment of the present application:

[0528] In an embodiment of the present application, routing fault information can be generated by the upstream node or the faulty node of the faulty link. The routing fault information is generally sent by the node generating the routing fault information along the reverse route by unicast. In this way, after the node on the reverse route receives the routing fault information, it can update the local forward routing table in time based on the routing fault information to delete the route that has failed due to the fault.

[0529] For example, as shown in FIG8 , the routing fault information includes at least one of the following fields:

[0530] Type: This field indicates that the type of information is routing failure;

[0531] Number of target nodes affected by the fault: This field indicates the number of target nodes that are unreachable due to the fault.

[0532] Target node address affected by the fault: This field indicates the network address of the target node affected by the fault;

[0533] ID of the path to the target node affected by the fault: This field indicates the ID of the path to the target node affected by the fault.

[0534] Reserved: Optional field, used for subsequent function expansion.

[0535] In some possible embodiments, when there are multiple target nodes affected by the fault, the two fields, namely, the address of the target node affected by the fault and the identifier of the path where the target node affected by the fault is located, may appear in the routing fault information in the form of a list: the address of the target node affected by the fault [1], ..., the address of the target node affected by the fault [n] and the identifier of the path where the target node affected by the fault is located [1], ..., the identifier of the path where the target node affected by the fault is located [n].

[0536] In some possible embodiments, routing fault information may be represented by a type-length-value TLV field, as shown in FIG8 , where the type field is used to indicate that the type of information is a routing fault, the length field is used to indicate the total length of the value field of the routing fault information, and the value field is used to carry the content of the routing fault information. The value field includes fields such as the number of target nodes affected by the fault, reservation, the address of the target node affected by the fault, and the identifier of the path where the target node affected by the fault is located.

[0537] For example, in FIG8 , the length of each field in the routing fault information may be: type (8 bits), length (8 bits), number of target nodes affected by the fault (8 bits), reserved (8 bits), address of the target node affected by the fault (16 bits), and identifier of the path where the target node affected by the fault is located (16 bits).

[0538] It is understood that Figure 8 is only an example of the format of routing failure information, and the embodiments of the present application do not limit the format of routing failure information to only the form shown in Figure 8. In some possible embodiments, the number of fields in routing failure information may be less than or greater than the number of fields shown in Figure 8, which is not specifically limited here.

[0539] Based on the embodiment shown in FIG3 above, a data transmission method is introduced based on the routing failure information shown in FIG8. Referring to FIG9, FIG9 is a flowchart of another data transmission method provided by an embodiment of the present application. The method can be applied to a communication system, which includes at least Node 1 and Node 2, wherein Node 2 is the previous hop node of Node 1 to the initiating node determined by Node 1 based on the local reverse routing table. The method includes but is not limited to the following steps:

[0540] S901: Node 1 determines that a first link from node 1 to node 3 fails, and updates a local forward routing table.

[0541] Here, node one is a forwarding node in the route from the initiating node to the target node.

[0542] Node 3 is a neighbor node of node 1. For example, node 1 can be called an upstream node of the first link, and node 3 can be called a downstream node of the first link.

[0543] In the implementation of this application, when node one determines that the first link from node one to node three fails, it determines that the route in which the next hop node of node one in the local forward routing table is node three is unusable (or invalid). In this case, the local forward routing table can be further updated.

[0544] In one implementation, updating the local forward routing table may include: deleting a route in which the next hop node of node one is node three from the forward routing table.

[0545] In another implementation, updating the local forward routing table may also be: in the forward routing table, changing the value of the number of hops in the route where the next hop node of node one is node three to "infinity" and changing the value of the path cost to "infinity".

[0546] In some possible embodiments, no link failure may occur, but node one may fail. In this case, the local forward routing table of node one becomes invalid, and S904 is executed.

[0547] S902: Node 1 determines whether there are other routes to the target node in the locally updated forward routing table.

[0548] For example, if there are no other routes to the target node in the locally updated forward routing table of node one, S904 is executed. Alternatively, in another implementation, if the next hop node of node one in the routes recorded in the local forward routing table of node one (i.e., the forward routing table has not been updated in S901 above) is node three, S904 is executed.

[0549] In some possible embodiments, if there are other routes to the target node in the locally updated forward routing table of node one, node one does not need to generate a routing failure frame. Further, if there are other routes to the target node in the locally updated forward routing table of node one, and node one currently needs to send service data to the target node, S903 is executed.

[0550] It can be understood that if there are other routes to the target node in the forward routing table after the local update of node one, it also means that before node one deletes the route with the next hop node of node one being node three from the local forward routing table, the next hop node of node one in the route recorded in the forward routing table includes not only node three, but also other nodes other than node three, and the forward routing table also stores the route for node one to reach the target node through other nodes other than node three.

[0551] S903: If the node 1 has a need to send the second service data to the target node, the second service data is sent to the next hop node of the node 1 leading to the target node based on the updated forward routing table.

[0552] S904: Node 1 generates a routing failure frame, and sends the routing failure frame to node 2 based on the local reverse routing table.

[0553] Exemplarily, sending a routing fault frame to node two based on a local reverse routing table includes: determining that the previous hop node of node one on the route from node one to the initiating node is node two based on the local reverse routing table; and sending a routing fault frame to node two.

[0554] Here, the routing fault frame includes third information, and the third information is used to indicate that there is a fault in the routing from the initiating node to the target node.

[0555] For example, the third information is the routing failure information, and reference may be made to the relevant description of the routing failure information. The format of the third information may be, for example, the format shown in FIG8 , which will not be described in detail here.

[0556] Exemplarily, the third information may be carried in any of the following forms in the routing failure frame:

[0557] In one implementation, the routing fault frame adopts the format of the basic service layer basic frame shown in FIG4 to carry routing fault information. In this case, the routing fault frame includes an extension field, and the third information is carried in the extension field of the routing fault frame.

[0558] In another implementation manner, the routing fault frame includes a second network layer unicast message, the second network layer unicast message includes a routing fault message header, and the third information is carried in the routing fault message header.

[0559] Furthermore, the second network layer unicast message further includes a network layer message header, wherein, in the second network layer unicast message, the network layer message header indicates that the message header of the next layer message is a routing fault message header.

[0560] See Figure 10, which is a schematic diagram of the format of a network layer unicast message carrying routing fault information, provided in an embodiment of the present application. In Figure 10, the routing fault frame includes a network layer message header and a routing fault message header (referred to as the routing fault header), wherein the third information (i.e., including the content shown in the gray rectangle in Figure 10) is carried in the routing fault header.

[0561] Regarding the network layer message header in Figure 10, the following fields are described:

[0562] Source address: This field is used to indicate the network address of the target node;

[0563] Destination Address: This field indicates the network address of the originating node; and

[0564] Next Header: This field indicates the header of the next layer of the message; for example, in FIG10 , this field indicates the routing failure header.

[0565] It can be understood that the remaining fields in Figure 10: version number (version), service type (ToS), topology identifier (Topo ID), flow label (flow label), payload length (payload length) and hop limit (hop limit) can be specifically referred to the description of the corresponding fields in the network layer message header of Figure 5, and will not be repeated here.

[0566] S905: Node 2 updates the local forward routing table based on the routing failure frame.

[0567] In the implementation of this application, node two receives the routing fault frame from node one, and based on the routing fault frame, determines that the route in the local forward routing table leading to the target node and the next hop node of node two being node one is unusable (or invalid). In this case, further, the local forward routing table can be updated.

[0568] In one implementation, updating the local forward routing table may include: deleting from the local forward routing table the route that leads to the target node and whose next hop node of node 2 is node 1.

[0569] In another implementation, updating the local forward routing table may also be: in the forward routing table, changing the value of the number of hops in the route leading to the target node and the next hop node of node 2 being node 1 to "infinity" and changing the value of the path cost to "infinity".

[0570] In some possible embodiments, when node one is a faulty node, node two updates the local forward routing table, which may be: when node one is a faulty node, node two deletes the route with node one as the next hop node of node two from the local forward routing table, which means that the route with node one as the next hop node of node two in the local forward routing table of node two is unusable (or invalid).

[0571] Furthermore, node two will also determine whether there are other routes to the target node in the locally updated forward routing table. If there are other routes to the target node in the locally updated forward routing table, node two will no longer send a routing fault frame to the previous hop node of node two leading to the initiating node based on the local reverse routing table. In this case, if node two needs to forward or send business data to the target node, it can send business data through other routes to the target node in the updated forward routing table. If there are no other routes to the target node in the locally updated forward routing table, node two will send a routing fault frame to the previous hop node of node two leading to the initiating node based on the local reverse routing table. The routing fault frame is used to indicate that the route from the initiating node to the target node is faulty.

[0572] In another implementation, node 2 receives a routing failure frame (referred to as routing failure frame 1) from node 1. Based on routing failure frame 1, when the next-hop node of node 2 in the route to the target node recorded in the local forward routing table of node 2 is all node 1, routing failure frame 2 is sent to the previous-hop node of node 2 leading to the initiating node. Routing failure frame 2 is used to indicate that there is a fault in the route from the initiating node to the target node. Here, routing failure frame 2 is generated based on routing failure frame 1. According to the above method, the routing failure information generated by node 1 can be sent back to the initiating node along the reverse route via the routing failure frame. In this way, each node that receives the routing failure frame can update the local forward routing table based on the routing failure information in the routing failure frame to delete the route that is currently invalid due to the fault.

[0573] In some possible embodiments, if node two is the initiating node and node two receives a routing failure frame from node one, if there are other routes to the target node in the locally updated forward routing table of node two, and node two has a need to send business data to the target node, the business data can be transmitted through other routes to the target node in the locally updated forward routing table; if there are no other routes to the target node in the locally updated forward routing table of node two (or before the update is performed, the next hop node of node two in the route to the target node recorded in the local forward routing table of node two is node one), and node two has a need to send business data to the target node, node two can re-start the routing discovery process shown in the embodiment of Figure 3 above by broadcasting a business frame, which will not be repeated here.

[0574] It can be seen that by implementing the embodiments of the present application, a routing fault frame is sent to the initiating node on the route where it is located through the upstream node of the faulty link or the faulty node, so that the node receiving the routing fault frame can promptly delete the invalid routes caused by the fault in the local forward routing table. When there is a need to send business data, the route can be switched in time based on the updated forward routing table. In this way, it is possible to achieve rapid switching of the forwarding path of business data when a fault occurs, which is beneficial to reducing the probability of data packet loss and improving the reliability of data transmission.

[0575] The application of the method shown in Figure 9 above is illustrated below by taking Figure 11 as an example. Referring to Figure 11, Figure 11 is a schematic diagram of a network failure provided by an embodiment of the present application. Assume that the topological relationship between the nodes shown in Figure 11 is formed after establishing a route from node S to node D based on the method shown in Figure 3 above, wherein, if there is a line segment connecting two nodes, it means that the two nodes are neighboring nodes to each other. It can be seen that there are two paths from node S to node D: S->A->B->D and S->A->C->D respectively. The reverse routing tables of node A, node B, node C and node D in Figure 11 can be found in the description of the corresponding content in Figure 3. The forward routing tables of node S, node A, node B and node C in Figure 11 can be found in the description of the corresponding content in Figure 3, which will not be repeated here.

[0576] For example, in FIG11 , for the transmission of the second service data, the data message sent by node S (the data message carries the second service data) is transmitted to node B via node A. Assuming that node B senses that the link BD fails, resulting in the inability to transmit the data message to node D. Since node D is the target node, node B deletes the route with the next hop node being node D from the local forward routing table (e.g., Table 8 above). If there are no other routes to node D in the local forward routing table of node B after the deletion operation, node B generates a routing fault frame 1. Routing fault frame 1 is used to indicate that the route from node S to node D is faulty. Assuming that routing fault frame 1 includes the network layer unicast message shown in FIG10 , in routing fault frame 1, the source address field is filled in with "node D's network address", the destination address field is filled in with "node S's network address", the number of target nodes affected by the fault is filled in with "1", the target node address field affected by the fault is filled in with "node D's network address", and the identification field of the path where the target node affected by the fault is located is filled in with "1".

[0577] Node B sends the routing failure frame 1 to node A based on the reverse routing table (eg, Table 4 above). Node A determines the previous hop node of node B leading to node S based on the local reverse routing table.

[0578] Node A receives routing failure frame 1 from node B, and knows that the data message cannot be transmitted to node D through node B due to a failure. Node A deletes the route to node D and the next hop node of node A is node B from the local forward routing table (such as Table 10 above). Assuming that the local forward routing table of node A is as shown in Table 12 after the deletion operation, it can be seen from Table 12 that there are other routes to node D in the forward routing table of node A, that is, there is a route for node A to reach node D through node C, which means that the transmission of the data message to node D is not affected. Therefore, node A does not need to send a routing failure frame to node S (that is, the upstream neighbor node of node A), and can send the data message to node C based on the forward routing table. In this way, the transmission of the data message can be achieved through the redundant path, which provides the reliability of data transmission.

[0579] Table 12

[0580] In some possible embodiments, assuming that there are no other routes to node D in node A's local forward routing table after the deletion operation, node A can send a routing failure frame 2 to node S based on the local reverse routing table (e.g., Table 2 described above). Routing failure frame 2 is used to indicate that the route from node S to node D is faulty. After receiving routing failure frame 2, node S deletes the route to node D whose next hop node is node A from the local forward routing table. Here, routing failure frame 2 is generated based on routing failure frame 1.

[0581] In some possible embodiments, the initiating node may detect a link failure, as shown in FIG12 , which is a schematic diagram of another network failure provided by an embodiment of the present application. In FIG12 , assuming that node S detects a link SA failure, node S deletes the route with the next hop node being node A from the local forward routing table. In this case, if node S needs to send service data to node D, node S can regenerate the above-mentioned broadcast service frame to enable route discovery, which will not be described in detail here.

[0582] 13 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application, wherein the communication device 30 includes a generating unit 310 and a sending unit 312. The communication device 30 can be implemented by hardware, software, or a combination of hardware and software.

[0583] Among them, the generation unit 310 is used to generate a broadcast service frame, which is used to transmit the first service data from the initiating node to the target node in the form of broadcast. The broadcast service frame also includes first information, which is used to request the establishment of a route from the initiating node to the target node, and the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form; the sending unit 312 is used to broadcast the broadcast service frame.

[0584] The communication device 30 may be used to implement the initiating node-side method described in the embodiment of FIG3 . In the embodiment of FIG3 , the generating unit 310 may be used to execute S301 , and the sending unit 312 may be used to execute S302 . In some possible embodiments, the communication device 30 further includes a processing unit (not shown), which may be used to execute S308 .

[0585] In some possible embodiments, the communication device 30 may also be used to implement the method on the node 2 side described in the embodiment of FIG. 9 , which will not be described in detail here for the sake of brevity.

[0586] 14 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application, wherein the communication device 40 includes a receiving unit 410, a processing unit 412, and a sending unit 414. The communication device 40 can be implemented by hardware, software, or a combination of hardware and software.

[0587] Among them, the receiving unit 410 is used to receive a first broadcast service frame, which is used to transmit the first service data from the initiating node to the target node in the form of broadcast. The first broadcast service frame also includes first information, which is used to request the establishment of a route from the initiating node to the target node, and the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form. The node where the communication device 40 is located is not the target node; the processing unit 412 is used to generate a second broadcast service frame based on the first broadcast service frame; the sending unit 414 is used to broadcast the second broadcast service frame.

[0588] The communication device 40 may be used to implement any forwarding node side method described in the embodiment of Figure 3. For example, in the embodiment of Figure 3, the receiving unit 410 and the processing unit 412 may be used to execute S303, S304, and S307, and the sending unit 414 may be used to execute S303 and S307.

[0589] In some possible embodiments, the communication device 40 may also be used to implement the node-side method or the node-side method described in the embodiment of FIG. 9 , which will not be described in detail here for the sake of brevity.

[0590] 15 , which is a schematic structural diagram of a communication device provided in an embodiment of the present application, the communication device 50 includes a receiving unit 510 and a sending unit 512. The communication device 50 can be implemented by hardware, software, or a combination of hardware and software.

[0591] Among them, the receiving unit 510 is used to receive a broadcast service frame, which is used to transmit the first service data from the initiating node to the target node in a broadcast form, and the broadcast service frame also includes first information, and the first information is used to request the establishment of a route from the initiating node to the target node, and the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form; the sending unit 512 is used to send a route response frame based on the broadcast service frame, and the route response frame includes second information, and the second information is used to indicate that the route from the initiating node to the target node has been established and to indicate the route.

[0592] The communication device 50 may be used to implement the method on the target node side described in the embodiment of Figure 3. In the embodiment of Figure 3, the receiving unit 510 may be used to execute S305, and the sending unit 512 may be used to execute S306.

[0593] It should be understood that the division of the various units in the above devices (e.g., communication device 30, communication device 40, or communication device 50) is merely a division of logical functions. In actual implementation, they may be fully or partially integrated into a single physical entity, or they may be physically separated. Furthermore, the units in the device may be implemented in the form of a processor calling software; for example, the device includes a processor connected to a memory storing instructions, and the processor calls the instructions stored in the memory to implement any of the above methods or the functions of the various units of the device, where the processor is, for example, a general-purpose processor, such as a central processing unit (CPU) or a microprocessor, and the memory is memory within the device or memory external to 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 software called by the processor, and the rest by hardware circuits.

[0594] In an embodiment of the present application, a processor is a circuit with a signal processing capability. In one implementation, the processor can be a circuit with instruction reading and execution capability, 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 can implement certain functions through the logical relationship of a hardware circuit. The logical relationship of the hardware circuit is fixed or reconfigurable, such as a hardware circuit implemented by a processor as an application-specific integrated circuit (ASIC) or a programmable logic device (PLD), such as an FPGA. In a reconfigurable hardware circuit, the processor loads a configuration document to implement the process of hardware circuit configuration, which 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.

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

[0596] 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 FPGA, a CPU and an artificial intelligence processor, a CPU and a GPU, etc.

[0597] Referring to Figure 16 , Figure 16 illustrates a communication device according to an embodiment of the present application. As shown in Figure 16 , communication device 60 includes a processor 601, a communication interface 602, a memory 603, and a bus 604. Processor 601, memory 603, and communication interface 602 communicate with each other via bus 604. It should be understood that this application does not limit the number of processors and memories in communication device 60.

[0598] In one implementation, the communication device 60 may be the initiating node, forwarding node, or target node described above. The initiating node, forwarding node, or target node may be a network device with routing and forwarding capabilities, such as a wireless router, a wireless access point (AP), or a component within the network device, such as a single board, a line card, or a chip. It may also be a terminal device with routing and forwarding capabilities, such as a smart home device (such as a television, a robot vacuum, a smart desk lamp, an audio system, a smart lighting system, an appliance control system, home background music, a home theater system, an intercom system, a video surveillance system, etc.), an intelligent transportation device (such as a car, a ship, a drone, a train, a van, a truck, etc.), an intelligent manufacturing device (such as a robot, an industrial device, intelligent logistics, an intelligent factory, etc.), a user device (a mobile phone, a computer, a tablet computer, a PDA, a desktop computer, headphones, audio equipment, a wearable device, an in-vehicle device, a virtual reality device, an augmented reality device, etc.), or a component within the terminal device (such as a chip or an integrated circuit).

[0599] Bus 604 may be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, among others. Buses may be classified as address buses, data buses, control buses, and the like. For ease of illustration, FIG16 shows only one line, but this does not imply a single bus or type of bus. Bus 604 may include a path for transmitting information between the various components of communication device 60 (e.g., memory 603, processor 601, and communication interface 602).

[0600] The processor 601 can refer to the relevant description of the processor in the above embodiment, which will not be repeated here.

[0601] Memory 603 is used to provide storage space for data such as the operating system and computer programs. Memory 603 can be one or a combination of random access memory (RAM), erasable programmable read-only memory (EPROM), read-only memory (ROM), or compact disc read-only memory (CD-ROM). Memory 603 can exist independently or be integrated into processor 601.

[0602] The communication interface 602 can be used to provide information input or output for the processor 601. Alternatively, the communication interface 602 can be used to receive data transmitted externally and / or transmit data externally. It can be a wired link interface such as an Ethernet cable, or a wireless link interface (such as Wi-Fi, Bluetooth, general wireless transmission, etc.). Alternatively, the communication interface 602 can also include a transmitter (such as a radio frequency transmitter, antenna, etc.) or a receiver coupled to the interface.

[0603] The processor 601 in the communication device 60 is used to read the computer program stored in the memory 603 to execute the aforementioned method, such as the method described in FIG. 3 or FIG. 9 .

[0604] In one possible design, the communication device 60 may be one or more modules in an execution entity (e.g., an initiating node) that executes the method shown in FIG. 3 , and the processor 601 may be configured to read one or more computer programs stored in a memory to perform the following operations:

[0605] Generate a broadcast service frame, where the broadcast service frame is used to transmit the first service data from the initiating node to the target node in a broadcast form, and the broadcast service frame further includes first information, where the first information is used to request establishment of a route from the initiating node to the target node, where the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form;

[0606] The broadcast service frame is broadcasted through the sending unit 312 .

[0607] In one possible design, the communication device 60 may be one or more modules in an execution entity (e.g., a forwarding node) that executes the method shown in FIG. 3 , and the processor 601 may be configured to read one or more computer programs stored in a memory to perform the following operations:

[0608] A first broadcast service frame is received by the receiving unit 410. The first broadcast service frame is used to transmit first service data from the initiating node to the target node in a broadcast manner. The forwarding node where the communication device 60 is located is not the target node. The first broadcast service frame also includes first information. The first information is used to request establishment of a route from the initiating node to the target node. The route is used to transmit second service data from the initiating node to the target node in a non-broadcast manner.

[0609] generating a second broadcast service frame according to the first broadcast service frame;

[0610] The second broadcast service frame is broadcasted through the sending unit 414 .

[0611] In one possible design, the communication device 60 may be one or more modules in an execution entity (e.g., a target node) that executes the method shown in FIG. 3 , and the processor 601 may be configured to read one or more computer programs stored in a memory to perform the following operations:

[0612] Receiving, by the receiving unit 510, a broadcast service frame, where the broadcast service frame is used to transmit the first service data from the initiating node to the target node in a broadcast form, and the broadcast service frame further includes first information, where the first information is used to request establishment of a route from the initiating node to the target node, where the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form;

[0613] The sending unit 512 sends a route response frame based on the broadcast service frame. The route response frame includes second information. The second information is used to indicate that a route from the initiating node to the target node has been established and to indicate the route.

[0614] In the embodiments described above, the descriptions of each embodiment have their own emphasis. For parts not described in detail in a particular embodiment, please refer to the relevant descriptions of other embodiments. In addition, in the various embodiments of this application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between the various embodiments are consistent and can be referenced to each other. The technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0615] It should be noted that, those skilled in the art can see that all or part of the steps in the various methods of the above embodiments can be completed by a program to instruct relevant hardware. The program can be stored in a computer-readable storage medium, and the storage medium includes a read-only memory (ROM), a random access memory (RAM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), a one-time programmable read-only memory (OTPROM), an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, magnetic disk storage, magnetic tape storage, or any other computer-readable medium that can be used to carry or store data.

[0616] The technical solution of the present application may essentially or contribute to the part or all or part of the technical solution in the form of a software product. The computer program product is stored in a storage medium and includes a number of instructions for enabling a device (which may be a personal computer, a server, or a network device, a robot, a single-chip microcomputer, a chip, a robot, etc.) to execute all or part of the steps of the method described in each embodiment of the present application.

Claims

1. A data transmission method, characterized in that: The method is applied to an initiating node, and the method comprises: Generate a broadcast service frame, wherein the broadcast service frame is used to transmit the first service data from the initiating node to the target node in a broadcast form, and the broadcast service frame also includes first information, wherein the first information is used to request to establish a route from the initiating node to the target node, and the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form; The broadcast service frame is broadcasted.

2. The method according to claim 1, characterized in that The method further comprises: receiving a route response frame, the route response frame comprising second information, the second information being used to indicate that a route from the initiating node to the target node has been established and to indicate the route; The second service data is sent through the route.

3. The method according to claim 2, characterized in that The route response frame includes a first route response frame and a second route response frame, the first route response frame is used to indicate that a first route from the initiating node to the target node has been established and is used to indicate the first route, and the second route response frame is used to indicate that a second route from the initiating node to the target node has been established and is used to indicate the second route; The sending the second service data through the route includes: sending the second service data through at least one of the first route and the second route.

4. The method according to any one of claims 1 to 3, characterized in that: The broadcast service frame includes an extension field, and the first information is carried in the extension field in the broadcast service frame.

5. The method according to any one of claims 1 to 3, characterized in that: The broadcast service frame includes a network layer broadcast protocol message, the network layer broadcast protocol message includes a routing request message header, and the first information is carried in the routing request message header.

6. The method according to claim 5, characterized in that The network layer broadcast protocol message also includes a network layer message header and a network layer broadcast protocol message header, wherein the network layer message header indicates that the message header of the next layer message is the network layer broadcast protocol message header, and the network layer broadcast protocol message header indicates that the message header of the next layer message is the routing request message header.

7. The method according to any one of claims 1 to 6, characterized in that: The first information includes at least one of the following fields: A type field, where the type field is used to indicate that the type of the first information is a routing request; a message sequence number field, where the message sequence number field is used to indicate a sequence number of the first information determined by the initiating node; An initiating node address field, wherein the initiating node address field is used to indicate a network address of the initiating node; A target node address field, wherein the target node address field is used to indicate a network address of the target node; A path identification field, wherein the path identification field is used to indicate an identification of a path from the initiating node to the target node; a forwarding hop number field, where the forwarding hop number field is used to indicate the number of hops that the first information needs to go through from the initiating node to the current sender of the first information; and A link overhead field, where the link overhead field is used to indicate the total overhead of the link through which the first information passes from the initiating node to the current sender of the first information.

8. The method according to any one of claims 2 to 7, characterized in that: The routing response frame includes an extension field, and the second information is carried in the extension field in the routing response frame.

9. The method according to any one of claims 2 to 7, characterized in that: The routing response frame includes a first network layer unicast message, the first network layer unicast message includes a routing response message header, and the second information is carried in the routing response message header.

10. The method according to claim 9, characterized in that The first network layer unicast message also includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing response message header.

11. The method according to any one of claims 2 to 10, characterized in that: The second information includes at least one of the following fields: A type field, where the type field is used to indicate that the type of the second information is a routing response; a message sequence number field, where the message sequence number field is used to indicate a sequence number of the second information determined by the target node; An initiating node address field, wherein the initiating node address field is used to indicate a network address of the initiating node; A path identification field, wherein the path identification field is used to indicate an identification of a path from the initiating node to the target node; A path hop count field, the path hop count field is used to indicate the total number of hops of the path from the initiating node to the target node; and A path cost field, where the path cost field is used to indicate the cost of the path from the initiating node to the target node.

12. The method according to any one of claims 1 to 11, characterized in that: The method further comprises: receiving a routing fault frame from the first node, the routing fault frame comprising third information, the third information being used to indicate that a routing from the initiating node to the target node is faulty; According to the routing fault frame, the route in the routing table leading to the target node and whose next hop node of the initiating node is the first node is deleted.

13. The method according to claim 12, characterized in that The routing failure frame includes an extension field, and the third information is carried in the extension field in the routing failure frame.

14. The method according to claim 12, characterized in that The routing fault frame includes a second network layer unicast message, the second network layer unicast message includes a routing fault message header, and the third information is carried in the routing fault message header.

15. The method according to claim 14, characterized in that The second network layer unicast message also includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing fault message header.

16. The method according to any one of claims 12 to 15, characterized in that: The third information includes at least one of the following fields: A type field, where the type field is used to indicate that the type of the third information is a routing failure; A first field, the first field being used for the number of target nodes in the network affected by the failure; a second field, the second field being used to indicate a network address of a target node affected by the fault; and A third field is used to indicate an identifier of a path where a target node affected by the fault is located.

17. A data transmission method, characterized in that: The method is applied to a first node, and the method comprises: receiving a first broadcast service frame, the first broadcast service frame being used to transmit first service data from an initiating node to a target node in a broadcast form, the target node being not the first node, the first broadcast service frame further comprising first information, the first information being used to request establishment of a route from the initiating node to the target node, the route being used to transmit second service data from the initiating node to the target node in a non-broadcast form; generating a second broadcast service frame according to the first broadcast service frame; The second broadcast service frame is broadcast.

18. The method according to claim 17, characterized in that The method further comprises: Determine, according to the first broadcast service frame, a previous hop node of the first node on a first route from the first node to the initiating node; receiving a first route response frame, wherein the first route response frame includes second information, wherein the second information is used to indicate that a route from the initiating node to the target node has been established and to indicate the route; Sending a second route response frame to a previous hop node of the first node, where the second route response frame is generated based on the first route response frame.

19. The method according to claim 17 or 18, characterized in that The method further comprises: receiving a first route response frame, wherein the first route response frame includes second information, wherein the second information is used to indicate that a route from the initiating node to the target node has been established and to indicate the route; Determine, according to the first route response frame, a next hop node of the first node on a second route from the first node to the target node; receiving second service data; Send the second service data to a next-hop node of the first node.

20. The method according to claim 19, characterized in that The method further comprises: Determining that a first link from the first node to a second node fails, wherein the second node is a next hop node of the first node on the second route; If the next hop nodes of the first node in the route recorded in the routing table are all the second nodes, a first route fault frame is generated and sent, and the first route fault frame includes third information, and the third information is used to indicate that the route from the initiating node to the target node is faulty.

21. The method according to claim 19 or 20, characterized in that The method further comprises: receiving a second route fault frame from a third node, where the second route fault frame is used to indicate that a route from the initiating node to the target node is faulty; the third node is a next hop node of the first node on the route from the first node to the target node; Based on the second route fault frame, when the next hop nodes of the first node in the route to the target node recorded in the routing table are all the third nodes, a third route fault frame is sent, and the third route fault frame is used to indicate the route from the initiating node to the target node. The routing is faulty.

22. A data transmission method, characterized in that: The method is applied to a target node, and the method comprises: receiving a broadcast service frame, wherein the broadcast service frame is used to transmit first service data from an initiating node to the target node in a broadcast form, and the broadcast service frame further includes first information, wherein the first information is used to request to establish a route from the initiating node to the target node, and the route is used to transmit second service data from the initiating node to the target node in a non-broadcast form; A route response frame is sent based on the broadcast service frame, wherein the route response frame includes second information, and the second information is used to indicate that a route from the initiating node to the target node has been established and to indicate the route.

23. The method according to claim 22, characterized in that The method further comprises: The first service data is acquired from the broadcast service frame.

24. The method according to claim 22 or 23, characterized in that The broadcast service frame includes a first broadcast service frame and a second broadcast service frame, the first broadcast service frame comes from a first node, the second broadcast service frame comes from a second node, and the first node and the second node are neighbor nodes of the target node; The sending of a routing response frame based on the broadcast service frame comprises: Based on the first broadcast service frame, sending a first routing response frame to the first node, and Based on the second broadcast service frame, sending a second routing response frame to the second node; Among them, the first route response frame is used to indicate that a first route from the initiating node to the target node has been established and is used to indicate the first route, and the second route response frame is used to indicate that a second route from the initiating node to the target node has been established and is used to indicate the second route, the first route passes through the first node, and the second route passes through the second node.

25. The method according to any one of claims 22 to 24, characterized in that: The broadcast service frame includes an extension field, and the first information is carried in the extension field in the broadcast service frame.

26. The method according to any one of claims 22 to 24, characterized in that: The broadcast service frame includes a network layer broadcast protocol message, the network layer broadcast protocol message includes a routing request message header, and the first information is carried in the routing request message header.

27. The method according to claim 26, characterized in that The network layer broadcast protocol message also includes a network layer message header and a network layer broadcast protocol message header, wherein the network layer message header indicates that the message header of the next layer message is the network layer broadcast protocol message header, and the network layer broadcast protocol message header indicates that the message header of the next layer message is the routing request message header.

28. The method according to any one of claims 22 to 27, characterized in that: The first information includes at least one of the following fields: A type field, where the type field is used to indicate that the type of the first information is a routing request; a message sequence number field, where the message sequence number field is used to indicate a sequence number of the first information determined by the initiating node; An initiating node address field, wherein the initiating node address field is used to indicate a network address of the initiating node; A target node address field, wherein the target node address field is used to indicate a network address of the target node; A path identification field, wherein the path identification field is used to indicate an identification of a path from the initiating node to the target node; a forwarding hop number field, where the forwarding hop number field is used to indicate the number of hops that the first information needs to go through from the initiating node to the current sender of the first information; and A link overhead field, where the link overhead field is used to indicate the total overhead of the link through which the first information passes from the initiating node to the current sender of the first information.

29. The method according to any one of claims 22 to 28, characterized in that: The routing response frame includes an extension field, and the second information is carried in the extension field in the routing response frame.

30. The method according to any one of claims 22 to 28, characterized in that: The routing response frame includes a first network layer unicast message, the first network layer unicast message includes a routing response message header, and the second information is carried in the routing response message header.

31. The method according to claim 30, characterized in that The first network layer unicast message also includes a network layer message header, and the network layer message header indicates that the message header of the next layer message is the routing response message header.

32. The method according to any one of claims 22 to 31, characterized in that: The second information includes at least one of the following fields: A type field, where the type field is used to indicate that the type of the second information is a routing response; a message sequence number field, where the message sequence number field is used to indicate a sequence number of the second information determined by the target node; An initiating node address field, wherein the initiating node address field is used to indicate a network address of the initiating node; A path identification field, wherein the path identification field is used to indicate an identification of a path from the initiating node to the target node; A path hop count field, the path hop count field is used to indicate the total number of hops of the path from the initiating node to the target node; and A path cost field, where the path cost field is used to indicate the cost of the path from the initiating node to the target node.

33. A data transmission device, characterized in that: The device is an initiating node or is included in the initiating node, and the device includes: a generating unit, configured to generate a broadcast service frame, wherein the broadcast service frame is used to transmit the first service data from the initiating node to the target node in a broadcast form, and the broadcast service frame further includes first information, wherein the first information is used to request to establish a route from the initiating node to the target node, and the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form; A sending unit is used to broadcast the broadcast service frame.

34. A data transmission device, characterized in that: The device is a first node or is included in the first node, and the device includes: a receiving unit, configured to receive a first broadcast service frame, wherein the first broadcast service frame is used to transmit first service data from an initiating node to a target node in a broadcast form, wherein the target node is not the first node, and wherein the first broadcast service frame further comprises first information, wherein the first information is used to request establishment of a route from the initiating node to the target node, wherein the route is used to transmit second service data from the initiating node to the target node in a non-broadcast form; A processing unit, configured to generate a second broadcast service frame according to the first broadcast service frame; A sending unit is used to broadcast the second broadcast service frame.

35. A data transmission device, characterized in that: The device is a target node or is included in the target node, and the device includes: a receiving unit, configured to receive a broadcast service frame, wherein the broadcast service frame is used to transmit the first service data from the initiating node to the target node in a broadcast form, and the broadcast service frame further includes first information, wherein the first information is used to request to establish a route from the initiating node to the target node, and the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form; A sending unit sends a route response frame based on the broadcast service frame, wherein the route response frame includes second information, and the second information is used to indicate that a route from the initiating node to the target node has been established and to indicate the route.

36. A communication device, characterized in that: It includes a processor, a transceiver and a memory; the memory is used to store instructions, the processor is used to execute the instructions, and the transceiver is used to communicate with other devices under the control of the processor; wherein, when the processor executes the instructions, it performs the method described in any one of claims 1-16 or 17-21 or 22-32.

37. A communication system, characterized in that: The communication system includes a first device, at least one second device and a third device, wherein the first device is used to execute the method as described in any one of claims 1-16, the second device is used to execute the method as described in any one of claims 17-21, and the third device is used to execute the method as described in any one of claims 22-32.

38. A vehicle, characterized in that: The vehicle comprises the apparatus as claimed in any one of claims 33-36, or comprises the communication system as claimed in claim 37.

39. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and the computer program is executed by a processor to implement the method according to any one of claims 1-16, 17-21 or 22-32.

Citation Information

Patent Citations

  • Ad-hoc network on-demand routing method and device supporting IP unvarnished transmission and computer equipment

    CN111711571A

  • Broadcast and route hybrid transmission method and system in wireless Mesh network

    CN111757413A

  • High-dynamic on-demand routing method for ad hoc network, communication node and storage medium

    CN115941584A

  • System and method for link quality source routing

    US20050185632A1

Cited By

  • Aircraft electromechanical system built-in wireless communication system and communication method

    CN119370315A

  • Heterogeneous wireless network transmission resource scheduling method, system and device and storage medium

    CN121012784A

  • Tracking information transmission system and method, storage medium and integrated circuit product

    CN121116765A