Data transmission method and device

The data transmission method addresses the inefficiencies of existing routing protocols by using broadcast service frames to establish routes concurrently with data transmission, reducing resource overhead and delay in wireless networks.

CN119071206APending Publication Date: 2024-12-03HUAWEI TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310639149.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-31
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

Existing routing protocols in wireless networks face challenges in balancing network resource overhead and transmission delay, with proactive protocols causing excessive resource consumption and reactive protocols leading to long waiting times for data transmission.

Method used

A data transmission method involving broadcast service frames that request route establishment while transmitting data, allowing for reduced waiting times and resource usage by utilizing both broadcast and non-broadcast forms of communication.

Benefits of technology

This method reduces network resource overhead and transmission delay by establishing routes efficiently, minimizing power consumption and resource usage while ensuring reliable data transmission.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119071206A_ABST
    Figure CN119071206A_ABST
Patent Text Reader

Abstract

The invention discloses a data transmission method and device, and the method comprises the steps that an initiating node generates a broadcast service frame and broadcasts the broadcast service frame, the broadcast service frame is used for transmitting first service data from the initiating node to a target node in a broadcast mode, and the broadcast service frame further comprises first information, the first information is used for requesting to establish a route from the initiating node to the target node, and the route is used for transmitting the second service data from the initiating node to the target node in a non-broadcast form. Therefore, the transmission of the first service data is realized while the route from the initiating node to the target node is established, and compared with the route established by adopting a reactive routing protocol, the waiting time delay of the first packet service data transmission can be reduced; compared with the prior art that routing is established by adopting a pre-response routing protocol, the overhead of network resources can also be reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

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

[0002] When using proactive routing protocols to establish routes, routing nodes need to maintain local routing tables by regularly sending control messages, resulting in large wireless resource overhead and fast power failure of routing nodes. When using reactive routing protocols to establish routes, there will be a delay in route establishment, resulting in a long waiting time for service data transmission.

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

[0004] 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 service data transmission.

[0005] 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 a target node in a broadcast form, and the broadcast service frame also includes first information, and 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; broadcasting the broadcast service frame.

[0006] Here, the initiating 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 in the network device, such as a single board, a line card, a chip, etc. The initiating node may also be a terminal device with routing and forwarding capabilities, such as a smart home device (such as a TV, a sweeping robot, a smart desk lamp, a sound system, a smart lighting system, an electrical control system, a home background music, a home theater system, an intercom system, a video surveillance system, etc.), a smart transportation device (such as a car, a ship, a drone, a train, a van, a truck, etc.), a smart manufacturing device (such as a robot, an industrial device, a smart logistics, a smart factory, etc.), a user device (a mobile phone, a computer, a tablet computer, a PDA, a desktop computer, a headset, a sound system, a wearable device, a vehicle-mounted device, a virtual reality device, an augmented reality device, etc.), or a component in the terminal device (such as a chip or an integrated circuit).

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

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

[0009] In this application, a route can also be understood as a path.

[0010] 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 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; broadcasting the broadcast service frame.

[0011] 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. The business data can be transmitted while the route is established. Compared with the use of a reactive routing protocol to establish a route, the transmission waiting delay of the first packet of business data can be reduced; compared with the use of a proactive routing protocol to establish a route, there is no need to establish a route 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 can not only save the power consumption of network equipment, but also greatly reduce the overhead of network resources.

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

[0013] 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 of the route from the initiating node to the target node and the cost of the route, or the second information may indicate the route by recording each node 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 current 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. The initiating node can implement the 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.

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

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

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

[0017] Here, the initiating node receives the routing response frame, and the so-called established routing can be understood as: the routing can realize the sending of the second service 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, and the forward routing table can guide the local node to send the service data.

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

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

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

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

[0022] Here, the initiating node receives multiple route response frames (i.e., the first route response frame and the second route response frame), which means that multiple routes are 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 can be 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 values ​​of the path hop number field and / or the path cost field in the second information of different route response frames are different. Here, the path hop number field and the path cost field can be referred to the description of the corresponding content below, which will not be repeated here.

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

[0024] Here, the cost of the 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. The cost of the route is used to measure the cost of the initiating node to reach the target node. When there are multiple routes from the initiating node to the target node, the route corresponding to the minimum route cost can be called the best route from the initiating node to the target node. Here, the cost of the route can also be called the cost of the path.

[0025] The link cost is a metric value of the link. The link cost may be, for example, the power consumption of the link, the transmission delay of the link, or the packet loss rate of the link. In another implementation, the link cost may also be determined based on at least one of the power consumption of the link, the transmission delay of the link, or the packet loss rate of the link.

[0026] 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:

[0027] Mode 1: Send the second service data through the first route. In this case, the second route can be used as a backup route or redundant route for the first route. For example, when the first route fails, the second service data can be sent from the first route to the second route, thereby improving the reliability of data transmission.

[0028] Mode 2: Send the second service data through the second route. In this case, the first route can be used as a backup route or redundant route for the second route. For example, when the second route fails, the second service data can be sent by switching from the second route to the first route, thereby improving the reliability of data transmission.

[0029] Mode 3: Send the second service data through the first route and the second route. In this case, even if one of the first route and the second route fails, the second service data can be transmitted to the target node through the route that is not failed in the first route and the second route, thereby realizing redundant transmission of data and improving the reliability of data transmission.

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

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

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

[0033] Here, the transmission channel is the basic path for the basic service layer to transmit, and its transmission process is based on this transmission channel. The transmission channel can be mapped to the logical link of the Star Flash access layer. The mapping can be one-to-one mapping, many-to-one mapping, or one-to-many mapping. The transmission mode is a series of processing methods for data when the basic service layer transmits, including packetization, packet aggregation, response, retransmission, etc. Each transmission channel will adopt a transmission mode for transmission.

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

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

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

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

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

[0039] 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;

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

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

[0042] 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;

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

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

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

[0046] Exemplarily, when the initiating node generates the first information, the forwarding hop number field has a value of 0 and the link cost field has a value of 0. The value of the forwarding hop number field in the first information will increase by 1 node by node as the forwarding node broadcasts during the route discovery process from the initiating node to the target node. Accordingly, the value of the link cost field in the first information will also change with the change of the value of the forwarding hop number field. 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 information remain unchanged during the route discovery process.

[0047] Exemplarily, for the above-mentioned path identifier field, there may be multiple paths (or routes) from the same initiating node to the same target node, and these multiple paths may share the same path identifier.

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

[0049] 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 refer to the description of the above corresponding content, which will not be repeated here.

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

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

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

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

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

[0055] 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;

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

[0057] 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;

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

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

[0060] For example, the second information indicates the route from the initiating node to the target node through the above-mentioned path identification field and path hop number field. It can be seen that in the case where there are multiple routes from the initiating node to the target node, the above-mentioned path hop number field and path cost field can be used to distinguish different routes from the initiating node to the target node.

[0061] 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; based on the routing fault frame, deleting the route in the routing table that leads to the target node and whose next hop node is the first node.

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

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

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

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

[0066] 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 to which, the number of hops of the route and the cost of the route can also be stored. In some possible implementations, relevant information (such as network address, identification, etc.) of each node in the routing path 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.

[0067] As an example, the local routing table of the initiating node can be 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 initiating node, the number of hops of the first path from the initiating node to the target node, and the corresponding relationship between the cost of the first path. Here, the local routing table of the initiating node is not limited to recording 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 corresponding relationship between the cost of the first path. The routing table can enable the initiating node to determine the next hop node of the initiating node leading to the target node based on the network address of the given target node, and does not limit the specific form of the local routing table of the initiating node.

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

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

[0070] 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 refer to the description of the above corresponding content, which will not be repeated here.

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

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

