Anti-fluctuation ad hoc network communication routing system and method in ground bearing environment

Abstract

The invention discloses an anti-fluctuation ad hoc network communication routing system and method in a ground bearing environment, and relates to the technical field of network communication, and the system comprises a data caching module used for caching data, a routing updating module used for routing calculation, and a full-path routing module used for updating full-path routing information. And the route updating module is used for transmitting the output result to the full-path route information module. According to the technical scheme provided by the invention, the data in a certain time can be cached through the data caching module, and the route updating module can calculate the signal-to-noise ratio of the new route, compare whether the signal-to-noise ratio of the new route is greater than the signal-to-noise ratio of the old route or not, and compare the historical numerical values of the new route and the old route, so that the route updating module can update the route. According to the method, whether a new route is the optimal route compared with an old route is judged through a full-path route updating module, and when the new route is the optimal route, the new route is updated through the full-path route updating module, so that the optimal route can be continuously analyzed and selected, the fluctuation resistance of the route is improved, and data transmission is more stable.

Description

Technical Field

[0001] The present invention relates to the field of network communication technology, and in particular to a fluctuation-resistant self-organizing network communication routing method in a ground backpack environment. Background Art

[0002] In ground emergency rescue scenarios, backpack-type self-organizing network communication products have the following advantages over other communication products: portability and high mobility; ready for use after power-up, and rapid completion of basic network construction; support for multi-hop, and the ability to complete communication tasks through multiple hops in various complex terrains; support for voice, video, short message and other service transmissions; support for docking with base stations, thereby transmitting data in the self-organizing network to the external network, facilitating decision-making by the command center.

[0003] Routing algorithms are critical for emergency backpack products, and often require a trade-off between the shortest route, the best signal-to-noise ratio, and stability and reliability. In existing products, since emergency rescue is mainly carried out on the ground and electromagnetic signals are affected by line of sight, the routing algorithm is generally implemented as follows: 1) Each node periodically broadcasts a signaling packet: containing the node ID, background noise, and existing routes (including destination ID, next hop ID, SNR); 2) After receiving the signaling packet from other node A, parse the route contained in the signaling; 3) Compare the current route of this node and select the optimal route.

[0004] However, the routing algorithms of backpack products in the current emergency field still have some shortcomings: in scenes with severe obstruction such as cities and canyons, the routing of backpack products fluctuates severely. Due to the fluctuation of routing, time slot resources need to be frequently readjusted, and the adjustment of time slot resources will lead to network delay changes, data packet loss and other problems, thereby causing user business data loss, video distorted screen and other problems, and even link paralysis in complex scenes. Therefore, in order to solve the above problems, it is necessary to improve the original routing algorithm to achieve anti-fluctuation of routing. The present invention solves this technical problem. Summary of the invention

[0005] The purpose of the present application is to provide a self-organizing network communication routing system and method that is resistant to fluctuations in a ground backpack environment, aiming to solve the technical problems corresponding to the background technology.

[0006] To achieve the above-mentioned purpose, the present application proposes a fluctuation-resistant self-organizing network communication routing system in a ground backpack environment, including a data caching module for caching data, a routing update module for routing calculation, and a full-path routing module for updating the full-path routing information. The routing update module is used to pass the output result to the full-path routing information module.

[0007] In addition, to achieve the above-mentioned purpose, the present invention also proposes a method for anti-fluctuation self-organizing network communication routing in a ground backpack environment, based on the anti-fluctuation self-organizing network communication routing system in the ground backpack environment as described above, comprising the following steps:

[0008] S1. After powering on, each node periodically sends a signaling packet;

[0009] S2. After receiving the signaling packet from other nodes, the routing update module estimates the signal-to-noise ratio of the peer node based on the noise floor of the local node and the peer node;

[0010] S3, caching the obtained data through a data cache module;

[0011] S4, passing the route to the routing update module;

[0012] S5, the route update module compares the historical data of the new route and the old route, as well as the amount of information cached by the data cache module within a certain period of time, to determine whether to switch the route;

[0013] S6. The output result of the routing update module is transmitted to the full-path routing module to update the full-path routing information and the signal-to-noise ratio information of each path;

[0014] S7. Repeat the above process.

