CN111510982A

CN111510982A - Data transmission method and device

Info

Publication number: CN111510982A
Application number: CN201910094027.4A
Authority: CN
Inventors: 王峰; 方婧华; 刘刚
Original assignee: Telecommunications Science and Technology Research Institute Co Ltd
Current assignee: Datang Mobile Communications Equipment Co Ltd
Priority date: 2019-01-30
Filing date: 2019-01-30
Publication date: 2020-08-07
Anticipated expiration: 2039-01-30
Also published as: WO2020156340A1; CN111510982B

Abstract

The application provides a method and a device for transmitting data, which are used for improving the reliability of data transmission. The method comprises the following steps: receiving first data, wherein the first data carries a destination address; determining whether a communication distance between a destination node and the first node is less than or equal to N hops, wherein N is a positive integer which is greater than or equal to 1 and less than the maximum hop count of the mobile ad hoc network; if the communication distance between the destination node and the first node is determined to be smaller than or equal to N hops, determining a first transmission path according to a neighbor list; the neighbor list comprises addresses of neighbor nodes with the communication distance to the first node within an N-hop range and node types of the neighbor nodes with the communication distance to the first node within the N-hop range; transmitting the first data through the first transmission path.

Description

Data transmission method and device

Technical Field

The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for transmitting data.

Background

The mobile ad hoc network is a centerless, multi-hop and temporary autonomous system formed by a group of nodes with functions of terminals and routing through transmission links. The node type of the nodes in the mobile ad hoc network is a common node or a backbone node. The backbone nodes are responsible for data broadcasting, routing, etc. in the network. The backbone node is equivalent to a cluster head and a gateway in a clustering network. The common nodes are 1-hop neighbors of the backbone nodes, can be directly communicated with the backbone nodes, and can also be directly communicated with other common neighbor nodes in the 1-hop. And the backbone node and the common node finish data transmission according to corresponding routing protocols. The routing protocol comprises a single-path routing protocol.

The single-path routing protocol is specifically as follows: each node in the mobile ad hoc network periodically broadcasts to maintain a routing table containing paths to all other nodes, and updates the routing table at any time according to the change of the network topology. And when the single-path routing protocol is used for data transmission, each node selects a next hop node according to the routing table. Since 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 a transmission link changes, errors are easily caused in the transmission process of the data. Therefore, in the prior art, a single-path routing protocol is adopted for data transmission, and the reliability of data transmission is low.

Disclosure of Invention

The application provides a method and a device for transmitting data, which are used for improving the reliability of a data transmission process.

In a first aspect, a method for transmitting data is provided, where the method is applied in a first node of a mobile ad hoc network, and the method includes:

receiving first data, wherein the first data carries a destination address;

determining whether a communication distance between a destination node and the first node is smaller than or equal to N hops, wherein N is a positive integer which is larger than or equal to 1 and smaller than the maximum hop count of the mobile ad hoc network, and the destination node is a node corresponding to the destination address;

if the communication distance between the destination node and the first node is determined to be smaller than or equal to N hops, determining a first transmission path according to a neighbor list; the neighbor list comprises addresses of neighbor nodes which are in a communication distance of N hops from the first node, node types of the neighbor nodes which are in a communication distance of N hops from the first node, and at least one transmission path from the first node to each node in the neighbor nodes in the N hops, wherein the first transmission path comprises the addresses of nodes passing from the first node to the destination node;

transmitting the first data through the first transmission path.

In the above scheme, when the communication distance between the first node and the destination node is within the N-hop range, the first node selects one transmission path from at least one transmission path in the neighbor list to transmit the first data, and even if a certain node on a certain path from the first node to the destination node moves or a link changes, the first node can still complete transmission of the first data through other paths in the neighbor list. Compared with the transmission process of a single-path routing protocol in the prior art, the method for transmitting data in the implementation of the application has better adaptability to the mobile self-organizing network and higher reliability of data transmission. Compared with the multi-path transmission protocol in the prior art, the method for transmitting data by storing the multi-path routing protocol from the first node to each node of the mobile ad hoc network has the advantages that the calculation and storage costs are lower compared with the method for transmitting data by the multi-path routing protocol, and the method for storing at least one transmission path of the neighbor node within the N-hop range of the first node in the embodiment of the application.

In one possible design, when the node type of the first node is a backbone node, the method further includes:

if the communication distance between the destination node and the first node is determined to be larger than N hops, a second transmission path is obtained according to a routing table; wherein the routing table includes a transmission path from the first node to each of other nodes, the second transmission path includes an address of a second node, the second node is a next hop of the first node indicated in the second transmission path, and the other nodes refer to nodes in the mobile ad hoc network except the first node;

determining whether the second node is the next hop of the first node in the neighbor list according to the address of the second node;

and if the second node is determined to be the next hop of the first node in the neighbor list, transmitting the first data according to the second transmission path.

In the above scheme, when the first node is a backbone node, 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, transmits the first data through the second transmission path, thereby ensuring the reliability of the second transmission path and further improving the reliability of data transmission.

In one possible design, the method further includes:

if the second node is determined to be not the next hop of the first node in the neighbor list and is a neighbor node in the N-hop range of the first node, determining a third transmission path according to the neighbor list; wherein the third transmission path includes addresses of nodes passed by from the first node to the second node;

transmitting the first data through the third transmission path.

In the above scheme, when the first node is a backbone node, the backbone node compares information in the routing table and the neighbor list, if the information in the routing table is inconsistent with the information in the neighbor list, it indicates that the local topology of the first node may have changed, and if the second node is also a neighbor node in the N-hop range of the first node, the first node may directly determine a transmission path according to the neighbor list, thereby transmitting the first data to the second node. Because the general neighbor list is updated more quickly, the neighbor list is used for transmitting data under the condition that the local topology structure of the first node is changed, and compared with the prior art in which a transmission path is determined directly according to the routing table, the scheme can ensure the reliability of the data transmission path and further improve the reliability of data transmission.

In one possible design, the method further includes:

if the second node is determined not to be a neighbor node in the N-hop range of the first node in the neighbor list, determining a fourth transmission path according to the neighbor list; the fourth transmission path comprises addresses of nodes passing from the first node to a third node, and the third node is a backbone node in an N-hop range of the first node;

transmitting the first data through the fourth transmission path.