[0073] The implementation manner described above provides multiple references for the carrying form of the third information in the routing fault frame.

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

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

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

[0077] a second field, the second field being used to indicate a network address of a target node affected by the failure; and

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

[0079] By implementing the above implementation, the initiating node can at least know the target node affected by the fault through the third information, so as to effectively deal with the fault.

[0080] In a 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.

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

[0082] Exemplarily, 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 in 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 TV, a sweeping robot, a smart desk lamp, a sound system, a smart lighting system, an electrical appliance control system, home background music, a home theater system, an intercom system, a video surveillance system, etc.), a smart transportation device (such as a car, a ship, a drone, a train, a van, a truck, etc.), a smart manufacturing device (such as a robot, an industrial equipment, a smart logistics, a smart factory, etc.), a user device (a mobile phone, a computer, a tablet computer, a PDA, a desktop computer, a headset, a sound system, a wearable device, a vehicle-mounted device, a virtual reality device, an augmented reality device, etc.), or a component in the terminal device (such as a chip or an integrated circuit).

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

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

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

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

[0087] Exemplarily, 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.

[0088] In the above method, during the route discovery process, if the forwarding node receives a broadcast service frame carrying service data and route request information, it still transmits the broadcast service frame carrying the service data and the updated route request information in the form of broadcast, and the service data is also transmitted while the route is established. Compared with the use of reactive routing protocols to establish routes, the waiting delay of the first packet of service data transmission can be reduced; compared with the use of proactive routing protocols to establish routes, local nodes do not need to send routing control messages regularly to maintain routing tables, which can not only save the power consumption of network equipment, but also greatly reduce the overhead of network resources.

[0089] Optionally, the method also includes: determining, based on the first broadcast service frame, the previous hop node of the first node on the first route from the first node to the initiating node; 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 for indicating 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.

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

[0091] For example, assuming 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, and 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.

[0092] 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, the logical channel identifier and the 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, the logical channel identifier and the sender's layer 2 identifier in the second routing response frame.

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

[0094] 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 a 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, a next hop node of the first node on a 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.

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

[0096] By implementing the above 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.

[0097] Optionally, the method also includes: determining that a first link from the first node to the second node is faulty, 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 is faulty.

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

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

[0100] 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 for the first node to send the second service data subsequently received to the next hop node of the first node leading to the target node.

[0101] As an example, the local routing table of the first node is 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 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 overhead from the first node to the target node on the first path.

[0102] Here, the local routing table of the first node is not limited to a form that records 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 corresponding relationship between the cost from the first node to the target node on the first path. The routing table 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 the given target node, and the specific form of the local routing table of the first node is not limited.

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

[0104] Taking deleting invalid routes in the routing table as an example, the first node needs to delete the route whose next hop node is the second node from the routing table. Assuming that the routing table includes route 1 leading to node E and whose next hop node is the second node, and route 2 leading to node D and whose next hop node is the second node, deleting the route whose next hop node is the second node in the routing table means that both route 1 and route 2 in the routing table are deleted.

[0105] When the above implementation method is implemented, when the first node detects that the link where 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.

[0106] 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 is 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 the third node, sending a third routing fault frame being used to indicate that the route from the initiating node to the target node is faulty.

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

[0108] Taking deleting invalid routes in the routing table as an example, the first node needs to delete the route leading to the target node and the next hop node of the first node is the second node from the routing table. Assuming that the routing table includes route 1 leading to node E and the next hop node is the second node and route 2 leading to node D and the next hop node is the second node, if the target node is node D, then deleting the route leading to the target node and the next hop node of the first node is the second node in the routing table means that only route 2 is deleted in the routing table.

[0109] Exemplarily, the third routing fault frame is generated based on the second routing fault frame. Compared with the second routing fault frame, the transmission channel identifier, the logical channel identifier and the layer 2 identifier of the sender in the third routing fault frame are all associated with the first node, so that the receiver of the third routing fault frame identifies the sender of the third routing fault frame as the first node based on at least one of the transmission channel identifier, the logical channel identifier and the layer 2 identifier of the sender in the third routing fault frame.

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

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

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

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

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

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

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

[0117] 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;

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

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

[0120] 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;

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

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

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

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

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

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

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

[0128] 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;

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

[0130] 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;

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

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

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

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

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

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

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

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

[0139] a second field, the second field being used to indicate a network address of a target node affected by the failure; and

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

[0141] 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, the broadcast service frame is used to transmit first service data from an initiating node to the target node in a broadcast form, the broadcast service frame also includes first information, 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, 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.

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

[0143] Here, the target 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 in the network device, such as a single board, a line card, a chip, etc. The target node may also be a terminal device with routing and forwarding capabilities, such as a smart home device (such as a TV, a sweeping robot, a smart desk lamp, a sound system, a smart lighting system, an electrical control system, a home background music, a home theater system, an intercom system, a video surveillance system, etc.), a smart transportation device (such as a car, a ship, a drone, a train, a van, a truck, etc.), a smart manufacturing device (such as a robot, an industrial device, a smart logistics, a smart factory, etc.), a user device (a mobile phone, a computer, a tablet computer, a PDA, a desktop computer, a headset, a sound system, a wearable device, a vehicle-mounted device, a virtual reality device, an augmented reality device, etc.), or a component in the terminal device (such as a chip or an integrated circuit).

[0144] 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, and 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 with the use of a reactive routing protocol to establish a route, the waiting delay for the transmission of the first packet of service data can be reduced; compared with the use of 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 can not only save the power consumption of network equipment, but also greatly reduce the overhead of network resources.

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

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

[0147] 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 of a route response frame based on the broadcast service frame includes: based on the first broadcast service frame, sending a first route response frame to the first node, and based on the second broadcast service frame, sending a second route response frame to the second node; 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.

[0148] Here, the first route is different from the second route, which is manifested as: 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 refer to the description of the corresponding content in the first aspect above, which will not be repeated here.

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

[0150] 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 the second service data) and is conducive to improving the reliability of data transmission.

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

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

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

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

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

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

[0157] 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;

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

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

[0160] 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;

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

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

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

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

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

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

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

[0168] 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;

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

[0170] 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;

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

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

[0173] 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, which is used to generate a broadcast service frame, and 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 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, which is used to broadcast the broadcast service frame.

[0174] Optionally, the receiving unit is also 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 also used to: send the second service data via the route.

[0175] 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 service data through at least one of the first route and the second route.

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

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

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

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

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

[0181] 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;

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

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

[0184] 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;

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

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

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

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

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

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

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

[0192] 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;

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

[0194] 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;

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

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

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

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

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

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

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

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

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

[0204] a second field, the second field being used to indicate a network address of a target node affected by the failure; and

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

[0206] 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, used to receive 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; a processing unit, used to generate a second broadcast service frame based on the first broadcast service frame; a sending unit, used to broadcast the second broadcast service frame.

[0207] 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 includes second information, 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; 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 is generated based on the first route response frame.

[0208] Optionally, the receiving unit is also used to receive a first route response frame, the first route response frame includes second information, 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; 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 service data; the sending unit is also used to send the second service data to the next hop node of the first node.

[0209] 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 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; the sending unit is also used to send the first route fault frame.

[0210] 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 being used to indicate that the route from the initiating node to the target node is faulty.

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

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

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

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

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

[0216] 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;

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

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

[0219] 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;

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

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

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

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

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

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

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

[0227] 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;

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

[0229] 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;

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

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

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

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

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

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

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

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

[0238] a second field, the second field being used to indicate a network address of a target node affected by the failure; and

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

[0240] 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, which is used to receive a broadcast service frame, and 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 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, 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.

[0241] Optionally, the device further includes a processing unit, and the processing unit is used to obtain the first service data from the broadcast service frame.

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

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

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

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

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

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

[0248] 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;

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

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