[0015] Furthermore, the specific steps of step S2 are as follows:

[0016] S21, record the noise floor of this node as floor1, and record the transmission power as Tx1;

[0017] S22, the noise floor floor2 and the transmission power Tx2 of the peer node can be obtained through the signaling sent by the peer node;

[0018] S23, the signal strength of the peer node received by the node is rxPower1;

[0019] S24. Calculate the signal-to-noise ratio of the opposite node based on the above content.

[0020] Furthermore, the specific calculation process of step S24 is as follows:

[0021] Due to the symmetry of the channel, the following formula exists:

[0022] RxPower1=Tx2–empty attenuation

[0023] RxPower2=Tx1–empty decay

[0024] SNR1=RxPower1–Floor1

[0025] SNR2=RxPower2–Floor2

[0026] Based on the above content, the signal-to-noise ratio of the peer node can be calculated:

[0027] SNR2=Tx1-(Tx2–RxPower1)-Floor2.

[0028] Furthermore, the specific steps of step S3 are as follows:

[0029] S31, using sliding window mechanism to cache 10s routing data;

[0030] S32, locate the target entry according to nextid and destid and store it;

[0031] S33, enable the timeout timer, if the target route is not received within a certain period of time, clear the entry information;

[0032] S34, repeat the above content to cache the routing information of all nodes on the network for 10s.

[0033] Furthermore, in step S5, the process of comparing the historical data of the new route and the old route by the routing update module is as follows:

[0034] S51. Compare the old route to see if it is 1 hop:

[0035] If yes, then compare whether the signal-to-noise ratio of the old route is greater than the set value. If it is greater than the set value, the signal-to-noise ratio of the old route is already the best, and the route is not switched and the process returns directly. Otherwise, the process continues to execute.

[0036] S52, comparing whether the signal-to-noise ratio of the new route is greater than that of the old route: if so, continue to execute, otherwise exit the execution;

[0037] S53, compare whether the number of hops of the new route is smaller than that of the old route, and whether the signal-to-noise ratio is greater than the set value: if so, directly switch to 1 hop, otherwise continue to execute

[0038] S54, comparing whether the signal-to-noise ratio of the new route is greater than the signal-to-noise ratio of the current route by a certain value: if it is smaller, then exit; if it is larger, query the data in the data cache module to compare within a 10s window, whether the data with a certain value greater than the current signal-to-noise ratio reaches 80% of the data within 10s;

[0039] If it is satisfied, the route is updated; if it is not satisfied, the process exits.

[0040] Furthermore, the specific steps of step S54 are as follows:

[0041] S541. Obtain the SNR of the new and old routes within a 10 - second window. Count the data of the new route as [n1 - n10] and the data of the old route as [O1 - O10].

[0042] S542. Compare the data second by second. If the condition is met, increment the count cnt. The comparison process is as follows:

[0043] If N1 > O1, then cnt = 1;

[0044] If N2 > O2, then cnt = 2;

[0045] If N3 < O3, then cnt = 2;

[0046] And so on;

[0047] S543. Finally, compare whether cnt is greater than or equal to 8. If it is, update the route.

[0048] Furthermore, in step S54, the principle of querying the data in the data cache module is as follows:

[0049] The data cache module caches the SNR data of each node in the most recent 10 seconds. The data needs to use the next - hop node and the destination node of the target route as parameters and pass them to the route update module through function calls. The route update module will compare the destination node and the next - hop node one by one in the cached route data to find the target data, and then return the target node data to the caller in the form of a pointer.

[0050] Furthermore, the route update module, the data cache module, and the full - path route module realize data transmission through their respective interfaces.

[0051] Furthermore, the signaling packet contains the routes, background noise, full - path routes to each node, and the corresponding SNR of each node currently maintained.

[0052] The technical effects of the present invention are as follows:

[0053] (1) The present invention caches data within a certain period of time through the data cache module. The route update module calculates the SNR of the new route, compares whether the SNR of the new route is greater than that of the old route, and compares the historical values of the new route and the old route to determine whether the new route is the best route compared to the old route. When the new route is the best route, it is updated through the full - path route update module, so as to continuously analyze and select the best route, improve the anti - volatility of the route, and make the data transmission more stable;