In the above scheme, when the first node is a backbone node, the backbone node compares the information in the routing table and the neighbor list, and if the information in the routing table is inconsistent with the information in the neighbor list and possibly because the topological structure of the first node changes too much or the topological structure is in the maintenance state, the second node is not a neighbor node in the N-hop range of the first node, the first node can directly determine the backbone node in the N-hop range according to the neighbor list and transmit the first data to the node, so that the first node can still successfully complete the data transmission process even if the topological structure of the first node changes too much or the topological structure is in the maintenance state, and the reliability of data transmission is further ensured. And the data transmission mode in the scheme has good adaptability to the change of the mobile self-organizing network and high robustness of data transmission.

In one possible design, when the node type of the first node is a normal node, the normal node refers to a node other than a backbone node in the mobile ad hoc network, and the method further includes:

if the communication distance between the destination node and the first node is determined to be larger than N hops, determining a fifth transmission path according to the neighbor list; the fifth transmission path comprises addresses of nodes passed by the first node to a fourth node, and the fourth node is a backbone node in neighbor nodes with the communication distance with the first node within an N-hop range;

transmitting the first data through the fifth transmission path.

In the above scheme, 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 may transmit the first data to the destination address through the node by using a backbone node within the range of N hops.

In one possible design, the fourth node is a backbone node with a largest dominance factor among N-hop neighbor nodes of the first node, and the dominance factor is used to characterize transmission link quality from the first node to the fourth node.

In the above scheme, the backbone node with a large dominance factor is selected as the fourth node, so that the quality of a transmission link between the first node and the fourth node can be ensured, and the quality of data transmission is further improved.

In one possible design, the method further includes:

receiving a neighbor maintenance data frame broadcast by each node in neighbor nodes in the N-1 hop range of the first node, wherein the neighbor maintenance data frame carries the node type of each node and the address and the node type of the neighbor node in at least the 1 hop range of each node;

and generating a neighbor list of the first node according to the neighbor maintenance data frame.

In the above scheme, 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 for generating the neighbor list is simple and direct.

In one possible design, when the node type of the first node is a backbone node, the method includes:

receiving routing control data frames periodically broadcast by other backbone nodes, wherein the routing control data frames carry addresses and node types of the other backbone nodes and addresses and node types of neighbor nodes in an N-hop range of the other backbone nodes, and the other backbone nodes refer to the backbone nodes except the first node in the mobile ad hoc network;

and generating a routing table of the first node according to the routing control data frame.

In the above scheme, a way of generating a routing table is provided, and the first node generates the routing table by using the routing control data frame broadcast by other backbone nodes, so that a common node does not need to participate in the establishment of the routing table, and the calculation overhead can be relatively reduced.

In one possible design, generating a routing table of the first node from the route control data frame includes:

if the first node is determined to receive the routing control data frame for the first time, a transmission path from the first node to each node in other nodes is established according to the routing control data frame, and therefore a routing table of the first node is obtained.

In the above scheme, when receiving a routing control data frame, the first node determines whether the data frame is received for the first time, and if the data frame is received for the first time, establishes a routing table according to the data frame.

In one possible design, after generating the routing table of the first node, the method further includes:

if the first node is determined not to receive the routing control data frame for the first time, determining whether the life cycle TT L of the previous routing control data frame is greater than TT L of the routing control data frame;

if the lifetime TT L of the previous route control data frame is less than TT L of the route control data frame, updating a transmission path from the first node to the other node according to the control data frame, and obtaining an updated routing table of the first node.

In the above scheme, the routing table is selectively updated, so that the calculation cost of the first node can be reduced, and the quality of a transmission path in the routing table can be ensured.

In a second aspect, an apparatus for transmitting data is provided, the apparatus serving as a first node of a mobile ad hoc network, the apparatus comprising:

a memory to store instructions;

a processor for reading the instructions in the memory, performing the following processes:

receiving first data, wherein the first data carries a destination address;

the first node is used for determining whether a communication distance between a destination node and the first node is smaller than or equal to N hops, wherein N is a positive integer which is larger than or equal to 1 and smaller than the maximum hop count of the mobile ad hoc network, and the destination node is a node corresponding to the destination address;

a transceiver for transceiving information under the control of the processor.

In one possible design, when the node type of the first node is a backbone node, the processor is further configured to:

the processor is further configured to determine whether the second node is a next hop of the first node in the neighbor list according to the address of the second node;

In one possible design, the processor is further to:

if the second node is determined to be not the next hop of the first node in the neighbor list and is a neighbor node in the N-hop range of the first node, determining a third transmission path according to the neighbor list; wherein the third transmission path includes addresses of nodes passed by the transmission from the first node to the second node;

transmitting the first data through the third transmission path.

In one possible design, the processor is further to:

transmitting the first data through the fourth transmission path.

In one possible design, when the node type of the first node is a normal node, the normal node refers to a node other than a backbone node in the mobile ad hoc network, and the processor is further configured to:

transmitting the first data through the fifth transmission path.

In one possible design, the processor is further to:

In one possible design, the processor is specifically configured to:

In one possible design, the processor is further to:

after generating the routing table of the first node, if the first node is determined not to receive the routing control data frame for the first time, determining whether the life cycle TT L of the previous routing control data frame is greater than TT L of the routing control data frame;

In a third aspect, an apparatus for transmitting data is provided, the apparatus serving as a first node of a mobile ad hoc network, the apparatus comprising:

a receiving module, configured to receive first data, where the first data carries a destination address;

a processing module, configured to determine whether a communication distance between a 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 a maximum hop count of the mobile ad hoc network, and the destination node is a node corresponding to the destination address;

the processing module is further configured to determine a first transmission path according to a neighbor list if it is determined that the communication distance between the destination node and the first node is less than or equal to N hops; the neighbor list comprises addresses of neighbor nodes which are in a communication distance of N hops from the first node, node types of the neighbor nodes which are in a communication distance of N hops from the first node, and at least one transmission path from the first node to each node in the neighbor nodes in the N hops, wherein the first transmission path comprises the addresses of nodes passing from the first node to the destination node;

and the sending module is used for transmitting the first data through the first transmission path.

In a fourth aspect, there is provided a computer readable storage medium having stored thereon computer instructions which, when run on a computer, cause the computer to perform the method of any of the first aspects.

Drawings

Fig. 1 is a schematic view of an application scenario provided in an embodiment of the present application;

fig. 2 is a flowchart of a method for transmitting data according to an embodiment of the present application;

fig. 3 is a first block diagram of a mobile ad hoc network according to an embodiment of the present invention;

fig. 4 is a flowchart of a method for transmitting data according to an embodiment of the present application;