[0251] 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;

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

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

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

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

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

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

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

[0259] 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;

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

[0261] 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;

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

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

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

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

[0266] In a ninth aspect, the present application provides a vehicle, which includes the communication system described in the eighth aspect.

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

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

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

[0270] Figure 1 It is a schematic diagram of the architecture of a communication system provided by an embodiment of the present application;

[0271] Figure 2A This is a schematic diagram of the format of a routing request information provided by an embodiment of the present application;

[0272] Figure 2B This is a schematic diagram of the format of a routing response information provided by an embodiment of the present application;

[0273] Figure 3 is a flow chart of a data transmission method provided in an embodiment of the present application;

[0274] Figure 4 It is a format diagram of a basic service layer basic frame provided in an embodiment of the present application;

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

[0276] Figure 6 is a schematic diagram of another communication system provided in an embodiment of the present application;

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

[0278] Figure 8 This is a schematic diagram of the format of routing fault information provided by an embodiment of the present application;

[0279] Fig. 9 is a flowchart of another data transmission method provided in an embodiment of the present application;

[0280] Fig.10 It is a schematic diagram of the format of a network layer unicast message carrying routing fault information provided by an embodiment of the present application;

[0281] Fig.11 A schematic diagram of a network failure provided in an embodiment of the present application;

[0282] Fig.12 is a schematic diagram of another network failure provided in an embodiment of the present application;

[0283] Fig.13 is a structural diagram of a communication device provided in this embodiment of the present application;

[0284] Fig.14 is a structural diagram of another communication device provided in this embodiment of the present application;

[0285] Fig.15 is a structural diagram of another communication device provided in this embodiment of the present application;

[0286] Fig.16 It is a structural diagram of a communication device provided in this embodiment of the present application. DETAILED DESCRIPTION

[0287] It should be noted that the prefixes such as "first" and "second" used in this application are only used to distinguish different description objects, and have no limiting effect on the position, order, priority, quantity or content of the described objects. For example, if the described object is a "field", the ordinal number before the "field" in the "first field" and the "second field" does not limit the position or order between the "fields". "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", 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 object being described 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 object being described 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 used to distinguish the described objects in the embodiments of the present application does not constitute a limitation on the described objects. For the statement of the described objects, refer to the description in the context of the claims or embodiments, and no unnecessary limitation should be constituted due to the use of such prefixes.

[0288] It should be noted that the description methods such as "at least one of a1, a2, ... and an" used in the embodiments of the present application include the situation where any one of a1, a2, ... and an exists alone, and also include any combination of any multiple of a1, a2, ... and an, and each situation can exist alone. For example, the description method of "at least one of a, b and c" includes the situation where a is alone, b is alone, c is alone, a combination of a and b, a combination of a and c, b and c, or a combination of abc.

[0289] See also Figure 1 , Figure 1 It is a schematic diagram of the architecture of a communication system provided by 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 the route 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 the route discovery, and the target node is the end node of the route discovery.

[0290] exist Figure 1In the communication system, the initiating node, at least one forwarding node and a target node. Here, the initiating node, the forwarding node or the target 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 in 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 a smart home device (such as a TV, a sweeping robot, a smart desk lamp, an audio system, a smart lighting system, an electrical control system, a 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 truck, a truck, etc.), an intelligent manufacturing device (such as a robot, an industrial equipment, an intelligent logistics, an intelligent factory, etc.), a user device (a mobile phone, a computer, a tablet computer, a PDA, a desktop computer, a headset, an audio device, a wearable device, an in-vehicle device, a virtual reality device, an augmented reality device, etc.), or a component in the terminal device (such as a chip or an integrated circuit).

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

[0292] For example, in Figure 1 In the example, node S triggers the establishment of a route based on business data. For example, when node S needs to send business data to node D, but node S has not established a route from node S to node D locally, node S can start route discovery based on the transmission of business data to establish a route from node S to node D. The process can be:

[0293] 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 to establish a route from node S to node D;

[0294] for Figure 1 Any forwarding node in the broadcast service frame, if the forwarding node receives the broadcast service frame, it means 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. The update of the broadcast service frame by the forwarding node can refer to the following Figure 3 Description of the embodiments;

