WO2020156340A1 - Procédé et appareil de transmission de données - Google Patents

Procédé et appareil de transmission de données Download PDF

Info

Publication number
WO2020156340A1
WO2020156340A1 PCT/CN2020/073325 CN2020073325W WO2020156340A1 WO 2020156340 A1 WO2020156340 A1 WO 2020156340A1 CN 2020073325 W CN2020073325 W CN 2020073325W WO 2020156340 A1 WO2020156340 A1 WO 2020156340A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
transmission path
neighbor
nodes
backbone
Prior art date
Application number
PCT/CN2020/073325
Other languages
English (en)
Chinese (zh)
Inventor
王峰
方婧华
刘刚
Original Assignee
电信科学技术研究院有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 电信科学技术研究院有限公司 filed Critical 电信科学技术研究院有限公司
Publication of WO2020156340A1 publication Critical patent/WO2020156340A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/26—Connectivity information management, e.g. connectivity discovery or connectivity update for hybrid routing by combining proactive and reactive routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • This application relates to the field of communication technology, and in particular to a method and device for transmitting data.
  • the mobile ad hoc network is a centerless, multi-hop, temporary autonomous system formed by a group of nodes with both terminal and routing functions through transmission links.
  • the types of nodes in the mobile ad hoc network are ordinary nodes or backbone nodes.
  • the backbone node is responsible for data broadcasting and routing in the network.
  • the backbone node is equivalent to the collection of cluster heads and gateways in the clustered network.
  • a common node is a one-hop neighbor of the backbone node, and it can directly communicate with the backbone node or with other common neighbor nodes within one hop.
  • the backbone node and the common node complete the data transmission according to the corresponding routing protocol. Routing protocols include single-path routing protocols.
  • the single-path routing protocol is specifically as follows: each node in the mobile ad hoc network broadcasts periodically to maintain a routing table containing the paths to all other nodes, and update the routing table at any time according to changes in the network topology. When using the single-path routing protocol for data transmission, each node selects the next hop node according to the routing table. Because the routing table stores a single transmission path between two nodes, the address of the next hop node corresponding to the routing table is also unique. Therefore, when the next hop node moves or the transmission link changes, it is easy to cause errors in the data transmission process. It can be seen that the single-path routing protocol is used for data transmission, and the reliability of data transmission is low.
  • This application provides a method and device for transmitting data, which are used to improve the reliability of the data transmission process.
  • a data transmission method which is applied to a first node of a mobile ad hoc network, and the method includes:
  • N is a positive integer greater than or equal to 1 and less than the maximum number of hops of the mobile ad hoc network, and the destination node is the The node corresponding to the destination address;
  • the first transmission path is determined according to the neighbor list; wherein, the neighbor list includes the communication distance with the first node The address of the neighbor node within the N hop range, the node type of the neighbor node whose communication distance with the first node is within the N hop range, and at least each node from the first node to the neighbor node within the N hop range A transmission path, the first transmission path including addresses of nodes passing through from the first node to the destination node;
  • the first data is transmitted through the first transmission path.
  • the first node selects a transmission path from at least one transmission path in the neighbor list to transmit the first data, even if it is the first transmission path.
  • the first node can still complete the transmission of the first data through other paths in the neighbor list.
  • the data transmission method in the implementation of this application is more adaptable to mobile ad hoc networks, and the reliability of data transmission is higher.
  • the data is transmitted by storing the multi-path routing protocol from the first node to each node of the mobile ad hoc network.
  • the data is transmitted by storing the multi-path routing protocol from the first node to each node of the mobile ad hoc network.
  • only the neighbors within the N hop range of the first node are stored.
  • the method of at least one transmission path of the node has smaller calculation and storage overhead than the method of transmitting data through a multi-path routing protocol.
  • the method further includes:
  • a second transmission path is obtained according to a routing table; wherein, the routing table includes each of the first node to the other nodes A transmission path of a node, the second transmission path includes the address of a second node, the second node is the next hop of the first node indicated in the second transmission path, and the other nodes are Refers to nodes other than the first node in the mobile ad hoc network;
  • the first data is transmitted according to the second transmission path.
  • the backbone node compares the information in the routing table and the neighbor list to determine whether the second node is the next hop of the first node, and if so, then through the second transmission
  • the path transmits the first data to ensure the reliability of the second transmission path and further improve the reliability of data transmission.
  • the method further includes:
  • the second node If it is determined that in the neighbor list, the second node is not the next hop of the first node and is a neighbor node within the N hop range of the first node, then determine the first node according to the neighbor list Three transmission paths; wherein the third transmission path includes addresses of nodes passing through from the first node to the second node;
  • the first data is transmitted through the third transmission path.
  • the backbone node compares the information in the routing table and the neighbor list. If the information in the routing table and the neighbor list are inconsistent, it means that the local topology of the first node may have occurred
  • the second node is also a neighbor node within the N hop range of the first node
  • the first node can directly determine a transmission path according to the neighbor list, so as to transmit the first data to the second node. Since the neighbor list is generally updated faster, when the local topology of the first node changes, the neighbor list is used to transmit data. Compared with the method of determining the transmission path directly based on the routing table, this solution can ensure data transmission. The reliability of the path further improves the reliability of data transmission.
  • the method further includes:
  • a fourth transmission path is determined according to the neighbor list; wherein, the fourth transmission path Including addresses of nodes passing through from the first node to a third node, where the third node is a backbone node within an N hop range of the first node;
  • the first data is transmitted through the fourth transmission path.
  • the backbone node compares the information in the routing table and the neighbor list. If the information in the routing table and the neighbor list are inconsistent, and the topology of the first node may change too much or When the topology is under maintenance, the second node is not a neighbor node within the N hop range of the first node.
  • the first node can directly determine a backbone node within the N hop range based on the neighbor list, and transmit the first data to the node. Therefore, even if the topological structure of the first node changes too much or the topological structure is in a maintenance state, the first node can still successfully complete the data transmission process, which further ensures the reliability of data transmission.
  • the data transmission method in this solution has good adaptability to changes in the mobile ad hoc network, and the data transmission has high robustness.
  • the ordinary node refers to a node other than a backbone node in the mobile ad hoc network
  • the method further includes:
  • a fifth transmission path is determined according to the neighbor list; wherein, the fifth transmission path includes from the first node to An address of a node passed by the fourth node, where the fourth node is a backbone node among neighbor nodes whose communication distance with the first node is within N hops;
  • the first data is transmitted through the fifth transmission path.
  • the first node when the first node is a normal node, if the communication distance between the destination node and the first node is greater than N hops, the first node can use the backbone nodes within the N hop range to pass the first data through the The node transmits to the destination address.
  • the fourth node is the backbone node with the largest dominance factor among the N-hop neighbor nodes of the first node, and the dominance factor is used to characterize the first node to the fourth node The quality of the transmission link.
  • selecting the backbone node with a larger dominance factor as the fourth node can ensure the quality of the transmission link between the first node and the fourth node, thereby further improving the quality of data transmission.
  • the method further includes:
  • the neighbor maintenance data frame carries the node type of each node and the information of each node Address and node type of neighbor nodes within at least 1 hop;
  • a neighbor list of the first node is generated.
  • the first node generates the neighbor list of the first node according to the neighbor maintenance data frame by receiving the neighbor maintenance data frame broadcast by the neighbor node.
  • the method of generating the neighbor list in this solution is simple and straightforward.
  • the method when the node type of the first node is a backbone node, the method includes:
  • the other backbone nodes refer to the backbone nodes other than the first node in the mobile ad hoc network;
  • a routing table of the first node is generated.
  • the first node generates a routing table through routing control data frames broadcast by other backbone nodes, without the need for ordinary nodes to participate in the establishment of the routing table, and relatively reduces computational overhead.
  • generating the routing table of the first node according to the routing control data frame includes:
  • a transmission path from the first node to each of the other nodes is established according to the routing control data frame, so as to obtain Describe the routing table of the first node.
  • the first node when the first node receives the routing control data frame, it first determines whether it is the first time it has received it. If it is the first time it has received the data frame, it then establishes a routing table based on the data frame.
  • the method further includes:
  • TTL lifetime
  • selectively updating the routing table can reduce the computational overhead of the first node and can also ensure the quality of the transmission path in the routing table.
  • a device for transmitting data serves as a first node of a mobile ad hoc network, and the device includes:
  • Memory used to store instructions
  • the processor is configured to read instructions in the memory and execute the following process:
  • N Used to determine whether the communication distance between the destination node and the first node is less than or equal to N hops, where N is a positive integer greater than or equal to 1 and less than the maximum number of hops of the mobile ad hoc network, and the destination node is The node corresponding to the destination address;
  • the first transmission path is determined according to the neighbor list; wherein, the neighbor list includes the communication distance with the first node The address of the neighbor node within the N hop range, the node type of the neighbor node whose communication distance with the first node is within the N hop range, and at least each node from the first node to the neighbor node within the N hop range A transmission path, the first transmission path including addresses of nodes passing through from the first node to the destination node;
  • the transceiver is used to send and receive information under the control of the processor.
  • the processor is further configured to:
  • a second transmission path is obtained according to a routing table; wherein, the routing table includes each of the first node to the other nodes A transmission path of a node, the second transmission path includes the address of a second node, the second node is the next hop of the first node indicated in the second transmission path, and the other nodes are Refers to nodes other than the first node in the mobile ad hoc network;
  • the processor is further configured to determine whether the second node is the next hop of the first node in the neighbor list according to the address of the second node;
  • the first data is transmitted according to the second transmission path.
  • the processor is also used for:
  • the second node determines the first node according to the neighbor list Three transmission paths; wherein the third transmission path includes the addresses of nodes that are transmitted from the first node to the second node;
  • the first data is transmitted through the third transmission path.
  • the processor is also used for:
  • a fourth transmission path is determined according to the neighbor list; wherein, the fourth transmission path Including addresses of nodes passing through from the first node to a third node, where the third node is a backbone node within an N hop range of the first node;
  • the first data is transmitted through the fourth transmission path.
  • the normal node refers to a node other than the backbone node in the mobile ad hoc network
  • the processor is also used for :
  • a fifth transmission path is determined according to the neighbor list; wherein, the fifth transmission path includes from the first node to An address of a node passed by the fourth node, where the fourth node is a backbone node among neighbor nodes whose communication distance with the first node is within N hops;
  • the first data is transmitted through the fifth transmission path.
  • the fourth node is the backbone node with the largest dominance factor among the N-hop neighbor nodes of the first node, and the dominance factor is used to characterize the first node to the fourth node The quality of the transmission link.
  • the processor is also used for:
  • the neighbor maintenance data frame carries the node type of each node and the information of each node Address and node type of neighbor nodes within at least 1 hop;
  • a neighbor list of the first node is generated.
  • the processor is further configured to:
  • the other backbone nodes refer to the backbone nodes other than the first node in the mobile ad hoc network;
  • a routing table of the first node is generated.
  • the processor is specifically used for:
  • a transmission path from the first node to each of the other nodes is established according to the routing control data frame, so as to obtain Describe the routing table of the first node.
  • the processor is also used for:
  • a device for transmitting data serves as a first node of a mobile ad hoc network, and the device includes:
  • a receiving module configured to receive first data, where the first data carries a destination address
  • the processing module is used to determine whether the communication distance between the destination node and the first node is less than or equal to N hops, where N is a positive integer greater than or equal to 1 and less than the maximum number of hops of the mobile ad hoc network, and The destination node is the node corresponding to the destination address;
  • the processing module is further configured to, if it is determined that the communication distance between the destination node and the first node is less than or equal to N hops, determine the first transmission path according to the neighbor list; wherein, the neighbor list includes and The address of the neighbor node whose communication distance is within N hops of the first node, the node type of the neighbor node whose communication distance is within N hops of the first node, and the distance from the first node to the N hop range At least one transmission path of each node in the neighbor nodes, the first transmission path including the address of the node passing by from the first node to the destination node;
  • the sending module is configured to transmit the first data through the first transmission path.
  • a computer-readable storage medium stores computer instructions.
  • the computer instructions When the computer instructions are executed on a computer, the computer executes the method described in any one of the first aspects. method.
  • FIG. 1 is a schematic diagram of an application scenario provided by an embodiment of the application
  • FIG. 2 is a flowchart of a method for transmitting data according to an embodiment of the application
  • FIG. 3 is a structural diagram 1 of a mobile ad hoc network provided by an embodiment of this application.
  • FIG. 4 is a flowchart of a method for transmitting data according to an embodiment of the application
  • FIG. 5 is a second structural diagram of a mobile ad hoc network provided by an embodiment of this application.
  • FIG. 6 is a flowchart of a method for transmitting data provided by an embodiment of the application.
  • FIG. 7 is a third structural diagram of a mobile ad hoc network provided by an embodiment of this application.
  • FIG. 8 is a structural diagram of a data transmission device provided by an embodiment of the application.
  • FIG. 9 is a structural diagram of a data transmission device provided by an embodiment of the application.
  • a mobile ad hoc network (Ad hoc) is a centerless, multi-hop, and temporary autonomous system formed by a group of nodes with both terminal and routing functions through transmission links.
  • Cluster head a cluster in a wireless network is composed of a group of nodes. Generally, a group of nodes in the neighboring area form a cluster, and a coordinating node (central node) coordinates and controls the behavior of the nodes in the cluster. This coordination The node (central node) is called the cluster head.
  • Virtual backbone network The connected dominance set of the network is called the virtual backbone network, and the set of all cluster heads and gateways in the network is defined as the network dominance set. For a network where the distance between all nodes in the cluster and the cluster head is one hop , The network dominance set is equal to the connectivity dominance set, that is, the virtual backbone network. In practical applications, the virtual backbone network elected by different algorithms is different, and as time changes, the virtual backbone network is constantly updated and changed. The virtual backbone network is a connected subset of the mobile ad hoc network.
  • Backbone nodes which can also be called virtual backbone network nodes, central nodes or control nodes, refer to nodes in the virtual backbone network.
  • the virtual backbone network is a connected subset of the mobile ad hoc network.
  • the node type of any node in the mobile ad hoc network is a backbone node or a common node.
  • the node type of a node is not fixed, that is, the node type of a node may be a backbone node before, and then the node type of the node may become a normal node, or before the node
  • the node type of is a normal node, which may become a backbone node later.
  • Time To Live refers to the maximum number of network segments that data is allowed to pass through before being discarded. In the transmission process, each time data is forwarded, the TTL of the data is reduced by one.
  • Terminal equipment which can be a wireless terminal or a wired terminal.
  • a wireless terminal can be a device that provides voice and/or other service data connectivity to the user, a handheld device with wireless connection function, or other connected to a wireless modem Processing equipment.
  • a wireless terminal can communicate with one or more core networks via a Radio Access Network (RAN).
  • the wireless terminal can be a mobile terminal, such as a mobile phone (or "cellular" phone) and a computer with a mobile terminal For example, they can be portable, pocket-sized, handheld, computer-built or vehicle-mounted mobile devices, which exchange language and/or data with the wireless access network.
  • Wireless terminal can also be called system, subscriber unit (Subscriber Unit), subscriber station (Subscriber Station), mobile station (Mobile Station), mobile station (Mobile), remote station (Remote Station), remote terminal (Remote Terminal), connection Incoming terminal (Access Terminal), user terminal (User Terminal), user agent (User Agent), and user equipment (User Device or User Equipment).
  • FIG. 1 is a diagram of an application scenario in an embodiment of this application.
  • the mobile ad hoc network includes multiple backbone nodes (indicated by M in Figure 1) and multiple ordinary nodes (indicated by D in Figure 1).
  • the backbone node can communicate with one-hop ordinary nodes, and the ordinary nodes can directly communicate with other ordinary neighbor nodes within one hop.
  • the number of backbone nodes is 4 as an example, and the number of ordinary nodes is 5 as an example, but the number of backbone nodes and ordinary nodes is actually not limited.
  • the backbone nodes and ordinary nodes may both be routing devices, and the routing devices may specifically be access, aggregation, core routers, enterprise network routers (such as enterprise network edge routers), or home gateways.
  • the backbone node and the common node can also be terminal devices, and the terminal device accesses the Internet through the home gateway to communicate with another terminal device.
  • Some of the backbone nodes are routing devices, and some of the backbone nodes are terminal devices.
  • Some common nodes among the multiple common nodes are routing devices, and some common nodes are terminal devices.
  • Common nodes and backbone nodes can complete data transmission through a single-path routing protocol.
  • the single-path routing protocol stores a single transmission path between two nodes, when a node on the transmission path moves or the transmission link changes, packet loss is likely to occur, or when When the transmission data load is large, the transmission path is prone to blockage. It can be seen that the use of a single-path routing protocol for data transmission has poor adaptability to conditions such as node movement or link changes in the mobile ad hoc network, and the reliability of data transmission is poor.
  • an embodiment of the present application provides a data transmission method, which is suitable for the scene graph shown in FIG. 1, and the method is executed by the first node in the mobile ad hoc network.
  • the first node is any node in the mobile organization network.
  • the node type of the first node is a backbone node or a normal node. Please refer to Fig. 2, the flow of the method will be described in detail below.
  • Step 201 Receive first data, where the first data carries a destination address
  • Step 202 Determine whether the communication distance between the destination node and the first node is less than or equal to N hops, where N is a positive integer greater than or equal to 1 and less than the maximum number of hops of the mobile ad hoc network, and the destination node Is the node corresponding to the destination address;
  • Step 203 If it is determined that the communication distance between the destination node and the first node is less than or equal to N hops, determine the first transmission path according to the neighbor list; wherein, the neighbor list includes the communication distance with the first node The address of the neighbor node whose communication distance is within the range of N hops and the node type of the neighbor node whose communication distance with the first node is within the range of N hops, and the first transmission path includes transferring the first data from the first node The address of the node through which the destination address is transmitted;
  • Step 204 Transmit the first data through the first transmission path.
  • step 201 when the first node is the source node for transmitting the first data, the first node generates the first data according to the data acquisition request of other nodes, which is equivalent to receiving the first data.
  • the data acquisition request includes the destination address and the identification of the requested data.
  • other nodes in the mobile ad hoc network send the first data to the first node, and the first node receives the first data from the other nodes.
  • the first data is data to be transmitted.
  • the first data carries the destination address.
  • the destination address refers to the address corresponding to the destination node, and can also be called the destination network address.
  • the destination address is, for example, the Internet Protocol Address (IP) address of the destination node, or the unique identity (identification, ID) of the destination node in the mobile organization network.
  • IP Internet Protocol Address
  • ID unique identity
  • the first data also includes data content to be transmitted.
  • the first node After the first node receives the first data, the first node performs step 202, which is to determine whether the communication distance between the destination node and the first node is less than or equal to N hops.
  • N is a positive integer greater than or equal to 1 and less than the maximum number of hops of the mobile ad hoc network.
  • the maximum number of hops of the mobile ad hoc network refers to the communication distance between the source node and the destination node in the longest transmission link of the mobile ad hoc network at the current moment.
  • step 202 The following is an example of how to perform step 202.
  • the first way to perform step 202 is:
  • the first node determines the communication distance between the destination node and the first node according to the neighbor list, so as to determine whether the communication distance between the destination node and the first node is less than or equal to N hops.
  • the first node needs to obtain the neighbor list first.
  • the method for obtaining the neighbor list will be described below as an example.
  • the first node receives the neighbor maintenance data frame broadcast by each of the neighbor nodes within the N-1 hop range, and the first node generates the neighbor list of the first node according to the neighbor maintenance data frames.
  • each node in the mobile ad hoc network is synchronized, but each node does not know what its neighbor nodes are. Therefore, the first node needs to discover its neighbor nodes first.
  • N-hop neighbor nodes There are many ways to discover N-hop neighbor nodes, the following is an example.
  • the first node can periodically broadcast detection data packets, receive and according to other nodes' response data packets, find neighbor nodes within the N hop range.
  • the range of N hops refers to neighbor nodes whose communication distance with the first node is less than or equal to N hops.
  • the Exploring Packet (EP) includes the address of the current detecting node.
  • the response packet (RP) includes the address of the current node and the path from the current response node to the current detection node.
  • the first node After the first node can discover neighbor nodes within the N hop range, the first node and other nodes will broadcast their neighbor data maintenance frames. The first node will receive the neighbor maintenance data frames broadcast by each of the neighbor nodes within the N-1 hop range, and the first node maintains the data frames according to these neighbors, thereby establishing the neighbor list of the first node.
  • the neighbor maintenance data frame carries the node type of each node, and the addresses and node types of neighbor nodes within at least one hop of each node.
  • the node type is the backbone node or common node mentioned in the previous article.
  • the neighbor maintains a data frame such as a hello packet.
  • the specific format and content of the neighbor maintenance data frame can be set according to actual needs, and this article does not make specific restrictions.
  • the neighbor list can be understood as the local topology of the first node, that is, the relationship between the first node and neighbor nodes within the N hop range.
  • the neighbor list includes the addresses of neighbor nodes whose communication distance with the first node is within N hops, the node type of neighbor nodes whose communication distance with the first node is within N hops, and the neighbor nodes from the first node to N hops. At least one transmission path for each node in. There are many specific forms of the neighbor list, and this article does not limit the specific form of the neighbor list.
  • the neighbor data maintenance frame further includes a unique identifier, and the unique identifier is used to distinguish the neighbor data maintenance frames broadcast by the node in different periods.
  • the first node will periodically receive the neighbor maintenance data frame broadcast by each of the neighbor nodes within the N-1 hop range. After receiving the neighbor data maintenance frame, the first node can determine the first node according to the unique identifier. Whether a node receives the neighbor data maintenance frame for the first time, if it is not the first time to receive the neighbor data maintenance frame, it will periodically update the neighbor list according to the neighbor data maintenance frame to ensure that the information in the neighbor list can be Accurately reflect the current topology of the mobile ad hoc network.
  • the first node can query the neighbor list according to the destination address. If the neighbor list has the destination address, it means that the destination node is The communication distance of the first node is within N hops, so the first node can determine that the communication distance between the destination node and itself is less than or equal to N hops. If the neighbor list does not have the destination address, the first node can determine that the communication distance between the destination node and itself is greater than N hops.
  • Figure 3 is a structure diagram of the current mobile ad hoc network.
  • the mobile organization network includes five backbone nodes (node 3, node 7, node 1, node 2 and node 5).
  • the backbone network also includes four common nodes (node 15, node 6, node 4, and node 8).
  • N the number of backbone nodes
  • the neighbor list of node 7 can be as shown in Table 1 below:
  • step 203 is performed to determine the first transmission path according to the neighbor list.
  • the first node since the neighbor list stores at least one transmission path from the first node to each neighbor node in the N hop range, the first node directly determines the transmission path from the first node based on the at least one transmission path stored in the neighbor list. At least one transmission path from the first node to the destination node.
  • the content of the neighbor list please refer to the content discussed in the previous section, which will not be repeated here.
  • this transmission path is the first transmission path. If there are multiple transmission paths from the first node to the destination node, the first node needs to determine the first transmission path from the multiple transmission paths. The method of determining the first transmission path will be described as an example below.
  • the first method is to determine the first transmission path:
  • One of the multiple transmission paths is randomly selected as the first transmission path.
  • the first node is selected randomly, the first node does not need redundant calculations, and the determination method is simple and flexible.
  • the second method is to determine the first transmission path:
  • the transmission path with the highest link quality among the multiple transmission paths is the first transmission path.
  • the link quality of multiple transmission paths is different, and the first node may determine the link quality corresponding to each transmission path according to a preset algorithm, so as to select the transmission path with the highest link quality as the first transmission path.
  • the transmission path with the highest link quality is selected as the first transmission path, which can ensure the transmission quality of the first data.
  • the third method is to determine the first transmission path:
  • a transmission path matching the priority level of the first data transmission among the multiple transmission paths is determined to be the first transmission path.
  • the priority level is used to indicate the importance of data transmission. The higher the priority of the data, the more important the data.
  • Each of the multiple transmission paths corresponds to a different link quality. The data with the highest priority can be transmitted through the high-quality link, and the data with relatively low transmission priority can be transmitted through the transmission path with relatively low link quality. transmission.
  • the priority level of the first data may be pre-carried in the first data or determined by the first node.
  • determining corresponding transmission paths according to different priority levels of data can not only meet the requirements of data transmission of different priority levels, but also make the load of each transmission path relatively more balanced.
  • step 204 that is, transmits the first data through the first transmission path, thereby transmitting the data to the destination node.
  • step 201, step 202, step 203, and step 204 in the foregoing embodiment can be performed during data transmission.
  • step 202 if the first node determines that the communication distance between the destination node and itself is greater than N hops, and the type of the first node is different, the corresponding transmission mode of the first data is different.
  • the node types of the first node are different, the method of transmitting the first data will be separately described below.
  • step 402 if it is determined that the first node determines that the communication distance between the destination node and itself is greater than N hops, the first node performs step 403, that is, determines the second transmission path according to the routing table.
  • the first node Before performing step 403, the first node needs to first establish a routing table. There are many ways to establish a routing table, and examples are described below.
  • the first node receives routing control data frames periodically broadcast by other backbone nodes.
  • the routing control data frames carry the addresses and node types of other backbone nodes, and the addresses and node types of neighbor nodes within the N hop range of other backbone nodes.
  • Other backbone nodes Nodes refer to the backbone nodes other than the first node in the mobile ad hoc network;
  • the routing table of the first node is generated.
  • each node in the mobile ad hoc network will send a corresponding neighbor maintenance data frame and establish its own neighbor list.
  • Each backbone node can generate routing control data frames according to the neighbor list, or each backbone node can directly generate routing control data frames according to neighbor maintenance data frames sent by other nodes.
  • each routing control data frame is used to represent the current local topology structure of each backbone node, specifically including the address and node type of the node, and the addresses and node types of neighboring nodes within the N hop range of the node.
  • Table 2 is an example of an encapsulation format for routing control data frames.
  • the routing control data frame includes service type, datagram length, flag and chip offset, destination address, source address, header checksum, TTL, routing control data identification, forwarding node address, neighbor list length, The neighbor list of common nodes.
  • the service type is used to represent data of different service types.
  • the service type generally has a length of 8 bits.
  • the first two bits of the 8 bits are used to indicate the source of the data, and the last six bits of the 8 bits are used to distinguish different data of the same service type sent by the same node. For example, if the first two bits are 11, it indicates the data source and routing data.
  • the datagram length is used to indicate the total length of the routing control data frame, generally the length is 8 bits, the length unit can be double bytes (4bytes), the length range is 2 to 256, and all 0s represent 256.
  • the flag and the fragment offset are used to indicate the fragmentation flag of the routing control data frame. Generally, the length is 8 bits.
  • the routing control data frame is not fragmented, so the field is fixed to 00000000.
  • the destination address is used to indicate the destination address of the routing control data frame. Since the routing control data frame is broadcast in the virtual backbone network, the destination address of the routing control data frame is fixed to 11111111.
  • the source address is used to indicate the address of the node sending the routing control data frame, and is generally 8 bits in length.
  • the header checksum is used to check the header of the routing control frame, and the length is generally 8 bits.
  • TTL used to indicate the life cycle of routing control data frames, generally 4 bits in length.
  • the identifier is determined by the node that sends the routing control data frame, and is used to distinguish different routing control data sent by the backbone node.
  • the general length is 4 bits.
  • the forwarding node address is used to indicate the address of the latest forwarding node, and the general length is 8 bits.
  • the length of the neighbor list is used to indicate the number of neighbor nodes in the common node neighbor list of the backbone node, and the general length is 8 bits.
  • the ordinary node neighbor address list refers to the address list of ordinary nodes within the N hop range of the first node.
  • the first node can receive the routing control data frame sent by other backbone nodes.
  • the first node can directly establish a routing table after receiving the routing control data frame from the sender of other backbone nodes. Alternatively, after receiving the routing control data frame, the first node may first determine whether it is the first time that it has received the routing control data frame sent by the backbone node.
  • the first node may determine whether the routing control data frame is received for the first time according to the service type, source address, and identification in the routing control data frame. If the first node receives the routing control data frame for the first time, it can establish a transmission path from the first node to the backbone node according to the routing control data frame, and establish an N hop from the first node to the backbone node A transmission path of each node in the neighboring nodes in the range, and so on, when the first node establishes a transmission path with all other nodes, the routing table of the first node is obtained.
  • the TTL of the current routing data frame is greater than 1. If the TTL is equal to 1, then the current routing control data frame is not processed. If the TTL of the current routing control data frame is greater than 1, compare the TTL of the current routing control data frame with the previous routing control data frame.
  • the last routing control data frame refers to a data frame that has the same source address, the same service type, and a different identifier as the current routing control data frame.
  • the TTL of the last routing control data frame is less than the TTL of the routing control data frame, it means that the current transmission link has fewer network segments from the source address to the first node, which means that the current routing control data frame indicates Relatively fewer hops pass through the transmission link, so according to the current routing control data frame, a transmission path from the first node to other nodes is updated to obtain the updated routing table of the first node.
  • selectively updating the routing table can ensure the reliability of each transmission link in the current routing table.
  • the first node in order to facilitate other backbone nodes to establish or update the routing table, while the first node updates the routing table, the first node also modifies and controls the TTL of the data frame, the forwarding node address, and continues to forward the routing control Data Frame. If the first node does not have a 1-hop ordinary node, there is no need to forward the routing control data.
  • the first node periodically updates the neighbor list and the routing table, and the update period of the neighbor list is less than the update period of the routing table.
  • the update period of the first node to update the neighbor list is less than the update period of the routing table.
  • the update of the neighbor list provides buffer time for updating the routing table.
  • the first node can rely on the neighbor list for data transmission, ensuring the reliability of data transmission.
  • Fig. 3 when the first node is the backbone node and is the node 7 in Fig. 3, encapsulate according to the format of Table 2 above, and the obtained routing control data frame sent by node 7 is shown in Table 4 below.
  • Node 7 sends the routing control data frame to node 3 after 2 hops, and node 3 sends it to node 1.
  • the routing control data frame received by node 1 is shown in Table 5 below.
  • the node 1 can establish a transmission path to the node 7, the node 15, and the node 6 according to the routing control data frame in the table 5, and forward the routing control data frame.
  • the routing control data frame forwarded by node 1 is received by node 5, and the control data frame received by node 5 is specifically shown in Table 6 below.
  • Node 5 receives the routing control data frame shown in Table 6, and continues to forward the routing control data frame. If node 1 receives the routing control data frame shown in Table 6 sent by node 5, node 1 determines that the routing data frame with the identifier 0100 has been processed, and the TTL of the routing control data frame shown in Table 6 is less than the above For a routing control data frame (that is, the routing control data frame shown in Table 5), node 1 no longer performs any processing on the current routing control data frame received.
  • the first node After the first node establishes the routing table, since a transmission path from the first node to each of the other nodes is stored in the routing table, the first node can determine the first node from the routing table according to the routing table and the destination address. 2. Transmission path.
  • the second transmission path includes the address of the second node, and the second transmission path is a transmission path selected from the routing table.
  • the address of the second node is the next hop of the first node indicated in the second transmission path.
  • step 403 After step 403 is performed by the first node, the first data can be transmitted directly through the second transmission path.
  • the first node sends the first data to the next-hop node of the first node, and the next-hop node continues transmission until the first data is transmitted to the destination address.
  • the first node may perform step 404 after performing step 403, that is, according to the address of the second node, determine whether the second node is in the neighbor list and is the first node Next hop.
  • the second node is the next hop of the first node, but the topology of the mobile ad hoc network may change, and the first node updates the neighbor list. Therefore, the second node may not necessarily be the next hop of the first node in the neighbor list.
  • step 405 If the first node determines from the neighbor list that the second node is in the neighbor list and is still the next hop of the first node, the first node executes step 405, that is, transmits the first data according to the second transmission path.
  • the first node determines that the second node is in the neighbor list and is still the next hop of the first node, it means that the topology of the first node has not changed temporarily. Therefore, the first node directly passes the first data through The second transmission path can be transmitted to the second node.
  • the first node determines from the neighbor list that the second node is in the neighbor list and is not the next hop of the first node, the first node performs step 406, that is, determines whether the second node is a neighbor node within N hops of the first node .
  • the first node determines that it is in the neighbor list, and the second node is no longer the next hop of the first node, it means that the topology of the first node may have changed. Therefore, the first node needs to be further based on the neighbor list. It is determined whether the second node is a neighbor node within the N hop range of the first node, that is, the first node also needs to determine whether the communication distance between the second node and the first node is less than or equal to N hops according to the neighbor list.
  • the first node can query the neighbor list according to the address of the second node. If the address of the second node is in the neighbor list, it means that the second node is a neighbor node within the N hop range of the first node. If there is no address of the second node in the neighbor list, it means that the second node is not a neighbor node within the N hop range of the first node.
  • step 406 if the first node determines that the second node is a neighbor node within the N hop range of the first node, the first node executes step 407, that is, determines the third transmission path according to the neighbor list.
  • the third transmission path refers to The address of the node passed from the first node to the second node.
  • the first node directly selects a transmission path according to the neighbor list as the third transmission path.
  • the neighbor list there may be multiple transmission paths from the first node to the second node, and the method for determining the third transmission path from the multiple transmission paths by the first node can refer to the selection from multiple transmission paths discussed in step 203 above. Determine the content of the first transmission path, which will not be repeated here.
  • step 408 is performed, that is, the first data is transmitted through the third transmission path.
  • the first node transmits the first data to the second node through the third transmission path.
  • step 406 if the first node determines that the second node is not a neighbor node within the N hop range of the first node, step 409 is executed, that is, the fourth transmission path is determined according to the neighbor list.
  • the fourth transmission path refers to the address of the node through which the first data is transmitted from the first node to the third node, and the third node is a backbone node within the N hop range of the first node.
  • the first node determines that the second node is not a neighbor node within the N hop range of the first node, then the first node searches for a backbone node within the N hop range of the first node according to the neighbor list, that is, determines the third node Node, thereby determining the fourth transmission path.
  • the first node Since there may be more than one backbone node whose communication distance with the first node is within N hops, the first node needs to select one backbone node from the multiple backbone nodes as the third node.
  • the specific implementation methods include but are not limited to the following, which will be introduced separately below.
  • a backbone node is randomly selected as the third node.
  • the third node there may be multiple backbone nodes whose communication distance with the first node is less than or equal to N hops, and the first node randomly selects one of the backbone nodes as the third node.
  • the way to determine the third node is simple and flexible.
  • the second type is the first type:
  • the third node is determined.
  • the backbone node with the largest dominance factor is determined to be the third node.
  • the backbone node with the largest dominance factor is the third node.
  • the dominant factor is used to characterize the quality of the transmission link.
  • the dominance factor selects an index used to represent the characteristics of the node, such as ID, node remaining energy, and moving speed.
  • the dominance factor selects indicators used to represent network characteristics, such as the connectivity of the node, the coverage of the node, and the type of the node.
  • step 409 the first node performs step 410, that is, transmits the first data through the fourth transmission path.
  • the first node transmits the first data to the third node through the fourth transmission path.
  • the third node continues to propagate until it reaches the destination address.
  • FIG. 5 shows the updated structure of the mobile ad hoc network shown in FIG. 3, and the value of N is 2. Compared with FIG. 3, the position of node 7 in FIG. 6 has changed, and the connection between node 7 and node 3 is disconnected.
  • the updated neighbor list of node 7 is as follows:
  • node 7 first determines whether node 3 is its own 2-hop neighbor node, and determines that node 3 is its own 2-hop neighbor node. Node 7 queries the neighbor list and determines that the transmission path from node 7 to node 3 is 7-15-3 or 7-6-15-3. Therefore, node 7 can choose a transmission path at will and transmit the first data to node 3.
  • node 7 wants to send the first data to node 1, and node 7 determines that node 1 is not a neighbor node within its two-hop range, it looks up the routing table (such as Table 3) and determines to transmit it to node 1. The next hop is node 3.
  • Table 3 the routing table
  • Node 7 then queries the neighbor list (shown in Table 7) to determine that node 3 is not the next hop of node 7, so node 7 determines that node 3 is a neighbor node within 2 hops of node 7. Therefore, node 7 selects any transmission path "3:3, 3:6, 3:15" in the neighbor list, for example, node 7 selects "3:15", node 7 sends the first data to node 15, and then node 15 Send the first data to node 3, and finally node 3 sends the first data to node 1, thereby completing the transmission process.
  • step 602 when the first node determines that the communication distance between the destination node and itself is greater than N hops, the first node executes step 603, that is, determines the fifth transmission path according to the neighbor list.
  • the first node is based on The neighbor list determines the fifth transmission path, and the fifth transmission path is the address of the node through which the first node to the fourth node pass.
  • the fourth node is a backbone node whose communication distance with the first node is within N hops.
  • the first node Since there may be more than one backbone node whose communication distance with the first node is within N hops, the first node needs to select one backbone node from the multiple backbone nodes as the fourth node. For its specific implementation, refer to the discussion in step 409 above to determine the content of the third node, which will not be repeated here.
  • the third transmission path needs to be selected from multiple transmission paths.
  • the way to determine the third transmission path can be Refer to the content of determining the first transmission path discussed above, which will not be repeated here.
  • the first node may perform step 604, that is, transmit the first data through the fifth transmission path.
  • the first node transmits the first data to the fourth node through the determined fifth transmission path.
  • FIG. 7 shows the updated structure of the mobile ad hoc network shown in FIG. 3, and the value of N is 2. Compared with FIG. 3, the position of the node 15 in FIG. 7 has changed, and the node 15 is disconnected from the node 3 and the node 7.
  • node 15 wants to send the first data to node 8, it first determines whether node 8 is its own 2-hop neighbor node, and node 15 determines that node 8 is not its own 2-hop neighbor node. , Then determine the backbone node within the 2-hop range. The node 15 finds that the node 7 is a neighbor node within a 2-hop range. Therefore, the node 15 sends the first data to the node 7 through the node 6.
  • the device serves as the first node of a mobile ad hoc network. Please refer to FIG. 8.
  • the device includes:
  • the memory 801 is used to store instructions
  • the processor 802 is configured to read instructions in the memory 801 and execute the following process:
  • N Used to determine whether the communication distance between the destination node and the first node is less than or equal to N hops, where N is a positive integer greater than or equal to 1 and less than the maximum number of hops in the mobile ad hoc network, and the destination node is the node corresponding to the destination address ;
  • the first transmission path is determined according to the neighbor list; wherein, the neighbor list includes the neighbor nodes whose communication distance with the first node is within N hops.
  • the first transmission path includes The address of the node that the node passes through to the destination node;
  • the transceiver 803 is configured to send and receive information under the control of the processor 802.
  • the processor 802 is further configured to:
  • the second transmission path is obtained according to the routing table; wherein, the routing table includes a transmission path from the first node to each of the other nodes, and the second The transmission path includes the address of the second node, the second node is the next hop of the first node indicated in the second transmission path, and other nodes refer to nodes other than the first node in the mobile ad hoc network;
  • the processor 802 is further configured to determine whether the second node is the next hop of the first node in the neighbor list according to the address of the second node;
  • the first data is transmitted according to the second transmission path.
  • the processor 802 is also used to:
  • the third transmission path is determined according to the neighbor list; where, the third transmission path Including the addresses of nodes transmitted from the first node to the second node;
  • the first data is transmitted through the third transmission path.
  • the processor 802 is also used to:
  • the fourth transmission path is determined according to the neighbor list; wherein, the fourth transmission path includes the path from the first node to the third node.
  • the address of the passing node, the third node is a backbone node within the N hop range of the first node;
  • the first data is transmitted.
  • the normal node refers to a node other than the backbone node in the mobile ad hoc network
  • the processor 802 is also used for:
  • the fifth transmission path is determined according to the neighbor list; wherein, the fifth transmission path includes the address of the node passing through from the first node to the fourth node,
  • the fourth node is a backbone node among neighbor nodes whose communication distance with the first node is within N hops;
  • the first data is transmitted through the fifth transmission path.
  • the fourth node is the backbone node with the largest dominance factor among the N-hop neighbor nodes of the first node, and the dominance factor is used to characterize the quality of the transmission link from the first node to the fourth node.
  • the processor 802 is also used to:
  • the neighbor maintenance data frame carries the node type of each node and the neighbor nodes within at least 1 hop of each node Address and node type;
  • the neighbor list of the first node is generated.
  • the processor 802 is further configured to:
  • Receive routing control data frames periodically broadcast by other backbone nodes.
  • the routing control data frames carry the addresses and node types of other backbone nodes, as well as the addresses and node types of neighbor nodes within the N-hop range of other backbone nodes.
  • Other backbone nodes refer to The backbone nodes other than the first node in the mobile ad hoc network;
  • the routing table of the first node is generated.
  • the processor 802 is specifically used to:
  • a transmission path from the first node to each of the other nodes is established according to the routing control data frame, thereby obtaining the routing table of the first node.
  • the processor 802 is also used to:
  • a transmission path from the first node to other nodes is updated according to the control data frame to obtain the updated routing table of the first node.
  • the transceiver 803 and the memory 801 in FIG. 8 may be coupled to the processor 802.
  • processor 802 is taken as an example, but the number of processors 802 is actually not limited.
  • the processor 802 may be a central processing unit (CPU), or an application-specific integrated circuit (ASIC), and may be one or more integrated circuits for controlling program execution, and may be Baseband chips, etc.
  • CPU central processing unit
  • ASIC application-specific integrated circuit
  • an embodiment of the present application provides a data transmission device.
  • the device serves as the first node of a mobile ad hoc network, and the device includes:
  • the receiving module 901 is configured to receive first data, where the first data carries a destination address;
  • the processing module 902 is used to determine whether the communication distance between the destination node and the first node is less than or equal to N hops, where N is a positive integer greater than or equal to 1 and less than the maximum number of hops of the mobile ad hoc network, and the destination node is the destination address The corresponding node;
  • the processing module 902 is further configured to, if it is determined that the communication distance between the destination node and the first node is less than or equal to N hops, determine the first transmission path according to the neighbor list; wherein, the neighbor list includes the communication distance with the first node in N The address of the neighbor node within the hop range, the node type of the neighbor node whose communication distance with the first node is within N hops, and at least one transmission path from the first node to each of the neighbor nodes within the N hop range.
  • a transmission path refers to the address of the node passing through from the first node to the destination address;
  • the sending module 903 is configured to transmit the first data through the first transmission path.
  • the node type of the first node is a backbone node, where:
  • the processing module 902 is further configured to, if it is determined that the communication distance between the destination node and the first node is greater than N hops, obtain the second transmission path according to the routing table; wherein, the routing table includes each node from the first node to the other nodes
  • the second transmission path includes the address of the second node, the second node is the next hop of the first node indicated in the second transmission path, and other nodes refer to the mobile ad hoc network except the first node Outside node
  • the processing module 902 is further configured to determine whether the second node is the next hop of the first node in the neighbor list according to the address of the second node;
  • the sending module 903 is further configured to transmit the first data according to the second transmission path if the second node is the next hop of the first node in the neighbor list.
  • the processing module 902 is further configured to: if it is determined that in the neighbor list, the second node is not the next hop of the first node, and is a neighbor node within N hops of the first node, according to The neighbor list determines the third transmission path; where the third transmission path includes the addresses of the nodes through which the first data passes from the first node to the second node;
  • the sending module 903 is further configured to transmit the first data through the third transmission path.
  • the processing module 902 is further configured to determine the fourth transmission path according to the neighbor list if it is determined that the second node is not a neighbor node within N hops of the first node in the neighbor list; where , The fourth transmission path includes the address of the node through which the first data is transmitted from the first node to the third node, and the third node is a backbone node within the N hop range of the first node;
  • the sending module 903 is further configured to transmit the first data through the fourth transmission path.
  • the normal node refers to a node other than the backbone node in the mobile ad hoc network
  • the processing module 902 is further configured to determine a fifth transmission path according to the neighbor list if it is determined that the communication distance between the destination node and the first node is greater than N hops; wherein, the fifth transmission path includes transferring the first data from the first node The address of the node passed by the fourth node is transmitted, and the fourth node is a backbone node among neighbor nodes whose communication distance with the first node is within N hops;
  • the processing module 902 is further configured to transmit the first data through the fifth transmission path.
  • the fourth node is the backbone node with the largest dominance factor among the N-hop neighbor nodes of the first node, and the dominance factor is used to characterize the quality of the transmission link from the first node to the fourth node.
  • the receiving module 901 is also used to receive the neighbor maintenance data frame broadcast by each of the neighbor nodes within the N-1 hop range of the first node, and the neighbor maintenance data frame carries the node of each node Type, and the address and node type of neighboring nodes within at least 1 hop of each node;
  • the processing module 902 is further configured to generate a neighbor list of the first node according to the neighbor maintenance data frame.
  • the node type of the first node is a backbone node
  • the receiving module 901 is also used to receive routing control data frames periodically broadcast by other backbone nodes.
  • the routing control data frames carry the addresses and node types of other backbone nodes, and the addresses and nodes of neighboring nodes within the N hop range of other backbone nodes.
  • Type, other backbone nodes refer to backbone nodes other than the first node in the mobile ad hoc network;
  • the processing module 902 is further configured to generate a routing table of the first node according to the routing control data frame.
  • processing module 902 is specifically used to:
  • a transmission path from the first node to each of the other nodes is established according to the routing control data frame, thereby obtaining the routing table of the first node.
  • processing module 902 is also used to:
  • a transmission path from the first node to other nodes is updated according to the routing control data frame to obtain the updated routing table of the first node.
  • the processing module 902 in FIG. 9 may be implemented by the processor 802 in FIG. 8.
  • the receiving module 901 and the sending module 903 in FIG. 9 can be implemented by the transceiver 803 in FIG. 8.
  • an embodiment of the present application provides a computer-readable storage medium, the computer-readable storage medium stores computer instructions, and when the computer instructions run on a computer, The computer is caused to execute the method described in FIG. 2 or FIG. 4 or FIG. 6.
  • this application can be provided as methods, systems, or computer program products. Therefore, this application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, this application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device.
  • the device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.
  • These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so as to execute on the computer or other programmable equipment.
  • the instructions provide steps for implementing the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