fig. 5 is a second structural diagram of a mobile ad hoc network according to an embodiment of the present application;

fig. 6 is a flowchart of a method for transmitting data according to an embodiment of the present application;

fig. 7 is a third structural diagram of a mobile ad hoc network according to an embodiment of the present application;

fig. 8 is a block diagram of an apparatus for transmitting data according to an embodiment of the present disclosure;

fig. 9 is a block diagram of an apparatus for transmitting data according to an embodiment of the present disclosure.

Detailed Description

In order to better understand the technical solutions provided by the embodiments of the present application, the following detailed description is made with reference to the drawings and specific embodiments.

1) An Ad hoc network (Ad hoc) is a centerless, multi-hop, temporary autonomous system formed by a group of nodes with terminal and routing functions through transmission links.

2) The cluster head is a cluster head, and a cluster in a wireless network is composed of a group of nodes, and generally, a group of nodes in an adjacent area are composed into a cluster, and the behavior of the nodes in the cluster is coordinated and controlled through a coordinating node (central node), and the coordinating node (central node) is called as the cluster head.

3) The communication dominating set is characterized in that in a hierarchical structure, a network is divided into clusters, each cluster is composed of a cluster head and a plurality of cluster members, in a clustered network, communication among the clusters is completed by means of gateway nodes, and the cluster heads and the gateways form the communication dominating set.

4) And for the network with the distance between all nodes and the cluster heads being 1 hop, the network support set is equal to the communication support set, namely the virtual backbone network. In practical application, different algorithms select different virtual backbones, and the virtual backbones are continuously updated and changed along with the change of time. The virtual backbone network is a connected subset of the mobile ad hoc network.

5) Backbone nodes, which may also be referred to as virtual backbone network nodes, central nodes, or control nodes, refer to nodes in a virtual backbone network, the virtual backbone network is a connected subset in a mobile ad hoc network, and the backbone nodes are equivalent to a cluster head and gateway aggregation in a clustered network.

6) And the common node is a node except the backbone node in the mobile ad hoc network, and the communication distance between the common node and the backbone node is 1 hop. The node type of any node in the mobile self-organizing network is a backbone node or a common node. In a mobile ad hoc network, 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 the node type of a node before is a normal node and then may become a backbone node.

7) The Time To L ive, TT L, refers To the maximum number of segments that the data can pass through before being dropped, during transmission, the TT L of the data is reduced by one every Time the data is forwarded.

8) A Wireless Terminal may be a Mobile Terminal such as a Mobile phone (or a "cellular" phone) and a computer having a Mobile Terminal, e.g., a portable, pocket, hand-held, computer-included, or vehicle-mounted Mobile device that exchanges speech and/or data with a Wireless Access Network (RAN). e.g., a Personal Communication Service (PCS) phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless local loop (Wireless L, cellular L p, W LL) Subscriber Station, a personal digital Assistant (personal digital Assistant), a Remote Terminal (Subscriber Station), a Remote Agent (Subscriber), a User Terminal (User) and a Wireless Access Network (RAN).

The following introduces a scenario to which the embodiment of the present application is applicable, and the embodiment of the present application may be applicable to communication between nodes in a mobile ad hoc network. Referring to fig. 1, fig. 1 is a diagram illustrating an application scenario in an embodiment of the present application. As shown in fig. 1, the mobile ad hoc network includes a plurality of backbone nodes (denoted by M in fig. 1) and a plurality of general nodes (denoted by D in fig. 1). The backbone nodes can communicate with the common nodes of the 1 hop, and the common nodes can directly communicate with other common neighbor nodes in the 1 hop. In fig. 1, the number of backbone nodes is 4, and the number of normal nodes is 5, but the number of backbone nodes and normal nodes is not limited in practice.

The backbone node and the common node may both be routing devices, and the routing devices may specifically be access, aggregation, and core routers, enterprise network routers (e.g., enterprise network edge routers), or home gateways. The backbone nodes and the common nodes can also be terminal devices, and the terminal devices access the Internet through a home gateway and communicate with another terminal device. Some backbone nodes in the plurality of backbone nodes are routing devices, and some backbone nodes are terminal devices. Some common nodes in the plurality of common nodes are routing devices, and some common nodes are terminal devices.

The prior art is explained below with reference to the scene diagram of fig. 1.

In the prior art, a common node and a backbone node complete data transmission through a single-path routing protocol. The specific content of the single-path routing protocol can refer to the content discussed above, and is not described herein again. Because the routing table in the single-path routing protocol stores a single transmission path between two nodes, when a certain node on the transmission path moves or a transmission link changes, the situations such as packet loss and the like are easy to occur, or when the transmission data load is large, the situations such as blockage and the like are easy to occur on the transmission path. Therefore, in the prior art, a single-path routing protocol is adopted for data transmission, so that the adaptability to conditions such as node movement or link change of a mobile ad hoc network is poor, and the reliability of data transmission is poor.

In view of this, the present application provides a method for transmitting data, which is applied in the scenario diagram shown in fig. 1 and is performed by a first node in a mobile ad hoc network. The first node is any one of the nodes in the mobile organization network. The node type of the first node is a backbone node or a regular node. Referring to fig. 2, the flow of the method will be described in detail.

Step 201, receiving first data, wherein the first data carries a destination address;

step 202, determining whether a communication distance between a 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 hop count of the mobile ad hoc network, and the destination node is a node corresponding to the destination address;

step 203, if the communication distance between the destination node and the first node is determined to be less than or equal to N hops, determining a first transmission path according to a neighbor list; wherein the neighbor list includes addresses of neighbor nodes in an N-hop range of communication distance from the first node and node types of the neighbor nodes in the N-hop range of communication distance from the first node, and the first transmission path includes addresses of nodes through which first data is transmitted from the first node to the destination address;

step 204, transmitting the first data through the first transmission path.

In step 201, when the first node is a source node for transmitting the first data, the first node generates the first data according to the data obtaining request of the other node, that is, the first data is received. The get data request includes a destination address and an identification of the requested data. Or, for example, when the first node is an intermediate node in the process of transmitting the first 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 needing to be transmitted. The first data carries the destination address. The destination address is an address corresponding to the destination node, and may also be referred to as a destination network address. The destination Address is, for example, an Internet Protocol Address (IP) Address of the destination node, or a unique Identification (ID) of the destination node in the mobile organization network. In addition, the first data further includes data content to be transmitted.

After the first node receives the first data, the first node performs step 202 of determining whether the communication distance between the destination node and the first node is less than or equal to N hops.