[0295] According to the above method, the broadcast service frame is broadcasted through node S and at least one forwarding node, and finally node D can receive the broadcast service frame from its neighbor node (the neighbor node belongs to Figure 1 At least one forwarding node in the node receives the broadcast service frame broadcast by the neighbor node, and 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, and 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. During the process of transmitting the route response frame from node D to node S based on the local reverse routing table of the node, each node passed along the way also establishes a forward routing table locally. The local forward routing table of the node is used to record the set of routes from the node to the target node. The local forward routing table of the node can be used to guide the sending of subsequent business data. In this way, 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, and for the sake of brevity of the specification, it will not be repeated here.

[0296] Figure 1 The communication system shown can be applied to a variety of application scenarios, such as the following application scenarios: mobile internet (MI), industrial control, self driving, transportation safety, internet of things (IoT), smart city, or smart home, etc.

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

[0298] It can be understood that the initiating node, target node and forwarding node mentioned above are all nodes, and a node is a name for an electronic device with forwarding capability. In some application scenarios or certain network types, the name of a device with similar forwarding capability may not be called a node, for example, it may be called a device, which is not specifically limited here.

[0299] here, Figure 1 The network address of the node shown may be a network layer address, for example, its length may be 2 bytes (ie, 16 bits), and may be used for addressing in a corresponding communication system. Figure 1 The address types of the initiating node, forwarding node and target node shown may be Star Flash network addresses. It can be understood that the Star Flash network address is another address type different from the IP address.

[0300] It should be noted that Figure 1 This is only an exemplary architecture diagram, but not limited to Figure 1 The system shown includes the number of network elements. Figure 1 Not shown, but except Figure 1 In addition to the functional entities shown, Figure 1 Other functional entities may also be included. In addition, the method provided in the embodiment of the present application can be applied to Figure 1 The communication system shown, of course, the method provided in the embodiment of the present application can also be applied to other communication systems, and the embodiment of the present application is not limited to this.

[0301] based on Figure 1 As shown in the architectural diagram, the embodiment of the present application provides a data transmission method, which can realize the transmission of business data while realizing route establishment. Compared with the method of using a proactive routing protocol to establish a route, the embodiment of the present application can reduce the overhead of network resources; compared with the method of using a reactive routing protocol to establish a route, the embodiment of the present application can also reduce the waiting delay of the first packet of business data transmission.

[0302] The data transmission method provided in the embodiment of the present application needs to rely on at least routing request (RREQ) information and routing response (RREP) information to be implemented. Before introducing the data transmission method provided in the embodiment of the present application, the format of the routing request information and routing response information involved in the embodiment of the present application is 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.

[0303] The following is based on Figure 2A Describes routing request information. Figure 2A , Figure 2A This is a schematic diagram of the format of a routing request information provided in an embodiment of the present application:

[0304] 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 until the target node also receives the route request message. The broadcast of the route request message can establish a reverse route. The reverse route refers to the route from the target node to the initiating node. The reverse route can be used to send the route response message sent by the target node in response to the route request message back to the initiating node. Here, the initiating node, forwarding node, and target node can refer to Figure 1 The description of the corresponding contents will not be repeated here.

[0305] For example, Figure 2A As shown, the routing request information includes at least one of the following fields:

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

[0307] 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;

[0308] Initiating Node Address: This field indicates the network address of the initiating node;

[0309] Target Node Address: This field indicates the network address of the target node;

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

[0311] Forwarding hop count: This field indicates the number of hops that the route request information needs to go through from the originating node to the current sender of the route request information; and

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

[0313] Here, the link cost is a metric value of the link. The link cost may be, for example, the power consumption of the link, the transmission delay of the link, or the packet loss rate of the link. In some possible embodiments, the link cost may also be determined based on at least one of the power consumption of the link, the transmission delay of the link, or the packet loss rate of the link.

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

[0315] It can be understood that when the initiating node generates the route request information, the forwarding hop field value is 0 and the link cost field value is 0, but the value of the forwarding hop field in the route request information will increase by 1 node by node as each forwarding node on the path from the initiating node to the target node broadcasts, and accordingly, the value of the link cost field in the route request information will also change with the change of the value of the forwarding hop 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 information remain unchanged during the route discovery process.

[0316] Exemplarily, for the path identifier field in the routing request information, there may be multiple paths (or routes) from the same initiating node to the same target node, and these multiple paths may share the same path identifier.

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

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

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

[0320] In some possible embodiments, the routing request information may be represented by a type-length-value TLV field, such as Figure 2A As shown, 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, the value field is used to carry the content of the routing request information, and the value field includes the message sequence number, reservation, initiating node address, target node address, path identifier, message validity period, forwarding hop count and link overhead.

[0321] For example, in Figure 2A The length of each field in the routing request information can be: type (8 bits), length (8 bits), message sequence number (8 bits), reserved (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).

[0322] Understandably, Figure 2A The format of the routing request information shown is only an example. The embodiment of the present application does not limit the format of the routing request information to only Figure 2A In some possible embodiments, the number of fields in the routing request information may be less than Figure 2AThe number of fields shown, for example, one or more of the reserved fields, message validity period fields, etc. may be omitted. In some possible embodiments, the number of fields in the routing request information may be more than Figure 2A The number of fields shown is not specifically limited here.

[0323] The following is based on Figure 2B Describe the routing response information in the embodiment of the present application. Figure 2B , Figure 2B This is a schematic diagram of the format of a routing response information provided in an embodiment of the present application:

[0324] In the embodiment of the present application, the route response information is generated by the target node in the network. The route response information is used to indicate that the route from the initiating node to the target node has been established and to indicate the route. The route response information is sent by the target node along the reverse route. The route response information can realize the establishment of the forward route in the process of being sent back to the initiating node. The forward route refers to the route from the initiating node to the target node. The forward route can guide the transmission of business data.

[0325] For example, Figure 2B As shown, the routing response information includes at least one of the following fields:

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

[0327] 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;

[0328] Initiating Node Address: This field indicates the network address of the initiating node;

[0329] Target Node Address: This field indicates the network address of the target node;

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

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

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

[0333] Here, the path cost refers to the sum of the costs of each link in a path from the initiating node to the target node. The path cost is used to measure the cost of the initiating node to reach the target node. When there are multiple paths from the initiating node to the target node, the path corresponding to the minimum path cost can be called the best path from the initiating node to the target node.

[0334] Exemplarily, the route response information indicates the route from the initiating node to the target node through the above-mentioned path identification field and path hop number field. It can be understood that when there are multiple paths (or routes) from the initiating node to the target node, the path identification field and the path hop number field can distinguish different paths from the initiating node to the target node.

[0335] Exemplarily, 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 identification field, the path hop number field and the path cost field remain unchanged.

[0336] 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:

[0337] 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

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

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

[0340] For example, in Figure 2B The length of each field in the routing response information can be: type (8 bits), length (8 bits), message sequence number (8 bits), reserved (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).

[0341] Understandably, Figure 2B The format of the routing response information shown is only an example. The embodiment of the present application does not limit the format of the routing response information to only Figure 2B In some possible embodiments, the number of fields in the routing response information may be less than Figure 2B The number of fields shown, for example, one or more of the reserved fields, message validity period fields, etc. may be omitted. In some possible embodiments, the number of fields in the routing response information may be more than Figure 2B The number of fields shown is not specifically limited here.

[0342] based on Figure 2A The routing request information shown and Figure 2B The routing response information shown is shown in Figure 3 , Figure 3 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, Figure 1 The communication system shown. The method includes but is not limited to the following steps:

[0343] 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 to establish a route from the initiating node to the target node.

[0344] Here, the 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). Figure 1 For the sake of brevity of the specification, the corresponding contents will not be repeated here.

[0345] Exemplarily, the first information is the above-mentioned routing request information, and reference may be made to the relevant description of the above-mentioned routing request information. The format of the first information may be, for example, Figure 2A The format shown is not repeated here.

[0346] In one implementation, generating a broadcast service frame 1 includes: generating a broadcast service frame 1 based on a demand for sending service data to a target node. In this way, the establishment of a route is triggered based on the service data, that is, by carrying route request information in the broadcast service frame, compared with the reactive routing protocol using the broadcast route request information to establish a route, while achieving route establishment, the waiting delay of the first packet of service data transmission can be reduced.

[0347] The following specifically describes the carrying manner of the first information in the broadcast service frame 1, and provides the following two exemplary embodiments:

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

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

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

[0351] Here, the transmission channel is the basic path for the basic service layer to transmit, and its transmission process is based on this transmission channel. The transmission channel can be mapped to the logical link of the Star Flash access layer, and the mapping can be one-to-one mapping, many-to-one mapping, or one-to-many mapping. The transmission mode is a series of processing methods for data when the basic service layer transmits, including packetization, packet aggregation, response, retransmission, etc. Each transmission channel will adopt a transmission mode for transmission.

[0352] See also Figure 4 , Figure 4 Schematic diagram of the format of a basic service layer basic frame provided in an embodiment of the present application. Figure 4 It can be seen that the basic service layer basic frame includes the following fields:

[0353] Transmission channel identifier (TCID): used to indicate the transmission channel identifier, with a length of 8 bits; for example, when the value of this field is 0x01 to 0x1F, it indicates a fixed transmission channel identifier; when the value is 0x20 to 0x4F, it indicates broadcast dynamic allocation; when the value is 0x50 to 0x7F, it indicates multicast dynamic allocation; when the value is 0x80 to 0xDF, it indicates unicast dynamic allocation;

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

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

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

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

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

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

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

[0361] Data information: variable length, used to carry service data; and

[0362] CRC: used to carry the CRC check value.

[0363] Exemplarily, the first information in the broadcast service frame 1 may be carried in Figure 4 In the extended field of the basic service layer basic frame shown in FIG. 1 , the service data in the broadcast service frame 1 is carried in Figure 4 In the data information field of the basic service layer basic frame shown.

[0364] In one implementation, the broadcast service frame adopts Figure 4 When the format of the basic service layer basic frame shown is encapsulated, the broadcast service frame 1 includes an extension field, and the first information can be carried in the extension field in 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 in the broadcast service frame 1.

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

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

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

[0368] See also Figure 5 , Figure 5 Schematic diagram of the format of a network layer broadcast protocol message for carrying routing request information and service data provided by an embodiment of the present application. Figure 5 It can be seen that the network layer broadcast protocol message includes a network layer message header, a network layer broadcast protocol message header (referred to as a broadcast header), a routing request message header (referred to as a routing request header) and a load field, wherein the first information (i.e., including Figure 5 The content shown in the gray rectangle in the middle) is carried in the routing request header.

[0369] exist Figure 5 In the embodiment, the positional relationship among the network layer header, the broadcast header and the routing request header can be: 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.

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

[0371] The following are respectively explained Figure 5 The meaning of each field in the network layer message header, broadcast header and routing request header.

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

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

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

[0375] Topology 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, that is, a topology that meets QoS requirements for applications. The length is, for example, 2 bits.

[0376] Flow label: a flow label indicating the data flow to which the message belongs; the length is, for example, 19 bits;

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

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

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

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

[0381] Destination address: indicates the destination node address for receiving and processing the message; Figure 5 In the , this field indicates a broadcast address; the length is, for example, 16 bits.

[0382] exist Figure 5 The broadcast header includes the following fields:

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

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

