Data transmission method and device in ad hoc network, storage medium and node

Abstract

The invention discloses a data transmission method and device in an ad hoc network, a storage medium and nodes, and relates to the technical field of communication, and each node in the ad hoc network can execute the following steps: collecting global situation information, the global situation information comprising intra-domain real-time situation information and extra-domain under-real-time situation information, the intra-domain real-time situation information is obtained according to node real-time situation information of nodes in a predetermined area where the nodes are located, and the extra-domain under-real-time situation information is obtained according to node under-real-time situation information of nodes outside the predetermined area; in response to the data transmission instruction, if the target node is located in the predetermined area, performing active routing decision and data forwarding based on the in-domain real-time situation information; and if the target node is located outside the predetermined area, carrying out directed deep routing search and data forwarding of an equation while being transmitted by combining the real-time situation information in the area and the under-real-time situation information outside the area. The data transmission reliability under the large-scale ad hoc network can be improved.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a data transmission method, device, storage medium and node in a self-organizing network. Background Art

[0002] With the development of technology, the scale of self-organizing networks, such as drone equipment clusters, is getting larger and larger. Nodes in self-organizing networks usually have data transmission needs. For example, nodes in self-organizing networks may need to forward business data to one or more target nodes. In practice, when transmitting data in self-organizing networks, node trajectory planning and preset matching of optimal data transmission paths are usually performed by presetting the initial position and height of all nodes in the self-organizing network and the position and height of all target nodes, as well as presetting trajectories.

[0003] At present, this method of pre-setting information still has many limitations in practical applications, especially in data transmission decisions, and lacks flexibility. The communication distance of each node in a large-scale ad hoc network is usually limited. When the target node exceeds the communication range of the source node and requires multi-hop intermediate node relay forwarding, due to the dynamic nature of the ad hoc network topology and the time-varying nature of the wireless transmission channel, it is very easy for business data to be difficult to reliably reach the target node. Therefore, there is currently a problem of low reliability in data transmission in ad hoc networks. Summary of the invention

[0004] The embodiment of the present application provides a solution that can effectively improve the reliability of data transmission in an ad hoc network.

[0005] The embodiments of the present application provide the following technical solutions: According to one embodiment of the present application, a method for data transmission in a self-organizing network includes multiple nodes, and the method is applied to each of the nodes. The method includes: separately collecting global situation information, the global situation information includes real-time situation information within the domain and less-than-real-time situation information outside the domain, the real-time situation information within the domain is obtained based on the node real-time situation information of nodes within a predetermined area where each of the nodes is located, and the less-than-real-time situation information outside the domain is obtained based on the node less-than-real-time situation information of nodes outside the predetermined area; in response to a data transmission instruction, if the target node is located within the predetermined area, active routing decision and data forwarding are performed based on the real-time situation information within the domain; if the target node is located outside the predetermined area, a directed deep routing search and data forwarding of an instant transmission and calculation formula are performed in combination with the real-time situation information within the domain and the less-than-real-time situation information outside the domain.

[0006] According to one embodiment of the present application, a data transmission device in a self-organizing network includes a plurality of nodes, and the device is applied to each of the nodes, and the device includes: a collection module, used to: respectively collect global situation information, the global situation information includes real-time situation information within the domain and less-than-real-time situation information outside the domain, the real-time situation information within the domain is obtained based on the node real-time situation information of nodes within a predetermined area where each of the nodes is located, and the less-than-real-time situation information outside the domain is obtained based on the node less-than-real-time situation information of nodes outside the predetermined area; a transmission module, used to: respond to a data transmission instruction, if the target node is located in the predetermined area, perform active routing decision and data forwarding based on the real-time situation information within the domain; if the target node is located outside the predetermined area, perform directed deep routing search and data forwarding with a transfer-and-calculation formula in combination with the real-time situation information within the domain and the less-than-real-time situation information outside the domain.

[0007] According to another embodiment of the present application, a storage medium stores a computer program thereon, and when the computer program is executed by a processor of a node, the node executes the method described in the embodiment of the present application.

[0008] According to another embodiment of the present application, a node may include: a memory storing a computer program; and a processor reading the computer program stored in the memory to execute the method described in the embodiment of the present application.

[0009] According to another embodiment of the present application, a computer program product or a computer program includes a computer instruction stored in a computer-readable storage medium. A processor of a node reads the computer instruction from the computer-readable storage medium, and the processor executes the computer instruction, so that the node executes the method provided in various optional implementations described in the embodiments of the present application.

[0010] In an embodiment of the present application, each of the nodes in the self-organizing network can execute: respectively collect global situation information, the global situation information includes real-time situation information within the domain and less-than-real-time situation information outside the domain, the real-time situation information within the domain is obtained based on the node real-time situation information of the nodes within the predetermined area where each of the nodes is located, and the less-than-real-time situation information outside the domain is obtained based on the node less-than-real-time situation information of the nodes outside the predetermined area; in response to a data transmission instruction, if the target node is located in the predetermined area, active routing decisions and data forwarding are performed based on the real-time situation information within the domain; if the target node is located outside the predetermined area, a directed deep routing search and data forwarding of the transfer-and-calculation formula are performed in combination with the real-time situation information within the domain and the less-than-real-time situation information outside the domain.

[0011] In this manner of the embodiments of the present application, each node in the self-organizing network can achieve accurate and timely tracking of the topological changes of nodes in a predetermined area by maintaining real-time situation information within the domain. When the target node is located in the predetermined area, active routing decisions and data forwarding are performed based on the real-time situation information within the domain, so that the data can be accurately forwarded to the target node; further, each node in the self-organizing network can perform rough tracking of the topological changes of nodes outside the predetermined area outside the domain by maintaining less-than-real-time situation information outside the domain. When the target node is outside the predetermined area, the real-time situation information within the domain and the less-than-real-time situation information outside the domain are combined to perform directed deep routing search and data forwarding of the transmission and calculation formula, which can combine accurate and timely tracking within the domain with rough tracking outside the domain to perform accurate transmission of data in the transmission and calculation formula, effectively improving the reliability of data transmission in large-scale self-organizing networks as a whole. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

[0013] Figure 1 A flow chart of a data transmission method in an ad hoc network according to an embodiment of the present application is shown.

[0014] Figure 2 A schematic diagram of a network topology according to an embodiment of the present application is shown.

[0015] Figure 3 A cycle calculation flow chart according to an embodiment of the present application is shown.

[0016] Figure 4 A duration calculation flow chart according to an embodiment of the present application is shown.

[0017] Figure 5 A schematic diagram of network topology according to another embodiment of the present application is shown.

[0018] Figure 6 A path analysis flow chart according to an embodiment of the present application is shown.

[0019] Figure 7 A schematic diagram of network topology according to another embodiment of the present application is shown.

[0020] Figure 8 A flow chart of set construction according to an embodiment of the present application is shown.

[0021] Fig. 9 A node screening flow chart according to an embodiment of the present application is shown.

[0022] Fig.10 A schematic diagram of network topology according to another embodiment of the present application is shown.

[0023] Fig.11 A schematic diagram of network topology according to another embodiment of the present application is shown.

[0024] Fig.12 A block diagram of a data transmission device in an ad hoc network according to an embodiment of the present application is shown.

[0025] Fig.13 A block diagram of a node according to an embodiment of the present application is shown. DETAILED DESCRIPTION