Wherein, N is a positive integer which is greater than or equal to 1 and less than the maximum hop count of the mobile ad hoc network. The maximum hop count of the mobile ad hoc network refers to the communication distance between a source node and a destination node in the longest transmission link of the mobile ad hoc network at the current moment.

The manner in which step 202 is performed is illustrated below.

The first way to execute step 202 is:

and 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.

In the first way of executing step 202, the first node needs to acquire the neighbor list first, and the method for acquiring the neighbor list is described as an example below.

In the embodiment of the application, the first node receives neighbor maintenance data frames broadcast by each node in the neighbor nodes in the N-1 hop range, and the first node generates a neighbor list of the first node according to the neighbor maintenance data frames.

After the mobile ad hoc network is constructed, each node in the mobile ad hoc network is synchronized, but each node does not know which neighbor nodes are. The first node needs to discover its own neighbor nodes first. There are many ways to discover N-hop neighbor nodes, and the following examples are given.

The first node may periodically broadcast the probe packet, receive and discover neighbor nodes within the N-hop range according to the response packets of other nodes.

The N-hop range refers to a neighbor node with a communication distance with the first node being less than or equal to N hops. The probing Packet (EP) includes the address of the current probing node. The Response Packet (RP) includes the address of the current node and the path from the current responding node to the current probing node.

After the first node can discover neighbor nodes within the range of N hops, the first node and other nodes broadcast own neighbor data maintenance frames. The first node receives neighbor maintenance data frames broadcast by each node in the neighbor nodes within the range of N-1 hop, and the first node establishes a neighbor list of the first node according to the neighbor maintenance data frames.

The neighbor maintenance data frame carries the node type of each node, and the address and the node type of the neighbor node in at least 1-hop range of each node. The node type is a backbone node or a generic node as mentioned in the foregoing. Neighbor maintenance data frames such as hello packets. The specific format and content of the neighbor maintenance data frame may be set according to actual requirements, and this document is not particularly limited.

The neighbor list may be understood as a local topology of the first node, i.e. a relationship between the first node and neighbor nodes within an N-hop range. The neighbor list includes addresses of neighbor nodes that are in an N-hop range of communication distance from the first node, node types of the neighbor nodes that are in the N-hop range of communication distance from the first node, and at least one transmission path from the first node to each of the neighbor nodes in the N-hop range. The specific form of the neighbor list is various, and the specific form of the neighbor list is not limited herein.

In one possible design, the neighbor data maintenance frame further includes a unique identifier for distinguishing neighbor data maintenance frames broadcast by the node at different periods.

Specifically, the first node may periodically receive a neighbor maintenance data frame broadcast by each node in the neighbor nodes within the N-1 hop range, and after receiving the neighbor data maintenance frame, the first node may determine, according to the unique identifier, whether the first node receives the neighbor data maintenance frame for the first time, and if not, periodically update the neighbor list according to the neighbor data maintenance frame, thereby ensuring that information in the neighbor list can accurately reflect the current topology structure of the mobile ad hoc network.

The neighbor list stores the addresses and node types of the neighbor nodes in the first node within the range of N hops, so that the first node can inquire the neighbor list according to the destination address, if the neighbor list has the destination address, the communication distance between the destination node and the first node is within the range of N hops, and the first node can determine that the communication distance between the destination node and the first node is less than or equal to N hops. If the neighbor list does not have the destination address, the first node may determine that the communication distance between the destination node and itself is greater than N hops.

For example, referring to fig. 3, fig. 3 is a structural diagram of a current mobile ad hoc network, where the mobile ad hoc network includes a virtual backbone network formed by five backbone nodes (node 3, node 7, node 1, node 2, and node 5), and also includes four common nodes (node 15, node 6, node 4, and node 8). Taking the value of N as 2 and the first node as node 7 as an example, the neighbor list of node 7 can be shown in table 1 below:

TABLE 1

After the first node performs step 202, if the first node determines that the communication distance between the destination node and the first node is less than or equal to N hops, step 203 is performed to determine a first transmission path according to the neighbor list.

Specifically, since at least one transmission path from the first node to each neighbor node in the N-hop range is stored in the neighbor list, the first node determines at least one transmission path from the first node to the destination node directly according to the at least one transmission path stored in the neighbor list. The contents of the neighbor list can refer to the contents discussed above, and are not described herein.

If there is only one transmission path from the first node to the destination node in the neighbor list, the 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. A method of determining the first transmission path is exemplified below.

The first method for determining the first transmission path comprises the following steps:

one of the plurality of transmission paths is randomly selected as a first transmission path. The first node is randomly selected, redundant calculation is not needed for the first node, the determination mode is simple, and flexibility is high.

Second, the method for determining the first transmission path comprises:

and determining the transmission path with the highest link quality in the plurality of transmission paths as a first transmission path.

Specifically, the link qualities of the multiple transmission paths are 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.

In the embodiment of the application, the transmission path with the highest link quality is selected as the first transmission path, so that the transmission quality of the first data can be ensured.

Thirdly, the method for determining the first transmission path comprises the following steps:

and determining a transmission path matched with the priority level of the first data transmission as a first transmission path in the plurality of transmission paths according to the priority level of the first data transmission.

Specifically, the priority level is used to indicate the importance of data transmission. If the priority level of the data is higher, it indicates that the data is more important. The link quality corresponding to each transmission path in the plurality of transmission paths is different, the data with the highest priority can be transmitted through the transmission path with high link quality, and the data with relatively low transmission priority can be transmitted through the transmission path with relatively low link quality.

The priority level of the first data may be carried in the first data in advance, or may be determined by the first node.

In the embodiment of the application, the corresponding transmission paths are determined according to different priority levels of data, so that the requirements of data transmission of different priority levels can be met, and the loads of all transmission paths can be relatively balanced.

After the first node performs step 203, the first node performs step 204 of transmitting the first data through the first transmission path, thereby transmitting the data to the destination node.

It should be noted that, whether the node type of the first node is a backbone node or a normal node, step 201, step 202, step 203 and step 204 in the above embodiments may be performed during data transmission.

In step 202, if the first node determines that the communication distance between the destination node and the first node is greater than N hops, and the type of the first node is different, the corresponding manner of transmitting the first data is different. The following describes a manner of transmitting the first data when the node types of the first nodes are different.

Referring to fig. 4, when the node type of the first node is a backbone node, fig. 4 is a flowchart illustrating a transmission method when the first node is a backbone node. The contents of step 201 and step 202 in fig. 4 can refer to the foregoing discussion, and are not described here again. In step 202, if it is determined that the first node determines that the communication distance between the destination node and the first node is greater than N hops, the first node performs step 401, that is, determines the second transmission path according to the routing table.