[0385] ACK: In reliability broadcast, the receiving end sends a unicast response ACK message to the sending end, ACK is set to 1, and ACK is set to 0 in other cases; the length is, for example, 1 bit;

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

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

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

[0389] exist Figure 5 In the routing request header, the next header field and the first information are included. The message format of the first information can be specifically referred to above. Figure 2A For the sake of brevity of the specification, the description will not be repeated here.

[0390] For example, for any of the above-mentioned bearer modes, when the initiating node generates a broadcast service frame, the filling method of each field in the first information can be: based on Figure 2A In the routing request information shown, 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 cost field" to "0". In addition, the initiating node also fills in the "type", "message sequence number", "path identifier", "message validity period" and other fields.

[0391] S302: The initiating node broadcasts the above-mentioned broadcast service frame 1.

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

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

[0394] Exemplarily, 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 means 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 means that node 1 is a neighbor node of the initiating node, or node 1 is the next hop node of the initiating node.

[0395] Exemplarily, the forwarding node receives a broadcast service frame, and based on at least one of the transport channel identifier (TCID), logical channel identifier (LCID), layer 2 identifier of the node broadcasting the broadcast service frame and the local node neighbor table, the node broadcasting the broadcast service frame can be determined, that is, the forwarding node knows which neighbor node of the broadcast service frame comes from. 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.

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

[0397] In one implementation, in order to avoid repeated processing of the first information by the forwarding node, the above-mentioned for any forwarding node among at least one forwarding node, if a broadcast service frame is received, the broadcast service frame is updated and the updated broadcast service frame is broadcasted, including: for any forwarding node among at least one forwarding node, if a broadcast service frame is received, 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, the broadcast service frame is updated and the updated broadcast service frame is broadcasted. Here, the sequence number of the first information in the broadcast service frame is indicated by the message sequence number field in the first information.

[0398] 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 can be understood that the message cache table can be used by the local node to determine whether the route request information received this time has been processed, so as to avoid the same node from repeatedly processing the route request information with the same sequence number.

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

[0400] See also Figure 6 , Figure 6 It is a schematic diagram of another communication system provided in an embodiment of the present application. Figure 6 It is assumed that node S is the initiating node and node D is the target node, and at least one forwarding node includes node A, node B and node C. Figure 6 The cost of some links is shown, for example, the cost of link SA is 2, the cost of link AB is 1, etc. Figure 6 Taking the broadcast process of the broadcast service frame in at least one forwarding node as an example, refer to the following steps A1-A3:

[0401] 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 "initiation 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.

[0402] 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 historical 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.

[0403] Step A3: Node A broadcasts the above 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.

[0404] 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 recorded in the local message cache table of node B (that is, node B processes broadcast service frame 2 for the first time), node B 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 "3" (because 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, that is, 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.

[0405] For node C, if the sequence number of the first information in broadcast service frame 2 is greater than the sequence number of the routing request information recorded in the historical record of 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.

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

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

[0408] In one implementation, in order to avoid repeated processing of the first information by the forwarding node, the above-mentioned for any one of the at least one forwarding nodes, if a broadcast service frame is received, a reverse routing table is generated according to the broadcast service frame, which can be: the above-mentioned for any one of the at least one forwarding node, if a broadcast service frame is received, 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, a reverse routing table is generated according to the broadcast service frame.

[0409] Further, 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 according to the broadcast service frame. Here, the message cache table can refer to the description of the corresponding content in the above S303, which will not be repeated here.

[0410] In an embodiment of the present application, for any forwarding node (e.g., the first node) among at least one forwarding node, the first node receives a broadcast service frame, and the previous hop node of the first node on the route from the first node to the initiating node can be determined according to 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 reverse routing table of the first node.

[0411] 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 the 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 the routing response information and can also assist the subsequent node to generate a forward routing table locally, as described in S307 below, which will not be repeated here.

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

[0413] Here, the reverse routing table of the first node is not limited to the form of 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 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.

[0414] Next, we will combine S303 Figure 6 The description indicates that at least one forwarding node (i.e. Figure 6 Node A, node B and node C in the local generated message cache table and reverse routing table, assuming that each forwarding node in at least one forwarding node has not received routing request information in the history.

[0415] For Node A:

[0416] The message cache table after local update of node A is shown in Table 1 below, which 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. Exemplarily, 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.

[0417] Table 1

[0418] Message sequence number The network address of the target node The network address of the initiating node Forwarding hop count Link cost 1 The network address of D The network address of S 1 2

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

[0420] For example, the reverse routing table generated locally by node A is shown in Table 2 below, which 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. Exemplarily, 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.

[0421] Table 2

[0422] Message sequence number The network address of the destination node The network address of the previous hop node Hop Count Path cost 1 The network address of S The network address of S 1 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 the following Table 3, and 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) - network address of target node (network address of D) - network address of initiating node (network address of S) - forwarding hop count (2) - link cost (3)" based on the above 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] Message sequence number The network address of the target node The network address of the initiating node Forwarding hop count Link cost 1 The network address of D The network address of S 2 3

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

[0429] 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 items, one of which is "message sequence number (1)-network address of the destination node (network address of A)-network address of the 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 item is "message sequence number (1)-network address of the destination node (network address of S)-network address of the 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.

[0430] Table 4

[0431] Message sequence number The network address of the destination node The network address of the previous hop node Hop Count Path cost 1 A's network address A's network address 1 1 1 The network address of S A's network address 2 3

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

[0433] For Node C:

[0434] For example, the message cache table after local update of node C is shown in the following Table 5, and Table 5 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) - network address of target node (network address of D) - network address of initiating node (network address of S) - forwarding hop count (2) - link cost (4)" based on the above broadcast service frame 2, that is, from node S to node C, there are 2 hops and the total cost is 4.

[0435] Table 5

[0436] Message sequence number The network address of the target node The network address of the initiating node Forwarding hop count Link cost 1 The network address of D The network address of S 2 4

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

[0438] 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 items, one of which is "message sequence number (1)-network address of the destination node (network address of A)-network address of the 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 item is "message sequence number (1)-network address of the destination node (network address of S)-network address of the previous hop node (network address of A)-number of hops (2)-path cost (4)", that is, node C passes through node A to node S, with a total of 2 hops and a total cost of 4.

[0439] Table 6

[0440] Message sequence number The network address of the destination node The network address of the previous hop node Hop Count Path cost 1 A's network address A's network address 1 2 1 The network address of S A's network address 2 4

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

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

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

[0444] Here, compared with the above-mentioned 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 number 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. Exemplarily, the transmission channel identifier in the broadcast service frame 2 indicates the identifier of the neighboring node.

[0445] Exemplarily, the target node receives the broadcast service frame 2, and based on at least one of the transport channel identifier (TCID), logical channel identifier (LCID), layer 2 identifier of the node broadcasting 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's neighbor nodes 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.

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

[0447] For example, the number of broadcast service frame 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.

[0448] For another example, the number of broadcast service frames 2 may be multiple, and the sequence numbers of the first information in these multiple broadcast service frames 2 are the same, but in the first information in different broadcast service frames 2, the value of the "forwarding hop count" field is different and / or the value of the "link overhead" field is 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, and multiple routes (or paths) are established between the initiating node and the target node. In this way, not only can the redundant transmission of service data be realized, but it is also conducive to improving the reliability of transmitting service data.

[0449] 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 neighboring nodes, or the target node may obtain them from multiple neighboring nodes. In this case, there is no limit on the number of broadcast service frames 2 obtained by the target node from each of these multiple neighboring nodes.

[0450] The following is a detailed introduction to the routing response frame.

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

[0452] 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 has established a reverse routing table locally based on the received routing request information.

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