[0054] (2) The data cache module in this solution will cache historical data for a period of time. During subsequent analysis and comparison, it can reduce the impact of the instantaneous signal-to-noise ratio on routing stability, and the obtained data will be more reliable, thereby improving routing stability.

[0055] (3) This solution can combine the signal-to-noise ratio of each node on the entire path to select the best path. Once a node fails, a new reliable route can also be quickly selected, improving the recovery after network outage. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the structures shown in these drawings without paying creative work.

[0057] Figure 1 It is the work flow chart of the present invention.

[0058] Figure 2 It is a schematic diagram of the hardware structure of the present invention.

[0059] The realization of the purpose, functional features and advantages of the present invention will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0060] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0061] It should be noted that if the embodiments of the present invention involve directional indications (such as up, down, left, right, front, back, etc.), the directional indications are only used to explain the relative position relationship, movement status, etc. between the components in a certain specific posture. If the specific posture changes, the directional indication will also change accordingly.

[0062] In addition, if there are descriptions involving "first", "second", etc. in the embodiments of the present invention, the descriptions of "first", "second", etc. are only used for descriptive purposes and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of technical features indicated. Therefore, the features limited to "first" and "second" may explicitly or implicitly include at least one of the features. In addition, if "and / or" or "and / or" appears in the full text, its meaning includes three parallel solutions. Taking "A and / or B" as an example, it includes solution A, solution B, or solutions that satisfy both A and B. In addition, the technical solutions between the various embodiments can be combined with each other, but it must be based on the ability of ordinary technicians in this field to implement. When the combination of technical solutions is contradictory or cannot be implemented, it should be deemed that such combination of technical solutions does not exist and is not within the scope of protection required by the present invention.

[0063] See also Figure 2 , a ground-based anti-fluctuation ad hoc network communication routing system in a backpack environment, including a data cache module for caching data, a routing update module for routing calculation, and a full-path routing module for updating full-path routing information. The routing update module is used to pass the output result to the full-path routing information module. The modules mentioned above are mainly operated on Figure 1 On the ARM processor in.

[0064] See also Figure 1 The present invention also provides a method for anti-fluctuation self-organizing network communication routing in a ground backpack environment, based on the anti-fluctuation self-organizing network communication routing system in the ground backpack environment as described above, comprising the following steps:

[0065] S1. After powering on, each node periodically sends a signaling packet, with a default time of 1s.

[0066] S2. After receiving the signaling packet from other nodes, the routing update module estimates the signal-to-noise ratio of the peer node based on the noise floor of the local node and the peer node;

[0067] S3, caching the obtained data through a data cache module;

[0068] S4, passing the route to the routing update module;

[0069] S5, the route update module compares the historical data of the new route and the old route, as well as the amount of information cached by the data cache module within a certain period of time, to determine whether to switch the route;

[0070] S6. The output result of the routing update module is transmitted to the full-path routing module to update the full-path routing information and the signal-to-noise ratio information of each path;

[0071] S7. Repeat the above process.

[0072] Through the above work, the most stable and efficient route, that is, the optimal route, can be selected.

[0073] Signaling packets are packets used to transmit control information in computer networks and communication systems. Unlike data packets, which usually carry user data (such as web page content, emails, videos, etc.), signaling packets are specifically used to establish, manage, and terminate communication sessions. During the communication process, signaling packets perform the following functions:

[0074] 1) Establishing a connection: Before establishing a communication session between two communicating entities, signaling packets are used to exchange necessary information, such as addresses, capabilities, bandwidth requirements, and encryption methods.

[0075] 2) Maintaining the connection: While a session is ongoing, signaling packets can be used to maintain and update the state of the session, for example, to handle network congestion, adjust the transmission rate, or handle errors.

[0076] 3) Termination of connection: When a communication session ends, signaling packets are used to properly close the session and ensure that all resources are released.

[0077] Furthermore, the specific steps of step S2 are as follows:

[0078] S21, record the noise floor of this node as floor1, and record the transmission power as Tx1;

[0079] S22, the noise floor floor2 and the transmission power Tx2 of the peer node can be obtained through the signaling sent by the peer node;

[0080] S23, the signal strength of the peer node received by the node is rxPower1;