Before executing step 401, the first node needs to establish a routing table in various ways, which is described in the following.

One way to establish a routing table is:

the method comprises the steps that a first node receives routing control data frames periodically broadcast by other backbone nodes, the routing control data frames carry addresses and node types of the other backbone nodes and addresses and node types of neighbor nodes in N-hop ranges of the other backbone nodes, and the other backbone nodes refer to the backbone nodes except the first node in the mobile self-organizing network;

Specifically, as mentioned in step 202, each node in the mobile ad hoc network sends a corresponding neighbor maintenance data frame and establishes its own neighbor list. Each backbone node can generate a route control data frame according to the neighbor list, or each backbone node can directly generate a route control data frame according to neighbor maintenance data frames sent by other nodes.

Each route control data frame is used for representing the current local area topological structure of each backbone node, and specifically comprises the address and the node type of the node, and the address and the node type of a neighbor node in the N-hop range of the node. There are many encapsulation formats for the routing control data frame, please refer to table 2, where table 2 is an example of an encapsulation format for the routing control data frame.

TABLE 2

Referring to table 2, the routing control data frame includes a service type, a datagram length, a flag and a slice offset, a destination address, a source address, a packet header checksum, TT L, a routing control data identification, a forwarding node address, a neighbor list length, and a general node neighbor list.

Wherein the service type is used to represent data of different service types. The service type is generally 8 bits in length, the first two bits of the 8 bits are used for indicating a data source, and the last six bits of the 8 bits are used for distinguishing different data of the same service type sent by the same node. For example, the first two bits are 11, which indicate the source and routing data.

The datagram length is used to indicate the total length of the routing control data frame, and is generally 8 bits in length, and the length unit may be two bytes (4bytes), and the length range is 2 to 256, and all 0 s indicate 256. The flag and slice offset, which are used to indicate the slice flag of the route control data frame, are typically 8 bits in length, and the route control data frame is not sliced, so this field is fixed to 00000000.

The destination address is used for indicating the destination address of the routing control data frame transmission, and the destination address of the routing control data frame is fixed to 11111111111 because the routing control data frame is broadcast in the virtual backbone network. The source address, which is used to indicate the address of the node that sent the routing control data frame, is typically 8 bits in length. The header checksum is used to check the header of the routing control frame, and the length of the header checksum is generally 8 bits.

TT L, for indicating the lifetime of the route control data frame, generally 4-bit long, identifies, determined by the node sending the route control data frame, for distinguishing different route control data sent by the backbone node, generally 4-bit long, forwarding node address, for indicating the latest forwarding node address, generally 8-bit long, neighbor list length, for indicating the number of neighbor nodes in the normal node neighbor list of the backbone node, generally 8-bit long, normal node neighbor address list, refers to the address list of normal nodes within N hops of the first node.

After each backbone node generates the route control data frame and each backbone node in the mobile ad hoc network broadcasts the route control data frame, the first node may receive the route control data frames sent by other backbone nodes.

The first node can directly establish a routing table when receiving the routing control data frame of the other backbone node sending end. Alternatively, after receiving the route control data frame, the first node may determine whether the route control data frame sent by the backbone node is received for the first time.

The first node may determine whether the route control data frame is received for the first time according to the service type, the source address and the identification in the route control data frame. If the first node receives the route control data frame for the first time, a transmission path from the first node to the backbone node and a transmission path from the first node to each node in the neighbor nodes in the N-hop range of the backbone node can be established according to the route control data frame, and so on, when the first node establishes transmission paths with all other nodes, the routing table of the first node is obtained.

If the first node does not receive the routing control data frame for the first time, judging whether the TT L of the current routing data frame is larger than 1, if the TT L is equal to 1, the current routing control data frame is not processed, if the TT L of the current routing control data frame is larger than 1, the sizes of the TT L of the current routing control data frame and the last routing control data frame are compared, and the last routing control data frame refers to a data frame which has the same source address, the same service type and different identification with the source address of the current routing control data frame.

If the survival period TT L of the last routing control data frame is less than TT L of the routing control data frame, the number of network segments passed by the current transmission link from the source address to the first node is less, and the number of hops passed by the transmission link indicated by the current routing control data frame is less, so that a transmission path from the first node to other nodes is updated according to the current routing control data frame, and the updated routing table of the first node is obtained.

In the embodiment of the application, the routing table is selectively updated, so that the reliability of each transmission link in the current routing table can be ensured.

In the embodiment of the application, in order to facilitate other backbone nodes to establish or update the routing table, the first node modifies the TT L of the control data frame, forwards the node address and continues to forward the routing control data frame while updating the routing table.

For example, with continued reference to fig. 3, the routing table for node 7 in fig. 3 is shown in table 3 below:

TABLE 3

Transmission path (destination node: next hop of node 7)
	15：15
2:3
	3:3
4:3
	5:3
6:6
	1:3
8:3

In the embodiment of the application, the first node periodically updates the neighbor list and the routing table, and the update period of the neighbor list is smaller than the update period of the routing table.

The updating period of the first node for updating the neighbor list is less than the updating period of the routing table, and when the topological structure of the mobile ad hoc network changes, the updating of the neighbor list provides buffering time for updating the routing table. And even if the routing table is not updated in time, the first node can rely on the neighbor list to transmit data, so that the reliability of data transmission is ensured.

For example, referring to fig. 3 again, when the first node is a backbone node and is the node 7 in fig. 3, the routing control data frame sent by the node 7 is encapsulated according to the format in table 2, and the obtained routing control data frame is shown in table 4 below.

TABLE 4

After 2 hops, the node 7 sends the routing control data frame to the node 3, and the node 3 sends the routing control data frame to the node 1, where the routing control data frame received by the node 1 is shown in table 5 below.

TABLE 5

It can be seen that node 1 receives routing control data frames with a reduced TT L compared to routing data frames sent by node 7, and the forwarding node address changes.

Thus, the node 1 can establish a transmission path to the node 7, the node 15, and the node 6 according to the received route control data frame in the table 5, and forward the route control data frame.

The routing control data frame forwarded by the node 1 is received by the node 5, and the control data frame received by the node 5 is specifically shown in the following table 6.

TABLE 6