[0454] Exemplarily, the second information is the above-mentioned routing response information, and reference may be made to the relevant description of the above-mentioned routing response information. The format of the second information may be, for example, Figure 2B The format shown is not repeated here.

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

[0456] One implementation method, such as broadcast service frame 2 using Figure 4 The basic service layer basic frame format shown in the figure realizes the carrying of the first service data and the first information, and the routing response frame also adopts Figure 4 The basic service layer basic frame format shown is encapsulated. 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.

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

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

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

[0460] against Figure 7 The network layer header of the packet is described below:

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

[0462] Destination Address: This field is used to indicate the network address of the originating node; and

[0463] Next header: This field indicates the header of the next layer of the message; for example, Figure 7 , this field indicates the routing response header.

[0464] Understandably, Figure 7 The remaining fields in the , namely, version number (version), service type (type of service, ToS), topology identifier (Topo ID), flow label (flow label), payload length (payload length) and hop limit (hop limit) can be found in detail. Figure 5 The description of the corresponding fields in the network layer message header will not be repeated here.

[0465] Based on the above S303 Figure 6 The description of FIG. 1 illustrates the routing response frame generated by node D. Figure 6 In the example, 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 above-mentioned broadcast service frame 2, wherein 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 overhead" 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 overhead" field is "4", assuming that the routing response frame generated by node D adopts Figure 7 The format shown is:

[0466] exist Figure 6In the example, node D can 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 "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 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).

[0467] Similarly, in Figure 6 In the example, node D can 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 the link CD).

[0468] 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 description of the reverse routing table may refer to the description of the corresponding content in the above S304.

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

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

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

[0472] Here, the local reverse routing table of the target node is not limited to the form of 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 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 local reverse routing table of the target node can realize that the target node can determine the next hop node of the target node leading to the initiating node based on the network address of the initiating node, and the specific form of the local reverse routing table of the target node is not limited.

[0473] Next, we will combine S303 Figure 6 The description of the reverse routing table generated locally by node D is as follows. Assuming that node D has not received routing request information in the past, based on the above S303 Figure 6 , assuming 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. The reverse routing table generated locally by node D can be referred to in Table 7 below, for example. Table 7 can refer to the description of Table 2 above. Exemplarily, a corresponding relationship recorded in the reverse routing table can be referred to as 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.

[0474] Table 7

[0475] Message sequence number The network address of the destination node The network address of the previous hop node Hop Count Path cost 1 B's network address B's network address 1 1 1 The network address of S B's network address 3 4 1 The network address of C The network address of C 1 2 1 The network address of S The network address of C 3 6

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

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

[0478] Exemplarily, the target node receives the broadcast service frame 2. Assuming that the target node determines that the sender of the broadcast service frame 2 is node n, after the target node generates a route response frame based on the broadcast service frame 2, in response to the broadcast service frame 2, the target node sends the route response frame to node n, and 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 the broadcast service frame 2 may also be determined by the target node based on the broadcast service frame 2 and the reverse routing table generated in S305.

[0479] In one implementation, there are multiple broadcast service frames 2, the sequence numbers of the first information in different broadcast service frames 2 are the same, and in the first information of different broadcast service frames 2, the values ​​of the forwarding hop number field and / or the values ​​of the link overhead field are different. Accordingly, there are multiple routing response frames, and each routing response frame in the multiple routing response frames corresponds to a broadcast service frame 2 in the multiple broadcast service frames 2, 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.

[0480] For example, based on the above S305 Figure 6 , multiple broadcast service frames 2 include the above-mentioned broadcast service frame 3 and broadcast service frame 4, wherein broadcast service frame 3 comes from node B, and broadcast service frame 4 comes from node C, and node B and node C are neighbor nodes of node D, then multiple 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 (for example, indicating that the number of hops of route 1 is 3 and the cost is 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 (for example, indicating that the number of hops of route 2 is 3 and the cost is 6). In this case, the target node sends a 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 Figure 6 , route 1 can be expressed as S->A->B->D, and route 2 can be expressed as S->A->C->D.

[0481] For example, assuming that the route from the initiating node to the target node includes the above-mentioned route 1 and route 2, 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.

[0482] S307: For the forwarding node in at least one forwarding node, if a routing response frame is received, a forward routing table is generated locally, and an updated routing response frame is sent based on the local reverse routing table.

[0483] In an embodiment of the present application, for any forwarding node (e.g., the first node) of at least one forwarding node, the first node receives a route response frame, and the next hop node of the first node on the route from the first node to the target node can be determined based on the route response frame. 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.

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

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

[0486] Here, the local forward routing table of the first node is not limited to a form that records 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 cost 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.

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

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

[0489] Here, the number of route response frames received by the forwarding node is not limited. It can be understood that during the route discovery process, if the 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 the 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.

[0490] 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 recognize that the currently received routing response frame comes from the forwarding node.

[0491] See also Figure 6 , based on the above S303-S306 Figure 6 From the description, we can know that when node D receives broadcast service frame 3 broadcasted by node B, it responds to broadcast service frame 3 and sends routing response frame 1 to node B, and when node D receives broadcast service frame 4 broadcasted by node C, it responds to broadcast service frame 4 and sends routing response frame 2 to node C. Figure 6 Take the following as an example to illustrate the transmission process of routing response frame 1 and routing response frame 2 in at least one forwarding node:

[0492] For Node B:

[0493] 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 (i.e., 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.

[0494] 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). The forward routing table can be, for example, referred to 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. Exemplarily, a correspondence recorded in the forward routing table can be referred to as 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-mentioned routing response frame 1, that is, there is 1 hop from node B to node D and the cost is 1.

[0495] Table 8

[0496] Path identification The network address of the target node The network address of the next hop node Hop Count Path cost 1 The network address of D The network address of D 1 1

[0497] 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 only that shown in Table 8. In some possible embodiments, the forward routing table may also 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.

[0498] For Node C:

[0499] 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 (i.e., as shown in Table 6). The routing response frame A2 is the updated routing response frame 2, or in other words, the routing response frame A2 is generated by node C based on the routing response frame 2.

[0500] 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). The forward routing table can be, for example, referred to in Table 9 below. Table 9 can refer to the description of Table 8 above. As can be seen from Table 9, 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 D) - number of hops (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.

[0501] Table 9

[0502] Path identification The network address of the target node The network address of the next hop node Hop Count Path cost 1 The network address of D The network address of D 1 2

[0503] 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 only.

[0504] For Node A:

[0505] Node A receives routing response frame A1. Since node A is not an initiating node, node A sends 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). Routing response frame S1 is the updated routing response frame A1, or in other words, routing response frame S1 is generated by node A based on routing response frame A1. Similarly, node A receives routing response frame A2. Since node A is not an initiating node, node A forwards 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). Routing response frame S2 is the updated routing response frame A2, or in other words, routing response frame S2 is generated by node A based on routing response frame A2.

[0506] Node A can also generate a forward routing table based on routing response frame A1, routing response frame A2 and the local message cache table (i.e., as shown in Table 1). The forward routing table can be, for example, referred to in Table 10 below. Table 10 can refer to 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.

[0507] Table 10

[0508] Path identification The network address of the target node The network address of the next hop node Hop Count Path cost 1 The network address of D B's network address 2 2 1 The network address of D The network address of C 2 4

[0509] 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 only.

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

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

[0512] 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 according to 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.

[0513] Exemplarily, the local routing table of the initiating node is used to record the 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.

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

[0515] Here, the local routing table of the initiating node 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 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. The local routing table of the initiating node can realize that the initiating node can determine the next hop node of the initiating node leading to the target node based on the network address of the given target node, and the specific form of the local routing table of the initiating node is not limited.

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

[0517] Here, the number of route response frames received by the initiating node from its neighboring nodes is not limited. In one implementation, the initiating node receives multiple route response frames, which 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.