[0081] S24. Calculate the signal-to-noise ratio of the opposite node based on the above content.

[0082] In a communication system, background noise refers to the noise present in the channel when there is no signal transmission. This noise will reduce the clarity and reliability of the signal and affect the communication quality.

[0083] Signal-to-noise ratio, abbreviated as SNR, is an important parameter to measure signal quality. It represents the ratio between the useful signal strength and the background noise strength. The signal-to-noise ratio is usually used to evaluate the performance of electronic equipment, communication systems, audio equipment and image processing systems. In wireless and wired communications, the signal-to-noise ratio determines the transmission quality and distance of the signal. A high signal-to-noise ratio helps reduce the bit error rate and improve the reliability and efficiency of data transmission.

[0084] Furthermore, the specific calculation process of step S24 is as follows:

[0085] Due to the symmetry of the channel, the following formula exists:

[0086] RxPower1=Tx2–empty attenuation

[0087] RxPower2=Tx1–empty decay

[0088] SNR1=RxPower1–Floor1

[0089] SNR2=RxPower2–Floor2

[0090] Based on the above content, the signal-to-noise ratio of the peer node can be calculated:

[0091] SNR2=Tx1-(Tx2–RxPower1)-Floor2.

[0092] Furthermore, the specific steps of step S3 are as follows:

[0093] S31, using sliding window mechanism to cache 10s routing data;

[0094] S32, locate the target entry according to nextid and destid and store it;

[0095] S33, enable the timeout timer, if the target route is not received within 3s, clear the entry information, mainly used to prevent the signaling packet loss problem when the link status is poor;

[0096] S34, repeat the above content to cache the routing information of all nodes on the network for 10s.

[0097] In the above content, the sliding window mechanism is a technology used in transport layer protocols in computer networks, such as TCP (Transmission Control Protocol), to manage data flows and ensure that data is transmitted correctly and efficiently. This mechanism allows the sender to send multiple data packets without waiting for confirmation of each data packet, which can significantly improve network throughput and efficiency;

[0098] nextid (next identifier) ​​is a unique identifier used to refer to the next expected item, message or data packet, or an increasing sequence number indicating the order of data items or a unique ID used to track the order of message streams or data packets. nextid can be used to ensure the integrity and order of data.

[0099] destid (destination identifier) ​​is usually used to specify the target location where the data entry should be sent to or stored. It can be the ID of a target task, the identifier of the target storage location, or the identifier of a target system. In this solution, destid is used to route messages to the correct node.

[0100] Further, in step S5, the process of comparing the historical data of the new route and the old route by the route updating module is as follows:

[0101] S51, compare the old route to see if it is 1 hop:

[0102] If yes, then compare whether the signal-to-noise ratio of the old route is greater than 24dBm. If it is greater than 24dBm, the signal-to-noise ratio of the old route is already the best, and the route is not switched and the process returns directly. Otherwise, the process continues to execute.

[0103] S52, comparing whether the signal-to-noise ratio of the new route is greater than that of the old route: if so, continue to execute, otherwise exit the execution;

[0104] S53, compare whether the number of hops of the new route is smaller than that of the old route, and whether the signal-to-noise ratio is greater than 24dBm: If so, directly switch to 1 hop, otherwise continue to execute

[0105] S54, compare whether the signal-to-noise ratio of the new route is 3 dBm greater than that of the current route: if it is smaller, exit; if it is larger, query the data in the data cache module to compare whether the data with a signal-to-noise ratio greater than the current signal-to-noise ratio by 3 dBm in the 10s window reaches 80% of the data in 10s;

[0106] If it is satisfied, the route is updated; if it is not satisfied, the process exits.

[0107] The principle of the route update module is mainly to compare the historical data of the new route and the old route. The new route must be larger than the old route by more than 3dBm, and 80% of the data in the 10s cache window must meet this condition before the update is allowed. In addition, the upper limit SNR of route switching is added. Once the SNR is greater than 24dBm, it is determined that the signal-to-noise ratio is excellent at this time. At this time, it can quickly switch to a path with fewer hops, taking into account the speed of route switching.

[0108] Through the above method, the new route and the old route can be compared in terms of hop count, signal-to-noise ratio and data, and comprehensive considerations can be made on whether to switch routes, thereby improving the reliability of route updates in this solution;