Abstract

Cette invention concerne un procédé et un appareil de transmission de données, qui sont utilisés pour améliorer la fiabilité de la transmission de données. Le procédé comprend les étapes consistant à : recevoir des premières données, les premières données transportant une adresse de destination ; déterminer si la distance de communication entre un nœud de destination et le premier nœud est inférieure ou égale à N bonds, N étant un nombre entier positif supérieur ou égal à 1 et inférieur au nombre maximal de bonds du réseau mobile ad hoc ; s'il est déterminé que la distance de communication entre le nœud de destination et le premier nœud est inférieure ou égale à N bonds, déterminer une première voie de transmission en fonction d'une liste de voisins, la liste de voisins comprenant les adresses de nœuds voisins dont la distance de communication avec le premier nœud se trouve la plage de N bonds, et les types de nœud des nœuds voisins ; et transmettre les premières données au moyen de la première voie de transmission.
PCT/CN2020/073325 2019-01-30 2020-01-20 Procédé et appareil de transmission de données WO2020156340A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910094027.4 2019-01-30
CN201910094027.4A CN111510982B (zh) 2019-01-30 2019-01-30 一种传输数据的方法及装置

Publications (1)

Publication Number Publication Date
WO2020156340A1 true WO2020156340A1 (fr) 2020-08-06