[0518] Exemplarily, when there are multiple routing response frames, the multiple routing 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.

[0519] For example, based on S307 Figure 6According to the description, node S will receive routing response frame S1 and routing response frame S2 from node A. In response to routing response frame S1 and routing response frame S2, the routing table generated locally by node S can be referred to as Table 11 below. Exemplarily, a corresponding relationship recorded in the routing table can be referred to as 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)-network address of target node (network address of D)-network address of next hop node (network address of A)-number of hops (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)-network address of target node (network address of D)-network address of next hop node (network address of A)-number of hops (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.

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

[0521] Table 11

[0522] Path identification The network address of the target node The network address of the next hop node Hop Count Path cost 1 The network address of D A's network address 3 4 1 The network address of D A's network address 3 6

[0523] 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. Figure 6 Node S in the routing table receives the routing response frame S1 and generates a routing table entry "path identifier (1) - network address of target node (network address of D) - network address of next hop node (network address of A) - hop count (3) - path cost (4)", wherein in the routing table entry, the value of "hop count" 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.

[0524] After the initiating node receives the routing response frame, because 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.

[0525] It can be seen that, in the implementation of the embodiment of the present application, the start of route discovery is triggered 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 manner. Compared with the establishment of a route by a reactive routing protocol, this method can reduce the waiting delay for the transmission of the first packet of business data while achieving route establishment; compared with the establishment of a route by a proactive routing protocol, this method does not need to establish a route when there is no business data to be sent, and does not need to regularly send routing control messages to maintain the routing table. This can not only save the power consumption of network equipment, but also greatly reduce the overhead of network resources.

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

[0527] Exemplarily, the initiating node receives a first route response frame and receives 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 the 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 cost of the first route can also be stored. In some possible embodiments, relevant information (such as network address, identification, etc.) of each node along the first route 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 the storage form of the first route in the routing table is not specifically limited.

[0528] Here, the initiating node receives a route response frame (eg, a first route 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 in the first route path has not only completed the establishment of a reverse routing table locally, but also completed the establishment of a forward routing table.

[0529] 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 via at least one of the first route and the second route.

[0530] For example, the initiating node sends the second service 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 service 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.

[0531] For another example, the initiating node sends the second service data through the second route, and the first route is used as a redundant route or a backup route. That is, when the second route fails, the second service 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.

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

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

[0534] It can be seen that, by implementing the embodiments 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.

[0535] In some possible embodiments, after the route from the initiating node to the target node is established, the initiating node starts the transmission of 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 it is located in has a fault, making data transmission unreachable.

[0536] The following is based on Figure 8 The routing error (RERR) information in the embodiment of the present application is described. Figure 8 , Figure 8 This is a schematic diagram of the format of routing fault information provided by an embodiment of the present application:

[0537] In an embodiment of the present application, routing fault information can be generated by an upstream node or a faulty node of a faulty link. Routing fault information is generally sent by a node generating the routing fault information along a reverse route by unicast. Thus, after receiving the routing fault information, the node on the reverse route can timely update the local forward routing table based on the routing fault information to delete the route that has failed due to the fault.

[0538] For example, Figure 8As shown, the routing fault information includes at least one of the following fields:

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

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

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

[0542] Identifier of the path where the target node affected by the fault is located: This field indicates the identifier of the path where the target node affected by the fault is located;

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

[0544] 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: that is, 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].

[0545] In some possible embodiments, routing failure information may be represented by a type-length-value TLV field, such as Figure 8 As shown, 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, the value field is used to carry the content of the routing fault information, and the value field includes the number of target nodes affected by the fault, the 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.

[0546] For example, in Figure 8 The length of each field in the routing fault information can 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).

[0547] Understandably, Figure 8 This is just an example of the format of routing fault information. The embodiment of the present application does not limit the format of routing fault information to only Figure 8 In some possible embodiments, the number of fields in the routing fault information may be less than or more than Figure 8 The number of fields shown is not specifically limited here.

[0548] In the above Figure 3 Based on the embodiment shown, based on Figure 8 The routing failure information shown describes a method of data transmission. Fig. 9 , Fig. 9 1 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 leading 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:

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

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

[0551] Among them, node 3 is a neighbor node of node 1. Exemplarily, 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.

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

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

[0554] 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".

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

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

[0557] Exemplarily, 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 executed the "update" in S901 above) is node three, S904 is executed.

[0558] In some possible embodiments, if there are other routes to the target node in the forward routing table after the local update of node 1, node 1 does not need to generate a routing fault frame. Further, if there are other routes to the target node in the forward routing table after the local update of node 1, and node 1 currently has a demand to send service data to the target node, S903 is executed.

[0559] 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 in which the next hop node of node one is 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.

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

[0561] S904: Node one generates a routing failure frame, and sends the routing failure frame to node two based on the local reverse routing table.

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

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

[0564] Exemplarily, the third information is the above-mentioned routing failure information, and reference may be made to the above-mentioned description of the routing failure information. The format of the third information may be, for example: Figure 8 The format shown is not repeated here.

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

[0566] In one implementation, the routing fault frame uses Figure 4The format of the basic service layer basic frame shown realizes the carrying of 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.

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

[0568] Furthermore, the second network layer unicast message also 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.

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

[0570] against Fig.10 The network layer header of the packet is described below:

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

[0572] Destination Address: This field is used to indicate the network address of the originating node; and

[0573] Next header: This field indicates the header of the next layer of the message; for example, Fig.10 In the Routing Failure header, this field indicates the Routing Failure header.

[0574] Understandably, Fig.10 The remaining fields in the , namely, version number (version), service type (type of service, ToS), topology identifier (Topo ID), flow label (flow label), payload length (payload length) and hop limit (hop limit) can be found in detail. Figure 5 The description of the corresponding fields in the network layer message header will not be repeated here.

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

[0576] In the implementation of the present 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.

[0577] In one implementation, updating the local forward routing table may include: deleting the route leading to the target node and the next hop node of node 2 being node 1 from the local forward routing table.

[0578] 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 whose next hop node is node one to "infinity" and changing the value of the path cost to "infinity".

[0579] 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).

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

[0581] In another implementation, node 2 receives a routing fault frame (referred to as routing fault frame 1) from node 1. Based on routing fault 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 node 1, routing fault frame 2 is sent to the previous hop node of node 2 leading to the initiating node. Routing fault frame 2 is used to indicate that the route from the initiating node to the target node is faulty. Here, routing fault frame 2 is generated based on routing fault frame 1. According to the above method, the routing fault information generated by node 1 can be sent back to the initiating node along the reverse route through the routing fault frame. In this way, each node that receives the routing fault frame can update the local forward routing table based on the routing fault information in the routing fault frame to delete the route that is currently invalid due to the fault.

[0582] 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 above by broadcasting business frames. Figure 3 The route discovery process shown in the embodiment will not be described in detail here.

[0583] It can be seen that by implementing the embodiments of the present application, the upstream node of the faulty link or the faulty node triggers the sending of a routing fault frame to the initiating node on the route where it is located, 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, and 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.

[0584] Below Fig.11 Take the above as an example Fig. 9 Application of the method shown. Fig.11 , Fig.11 A schematic diagram of a network failure provided in an embodiment of the present application. Assume Fig.11 The topological relationship between the nodes shown is based on the above Figure 3The method shown in the figure establishes a route from node S to node D. If there is a line segment connecting two nodes, it means that the two nodes are neighbors. It can be seen that there are two paths from node S to node D: S->A->B->D and S->A->C->D. Fig.11 The reverse routing tables of nodes A, B, C, and D can be found in Figure 3 The description of the corresponding content in Fig.11 The forward routing tables of nodes S, A, B, and C can be found in Figure 3 The description of the corresponding content will not be repeated here.