[0109] The hop count of a route is a term in the network, which is used to describe the number of routers that a data packet passes through when it is transmitted from the source host to the destination host. Every time a data packet is forwarded from one router to another, the hop count increases by 1. In simple terms, each hop means that the data packet passes through a router. The more hops there are, the more routers it passes through, and the higher the network delay will be.

[0110] The hop count is an indicator for measuring network latency and path length. In network design and troubleshooting, the hop count can help network administrators understand the transmission path of data packets in the network and optimize network configuration accordingly.

[0111] Furthermore, the specific steps of step S54 are as follows:

[0112] S541. Obtain the SNR of the new and old routes within a 10s window. Denote the data of the new route as [n1~n10] and the data of the old route as [O1~O10];

[0113] S542. Compare the data second by second. If the conditions are met, the count cnt will automatically increase. The comparison process is as follows:

[0114] If N1>O1, then cnt = 1;

[0115] If N2>O2, then cnt = 2;

[0116] If N3<O3, then cnt = 2;

[0117] And so on;

[0118] S543. Finally, compare whether cnt is greater than or equal to 8. If it is greater than or equal to 8, it means that the data with a SNR 3dBm higher than the current SNR has reached 80% of the data within 10s, and the route can be updated.

[0119] Furthermore, in step S54, the principle of querying the data in the data cache module is as follows:

[0120] The data cache module will cache the SNR data of each node in the recent 10s. The data needs to use the next-hop node and destination node of the target route as parameters and pass them to the route update module through function calls. The route update module will compare the destination node and next-hop node one by one in the cached route data, find the target data, and then return the target node data to the caller in the form of a pointer.

[0121] Furthermore, the route update module, data cache module, and full-path route module implement data transmission through their respective interfaces. Each module has interfaces for processing, storing, deleting, etc. its own data. Through these interfaces, data can be passed into the corresponding module.

[0122] Furthermore, the signaling packet contains the routes, background noise, full-path routes to each node, and the corresponding SNR of each node currently maintained.

[0123] Through Figure 1It can be seen that the process of this solution is simply as follows: after receiving the signaling packet, data is cached, and based on the obtained data, it is determined whether a route update is required. When a route update is required, it needs to be updated through the full-path route update module;

[0124] Specifically, the present invention caches data within a certain period of time through a data cache module, and the routing update module calculates the signal-to-noise ratio of the new route, and compares whether the signal-to-noise ratio of the new route is greater than the signal-to-noise ratio of the old route, and compares the historical values ​​of the new route and the old route to determine whether the new route is the best route compared with the old route. When the new route is the best route, it is updated through the full-path routing update module, so that the best route can be continuously analyzed and selected, the anti-fluctuation performance of the route is improved, and the data transmission is more stable, thereby overcoming the problem of serious routing signal fluctuation in the prior art.

[0125] The above description is only an exemplary embodiment of the present invention, and does not limit the patent scope of the present invention. All equivalent structural changes made by using the contents of the present invention specification and drawings under the technical concept of the present invention, or directly / indirectly applied in other related technical fields are included in the patent protection scope of the present invention.

Claims

1. A self-organizing network communication routing system that is resistant to fluctuations in a ground backpack environment, characterized in that: It comprises a data caching module for caching data, a routing updating module for routing calculation, and a full-path routing module for updating full-path routing information. The routing updating module is used to transfer the output result to the full-path routing information module.

2. A method for resistant fluctuation self-organizing network communication routing in a ground backpack environment, based on the resistant fluctuation self-organizing network communication routing system in a ground backpack environment as claimed in claim 1, characterized in that: The following steps are involved: S1. After powering on, each node periodically sends a signaling packet; S2. After receiving the signaling packet from other nodes, the routing update module estimates the signal-to-noise ratio of the peer node based on the noise floor of the local node and the peer node; S3, caching the obtained data through a data cache module; S4, passing the route to the routing update module; S5, the route update module compares the historical data of the new route and the old route, as well as the amount of information cached by the data cache module within a certain period of time, to determine whether to switch the route; S6. The output result of the routing update module is transmitted to the full-path routing module to update the full-path routing information and the signal-to-noise ratio information of each path; S7. Repeat the above process.