[0026] The present disclosure is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the embodiments provided herein are only used to explain the present disclosure and are not intended to limit the present disclosure. In addition, the embodiments provided below are partial embodiments for implementing the present disclosure, rather than providing all embodiments for implementing the present disclosure. In the absence of conflict, the technical solutions recorded in the embodiments of the present disclosure can be implemented in any combination. It should be noted that, in the embodiments of the present disclosure, the terms "include", "comprises" or any other variants thereof are intended to cover non-exclusive inclusion, so that a method or apparatus including a series of elements includes not only the elements explicitly recorded, but also includes other elements not explicitly listed, or also includes elements inherent to the implementation of the method or apparatus. In the absence of further restrictions, an element defined by the sentence "includes a ..." does not exclude the presence of other related elements in the method or apparatus including the element (such as a step in the method or a unit in the apparatus, for example, a unit may be a part of a circuit, a part of a processor, a part of a program or software, etc.). For example, the data transmission method in a self-organizing network provided in the embodiment of the present disclosure includes a series of steps, but the data transmission method in a self-organizing network provided in the embodiment of the present disclosure is not limited to the recorded steps. Similarly, the data transmission device in a self-organizing network provided in the embodiment of the present disclosure includes a series of units, but the device provided in the embodiment of the present disclosure is not limited to including the units explicitly recorded, and can also include units required to obtain relevant information or perform processing based on the information. Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which the present disclosure belongs. The terms used herein are only for the purpose of describing specific embodiments and are not intended to limit the present disclosure. It is understandable that in the specific implementation of this application, relevant data is involved. When the embodiments in this application are applied to specific products or technologies, user permission or consent is required, and the collection, use and processing of relevant data need to comply with relevant laws, regulations and standards of relevant countries and regions.

[0027] Figure 1 The flowchart of the data transmission method in an ad hoc network according to an embodiment of the present application is schematically shown. The ad hoc network usually includes multiple nodes, and the execution subject of the data transmission method in the embodiment of the present application can be any node in the ad hoc network.

[0028] Among them, the ad hoc network can be: a wireless ad hoc network composed of multiple drones as nodes, or a wireless ad hoc network composed of multiple vehicle-mounted devices as nodes, or a wireless ad hoc network composed of multiple user devices (such as watches, mobile phones, etc.) as nodes, etc.

[0029] Each node in the ad hoc network can execute Figure 1 The data transmission method in the ad hoc network shown in FIG. Figure 1 The data transmission method in the ad hoc network may include steps S110 to S130.

[0030] Step S110, respectively collecting global situation information, the global situation information includes real-time situation information within the domain and less-than-real-time situation information outside the domain, the real-time situation information within the domain is obtained based on the node real-time situation information of the nodes within the predetermined area where each node is located, and the less-than-real-time situation information outside the domain is obtained based on the node less-than-real-time situation information of the nodes outside the predetermined area; Step S120, in response to the data transmission instruction, if the target node is located in the predetermined area, active routing decision and data forwarding are performed based on the real-time situation information in the domain; Step S130: If the target node is outside the predetermined area, a directed deep routing search and data forwarding of a transmission-and-calculation formula is performed in combination with the real-time situation information within the domain and the sub-real-time situation information outside the domain.

[0031] Each node in the ad hoc network can collect global situation information with itself as the center, and the global situation information is an information set containing node-related situation information of all nodes in the ad hoc network. For example, the ad hoc network may include node A, node B and other nodes, and node A can collect global situation information AX with itself as the center, and node B can collect global situation information BX with itself as the center.

[0032] The global situation information maintained by each node includes real-time situation information within the domain and less-than-real-time situation information outside the domain. The real-time situation information within the domain is obtained based on the node real-time situation information of the nodes within the predetermined area where each node is located, and the less-than-real-time situation information outside the domain is obtained based on the node less-than-real-time situation information of the nodes outside the predetermined area. For each node, "the node real-time situation information of the nodes within the predetermined area where the node is located" can be obtained more quickly than "the node less-than-real-time situation information of the nodes outside the predetermined area where the node is located". The node-related situation information of the nodes within the predetermined area can be called the node real-time situation information, and the node-related situation information of the nodes outside the predetermined area can be called the node less-than-real-time situation information.

[0033] Therefore, the real-time nature of the real-time situation information within the domain maintained by each node is higher than the real-time nature of the less-real-time situation information outside the domain, that is, the less-real-time situation information outside the domain is less-real-time, and the real-time situation information within the domain is real-time to a large extent. The real-time situation information within the domain can be used to accurately and timely track the topological changes of the nodes within the predetermined area, and the less-real-time situation information outside the domain can be used to roughly track the topological changes of the nodes outside the predetermined area.

[0034] Taking node A as an example, the global situation information AX may include real-time situation information A-X1 within the domain and less-than-real-time situation information A-X2 outside the domain. The real-time situation information A-X1 within the domain is obtained based on the node real-time situation information of the nodes within the predetermined area where node A is located, and the less-than-real-time situation information A-X2 outside the domain is obtained based on the node less-than-real-time situation information of the nodes outside the predetermined area where node A is located. Among them, the predetermined area where node A is located can specifically refer to the k-hop range of node A, and the size of k can be set according to actual conditions.

[0035] Similarly, taking node B as an example, the global situation information BX may include real-time situation information B-X1 within the domain and less-than-real-time situation information B-X2 outside the domain. The real-time situation information B-X1 within the domain is obtained based on the real-time situation information of the nodes within the predetermined area where node B is located, and the less-than-real-time situation information B-X2 outside the domain is obtained based on the less-than-real-time situation information of the nodes outside the predetermined area where node B is located. Among them, the predetermined area where node B is located can specifically refer to the k-hop range of node B, and the size of k can be set according to actual conditions.

[0036] Furthermore, each node in the ad hoc network can determine the target node to which data needs to be transmitted according to the data transmission instruction in response to the data transmission instruction, and determine whether the target node is located in the predetermined area Ka where it is located according to the global situation information maintained by it. For example, if node A receives a data transmission instruction and needs to transmit data to the target node M, node A can determine whether the target node M is located in the predetermined area where node A is located according to the global situation information AX. If node B receives a data transmission instruction and needs to transmit data to the target node N, node B can determine whether the target node N is located in the predetermined area Kb where node B is located according to the global situation information BX.

[0037] Furthermore, if the target node is located in a predetermined area, active routing decisions and data forwarding are performed based on the real-time situation information in the domain. Active routing decisions are "the source node that receives the data transmission instruction decides the data transmission path from itself to the target node". For example, node A decides the final data transmission path from node A itself to target node M based on the real-time situation information A-X1 in the domain, and then transmits the service data from node A itself to target node M through the data transmission path, wherein the nodes in the data transmission path are all located in the predetermined area where node A is located.

[0038] Furthermore, if the target node is located outside the predetermined area, a directed deep routing search and data forwarding of the transmit-and-calculate type are performed in combination with the real-time situation information within the domain and the less-than-real-time situation information outside the domain. The directed deep routing search and data forwarding of the transmit-and-calculate type is that "starting from the source node, each node determines its own next-hop node through a directed deep routing search in turn and forwards the notification data to the next-hop node, and finally forwards the business data from the source node to the target node, wherein the notification data at least contains the business data and the node information of the target node."

[0039] For example, node A combines the real-time situation information A-X1 within the domain and the less-than-real-time situation information A-X2 outside the domain to perform a directed deep routing search and obtain that the next-hop node is B. Then, node A transmits notification data containing business data and node information of the target node to node C. Then, node C combines the real-time situation information C-X1 within the domain and the less-than-real-time situation information C-X2 outside the domain in the global situation information CX it maintains to perform a directed deep routing search and obtain that the next-hop node is node G. Then, node C transmits the notification data to node G, and node G continues to perform directed deep routing search and data forwarding, and continues until the business data is finally forwarded from node A to the target node D.

[0040] In this manner of the embodiments of the present application, each node in the self-organizing network can achieve accurate and timely tracking of the topological changes of nodes in a predetermined area by maintaining real-time situation information within the domain. When the target node is located in the predetermined area, active routing decisions and data forwarding are performed based on the real-time situation information within the domain, so that the data can be accurately forwarded to the target node; further, each node in the self-organizing network can perform rough tracking of the topological changes of nodes outside the predetermined area outside the domain by maintaining less-than-real-time situation information outside the domain. When the target node is outside the predetermined area, the real-time situation information within the domain and the less-than-real-time situation information outside the domain are combined to perform directed deep routing search and data forwarding of the transmission and calculation formula, which can combine accurate and timely tracking within the domain with rough tracking outside the domain to perform accurate transmission of data in the transmission and calculation formula, effectively improving the reliability of data transmission in large-scale self-organizing networks as a whole.

[0041] Described below Figure 1 When data is transmitted in an ad hoc network under the embodiment, further optional specific embodiments are provided under each step performed.