[0585] For example, in Fig.11 In the example, 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 and the data message cannot be transmitted to node D, since node D is the target node, node B deletes the route with the next hop node as node D from the local forward routing table (such as the above table 8), and if there is no other route to node D in the local forward routing table of node B after the deletion operation, node B generates a routing fault frame 1, which is used to indicate that the route from node S to node D is faulty. Assuming that routing fault frame 1 includes Fig.10 For the network layer unicast message shown in the figure, in the routing fault frame 1, 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 number of target nodes affected by the fault is filled in with "1", the address field of the target nodes affected by the fault is filled in with "the network address of node D", and the identification field of the path where the target nodes affected by the fault are located is filled in with "1".

[0586] Node B sends the routing fault frame 1 to node A based on the reverse routing table (such as the above table 4), and node A determines the previous hop node of node B leading to node S for node B based on the local reverse routing table.

[0587] 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 data messages can be achieved through redundant paths, which provides reliability of data transmission.

[0588] Table 12

[0589] Path identification The network address of the target node The network address of the next hop node Hop Count Path cost 1 The network address of D The network address of C 2 4

[0590] In some possible embodiments, assuming that there are no other routes to node D in the local forward routing table of node A after the deletion operation, node A can send a routing failure frame 2 to node S based on the local reverse routing table (such as the above table 2), and the routing failure frame 2 is used to indicate that the route from node S to node D is faulty. After receiving the routing failure frame 2, node S deletes the route to node D and the next hop node of node S is node A from the local forward routing table. Here, the routing failure frame 2 is generated based on the routing failure frame 1.

[0591] In some possible embodiments, it may also happen that the initiating node detects a link failure, for example Fig.12 As shown, Fig.12 FIG. 1 is another schematic diagram of a network failure provided in an embodiment of the present application. Fig.12 In the figure, it is assumed that node S detects a link SA failure. For example, 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 repeated here.

[0592] See also Fig.13 , Fig.13 3 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.

[0593] 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 a broadcast form. The broadcast service frame also includes first information, and 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 sending unit 312 is used to broadcast the broadcast service frame.

[0594] The communication device 30 can be used to implement Figure 3 The method on the initiating node side described in the embodiment. Figure 3 In the embodiment, 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), and the processing unit may be used to execute S308.

[0595] In some possible embodiments, the communication device 30 can also be used to implement Fig. 9 For the sake of brevity of the specification, the method on the node side described in the embodiment will not be repeated here.

[0596] See also Fig.14 , Fig.14 4 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.

[0597] Among them, the receiving unit 410 is used to receive a first broadcast service frame, the first broadcast service frame 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, the first information is used to request to establish 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, and 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 according to the first broadcast service frame; the sending unit 414 is used to broadcast the second broadcast service frame.

[0598] The communication device 40 can be used to implement Figure 3 The method at any forwarding node side described in the embodiment. Figure 3 In the embodiment, 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 .

[0599] In some possible embodiments, the communication device 40 may also be used to implement Fig. 9For the sake of brevity of the specification, the node-side method or the node-side method described in the embodiments will not be described in detail here.

[0600] See also Fig.15 , Fig.15 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application, wherein 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.

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

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

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

[0604] In the embodiment of the present application, the processor is a circuit with signal processing capability. In one implementation, the processor can be a circuit with instruction reading and running 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), etc.; in another implementation, the processor can realize certain functions through the logical relationship of the hardware circuit, and 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.

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

[0606] In addition, all or part of the units in the above device can be 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 each unit of the device. The type of the at least one processor may be different, for example, including a CPU and an FPGA, a CPU and an artificial intelligence processor, a CPU and a GPU, etc.

[0607] See also Fig.16 , Fig.16 is a communication device provided in an embodiment of the present application. Fig.16As shown, the communication device 60 includes: a processor 601, a communication interface 602, a memory 603 and a bus 604. The processor 601, the memory 603 and the communication interface 602 communicate with each other via the bus 604. It should be understood that the present application does not limit the number of processors and memories in the communication device 60.

[0608] In one implementation, the communication device 60 may be the initiating node, forwarding node or target node mentioned above. Here, 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), etc., or a component in the network device, such as a single board, a line card, a chip, etc.; it may also be a terminal device with routing and forwarding capabilities, such as a smart home device (such as a TV, a sweeping robot, a smart desk lamp, an audio system, a smart lighting system, an electrical control system, a 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 truck, a truck, etc.), an intelligent manufacturing device (such as a robot, an industrial equipment, an intelligent logistics, an intelligent factory, etc.), a user device (a mobile phone, a computer, a tablet computer, a PDA, a desktop computer, a headset, an audio system, a wearable device, an in-vehicle device, a virtual reality device, an augmented reality device, etc.), or a component in the terminal device (such as a chip or an integrated circuit).

[0609] The bus 604 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.16 The bus 604 is represented by only one line, but it does not mean that there is only one bus or one type of bus. The bus 604 may include a path for transmitting information between various components of the communication device 60 (for example, the memory 603, the processor 601, and the communication interface 602).

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

[0611] The memory 603 is used to provide a storage space, in which data such as an operating system and a computer program can be stored. The memory 603 can be a random access memory (RAM), an erasable programmable read only memory (EPROM), a read-only memory (ROM), or a portable read-only memory (CD-ROM), etc., or a combination of multiple types. The memory 603 can exist alone or be integrated into the processor 601.

[0612] The communication interface 602 may be used to provide information input or output for the processor 601. Alternatively, the communication interface 602 may be used to receive data sent externally and / or send data externally, and may 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 may also include a transmitter (such as a radio frequency transmitter, an antenna, etc.) coupled to the interface, or a receiver, etc.

[0613] 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, for example Figure 3 or Fig. 9 The method described.

[0614] In a possible design, the communication device 60 may be a device for executing Figure 3 One or more modules in the execution subject (e.g., initiating node) of the method shown, the processor 601 may be used to read one or more computer programs stored in the memory to perform the following operations:

[0615] Generate a broadcast service frame, the broadcast service frame is used to transmit the first service data from the initiating node to the target node in a broadcast form, the 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, the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form;

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

[0617] In a possible design, the communication device 60 may be a device for executing Figure 3 One or more modules in the execution subject (e.g., forwarding node) of the method shown, the processor 601 may be used to read one or more computer programs stored in the memory to perform the following operations:

[0618] A first broadcast service frame is received by the receiving unit 410, the first broadcast service frame is used to transmit the first service data from the initiating node to the target node in a broadcast form, the forwarding node where the communication device 60 is located is not the target node, and 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 the second service data from the initiating node to the target node in a non-broadcast form;

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

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

[0621] In a possible design, the communication device 60 may be a device for executing Figure 3 One or more modules in the execution subject (e.g., target node) of the method shown, the processor 601 may be used to read one or more computer programs stored in the memory to perform the following operations:

[0622] Receiving a broadcast service frame through the receiving unit 510, the broadcast service frame is used to transmit the first service data from the initiating node to the target node in a broadcast form, the 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, the route is used to transmit the second service data from the initiating node to the target node in a non-broadcast form;

[0623] A routing response frame is sent based on the broadcast service frame by the sending unit 512. The routing 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.

[0624] In the above-mentioned embodiments of this invention, the description of each embodiment has its own emphasis. For the part that is not described in detail in a certain embodiment, please refer to the relevant description of other embodiments. In addition, in the various embodiments of this application, if there is no special explanation and 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 a new embodiment according to their internal logical relationship.

[0625] It should be noted that, a person 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 instructing related hardware through a program, and 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.

[0626] The essence of the technical solution of the present application or the part that makes the contribution or all or part of the technical solution can be embodied 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 can 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 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, a third routing fault frame is sent, and the third routing fault frame is used to indicate that the route from the initiating node to the target node 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.