Family

ID=71841228

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/073325 WO2020156340A1 (fr) 2019-01-30 2020-01-20 Procédé et appareil de transmission de données

Country Status (2)

Country Link
CN (1) CN111510982B (fr)
WO (1) WO2020156340A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115297192A (zh) * 2022-06-17 2022-11-04 浙江大华技术股份有限公司 Mesh网络数据传输方法、Mesh网络节点及存储介质

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113724414B (zh) * 2021-08-31 2023-06-16 浙江江南工程管理股份有限公司 一种智能巡检方法及系统
CN114039861B (zh) * 2021-12-20 2024-02-06 浪潮思科网络科技有限公司 一种基于tipc协议改造的链式拓扑感知方法、设备及介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120294152A1 (en) * 2011-05-20 2012-11-22 The Regents Of The University Of California Hybrid Cross-Layer Routing Protocol for MANETs
CN102916876A (zh) * 2012-10-24 2013-02-06 浙江大学 一种面向主从结构网络单向链路环境的路由方法
CN103957162A (zh) * 2014-05-14 2014-07-30 常熟理工学院 一种无线网络的路由通信实现方法
CN105517098A (zh) * 2014-10-16 2016-04-20 北京信威通信技术股份有限公司 无线自组网系统及其路由方法
CN105792312A (zh) * 2016-03-02 2016-07-20 山东航天电子技术研究所 一种主动与被动相结合的自组网路由方法

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB0220660D0 (en) * 2002-09-05 2002-10-16 Nokia Corp Signal propogation delay routing
EP1773003B1 (fr) * 2005-10-04 2014-01-15 NTT DoCoMo, Inc. Procédé et dispositif pour découvrir des routes disjointes à multiples noeuds de service
US8451807B2 (en) * 2006-12-20 2013-05-28 Honeywell International Inc. Configuration aware packet routing in an ad-hoc network
US8134950B2 (en) * 2007-04-03 2012-03-13 Harris Corporation Cluster head election in an ad-hoc network
CN101282279B (zh) * 2007-04-04 2010-12-01 同济大学 基于可用带宽测量的无线自组织网络路由方法
CN101217488B (zh) * 2008-01-16 2010-09-08 中南大学 一种可重构的多移动机器人通信方法
CN101951654B (zh) * 2010-08-09 2013-03-20 哈尔滨工程大学 一种面向多水下机器人通信的节能路由方法
CN102036338A (zh) * 2010-12-22 2011-04-27 中国科学院计算技术研究所 一种基于数据驱动链路估计的传感器网络实时路由方法
CN103124421B (zh) * 2012-12-12 2016-06-08 南京邮电大学 一种无线传感器网络中移动节点的分簇方法
CN103108374B (zh) * 2013-01-29 2015-10-14 北京交通大学 一种混合结构矿井应急救援无线网状网的节能路由算法
CN104104605A (zh) * 2013-04-02 2014-10-15 富士通株式会社 下行路由获取及维护方法和装置
CN103415056B (zh) * 2013-08-08 2015-12-02 电子科技大学 一种基于链路质量的移动自组织网络按需路由方法
CN104684025B (zh) * 2013-12-03 2018-11-20 富士通株式会社 网络负载平衡方法、装置和网络
CN108055684B (zh) * 2017-12-19 2020-05-19 河海大学 一种航空自组织网络路由方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120294152A1 (en) * 2011-05-20 2012-11-22 The Regents Of The University Of California Hybrid Cross-Layer Routing Protocol for MANETs
CN102916876A (zh) * 2012-10-24 2013-02-06 浙江大学 一种面向主从结构网络单向链路环境的路由方法
CN103957162A (zh) * 2014-05-14 2014-07-30 常熟理工学院 一种无线网络的路由通信实现方法
CN105517098A (zh) * 2014-10-16 2016-04-20 北京信威通信技术股份有限公司 无线自组网系统及其路由方法
CN105792312A (zh) * 2016-03-02 2016-07-20 山东航天电子技术研究所 一种主动与被动相结合的自组网路由方法

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115297192A (zh) * 2022-06-17 2022-11-04 浙江大华技术股份有限公司 Mesh网络数据传输方法、Mesh网络节点及存储介质
CN115297192B (zh) * 2022-06-17 2024-03-12 浙江大华技术股份有限公司 Mesh网络数据传输方法、Mesh网络节点及存储介质