[0042] In one embodiment, the respectively collecting global situation information may include: each of the nodes periodically shares situation information through a one-hop fusion forwarding method according to an elastic period, so that each of the nodes collects the global situation information.

[0043] In this embodiment, each node in the self-organizing network "periodically shares situation information according to an elastic cycle" and "shares situation information through a one-hop fusion forwarding method". Specifically, each node in the self-organizing network can maintain global situation information in a local situation information library, "the information sharing scope of each node is a one-hop scope (that is, each node only shares information with neighboring nodes connected to itself by one hop)" and "each node fuses the updated situation information updated in the local situation information library within the elastic cycle and further forwards it to the adjacent points."

[0044] After receiving the node situation information of a certain node forwarded by the neighboring node, the node can determine whether the node situation information of the certain node has been maintained in the local situation information library. If it has been maintained, the timestamp 1 in the currently received node situation information and the timestamp 2 in the maintained node situation information are compared. If the timestamp 1 is after the timestamp 2, the currently received node situation information can be used to update the node situation information of the certain node that has been maintained in the local situation information library. The timestamp carried in the node situation information of the certain node can specifically be the moment when the certain node shares its own node situation information.

[0045] In this implementation mode, situation information is shared in the self-organizing network through a one-hop fusion forwarding method with an elastic periodicity, which can effectively avoid the broadcast flooding of shared information in the self-organizing network, make the communication quality of the whole network more stable, and improve the controllability of the overhead when routing information in the self-organizing network.

[0046] It can be understood that in other embodiments, respectively collecting global situation information may include: each node sharing by two-hop or multi-hop transmission, or each node sharing without fusing information.

[0047] Furthermore, in one embodiment, each of the nodes periodically shares situation information through a one-hop fusion forwarding method according to an elastic period, which may further include: each of the nodes will receive updated situation information of nodes within different hop count ranges, and share the situation information through a one-hop fusion forwarding method according to the elastic period corresponding to the hop count range, wherein the elastic period corresponding to the hop count range farther from each of the nodes is longer.

[0048] See also Figure 2 , taking the first node 200 as an example, multiple different hop count ranges can be drawn with the first node 200 as the center: a first hop count range 210 from the center to 2 hops, a second hop count range 220 from 2 hops to k hops, and a third hop count range 230 beyond k hops. A corresponding elasticity period can be determined for each hop count range, and the longer the hop count range is from the node A, the longer the elasticity period is, that is, the longer the elasticity period is for the first hop count range 210, the second hop count range 220, and the third hop count range 230.

[0049] In one example, the elasticity period corresponding to the first hop count range 210 is 1 second, the elasticity period corresponding to the second hop count range 220 is 1 minute, and the elasticity period corresponding to the third hop count range 230 is ten minutes. Thus, the first node 200 can merge the updated situation information about the nodes in the first hop count range 210 updated in the local situation information library every 1 second and forward it to its neighboring points, the first node 200 can merge the updated situation information about the nodes in the second hop count range 220 updated in the local situation information library every 1 minute and forward it to its neighboring points, and the first node 200 can merge the updated situation information about the nodes in the third hop count range 230 updated in the local situation information library every ten minutes and forward it to its neighboring points. By analogy, each node in the ad hoc network can share information in this way.

[0050] In this way, each node in the ad hoc network shares situation information according to the corresponding elastic period for different hop count ranges, and the elastic period corresponding to the hop count range farther from each node is longer. This can further maintain the communication quality of the entire network more stable and improve the communication reliability in the ad hoc network.

[0051] Furthermore, in one embodiment, each of the nodes perceives the real-time situation information within the domain through a link layer, and each of the nodes perceives the less-than-real-time situation information outside the domain through an application layer.

[0052] In this embodiment, each node uses the link layer to perceive the real-time situation information within the domain, that is, each node uses the link layer to statistically process the received node situation information of the nodes located in the predetermined area, and passes it to the predetermined layer (such as the network layer) for further maintenance as the real-time situation information within the domain.

[0053] Each node perceives the out-of-domain sub-real-time situation information through the application layer. That is, each node uses the application layer to statistically process the node situation information of nodes outside the predetermined area received, and passes it to the predetermined layer (such as the network layer) for further maintenance as out-of-domain real-time situation information.

[0054] The perception period when the link layer is used for perception can be shorter than the perception period when the application layer is used for perception. For example, the perception period when the link layer is used for perception is in the millisecond level, while the perception period when the application layer is used for perception is in the second level. The link layer can use a highly compressed message transmission method to transmit the perceived information to the predetermined layer. The application layer can use a header compression method to transmit the perceived information and transmit it in the form of a business data message. The application layer and the link layer can adaptively adjust the perception mode and perception period.

[0055] In one embodiment, each of the nodes periodically shares situation information according to a fixed elastic period.

[0056] Further, in some embodiments, each of the nodes may adaptively adjust the elastic period to share situation information. Specifically, see Figure 3 , each of the nodes may determine the elastic period in the following manner: step S310, dynamically determining the planned period according to the load status and the network status; step S320, obtaining the elastic period according to the planned period.

[0057] In this embodiment, each node may dynamically determine a matching plan period according to its own load status and network status. For example, the node may query a plan period that matches its current load status and network status from a predetermined period table.

[0058] The node obtains the elastic period according to the planned period dynamically determined by the load status and network status, so that the node can adaptively update the load status and network status to dynamically adjust the elastic period, further improving the communication reliability in the ad hoc network.

[0059] Furthermore, each node can dynamically determine the planned period that matches different hop count ranges according to its own load state and network state. For example, the node can query the planned period that matches the current load state and network state of the node in different hop count ranges from the predetermined period table. Thus, the elastic period that matches different hop count ranges can be further obtained, wherein the elastic period corresponding to the hop count range farther from each node can be longer.

[0060] In one embodiment, obtaining the flexible period according to the planned period may include one of the following methods: The first method is to add the planned period to the forwarding jitter time to obtain the elastic period; the second method is to determine the planned period as the elastic period.

[0061] When sharing and sending situation information, adjacent nodes may try to send situation information at the same time in the same period, resulting in information loss. In the first way, the elastic period is obtained by adding the planning period to the forwarding jitter time, that is, the strategy of adding jitter time when the node periodically sends is adopted to avoid the problem of information loss caused by the synchronous and simultaneous sending of messages by adjacent nodes.

[0062] Specifically, T'=T+T j , T j ∈(min-jitter1,max-jitter1),where T' is the elastic period, T is the planning period, T j is the jitter period, T j The value range of is [min-jitter1, max-jitter1], min-jitter1 is the predetermined first minimum value, max-jitter1 is the predetermined first maximum value, and the sizes of min-jitter1 and max-jitter1 can be set according to actual conditions.

[0063] Furthermore, in one embodiment, the method may also include: each of the nodes locally saves the received node status information for a target effective retention time, wherein the target effective retention time is greater than the elastic period.

[0064] Taking a node M as an example, when the node status information of node M is forwarded by the node elastic period in the ad hoc network, the node status information should be saved at the receiving node for a target effective retention time, where the target effective retention time is greater than the elastic period determined by the receiving node. Figure 2After the first node 200 receives the node status information of the node M, if the node M is located in the third hop count range 230, the first node 200 will effectively maintain the node status information of the node M locally for a target duration that is at least greater than the elastic period corresponding to the third hop count range 230.

[0065] In this way, each node locally stores the received node status information for a target effective retention time greater than the elastic period, which can further improve the reliability of information sharing in the elastic period one-hop fusion forwarding method.

[0066] Further, in one embodiment, see Figure 4 , each of the nodes determines the target effective holding time in the following manner: Step S410, determine the predetermined effective holding time that matches the received node status information; Step S420, add the predetermined effective holding time to the holding jitter time to obtain the target effective holding time of the received node status information stored locally.