3. The method for anti-fluctuation ad hoc network communication routing in a ground backpack environment according to claim 2, characterized in that: The specific steps of step S2 are as follows: S21, record the noise floor of this node as floor1, and record the transmission power as Tx1; S22, the noise floor floor2 and the transmission power Tx2 of the peer node can be obtained through the signaling sent by the peer node; S23, the signal strength of the peer node received by the node is rxPower1; S24. Calculate the signal-to-noise ratio of the opposite node based on the above content.

4. The method for anti-fluctuation ad hoc network communication routing in a ground backpack environment according to claim 3 is characterized in that: The specific calculation process of step S24 is as follows: Due to the symmetry of the channel, the following formula exists: RxPower1=Tx2–empty decay RxPower2=Tx1–empty decay SNR1=RxPower1–Floor1 SNR2=RxPower2–Floor2 Based on the above content, the signal-to-noise ratio of the peer node can be calculated: SNR2=Tx1-(Tx2–RxPower1)-Floor2.

5. The method for anti-fluctuation ad hoc network communication routing in a ground backpack environment according to claim 2, characterized in that: The specific steps of step S3 are as follows: S31, using sliding window mechanism to cache 10s routing data; S32, locate the target entry according to nextid and destid and store it; S33, enable the timeout timer, if the target route is not received within a certain period of time, clear the entry information; S34, repeat the above content to cache the routing information of all nodes on the network for 10s.

6. The method for anti-fluctuation ad hoc network communication routing in a ground backpack environment according to claim 2, characterized in that: In step S5, the process of comparing the historical data of the new route and the old route by the route updating module is as follows: S51. Compare the old route to see if it is 1 hop: If yes, then compare whether the signal-to-noise ratio of the old route is greater than the set value. If it is greater than the set value, the signal-to-noise ratio of the old route is already the best, and the route is not switched and the process returns directly. Otherwise, the process continues to execute. S52, comparing whether the signal-to-noise ratio of the new route is greater than that of the old route: if so, continue to execute, otherwise exit the execution; S53, compare whether the number of hops of the new route is smaller than that of the old route, and whether the signal-to-noise ratio is greater than the set value: if so, directly switch to 1 hop, otherwise continue to execute S54. Compare whether the signal-to-noise ratio of the new route is greater than a certain value than that of the current route: if it is smaller, exit; if it is larger, query the data in the data cache module, and compare whether the data with a signal-to-noise ratio greater than a certain value within a 10s window reaches 80% of the data within 10s; If it is satisfied, perform route update; if it is not satisfied, exit.

7. The method for anti-fluctuation ad hoc network communication routing in a ground backpack environment according to claim 6, characterized in that: The specific steps of step S54 are as follows: S541. Obtain the SNR of the new and old routes in a 10s window, record the data of the new route as [n1~n10], and record the data of the old route as [O1~O10]; S542. Compare the data second by second. If the condition is satisfied, the count cnt is incremented. The comparison process is as follows: If N1>O1, then cnt = 1; If N2>O2, then cnt = 2; If N3<O3, then cnt = 2; And so on; S543. Finally, compare whether cnt is greater than or equal to 8. If it is greater than or equal to 8, update the route.

8. The method for anti-fluctuation ad hoc network communication routing in a ground backpack environment according to claim 6, characterized in that: In step S54, the principle of querying the data in the data cache module is as follows: The data cache module caches the signal-to-noise ratio data of each node in the recent 10s. The data needs to use the next-hop node and the destination node of the target route as parameters and pass them to the route update module through function calls. The route update module will compare the destination node and the next-hop node one by one in the cached route data, find the target data, and then return the target node data to the caller in the form of a pointer.

9. The method for anti-fluctuation ad hoc network communication routing in a ground backpack environment according to claim 2, characterized in that: The route update module, the data cache module, and the full-path route module implement data transmission through their respective interfaces.

10. The method for anti-fluctuation ad hoc network communication routing in a ground backpack environment according to claim 2, characterized in that: The signaling packet includes the routes of each node currently maintained, the background noise, the full-path routes to each node, and the corresponding signal-to-noise ratios.

Images