If the node 1 receives the routing control data frame shown in table 6 sent by the node 5 again, the node 1 determines that the routing data frame identified as 0100 has been processed, and the TT L of the routing control data frame shown in table 6 is smaller than the previous routing control data frame (i.e., the routing control data frame shown in table 5), then the node 1 does not perform any processing on the received current routing control data frame.

After the first node establishes the routing table, since one transmission path from the first node to each of the other nodes is stored in the routing table, the first node can determine the second transmission path from the routing table according to the routing table and the destination address.

Wherein the second transmission path includes an address of the second node, and the second transmission path is one 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.

After the first node performs step 401, the first data may be transmitted directly through the second transmission path.

Specifically, the first node sends the first data to a next hop node of the first node, and the next hop node continues to transmit the first data until the first data is transmitted to the destination address.

However, when the first node determines the second transmission path, the first node cannot determine whether the topology in the current mobile ad hoc network is changed. Therefore, referring to fig. 4 again, in this embodiment, after the first node performs step 401, step 402 may be performed to determine whether the second node is in the neighbor list and is the next hop of the first node according to the address of the second node.

Specifically, in the routing table, the second node is the next hop of the first node, but the topology structure in the mobile ad hoc network may be changed, and the first node updates the neighbor list. Thus, the second node may not necessarily be the next hop of the first node in the neighbor list.

If the first node determines that the second node is in the neighbor list and still is the next hop of the first node according to the neighbor list, the first node performs step 403, that is, transmits the first data according to the second transmission path.

Specifically, when the first node determines that the second node is still the next hop of the first node in the neighbor list, it indicates that the topology structure of the first node has not changed temporarily, and therefore, the first node may directly transmit the first data to the second node through the second transmission path.

If 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 404, i.e., determines whether the second node is a neighbor node in the N-hop range of the first node.

Specifically, when the first node determines that the second node is not the next hop of the first node in the neighbor list, it indicates that the topology of the first node may have changed, and therefore, the first node further needs to determine whether the second node is a neighbor node in the N-hop range of the first node according to the neighbor list, that is, the first node further 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 may query the neighbor list according to the address of the second node, and if the address of the second node is in the neighbor list, it indicates that the second node is a neighbor node in the N-hop range of the first node. And if the address of the second node is not in the neighbor list, the second node is not a neighbor node in the N-hop range of the first node.

In step 404, if the first node determines that the second node is a neighbor node within N hops of the first node, the first node performs step 405, that is, determines a third transmission path according to the neighbor list, where the third transmission path refers to an address of a node passing from the first node to the second node.

Specifically, if the second node is within the N-hop range of the first node, the first node directly selects one transmission path as the third transmission path according to the neighbor list. Of course, in the neighbor list, there may be multiple transmission paths from the first node to the second node, and the manner for the first node to determine the third transmission path from the multiple transmission paths may refer to the content of determining the first transmission path from the multiple transmission paths discussed in step 203, and is not described herein again.

After the first node performs step 405, it performs step 406 to transmit the first data through the third transmission path.

Specifically, after the first node determines the third transmission path, the first node transmits the first data to the second node through the third transmission path.

In step 404, if the first node determines that the second node is not a neighbor node in the N-hop range of the first node, step 407 is executed, i.e., a fourth transmission path is determined according to the neighbor list.

The fourth transmission path refers to an address of a node through which the first data is transmitted from the first node to a third node, and the third node is a backbone node in an N-hop range of the first node.

Specifically, the first node determines that the second node is not a neighbor node in the N-hop range of the first node, and then the first node searches for a backbone node in the N-hop range of the first node according to the neighbor list, that is, determines the third node, thereby determining the fourth transmission path.

Since there may be more than one backbone node in the N-hop range, the first node needs to select one backbone node from the plurality of backbone nodes as the third node. Specific implementations thereof include, but are not limited to, the following, which are described below.

The first method comprises the following steps:

randomly selecting one backbone node from the backbone nodes within the range of N hops from the first node as a third node.

Specifically, there may be a plurality of backbone nodes whose communication distance from the first node is less than or equal to N hops, and the first node randomly selects one of the backbone nodes as a third node. The mode for determining the third node is simple and flexible.

And the second method comprises the following steps:

and determining a third node according to the dominance factor.

Specifically, the backbone node with the largest dominance factor is determined to be the third node from the backbone nodes within the range of N hops from the first node. Or in order to simplify the processing capacity of the first node, the backbone node with the largest dominance factor is determined as the third node from the backbone nodes within 1 hop range of the first node.

Wherein the dominating factor is used to characterize the transmission link quality. The dominance factor is selected, for example, as an index representing a characteristic of the node, such as ID, node remaining energy, and moving speed. The dominating factor is selected to represent network characteristics, such as connectivity of nodes, coverage of nodes, category of nodes, and the like.

After the first node performs step 407, the first node performs step 408 of transmitting the first data via the fourth transmission path.

Specifically, the first node transmits the first data to the third node through the fourth transmission path. The third node continues to propagate until it is transmitted to the destination address.

Referring to fig. 5, fig. 5 shows a structure diagram of the mobile ad hoc network shown in fig. 3 after being updated, and N is 2. Compared with fig. 3, the position of the node 7 in fig. 6 is changed, and the node 7 is disconnected from the node 3.

At this time, the routing table is not updated in time (still the routing table shown in table 3), the neighbor list of the node 7 is updated, and the updated neighbor list of the node 7 is as follows:

TABLE 7

At this time, if the node 7 is to transmit the first data to the node 3, the node 7 first determines whether the node 3 is a 2-hop neighbor node of itself, and determines that the node 3 is a 2-hop neighbor node of itself. The node 7 inquires the neighbor list to determine that the transmission path from the node 7 to the node 3 is 7-15-3 or 7-6-15-3, so that the node 7 can randomly select one transmission path to transmit the first data to the node 3.

Referring to fig. 5, if the node 7 is to send the first data to the node 1, and the node 7 determines that the node 1 is not a neighbor node in its two-hop range, the routing table (e.g., table 3) is searched to determine that the next hop transmitted to the node 1 is the node 3.

Node 7 then queries the neighbor list (shown in table 7) to determine that node 3 is not the next hop for node 7, and thus node 7 determines that node 3 is a neighbor node within 2 hops of node 7. Therefore, the node 7 selects any one transmission path of "3: 3, 3:6, 3: 15" in the neighbor list, for example, the node 7 selects "3: 15", the node 7 sends the first data to the node 15, the node 15 sends the first data to the node 3, and finally the node 3 sends the first data to the node 1, thereby completing the transmission process.