[0067] The node determines that the received node status information matches the predetermined effective retention time, and the predetermined effective retention time is greater than or equal to the elastic time corresponding to the node from which the received node status information originates. For example, see Figure 2 After receiving the node status information of the node M, the first node 200 can determine the elastic period Tm corresponding to the third hop count range 230 where the node M is located, and allocate a predetermined effective retention time that is greater than or equal to the elastic period Tm. Then, the node can further add the predetermined effective retention time to the retention jitter time to obtain the time as the target effective retention time for the received node status information to be stored locally.

[0068] Furthermore, the first node 200 that receives the node status information of node M deletes the node status information of node M from the local status information library if the time interval for not receiving the relevant status information of node M forwarded by the neighboring node of the first node 200 again exceeds the target effective retention time, thereby avoiding data transmission errors in the self-organizing network and further improving data transmission reliability.

[0069] In the embodiments of the present application, under different scales of self-organizing network nodes and network application scenarios, the situation information awareness mode and update cycle can be initialized and customized according to the node mode options on the preset network management system.

[0070] In one method, the situation information perception mode of the real-time situation information in the configuration domain can be initialized as a periodic update mode with an update period of microseconds to seconds; the situation information perception mode of the less-than-real-time situation information outside the configuration domain can be initialized as a joint update mode, which is a combination of the periodic update mode and the event-based incremental update mode. The periodic update mode is to share information periodically according to an elastic period, and the event-based incremental update mode is to trigger information sharing through events. In this way, the overhead of periodic control in the ad hoc network can be further reduced.

[0071] Furthermore, in one embodiment of the present application, the real-time situation information within the domain may specifically include the intra-domain network topology information and routing decision resource information of the nodes within the predetermined area, and the routing decision resource information includes the real-time status information of the nodes and the link information between the nodes; the less-than-real-time situation information outside the domain may specifically include the node position information of each node outside the predetermined area.

[0072] The self-organizing network may include node A. Node A can collect and maintain global situation information AX with itself as the center. The global situation information AX may include real-time situation information A-X1 within the domain and less-than-real-time situation information A-X2 outside the domain. The real-time situation information A-X1 within the domain is obtained based on the node situation information of nodes within the predetermined area where node A is located, and the less-than-real-time situation information A-X2 outside the domain is obtained based on the node situation information of nodes outside the predetermined area where node A is located.

[0073] The intra-domain real-time situation information A-X1 may specifically include intra-domain network topology information A-X1-1 and routing decision resource information A-X1-2 of the nodes in the predetermined area where node A is located. The intra-domain network topology information A-X1-1 is the connection information of all nodes in the predetermined area, and the routing decision resource information A-X1-2 may include the node real-time status information and inter-node link information of the nodes in the predetermined area. The node real-time status information may include node ID, node QoS priority queue mapping bitmap, node capability level, node load level, node position information and other status information reflecting the node itself. The inter-node link information may include information reflecting the link quality between nodes, such as the link signal-to-noise ratio, stability, timeliness and utilization rate between nodes. The extra-domain sub-real-time situation information A-X2 only includes a small amount of information such as the node position information and node capability level of each node outside the predetermined area. Among them, the node position information may include node geographic location information and position information such as node movement mode (including movement direction, movement speed).

[0074] In this way, each node in the ad hoc network can reliably track the topological changes of nodes within a predetermined area accurately and timely by maintaining real-time situation information within the domain, and can roughly track the topological changes of nodes outside the predetermined area by maintaining less-than-real-time situation information outside the domain.

[0075] In one embodiment, the real-time situation information within the domain includes the network topology information within the domain and the routing decision resource information of the nodes within the predetermined area; the active routing decision and data forwarding based on the real-time situation information within the domain includes: determining a set of candidate paths from the current node to the target node according to the network topology information within the domain; performing path screening from the candidate path set according to the routing decision resource information to obtain a data transmission path; and sending the business data to the target node through the data transmission path.

[0076] The real-time situation information within the domain is obtained based on the real-time situation information of the nodes within the predetermined area where each node is located. If the target node is located in the predetermined area, active routing decisions based on the real-time situation information within the domain can determine the data transmission path within the predetermined area and forward the data. Active routing decisions mean that "the source node that receives the data transmission instruction decides the data transmission path from itself to the target node."

[0077] See also Figure 5 Taking the second node 510 as an example, when the second node 510 determines that the target node is the third node 520 according to the received data transmission instruction, the second node 510 can construct the following information based on the real-time situation information in the domain it maintains: Figure 5 The intra-domain routing (i.e., the network topology in the predetermined area) shown in the figure is used to determine a set of candidate paths from the current node (i.e., the second node 510) to the target node (i.e., the third node 520). For example, the set of candidate paths may include path 1, path 2, and other candidate paths. The second node 510 may further perform path screening from the set of candidate paths according to the routing decision resource information, and screen out a one-hop path as the data transmission path. Then, the service data may be sent to the target node through the data transmission path.

[0078] The real-time situation information within the domain is of great real-time nature. Active routing decisions based on the real-time situation information within the domain can accurately select a reliable data transmission path, through which the business data can be reliably transmitted to the target node.

[0079] Further, in one embodiment, see Figure 6, the routing decision resource information includes node real-time status information and inter-node link information; the path screening is performed from the candidate path set according to the routing decision resource information to obtain a data transmission path, including: step S610, if the candidate path set includes at least two paths, then a path that meets the predetermined service quality indicator requirements is determined from the candidate path set to obtain a pre-selected path set; step S620, if the pre-selected path set includes at least two paths, then the combined weight of each path in the pre-selected path set is calculated according to the node real-time status information and the inter-node link information; step S630, the path with the highest combined weight in the pre-selected path set is determined as the data transmission path.

[0080] If the candidate path set includes at least two paths, a path that meets the predetermined service quality indicator requirement is first determined from the candidate path set to obtain a pre-selected path set consisting of paths that meet the predetermined service quality indicator requirement. The predetermined service quality indicator requirement is a preset quality of service (QoS) constraint condition for selecting the path. For example, the path that meets the predetermined service quality indicator requirement may be "a path in which the number of nodes in the candidate path set is less than a predetermined threshold" or "a path in which the number of nodes in the candidate path set is ranked before a predetermined ranking from small to large", etc.

[0081] If the pre-selected path set also includes at least two paths, the combined weights of the paths in the pre-selected path set are further calculated based on the real-time status information of the nodes and the link information between the nodes; and the path with the highest combined weight in the pre-selected path set is determined as the final data transmission path, so that quality of service (QoS) routing decisions are made based on the node routing decision resource information in the predetermined area, to achieve flexible routing with quality of service (QoS) awareness and improve data transmission reliability.

[0082] The real-time status information of the node may include the node ID, the node QoS priority queue mapping bitmap, the node capability level, the node load level, the node orientation information and other status information reflecting the node itself. The inter-node link information may include the link signal-to-noise ratio, stability, timeliness and utilization between nodes and other information reflecting the link quality between nodes. The combined weight of each path in the pre-selected path set is calculated based on the node real-time status information and the inter-node link information. Specifically, it can be: the weighted sum calculation is performed based on the node real-time status information and the inter-node link information of the nodes included in each path in the pre-selected path set to obtain the combined weight of each path. The lower the node load level of the node in the path, the higher the node capability level, the lower the link signal-to-noise ratio between nodes, the higher the stability, the better the timeliness and the higher the utilization, the higher the combined weight of the path.

[0083] In one embodiment, the combination of the real-time situation information within the domain and the less-than-real-time situation information outside the domain to perform directed deep routing search and data forwarding of the transmit-and-calculate formula may include: performing a directed search from nodes within the predetermined area based on the real-time situation information within the domain and the less-than-real-time situation information outside the domain to obtain a candidate node set consisting of nodes that meet data forwarding requirements; performing a depth-first search from the candidate node set to obtain a target next-hop node; and sending notification data containing business data to the target next-hop node, so that the target next-hop node continues to perform directed deep routing search and data forwarding of the transmit-and-calculate formula.

[0084] If the target node is outside the predetermined area, a directed deep routing search and data forwarding of the transmit-and-calculate type are performed in combination with the real-time situation information within the domain and the less-than-real-time situation information outside the domain, wherein the directed deep routing search and data forwarding of the transmit-and-calculate type is "starting from the source node as a decision node, the decision node determines the target next-hop node of the decision node itself through a directed deep routing search and forwards the notification data to the target next-hop node, and then, the target next-hop node continues to forward the business data from the source node to the target node through directed deep routing search and data forwarding as a decision node, wherein the notification data at least contains the business data and the node information of the target node".