Also Published As

Publication number Publication date
CN111510982A (zh) 2020-08-07
CN111510982B (zh) 2022-03-11

Similar Documents

Publication Publication Date Title
US7330694B2 (en) Method for setting up route path through route discovery in a mobile ad hoc network using partial route discovery
Tran et al. Congestion adaptive routing in mobile ad hoc networks
US6985476B1 (en) Automatic setting of time-to-live fields for packets in an ad hoc network
KR100957920B1 (ko) 무선 통신 네트워크의 용량 증가를 위해 다수의 라디오를이용하는 시스템 및 방법
WO2020156340A1 (fr) Procédé et appareil de transmission de données
US20180213460A1 (en) Networking devices and methods
US20080240112A1 (en) Layer 2 routing protocol
KR20070032717A (ko) 무선 네트워크에서 주문형 라우팅 프로토콜의 성능을개선하기 위한 시스템 및 방법
WO2017020619A1 (fr) Procédé et dispositif d'acheminement
CN109068367B (zh) 一种无线令牌传递方法、装置、设备及可读存储介质
CN101102283A (zh) 一种在无线接入点上优化未知单播转发的方法及设备
CN110691379A (zh) 一种适于无线自组网的主动式路由通信方法
Mu An improved AODV routing for the zigbee heterogeneous networks in 5G environment
CN109600312B (zh) 一种面向智能终端自组网的BATMAN-Adv协议优化设计方法
CN103037436B (zh) 一种基于HWMP的网络编码感知无线Mesh路由协议
CN109510769B (zh) 一种适合于宽窄结合网络的融合路由系统及其方法
JP2009260720A (ja) 経路制御方法、通信システムおよび通信装置
CN105657774B (zh) 无线自组织网络中自适应核心转发网络的建立方法和系统
SreeRangaRaju et al. Optimized ZRP for MANETs and its Applications
CN104735712B (zh) 一种Ad Hoc网络路由的维护方法
Setty et al. Comparative study of energy aware QoS for proactive and reactive routing protocols for mobile ad-hoc networks
CN106973422B (zh) 一种dsr协议的改进算法
JP2007221568A (ja) 転送遅延制御方法および無線端末
JPWO2008114327A1 (ja) アドレス解決方法
SreeRangaRaju et al. Performance evaluation of ZRP in adhoc mobile wireless network using Qualnet simulator

Legal Events

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

Ref document number: 20747814

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20747814

Country of ref document: EP

Kind code of ref document: A1