When the node type of the first node is a normal node, please refer to fig. 6, and the contents of step 201 and step 202 in fig. 6 may refer to the foregoing discussion, which is not described herein again. In step 202, when the first node determines that the communication distance between the destination node and the first node is greater than N hops, the first node performs step 601, that is, determines a fifth transmission path according to the neighbor list.

Specifically, when it is determined that the communication distance between the first node and the destination node is greater than N hops, since the transmission path between the first node and the node that exceeds N hops is not stored in the neighbor list, the first node determines a fifth transmission path according to the neighbor list, where the fifth transmission path is an address of a node through which the first node passes to the fourth node.

The fourth node is a backbone node with the communication distance with the first node within the range of N hops.

Since there may be more than one backbone node in the N-hop range, the first node needs to select one backbone node from the plurality of backbone nodes as the fourth node. The content of determining the third node in step 407 can be referred to, and details thereof are not described here.

After the fourth node is determined, there may be more than one transmission path from the first node to the fourth node in the neighbor list, so that a third transmission path needs to be selected from the multiple transmission paths, and the manner of determining the third transmission path may refer to the content of determining the first transmission path discussed above, and is not repeated here.

After the first node performs step 601, the first node may perform step 602, i.e. transmit the first data through the third transmission path.

Specifically, the first node transmits the first data to the fourth node through the determined third transmission path.

Referring to fig. 7, fig. 7 shows a structure diagram of the mobile ad hoc network shown in fig. 3 after being updated, and N is 2. In comparison with fig. 3, the position of the node 15 in fig. 7 is changed, and the node 15 is disconnected from the

nodes

3 and 7.

However, at this time, the routing table may not be updated in time, if the node 15 is to send the first data to the node 8, it is first determined whether the node 8 is a 2-hop neighbor node of itself, and if the node 15 determines that the node 8 is not a two-hop neighbor node of itself, it is determined that the backbone node is within the 2-hop range. Node 15 finds node 7 to be a neighbor node in the range of 2 hops, and therefore node 15 sends the first data to node 7 through node 6.

In addition to the method for transmitting data discussed above, an apparatus for transmitting data is provided, the apparatus is used as a first node of a mobile ad hoc network, and referring to fig. 8, the apparatus includes:

a memory 801 for storing instructions;

the processor 802, for reading the instructions in the memory 801, executes the following processes:

receiving first data, wherein the first data carries a destination address;

the method comprises the steps that whether the communication distance between a target node and a first node is smaller than or equal to N hops or not is determined, N is a positive integer which is larger than or equal to 1 and smaller than the maximum hop count of the mobile ad hoc network, and the target node is a node corresponding to a target address;

if the communication distance between the target node and the first node is smaller than or equal to N hops, determining a first transmission path according to the neighbor list; the neighbor list comprises addresses of neighbor nodes with communication distances to the first node within an N-hop range, node types of the neighbor nodes with communication distances to the first node within the N-hop range, and at least one transmission path from the first node to each node in the neighbor nodes within the N-hop range, wherein the first transmission path comprises the addresses of nodes passing from the first node to a destination node;

a transceiver 803 for transceiving information under the control of the processor 802.

In one possible design, when the node type of the first node is a backbone node, the processor 802 is further configured to:

if the communication distance between the target node and the first node is determined to be larger than N hops, a second transmission path is obtained according to the routing table; the routing table comprises a transmission path from the first node to each node in other nodes, the second transmission path comprises the address of the second node, the second node is the next hop of the first node indicated in the second transmission path, and the other nodes refer to nodes except the first node in the mobile ad hoc network;

the processor 802 is further configured to determine whether the second node is a next hop of the first node in the neighbor list according to the address of the second node;

In one possible design, processor 802 is further to:

if the second node is determined to be not the next hop of the first node in the neighbor list and is a neighbor node in the N-hop range of the first node, determining a third transmission path according to the neighbor list; wherein the third transmission path includes addresses of nodes through which transmission from the first node to the second node passes;

the first data is transmitted through the third transmission path.

In one possible design, processor 802 is further to:

if the second node is determined not to be the neighbor node in the N-hop range of the first node in the neighbor list, determining a fourth transmission path according to the neighbor list; the fourth transmission path comprises addresses of nodes passing from the first node to a third node, and the third node is a backbone node in an N-hop range of the first node;

the first data is transmitted through a fourth transmission path.

In one possible design, when the node type of the first node is a normal node, the normal node refers to a node other than a backbone node in the mobile ad hoc network, and the processor 802 is further configured to:

if the communication distance between the target node and the first node is larger than N hops, determining a fifth transmission path according to the neighbor list; the fifth transmission path comprises addresses of nodes passed by the first node to the fourth node, and the fourth node is a backbone node in neighbor nodes with the communication distance with the first node within an N-hop range;

the first data is transmitted through a fifth transmission path.

In one possible design, the fourth node is a backbone node with the largest dominance factor among N-hop neighbor nodes of the first node, and the dominance factor is used for characterizing transmission link quality from the first node to the fourth node.

In one possible design, processor 802 is further to:

receiving a neighbor maintenance data frame broadcast by each node in neighbor nodes in an N-1 hop range of a first node, wherein the neighbor maintenance data frame carries a node type of each node and an address and a node type of the neighbor node in at least the 1 hop range of each node;

receiving routing control data frames periodically broadcast by other backbone nodes, wherein the routing control data frames carry addresses and node types of the other backbone nodes and addresses and node types of neighbor nodes in N-hop ranges of the other backbone nodes, and the other backbone nodes refer to the backbone nodes except for a first node in the mobile ad hoc network;

In one possible design, processor 802 is specifically configured to:

if the first node is determined to receive the route control data frame for the first time, a transmission path from the first node to each of other nodes is established according to the route control data frame, and thus a route table of the first node is obtained.

In one possible design, processor 802 is further to:

and if the survival period TT L of the last routing control data frame is smaller than the TT L of the routing control data frame, updating a transmission path from the first node to other nodes according to the control data frame, and obtaining an updated routing table of the first node.

The transceiver 803 and the memory 801 in fig. 8 may be coupled to the processor 802 as an example.

It should be noted that fig. 8 illustrates one processor 802, but the number of processors 802 is not limited in practice.

The processor 802 may be a Central Processing Unit (CPU) or an application-specific integrated circuit (ASIC), may be one or more integrated circuits for controlling program execution, and may be a baseband chip, or the like.

On the basis of the foregoing discussion of a method for transmitting data, an embodiment of the present application provides an apparatus for transmitting data, where the apparatus serves as a first node of a mobile ad hoc network, and the apparatus includes:

a receiving module 901, configured to receive first data, where the first data carries a destination address;

a processing module 902, configured to determine whether a communication distance between a destination node and a 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 a maximum hop count of a mobile ad hoc network, and the destination node is a node corresponding to a destination address;

the processing module 902 is further configured to determine a first transmission path according to the neighbor list if it is determined that the communication distance between the destination node and the first node is less than or equal to N hops; the neighbor list comprises addresses of neighbor nodes with communication distances to the first node within an N-hop range, node types of the neighbor nodes with the communication distances to the first node within the N-hop range, and at least one transmission path from the first node to each node in the neighbor nodes within the N-hop range, wherein the first transmission path refers to the addresses of the nodes passing through from the first node to a destination address;

a sending module 903, configured to transmit the first data through the first transmission path.

In one possible design, when the node type of the first node is a backbone node, wherein:

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 a second transmission path according to the routing table; the routing table comprises a transmission path from the first node to each node in other nodes, the second transmission path comprises the address of the second node, the second node is the next hop of the first node indicated in the second transmission path, and the other nodes refer to nodes except the first node in the mobile ad hoc network;

the processing module 902 is further configured to determine whether the second node is a 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.

In a possible design, the processing module 902 is further configured to determine, according to the neighbor list, a third transmission path if it is determined that the second node is not a next hop of the first node and is a neighbor node within an N-hop range of the first node in the neighbor list; wherein the third transmission path includes addresses of 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 a third transmission path.

In a possible design, the processing module 902 is further configured to determine a fourth transmission path according to the neighbor list if it is determined that the second node is not a neighbor node in the N-hop range of the first node in the neighbor list; the fourth transmission path comprises an address of a node through which the first data is transmitted from the first node to the third node, and the third node is a backbone node in the N-hop range of the first node;

the sending module 903 is further configured to transmit the first data through a fourth transmission path.

In one possible design, when the node type of the first node is a normal node, the normal node refers to a node in the mobile ad hoc network except for the backbone node;

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; the fifth transmission path comprises an address of a node through which the first data are transmitted from the first node to the fourth node, and the fourth node is a backbone node in neighbor nodes of which the communication distance with the first node is within an N-hop range;

the processing module 902 is further configured to transmit the first data through a fifth transmission path.

In a possible design, the receiving module 901 is further configured to receive a neighbor maintenance data frame broadcast by each node in neighbor nodes in an N-1 hop range of the first node, where the neighbor maintenance data frame carries a node type of each node and an address and a node type of a neighbor node in at least a 1-hop range 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.

In one possible design, when the node type of the first node is a backbone node;

the receiving module 901 is further configured to receive a routing control data frame periodically broadcast by other backbone nodes, where the routing control data frame carries addresses and node types of the other backbone nodes, and addresses and node types of neighbor nodes in an N-hop range of the other backbone nodes, and the other backbone nodes refer to backbone nodes in the mobile ad hoc network except for the first node;

the processing module 902 is further configured to generate a routing table of the first node according to the routing control data frame.

In one possible design, the processing module 902 is specifically configured to:

In one possible design, processing module 902 is further configured to:

and if the survival period TT L of the last routing control data frame is smaller than the TT L of the routing control data frame, updating a transmission path from the first node to other nodes according to the routing control data frame, and obtaining an updated routing table of the first node.

The processing module 902 of fig. 9 may be implemented by the processor 802 of fig. 8, for one embodiment. The receiving module 901 and the sending module 903 in fig. 9 may be implemented by the transceiver 803 in fig. 8.

On the basis of the foregoing discussion of a method for transmitting data, embodiments of the present application provide a computer-readable storage medium storing computer instructions that, when executed on a computer, cause the computer to perform the method as described in fig. 2 or fig. 4 or fig. 6.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims

1. A method for transmitting data, the method being applied to a first node of a mobile ad hoc network, the method comprising:

receiving first data, wherein the first data carries a destination address;

transmitting the first data through the first transmission path.

2. The method of claim 1, wherein when the node type of the first node is a backbone node, the method further comprises:

3. The method of claim 2, wherein the method further comprises:

transmitting the first data through the third transmission path.

4. The method of claim 2 or 3, wherein the method further comprises:

transmitting the first data through the fourth transmission path.

5. The method of claim 1, wherein when the node type of the first node is a normal node, the normal node refers to a node other than a backbone node in the mobile ad hoc network, the method further comprising:

transmitting the first data through the fifth transmission path.

6. The method of claim 5, wherein the fourth node is a backbone node of N-hop neighbor nodes of the first node having a largest dominance factor used to characterize transmission link quality of the first node to the fourth node.

7. The method of claim 1, wherein the method further comprises:

8. The method of claim 1 or 7, wherein when the node type of the first node is a backbone node, the method comprises:

9. The method of claim 8, wherein generating a routing table for the first node based on the routing control data frame comprises:

10. The method of claim 8, after generating the routing table for the first node, further comprising:

11. An apparatus for transmitting data as a first node of a mobile ad hoc network, the apparatus comprising:

a memory to store instructions;

receiving first data, wherein the first data carries a destination address;

a transceiver for transceiving information under the control of the processor.

12. The apparatus of claim 11, wherein when the node type of the first node is a backbone node, the processor is further configured to:

13. The apparatus of claim 12, wherein the processor is further configured to:

transmitting the first data through the third transmission path.

14. The apparatus of claim 12 or 13, wherein the processor is further configured to:

transmitting the first data through the fourth transmission path.

15. The apparatus of claim 11, wherein when the node type of the first node is a normal node, the normal node refers to a node in the mobile ad hoc network other than a backbone node, the processor is further configured to:

transmitting the first data through the fifth transmission path.

16. The apparatus of claim 15, wherein the fourth node is a backbone node of N-hop neighbor nodes of the first node having a largest dominance factor characterizing transmission link quality from the first node to the fourth node.

17. The apparatus of claim 11, wherein the processor is further configured to:

18. The apparatus of claim 11 or 17, wherein when the node type of the first node is a backbone node, the processor is further to:

19. The apparatus of claim 18, wherein the processor is specifically configured to:

20. The apparatus of claim 18, wherein the processor is further configured to:

21. An apparatus for transmitting data as a first node of a mobile ad hoc network, the apparatus comprising:

22. A computer-readable storage medium having stored thereon computer instructions which, when executed on a computer, cause the computer to perform the method of any one of claims 1-10.