[0085] The decision node determines its own target next-hop node through a directed deep routing search and forwards the notification data to the target next-hop node. Specifically, it can be: the decision node performs a directed search from the nodes in the predetermined area according to the real-time situation information within the domain and the less-than-real-time situation information outside the domain maintained by itself, and obtains a candidate node set consisting of nodes that meet the data forwarding requirements. Then, the decision node performs a depth-first search from the candidate node set to obtain the target next-hop node; then, the notification data containing the business data is sent to the target next-hop node, and the target next-hop node continues to perform the directed deep routing search and data forwarding of the transmit-and-calculate formula as a decision node.

[0086] For example, see Figure 7First, the fourth node 710 performs a directed deep routing search and data forwarding of the instant transmission and calculation formula as a decision node. Specifically, the fourth node 710 performs a directed search as a decision node in combination with the real-time situation information in the domain and the less-than-real-time situation information outside the domain maintained by itself, and obtains a candidate node set consisting of nodes that meet the data forwarding requirements. Then, a depth-first search is performed from the candidate node set to obtain the target next-hop node as the fifth node 720, and then the notification data is transmitted to the fifth node 720. Further, the fifth node 720 continues to perform a directed deep routing search and data forwarding of the instant transmission and calculation formula. Specifically, the fifth node 720 continues to perform a directed search as a decision node in combination with the real-time situation information in the domain and the less-than-real-time situation information outside the domain maintained by itself, and obtains a candidate node set consisting of nodes that meet the data forwarding requirements. Then, a depth-first search is performed from the candidate node set to obtain the target next-hop node as the sixth node 730, and then the notification data is transmitted to the sixth node 730. And so on, until the notification data is transmitted to the seventh node 740, and the seventh node 740 further transmits the business data to the eighth node 750.

[0087] The out-of-domain sub-real-time situation information is sub-real-time, while the in-domain real-time situation information is real-time to a great extent. Through the in-domain real-time situation information, the topological changes of the nodes in the predetermined area can be accurately tracked in time, and through the out-of-domain sub-real-time situation information, the topological changes of the nodes outside the predetermined area can be roughly tracked. Combining the precise and timely tracking in the domain and the rough tracking outside the domain can realize the accurate transmission of data transmission and calculation. When the target node moves dynamically, this method can also be used to advance to the nodes near the target node, and the nodes near the target node can accurately track the target node and accurately transmit the business data to the target node.

[0088] Further, in one embodiment, see Figure 8 The real-time situation information within the domain includes the network topology information within the domain of the nodes within the predetermined area, and the insufficient real-time situation information outside the domain includes the node position information of each node outside the predetermined area; the directed search is performed from the nodes within the predetermined area according to the real-time situation information within the domain and the insufficient real-time situation information outside the domain to obtain a candidate node set consisting of nodes that meet the data forwarding requirements, which may include: Step S810, determining whether there are one or more routes from the current node to the target node in the predetermined area according to the real-time topological relationship within the domain and the virtual topological relationship outside the domain, wherein the real-time topological relationship within the domain is constructed according to the network topological information within the domain, and the virtual topological relationship outside the domain is constructed according to the node position information in the insufficient real-time situation information outside the domain; Step S820: if it exists, then add the next hop node after the current node in the one or more routes to the direct forwarding subset; Step S830: If no such node exists, a neighboring node whose Euclidean distance to the node is smaller than the Euclidean distance from the node to the target node is selected from the neighboring node set of the node, and the neighboring node is added to the Euclidean forwarding subset; Step S840: Select a node with a next hop in the predetermined area from the Euclidean forwarding subset, and add the node to the priority forwarding subset.

[0089] The real-time situation information within the domain includes the network topology information within the domain of the nodes within the predetermined area. Based on the network topology information within the domain, the real-time topology relationship within the domain can be constructed. The real-time topology relationship within the domain can accurately reflect the network topology relationship between the nodes within the predetermined area. The less-real-time situation information outside the domain includes the node position information of each node outside the predetermined area. Based on the node position information of each node outside the predetermined area, the topology relationship between the nodes outside the predetermined area (i.e., the virtual topology relationship outside the domain) can be virtualized according to the predetermined virtual strategy. The virtual topology relationship outside the domain can roughly reflect the network topology relationship between the nodes outside the predetermined area.

[0090] When the target node is outside the predetermined area, based on the real-time topological relationship within the domain and the virtual topological relationship outside the domain, it can be roughly determined whether there is one or more routes from the current node (i.e., the decision node) to the target node within the predetermined area (e.g., within the k-hop range). Figure 7 When the fourth node 710 determines that the eighth node 750 as the target node is located outside the predetermined area, it can roughly determine whether there is one or more routes from the current node (i.e., the fourth node 710 as the decision node) to the eighth node 750 in the predetermined area by combining the real-time topological relationship within the domain and the virtual topological relationship outside the domain.

[0091] If it exists (that is, there are one or more routes from this node to the target node in the predetermined area), then the next hop node after this node in the one or more routes is added to the direct forwarding subset. .

[0092] If it does not exist (that is, there is no one or more routes from this node to the target node in the predetermined area), then from the neighbor node set composed of the neighbor nodes of this node, a neighbor node whose Euclidean distance to this node (the Euclidean distance between the two can be calculated based on the node position information of the neighbor node and this node) is less than the Euclidean distance from this node to the target node (the Euclidean distance between the two can be calculated based on the node position information of this node and the target node) can be selected through greedy search, and the neighbor node whose Euclidean distance to this node is less than the Euclidean distance from this node to the target node is added to the Euclidean forwarding sub-set .

[0093] If you choose to get the European forwarding subset , further from the European forwarding subset Select a node with a next hop in the predetermined area (for example, There is a node J in the predetermined area, and the node J is located in the predetermined area. It can be determined whether the node J is connected to a next-hop node in the predetermined area. If so, it means that the node J is a node with a next-hop in the predetermined area. Select a node with a next hop in the predetermined area and add the European forwarding subset The nodes with next hop in the predetermined area are added to the priority forwarding subset .

[0094] Therefore, the candidate node set consisting of nodes that meet the data forwarding requirements may include the "direct forwarding subset" " or "European forwarding subset and priority forwarding subset ", collecting candidate next-hop nodes in different situations in these subsets can effectively ensure that subsequent searches can obtain suitable target next-hop nodes.

[0095] Further, in one embodiment, see Fig. 9 The real-time situation information within the domain includes routing decision resource information of nodes within the predetermined area, and the routing decision resource information includes real-time node status information and inter-node link information; performing a depth-first search from the candidate node set to obtain a target next-hop node may include: Step S910: If the direct forwarding subset is not empty, the service quality metric score is calculated according to the node real-time status information and the inter-node link information of each node in the direct forwarding subset, and the node with the highest service quality metric score in the direct forwarding subset is selected as the target next hop node; Step S920: If the direct forwarding subset is empty and the priority forwarding subset is not empty, the service quality metric score is calculated according to the node real-time status information and the inter-node link information of each node in the priority forwarding subset, and the node with the highest service quality metric score in the priority forwarding subset is selected as the target next hop node; Step S930: otherwise, the service quality metric score is calculated according to the node real-time status information and the inter-node link information of each node in the Euclidean forwarding subset, and the node with the highest service quality metric score in the Euclidean forwarding subset is selected as the target next hop node.

[0096] First, if the sub-collection is forwarded directly If it is not empty, then the service quality metric score of each node in the direct forwarding subset can be calculated based on the node real-time status information and inter-node link information of each node in the direct forwarding subset, and the node with the highest service quality metric score in the direct forwarding subset is selected as the target next hop node. For example, see Figure 7 If the direct forwarding subset includes a fifth node 720 and other nodes 760, the fourth node 710 can calculate the service quality measurement score Q1 according to the node real-time status information of the fifth node 720 and the node link information between the fourth node 710 and the fifth node 720, and the fourth node 710 can calculate the service quality measurement score Q2 according to the node real-time status information of other nodes 760 and the node link information between the fourth node 710 and the other nodes 760. If Q1 is the highest, the fifth node 720 is used as the target next hop node after the fourth node 710.

[0097] When there are one or more routes from this node to the target node in the predetermined area, the next hop node after this node in the one or more routes is added to the direct forwarding subset. , directly forward the sub-collection Any node as the target next hop node will have higher transmission reliability. The routing decision resource information of each node in the network is used to calculate the service quality metric score, and the node with the highest service quality metric score in the direct forwarding subset is further selected as the target next hop node, which can further improve the service quality of data transmission in the ad hoc network and further improve the reliability of data transmission.

[0098] Furthermore, if the sub-collection is forwarded directly Empty and prioritize forwarding sub-collections If not empty, the priority forwarding subset is used. The real-time status information of each node and the link information between nodes in the priority forwarding subset can be used to calculate the service quality metric score of each node in the priority forwarding subset and select the priority forwarding subset. The node with the highest service quality metric score is selected as the target next hop node.

[0099] Due to the priority forwarding sub-set Each node in the predetermined area has a next-hop node, and a priority forwarding subset is selected from The node with the highest service quality metric score in the selection as the target next hop node can ensure that the selected target next hop node has a further next hop node, thereby avoiding the problem of routing holes in the routing decision process and further improving the reliability of data transmission. Fig.10, when the ninth node 1001 obtains the priority forwarding subset through directed search, it will determine that the tenth node 1002 has no next-hop node in the predetermined area, while the eleventh node 1003 has a next-hop twelfth node 1004 in the predetermined area, so only the eleventh node 1003 will be added to the priority forwarding subset, and then Fig.10 As shown in (b) in FIG. 1 , the priority forwarding subset can be The eleventh node 1003 is selected as the target next hop node of the ninth node 1001. Fig.10 As shown in (a) in FIG. 1 , if the tenth node 1002 with the shortest Euclidean distance is selected as the target next-hop node only through a greedy search method, and there is no next-hop node after the tenth node 1002 , data transmission is terminated at the tenth node 1002 , resulting in data transmission failure.

[0100] Further, otherwise (i.e. directly forwarding the sub-set Empty and prioritize forwarding sub-collections is empty, while the European forwarding sub-collection non-empty), according to the European forwarding subset The real-time status information of each node and the link information between nodes in the node can be used to calculate the Euclidean forwarding subsets respectively. The service quality metric score of each node in and select the European forwarding subset The node with the highest service quality metric score in is selected as the target next hop node. The middle node is the lowest level choice. The neighboring nodes whose Euclidean distance to the current node is less than the Euclidean distance from the current node to the target node are added to the Euclidean forwarding subset. In this case, when the first two subsets are empty, it is possible to ensure that a valid target next-hop node is searched as much as possible.

[0101] Among them, in each step of this embodiment, the decision node (i.e., the aforementioned node, i.e., the node that is the next hop node of the decision target) calculates the service quality measurement score according to the node real-time status information and inter-node link information of each node in the subset in the following manner: for each node, a weighted sum calculation is performed according to "the node real-time status information of each node" and "the inter-node link information between each node and the decision node" to obtain the service quality measurement score of each node. Among them, the lower the node load level of the node, the higher the node capacity level, the lower the link signal-to-noise ratio between the node and the decision node, the higher the stability, the better the timeliness and the higher the utilization rate, the higher the service quality measurement score of the node.

[0102] Furthermore, in one embodiment, when the candidate node set is empty, the method also includes: obtaining multiple neighboring nodes around the current node in the predetermined area through a surrounding search; calculating the service quality measurement score of each neighboring node according to the real-time status information of each neighboring node and the inter-node link information between the neighboring node and the current node; and selecting the one with the highest service quality measurement score among the multiple neighboring nodes as the target next-hop node.

[0103] The decision node (i.e. the node mentioned above, i.e. the node that is deciding the next hop node of the target) finds that the candidate node set is empty during the decision-making process, indicating that a routing hole has occurred. For example, Fig.11 As shown, a routing hole appears ahead when the thirteenth node 1101 is used as a decision node. In the above embodiment, if the direct forwarding subset is empty and the European forwarding subset is empty after executing steps S810 to S830, it means that the candidate node set is empty.

[0104] When the candidate node set is empty (i.e., a routing hole occurs), the decision node further searches the surrounding area to obtain multiple neighboring nodes around the node in a predetermined area (e.g., within the k-hop range of the decision node). Fig.11 As shown, the thirteenth node 1101, as a decision node, further obtains the neighboring nodes around the node (i.e., the thirteenth node 1101) in a predetermined area (e.g., the k-hop range of the decision node) through a peripheral search, namely, the fourteenth node 1102, the fifteenth node 1103, the sixteenth node 1104, and the seventeenth node 1105. Specifically, during the peripheral search, the neighboring nodes around the thirteenth node 1101 can be selected clockwise with the thirteenth node 1101 as the center by the right-hand rule.

[0105] When a routing hole appears in front of a decision node, the decision node calculates the service quality metric score of each neighboring node based on the real-time status information of each neighboring node and the inter-node link information between the neighboring node and the current node (i.e., the decision node), and then selects the one with the highest service quality metric score among multiple neighboring nodes as the target next hop node. Fig.11 In (c), the thirteenth node 1101 can combine the surrounding search and service quality metrics, and finally select the seventeenth node 1105 with the highest service quality metric score as the target next hop node. In this implementation, the data transmission path of the thirteenth node 1101, the seventeenth node 1105, the eighteenth node 1106, and the nineteenth node 1107 can be finally formed. In the related art, refer to Fig.11At (b) in the figure, the thirteenth node 1101 will select the fourteenth node 1102 as the target next-hop node only through surrounding search, and finally form the data transmission path of the thirteenth node 1101, the fourteenth node 1102, the sixteenth node 1104, the twentieth node 1108, the seventeenth node 1105, the eighteenth node 1106, and the nineteenth node 1107.

[0106] Therefore, in the aforementioned embodiment, when the candidate node set is empty (that is, a routing hole occurs), the routing hole can be repaired by combining the surrounding search and service quality measurement to select the target next-hop node, and ultimately a shorter data transmission path is obtained, reducing redundant forwarding and transmission delays, and reducing the risk of data packets being discarded due to exhaustion of hops, thereby further improving data transmission reliability.

[0107] In order to facilitate better implementation of the data transmission method in an ad hoc network provided in the embodiment of the present application, the embodiment of the present application also provides a data transmission device in an ad hoc network based on the data transmission method in an ad hoc network. The meanings of the terms are the same as those in the data transmission method in an ad hoc network, and the specific implementation details can refer to the description in the method embodiment. Fig.12 A block diagram of a data transmission device in an ad hoc network according to an embodiment of the present application is shown.

[0108] like Fig.12 The data transmission device 1200 in the self-organizing network shown can be applied to each node in the self-organizing network, and the data transmission device 1200 in the self-organizing network may include: the collection module 1210 can be used to: respectively collect global situation information, the global situation information includes real-time situation information within the domain and less-than-real-time situation information outside the domain, the real-time situation information within the domain is obtained based on the node real-time situation information of the nodes within the predetermined area where each of the nodes is located, and the less-than-real-time situation information outside the domain is obtained based on the node less-than-real-time situation information of the nodes outside the predetermined area; the transmission module 1220 can be used to: respond to the data transmission instruction, if the target node is located in the predetermined area, then perform active routing decision and data forwarding based on the real-time situation information within the domain; if the target node is located outside the predetermined area, then combine the real-time situation information within the domain and the less-than-real-time situation information outside the domain to perform directed deep routing search and data forwarding with an immediate transmission and calculation formula.

[0109] In one embodiment, the transmission module 1220 can be used to: perform a directed search from the nodes in the predetermined area according to the real-time situation information within the domain and the sub-real-time situation information outside the domain to obtain a candidate node set consisting of nodes that meet the data forwarding requirements; perform a depth-first search from the candidate node set to obtain a target next-hop node; and send notification data containing the business data to the target next-hop node, so that the target next-hop node continues to perform directed deep routing search and data forwarding with an instant transmission and calculation formula.

[0110] In one embodiment, the intra-domain real-time situation information includes intra-domain network topology information of nodes in the predetermined area, and the extra-domain less-real-time situation information includes node position information of each node outside the predetermined area; the transmission module 1220 can be used to: determine whether there is one or more routes from the current node to the target node in the predetermined area based on the intra-domain real-time topology relationship and the extra-domain virtual topology relationship, wherein the intra-domain real-time topology relationship is constructed based on the intra-domain network topology information, and the extra-domain virtual topology relationship is constructed based on the node position information in the extra-domain less-real-time situation information; if so, add the next hop node after the current node in the one or more routes to the direct forwarding subset; if not, select a neighboring node whose Euclidean distance to the current node is less than the Euclidean distance from the current node to the target node from the neighboring node set of the current node, and add it to the Euclidean forwarding subset; select a node with a next hop in the predetermined area from the Euclidean forwarding subset, and add it to the priority forwarding subset.

[0111] In one embodiment, the real-time situation information within the domain includes routing decision resource information of nodes within the predetermined area, and the routing decision resource information includes node real-time status information; the transmission module 1220 can be used to: if the direct forwarding subset is not empty, then the service quality metric score is calculated respectively according to the node real-time status information of each node in the direct forwarding subset, and the node with the highest service quality metric score in the direct forwarding subset is selected as the target next hop node; if the direct forwarding subset is empty and the priority forwarding subset is not empty, then the service quality metric score is calculated respectively according to the node real-time status information of each node in the priority forwarding subset, and the node with the highest service quality metric score in the priority forwarding subset is selected as the target next hop node; otherwise, the service quality metric score is calculated respectively according to the node real-time status information of each node in the European forwarding subset, and the node with the highest service quality metric score in the European forwarding subset is selected as the target next hop node.

[0112] In one embodiment, when the candidate node set is empty, the transmission module 1220 can be used to: obtain multiple neighboring nodes around the current node in the predetermined area through surrounding search; calculate the service quality measurement score of each neighboring node according to the real-time status information of each neighboring node and the node link information between the neighboring node and the current node; select the one with the highest service quality measurement score among the multiple neighboring nodes as the target next-hop node.

[0113] In one embodiment, the real-time situation information within the domain includes the intra-domain network topology information and routing decision resource information of the nodes within the predetermined area; the transmission module 1220 can be used to: determine a set of candidate paths from the current node to the target node based on the intra-domain network topology information; perform path screening from the candidate path set based on the routing decision resource information to obtain a data transmission path; and send business data to the target node through the data transmission path.

[0114] In one embodiment, the routing decision resource information includes node real-time status information and inter-node link information; the transmission module 1220 can be used to: if the candidate path set includes at least two paths, determine the path that meets the predetermined service quality indicator requirements from the candidate path set to obtain a pre-selected path set; if the pre-selected path set includes at least two paths, calculate the combined weight of each path in the pre-selected path set based on the node real-time status information and the inter-node link information; determine the path with the highest combined weight in the pre-selected path set as the data transmission path.

[0115] In one embodiment, the collection module 1210 in each of the nodes may be used to: periodically share situation information through a one-hop fusion forwarding method according to an elastic period, so that each of the nodes can collect global situation information.

[0116] In one embodiment, the collection module 1210 in each of the nodes can be used to: share the updated status information of the nodes within different hop count ranges received, according to the elastic period corresponding to the hop count range, through a one-hop fusion forwarding method, wherein the elastic period corresponding to the hop count range farther from each of the nodes is longer.

[0117] In one embodiment, each of the nodes perceives the real-time situation information within the domain through a link layer, and each of the nodes perceives the less-than-real-time situation information outside the domain through an application layer.

[0118] In one embodiment, the acquisition module 1210 in each of the nodes may also be used to determine the elastic period in the following manner: dynamically determine the planned period according to the load status and the network status; and obtain the elastic period according to the planned period.

[0119] In one embodiment, the collection module 1210 in each of the nodes may implement one of the following methods: adding the planned period to the forwarding jitter time to obtain the elastic period; determining the planned period as the elastic period.

[0120] In one embodiment, the acquisition module 1210 in each of the nodes may: locally save the received node status information for a target effective retention time, wherein the target effective retention time is greater than the elastic period.

[0121] In one embodiment, the collection module 1210 in each of the nodes can determine the target effective retention time in the following manner: determine the predetermined effective retention time that matches the received node status information; add the predetermined effective retention time to the retention jitter time to obtain the target effective retention time of the received node status information stored locally.

[0122] In one embodiment, the intra-domain real-time situation information includes intra-domain network topology information and routing decision resource information of nodes within the predetermined area, and the routing decision resource information includes node real-time status information and inter-node link information; the extra-domain less-real-time situation information includes node position information of each node outside the predetermined area.

[0123] It should be noted that, although several modules or units of the equipment for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present application, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into being embodied by multiple modules or units.

[0124] In addition, the present application embodiment also provides a node, such as Fig.13 As shown, Fig.13 A block diagram of a node according to an embodiment of the present application is shown, specifically: The node may include one or more processing core processors 1301, one or more computer-readable storage media memories 1302, power supplies 1303 and other components. Those skilled in the art will appreciate that Fig.13 The node structure shown in the figure does not constitute a limitation on the node, and may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently. The processor 1301 is the control center of the node, and uses various interfaces and lines to connect various parts of the entire computer device. By running or executing software programs and / or modules stored in the memory 1302, and calling data stored in the memory 1302, it executes various functions of the computer device and processes data, thereby monitoring the node as a whole. Optionally, the processor 1301 may include one or more processing cores; preferably, the processor 1301 may integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user pages and application programs, etc., and the modem processor mainly processes wireless communications. It is understandable that the above-mentioned modem processor may not be integrated into the processor 1301.

[0125] The memory 1302 can be used to store software programs and modules. The processor 1301 executes various functional applications and data processing by running the software programs and modules stored in the memory 1302. The memory 1302 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area may store data created according to the use of the computer device, etc. In addition, the memory 1302 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage devices. Accordingly, the memory 1302 may also include a memory controller to provide the processor 1301 with access to the memory 1302.

[0126] The node may also include a power supply 1303 for supplying power to each component. Preferably, the power supply 1303 may be logically connected to the processor 1301 through a power management system, so as to manage charging, discharging, and power consumption through the power management system. The power supply 1303 may also include any components such as one or more DC or AC power supplies, recharging systems, power failure detection circuits, power converters or inverters, and power status indicators. It is understood that the node may also include a communication unit, a network module, and the like.

[0127] Although not shown, the node may also include a display unit, etc., which will not be described in detail herein. Specifically in this embodiment, the processor 1301 in the node will load the executable file corresponding to the process of one or more computer programs into the memory 1302 according to the instruction, and the processor 1301 will run the computer program stored in the memory 1302, thereby realizing various functions in the aforementioned embodiments of the present application.

[0128] Those skilled in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be completed by a computer program, or by controlling related hardware through a computer program. The computer program may be stored in a computer-readable storage medium and loaded and executed by a processor.

[0129] To this end, an embodiment of the present application further provides a storage medium, in which a computer program is stored. The computer program can be loaded by a processor to execute the steps in any method provided in the embodiment of the present application.

[0130] The storage medium may be a computer-readable storage medium, and the storage medium may include: a read-only memory (ROM), a random access memory (RAM), a disk or an optical disk, etc.

[0131] Since the computer program stored in the storage medium can execute the steps in any method provided in the embodiments of the present application, the beneficial effects that can be achieved by the method provided in the embodiments of the present application can be achieved. Please refer to the previous embodiments for details and will not be repeated here.

[0132] Those skilled in the art will readily come up with other embodiments of the present application after considering the specification and practicing the embodiments disclosed herein. The present application is intended to cover any variations, uses or adaptations of the present application, which follow the general principles of the present application and include common knowledge or customary technical means in the art that are not disclosed in the present application.

[0133] It should be understood that the present application is not limited to the embodiments that have been described above and shown in the accompanying drawings, but various modifications and changes may be made without departing from the scope thereof.

Claims

1. A data transmission method in an ad hoc network, characterized in that: The ad hoc network includes a plurality of nodes, and the method is applied to each of the nodes. The method includes: Collecting global situation information respectively, the global situation information includes real-time situation information within the domain and less-than-real-time situation information outside the domain, the real-time situation information within the domain is obtained based on the node real-time situation information of the nodes within the predetermined area where each node is located, and the less-than-real-time situation information outside the domain is obtained based on the node less-than-real-time situation information of the nodes outside the predetermined area; In response to the data transmission instruction, if the target node is located in the predetermined area, active routing decision and data forwarding are performed based on the real-time situation information in the domain; If the target node is located outside the predetermined area, a directed deep routing search and data forwarding of the transmit-and-calculate formula are performed in combination with the real-time situation information within the domain and the less-than-real-time situation information outside the domain.

2. The method according to claim 1, characterized in that The combining of the real-time situation information within the domain and the less-than-real-time situation information outside the domain to perform a directive deep routing search and data forwarding of a transmission-and-calculation formula includes: According to the real-time situation information within the domain and the less-than-real-time situation information outside the domain, a directed search is performed from the nodes within the predetermined area to obtain a candidate node set consisting of nodes that meet the data forwarding requirements; Perform a depth-first search from the candidate node set to obtain a target next-hop node; Notification data containing business data is sent to the target next-hop node, so that the target next-hop node continues to perform the directed deep routing search and data forwarding of the transmit-and-calculate formula.

3. The method according to claim 2, characterized in that The intra-domain real-time situation information includes intra-domain network topology information of nodes within the predetermined area, and the extra-domain less-real-time situation information includes node position information of each node outside the predetermined area; The step of performing a directed search from nodes in the predetermined area according to the real-time situation information within the domain and the sub-real-time situation information outside the domain to obtain a candidate node set consisting of nodes that meet the data forwarding requirements includes: Determine whether there is one or more routes from the current node to the target node in the predetermined area according to the real-time topological relationship within the domain and the virtual topological relationship outside the domain, wherein the real-time topological relationship within the domain is constructed according to the network topological information within the domain, and the virtual topological relationship outside the domain is constructed according to the node position information in the insufficient real-time situation information outside the domain; If so, adding the next hop node after the current node in the one or more routes to the direct forwarding subset; If it does not exist, then select a neighbor node whose Euclidean distance to the current node is less than the Euclidean distance from the current node to the target node from the neighbor node set of the current node, and add it to the Euclidean forwarding subset; A node having a next hop in the predetermined area is selected from the European forwarding subset and added to the priority forwarding subset.

4. The method according to claim 3, characterized in that The real-time situation information within the domain includes routing decision resource information of nodes within the predetermined area, and the routing decision resource information includes real-time status information of nodes; The performing a depth-first search from the candidate node set to obtain a target next-hop node includes: If the direct forwarding subset is not empty, respectively calculating the service quality metric score according to the node real-time status information of each node in the direct forwarding subset, and selecting the node with the highest service quality metric score in the direct forwarding subset as the target next hop node; If the direct forwarding subset is empty and the priority forwarding subset is not empty, the service quality metric score is calculated according to the node real-time status information of each node in the priority forwarding subset, and the node with the highest service quality metric score in the priority forwarding subset is selected as the target next hop node; Otherwise, the service quality metric score is calculated respectively according to the node real-time status information of each node in the Euclidean forwarding subset, and the node with the highest service quality metric score in the Euclidean forwarding subset is selected as the target next hop node.

5. The method according to claim 4, characterized in that When the candidate node set is empty, the method further includes: Obtaining multiple neighboring nodes around the node in the predetermined area through a surrounding search; Calculate the service quality metric score of each neighboring node according to the node real-time status information of each neighboring node and the node link information between the neighboring node and the current node; Select one of the multiple neighboring nodes with the highest service quality metric score as the target next hop node.

6. The method according to claim 1, characterized in that The intra-domain real-time situation information includes intra-domain network topology information and routing decision resource information of nodes in the predetermined area; The active routing decision and data forwarding based on the real-time situation information in the domain includes: Determine a set of candidate paths from the current node to the target node according to the intra-domain network topology information; Filtering paths from the candidate path set according to the routing decision resource information to obtain a data transmission path; The service data is sent to the target node through the data transmission path.

7. The method according to claim 6, characterized in that The routing decision resource information includes real-time node status information and inter-node link information; The step of screening paths from the candidate path set according to the routing decision resource information to obtain a data transmission path includes: If the candidate path set includes at least two paths, then determining a path that meets a predetermined service quality indicator requirement from the candidate path set to obtain a pre-selected path set; If the pre-selected path set includes at least two paths, calculating the combined weight of each path in the pre-selected path set according to the node real-time status information and the inter-node link information; The path with the highest combined weight in the pre-selected path set is determined as the data transmission path.

8. The method according to claim 1, characterized in that The collecting of global situation information respectively includes: Each of the nodes periodically shares situation information through a one-hop fusion forwarding method according to an elastic period, so that each of the nodes can collect global situation information.

9. The method according to claim 8, characterized in that Each of the nodes periodically shares situation information through a one-hop fusion forwarding method according to an elastic period, including: Each of the nodes will receive updated status information of nodes within different hop count ranges and share the status information through a one-hop fusion forwarding method according to the elastic period corresponding to the hop count range, wherein the elastic period corresponding to the hop count range farther from each of the nodes is longer.

10. The method according to claim 8, characterized in that Each of the nodes perceives the real-time situation information within the domain through a link layer, and each of the nodes perceives the less-than-real-time situation information outside the domain through an application layer.

11. The method according to claim 8, characterized in that Each of the nodes determines the elastic period in the following manner: Dynamically determine the planning cycle based on load status and network status; The flexible period is obtained according to the planned period.

12. The method according to claim 11, characterized in that The obtaining of the flexible cycle according to the planned cycle includes one of the following methods: Adding the planned period to the forwarding jitter time to obtain the elastic period; The planning period is determined as the flexible period.

13. The method according to claim 8, characterized in that The method further comprises: Each of the nodes locally stores the received node status information for a target effective retention time, wherein the target effective retention time is greater than the elastic period.

14. The method according to claim 13, characterized in that Each of the nodes determines the target effective holding time in the following manner: Determining a predetermined effective retention time for matching of the received node situation information; The predetermined effective holding time is added to the holding jitter time to obtain the target effective holding time of the received node status information stored locally.

15. The method according to any one of claims 1 to 14, characterized in that The real-time situation information within the domain includes the network topology information within the domain and the routing decision resource information of the nodes within the predetermined area, and the routing decision resource information includes the real-time status information of the nodes and the link information between the nodes; the less-than-real-time situation information outside the domain includes the node position information of each node outside the predetermined area.

16. A data transmission device in an ad hoc network, characterized in that: The ad hoc network includes a plurality of nodes, and the device is applied to each of the nodes, and the device includes: A collection module, used to collect global situation information respectively, wherein the global situation information includes real-time situation information within the domain and less-than-real-time situation information outside the domain, wherein the real-time situation information within the domain is obtained based on the node real-time situation information of the nodes within the predetermined area where each node is located, and the less-than-real-time situation information outside the domain is obtained based on the node less-than-real-time situation information of the nodes outside the predetermined area; The transmission module is used to: respond to the data transmission instruction, if the target node is located in the predetermined area, make active routing decisions and forward data based on the real-time situation information in the domain; if the target node is located outside the predetermined area, combine the real-time situation information in the domain and the less-than-real-time situation information outside the domain to perform a directed deep routing search and data forwarding of the transmission and calculation formula.

17. A storage medium, characterized in that: A computer program is stored thereon, and when the computer program is executed by a processor of a computer, the computer is caused to execute the method according to any one of claims 1 to 15.

18. A node, characterized in that: include: a memory storing a computer program; A processor reads a computer program stored in a memory to execute the method according to any one of claims 1 to 15.

Images