Terminal equipment communication transmission method and equipment based on single-soldier ad hoc network, and medium

Abstract

The invention relates to a terminal device communication transmission method and device based on a single-soldier ad hoc network and a medium. Reliability is improved through a dynamic dual-mode compensation mechanism. The method specifically comprises the following steps: a terminal establishes a main communication mode (including an initial routing and transmission protocol) based on dynamic topology, and establishes a complementary auxiliary communication mode (different routing strategies or protocols but consistent capacities); dual modes are bound into a redundancy group, state differences are monitored in real time, and untransmitted data packets / path delays are associated with dynamic identification bits; performing compensation transmission on difference data pointed by the identification bit through an auxiliary mode, and clearing the identification bit after the compensation transmission is completed; and if the redundant group has no residual identification bit, terminating the main mode and switching the auxiliary mode to dominate transmission. The network state and the compensation requirement are accurately associated through the dynamic identification bit, self-adaptive compensation of difference data is achieved, waste of redundant resources is avoided, and meanwhile the end-to-end communication success rate in the high dynamic environment is ensured through the dual-mode complementary characteristic.

Description

Technical Field

[0001] The present application relates to the technical field of wireless ad hoc network communication transmission, and specifically relates to a communication transmission method, device and medium for a terminal device based on a single-soldier ad hoc network. Background Technique

[0002] In a single-soldier ad hoc network (MANET), terminal devices rely on dynamic network topologies to achieve communication. However, due to factors such as high node mobility and unstable links, traditional data transmission methods have significant drawbacks. In the prior art, redundancy transmission strategies are often used to improve reliability, such as backing up data through multi-path parallel transmission or fixed redundancy protocols. However, these methods face the following problems in dynamic environments:

[0003] Traditional redundancy modes (such as fixed dual paths) do not consider the real-time changes in the network topology, resulting in inconsistent capacities between the redundant paths and the main path, causing resource waste or insufficient compensation capabilities. For example, when the main path fails due to node movement, the redundant path may not be able to effectively take over the data stream due to uneven load or deteriorated link quality.

[0004] The prior art usually triggers retransmission based on a fixed threshold (such as delay timeout). However, the transient fluctuations in the path state in a dynamic network can cause the threshold to fail, making it difficult to accurately distinguish between occasional delays and real path failures, thus leading to misjudgment or compensation delays.

[0005] After detecting transmission anomalies, existing methods lack refined association management for uncompleted data packets, resulting in the selection of compensation paths relying on static rules (such as the shortest hop count), while ignoring real-time path quality (such as bit error rate, node load), ultimately reducing the compensation efficiency.

[0006] Traditional methods do not dynamically bind the data packet status (such as fragment loss, path fingerprint) to the network topology changes, resulting in a mismatch between the verification information and the transmission path during the compensation process, making it difficult to achieve cross-layer collaborative verification and even causing secondary transmission errors.

[0007] In response to the above problems, some improvement schemes attempt to introduce dynamic routing protocols or adaptive coding mechanisms, but there are still the following limitations:

[0008] Although dynamic routing protocols can update paths, they do not associate the path status with the differences in specific data packets, resulting in lack of pertinence in compensation transmission;

[0009] Adaptive coding (such as erasure coding) increases the redundancy overhead but does not solve the problems of rapid positioning and priority scheduling of different data packets;

[0010] Existing verification mechanisms (such as CRC) only target data integrity and cannot reflect the dynamic characteristics of the transmission path (such as hop count changes and frequency domain characteristics), resulting in the need for full verification after compensated transmission, with low efficiency.

[0011] Therefore, there is an urgent need for a method that can real-time associate the status of data packets with the dynamic network topology, accurately identify differential data, and intelligently trigger compensated transmission, so as to reduce redundant overhead while ensuring reliability and improve the communication efficiency of individual soldier ad-hoc networks in complex environments. Summary of the Invention

[0012] (I) Technical Problems to be Solved

[0013] The present invention mainly aims at the above problems and proposes a communication transmission method, device, and medium for terminal devices based on individual soldier ad-hoc networks, aiming to solve the problems of low redundant transmission efficiency and inaccurate compensation of differential data caused by dynamic topology changes in individual soldier ad-hoc networks.

[0014] (II) Technical Solutions

[0015] To achieve the above object, the first aspect of the present invention provides a communication transmission method for terminal devices based on individual soldier ad-hoc networks, including the following steps:

[0016] In an individual soldier ad-hoc network, a terminal device establishes a first communication mode based on the dynamic network topology, and the first communication mode includes an initial routing path and a transmission protocol;

[0017] Create a second communication mode complementary to the first communication mode, where the routing strategy or transmission protocol of the second communication mode is different from that of the first communication mode, and the data transmission capacities of the two modes are the same;

[0018] Bind the first communication mode and the second communication mode into a redundant communication group, real-time monitor the status differences of data transmission in the two modes, and associate the uncompleted transmitted data packets or path delay information with dynamic identification bits;

[0019] Perform compensated transmission on the differential data associated with the dynamic identification bits through the second communication mode, clear the corresponding dynamic identification bits after completion of transmission, and determine whether there are remaining dynamic identification bits in the redundant communication group;

[0020] In response to no dynamic identification bits in the redundant communication group, terminate the first communication mode and perform subsequent data transmission based on the second communication mode.

[0021] Further, the dynamic identification bits are updated in the following manner:

[0022] When a data packet is fragmented and transmitted, a fragment-level checksum and a packet-level hierarchical checksum are generated for each fragment. The fragment-level checksum includes the source node ID, the fragment sequence number, and the path fingerprint. The packet-level hierarchical checksum is generated by convolutional coding based on the transmission path quality indicators of all fragments, where the convolutional coefficient is dynamically bound to the current network topology hop count;

[0023] When the transmission delay of a fragment in the first communication mode exceeds the dynamic threshold, the path fingerprint of the fragment is extracted and matched with the path fingerprint eigenvalue in the path quality evaluation matrix. The dynamic threshold is adjusted in real time according to the convolutional coefficient of the packet-level hierarchical checksum, and the adjustment amplitude is proportional to the network throughput fluctuation range;

[0024] Based on the packet loss rate gradient and the delay fluctuation value of the matching path in the path quality evaluation matrix, the stability weight of the current transmission path is calculated through the stability weight formula. If the stability weight value is lower than the preset threshold, the dynamic identification bit is activated and a compensation transmission priority coefficient is generated. The priority coefficient is negatively correlated with the weight value;

[0025] In the second communication mode, a retransmission path is selected according to the compensation transmission priority coefficient to perform compensation transmission. At the same time, the real-time error rate and the node load rate of the compensation path are injected into the path quality evaluation matrix to update the frequency domain feature vector and the topological association parameter of the corresponding path fingerprint;

[0026] Cross-layer check verification is performed on the fragment after compensation transmission. If the path fingerprint of the fragment-level checksum matches the orthogonal decoding result of the packet-level hierarchical checksum, the dynamic identification bit is cleared and the path fingerprint binding is released; if the match fails, the dynamic identification bit is reactivated based on the updated path quality evaluation matrix and a secondary compensation transmission is triggered.

[0027] Furthermore, the path quality evaluation matrix is constructed in the following way:

[0028] Collect the time-varying parameter set of each transmission path in real time. The time-varying parameter set includes the instantaneous throughput, the error rate distribution, and the topological hop count difference;

[0029] For adjacent nodes of the transmission path, the time-domain sequence of their channel state information is intercepted, and the frequency domain features are extracted through sliding window Fourier transform to generate the frequency domain feature vector of the path fingerprint corresponding to each path;

[0030] The time-varying parameter set and the frequency domain feature vector are tensor fused, and the stability weight factor of each transmission path is calculated through a multi-layer perceptron model. The stability weight factor includes the quantization indexes of the packet loss rate gradient and the delay fluctuation value;

[0031] Associate and map the path fingerprints, stability weight factors, and real-time topological status of each transmission path to construct a path quality evaluation matrix that includes path fingerprint eigenvalues, a weight factor matrix, and a hop count association table.

[0032] Further, the shard-level checksum and packet-level hierarchical checksum are generated through the following method:

[0033] Divide the data packet into multiple data shards according to a preset sharding rule, and attach shard header information to each data shard. The shard header information includes the source node ID, the destination node ID, and the shard sequence number;

[0034] Based on the source node ID and shard sequence number in the shard header information, use a hash mapping algorithm to generate a shard unique identifier, and perform an exclusive OR operation on the shard unique identifier and the node hop count of the current transmission path to generate the path fingerprint of the shard-level checksum;

[0035] Perform time-domain splicing on the path fingerprints of all shard-level checksums, extract the frequency-domain energy distribution characteristics of each path fingerprint, and generate the frequency-domain feature vector of the path fingerprint sequence;

[0036] Dynamically generate a set of convolution coefficients according to the current network topology hop count. The convolution coefficients have an exponential relationship with the reciprocal of the topology hop count, and for each increase of 1 in the hop count, the convolution coefficient decay factor increases by a preset ratio;

[0037] Perform layer-by-layer convolutional encoding on the frequency-domain feature vector and the set of convolution coefficients to generate the packet-level hierarchical checksum, and bind the path fingerprint of each shard to the orthogonal component of the packet-level hierarchical checksum to form a hierarchical checksum structure.

[0038] Further, the dynamic threshold adjustment and compensation transmission priority coefficient generation are executed through the following steps:

[0039] According to the number of convolutional encoding layers of the packet-level hierarchical checksum, calculate the path quality decay factor of the current network topology hop count. The product of the decay factor and the convolution coefficient constitutes the reference value of the dynamic threshold;

[0040] Real-time collect network throughput fluctuation data, calculate the throughput fluctuation range through a moving average algorithm, and linearly superimpose the fluctuation range with the reference value to generate the real-time adjustment value of the dynamic threshold;

[0041] When the shard transmission delay exceeds the real-time adjustment value, extract the path fingerprint of the shard and match the frequency-domain similarity of the path fingerprint eigenvalue in the path quality evaluation matrix;

[0042] If the frequency domain similarity exceeds the matching threshold, the packet loss rate gradient and delay fluctuation value of the matching path are extracted. The packet loss rate gradient is calculated by the first-order difference of the historical packet loss rate sequence, and the delay fluctuation value is quantified by the standard deviation of the delay sequence.

[0043] The stability weight of the transmission path is calculated using the stability weight formula.

[0044] If the stability weight is lower than the preset threshold value, the deviation value between the weight value and the dynamic threshold is input into the S-shaped function to generate a compensation transmission priority coefficient, and the priority coefficient is positively correlated with the deviation value.

[0045] Furthermore, the stability weight formula is:

[0046]

[0047] where W represents the stability weight of the transmission path; α is a normalization coefficient associated with the network topology hop count, and the calculation formula is: H is the topology hop count of the current path; G is the packet loss rate gradient, calculated by the first-order difference of the historical packet loss rate sequence, that is, G = L t -L t-1 ,L t represents the packet loss rate at the t-th moment; β is the delay fluctuation coefficient, which is inversely proportional to the network topology hop count. γ is a preset constant; D is the delay fluctuation value, calculated by the standard deviation of the delay sequence, that is d i is the i-th delay measurement value. is the average delay, n represents the total number of delay measurements, which is the number of delay samples collected within the sliding window, and i is the index variable of the delay measurement value.

[0048] Furthermore, the real-time adjustment value of the dynamic threshold is calculated by the following formula:

[0049] T adjust =T base +k·Δ

[0050] where T adjust represents the real-time adjustment value of the dynamic threshold; T base is the reference value, and the calculation formula is: C is a preset constant, λ i is the i-th layer convolution coefficient, m represents the total number of convolution coding layers, which is the same as the number of layers of the convolution operation when generating the packet-level hierarchical check code; k is a linear superposition coefficient, which is positively correlated with the variance of the network throughput fluctuation range Δ, k = σ 2 ·η, σ is the throughput variance, η is an adjustment factor; Δ is the throughput fluctuation range, calculated by the difference between the maximum and minimum values of the throughput within the sliding window.

[0051] Further, the compensation transmission priority coefficient is generated by an S-shaped function:

[0052]

[0053] where P represents the compensation transmission priority coefficient; W th is a preset stability weight threshold; W is the stability weight of the current transmission path; e is the base of the natural logarithm.

[0054] To achieve the above object, a second aspect of the present invention provides an electronic device, including: at least one memory and at least one processor; the at least one memory is configured to store a readable program; the at least one processor is configured to call the readable program and execute the terminal device communication transmission method based on the single-soldier ad hoc network.

[0055] To achieve the above object, a third aspect of the present invention provides a computer-readable medium, on which a computer instruction is stored, and when the computer instruction is executed by a processor, the processor is caused to execute the terminal device communication transmission method based on the single-soldier ad hoc network.

[0056] (III) Advantageous effects of the present invention:

[0057] Compared with the prior art, a communication transmission method, device, and medium for a terminal device based on a single-soldier ad-hoc network provided by the present invention effectively solve the problems of low redundancy transmission efficiency and inaccurate differential data compensation in a single-soldier ad-hoc network through the refined management of dynamic identification bits and the collaborative mechanism of dual communication modes. Specifically, first, by binding the primary and backup communication modes (the first and second communication modes), the transmission capacities of the two modes are ensured to be the same, avoiding resource waste or insufficient compensation ability caused by capacity differences in traditional redundant paths. Secondly, during the data transmission process, the transmission state differences between the two modes are monitored in real time, and the uncompleted transmitted data packets or delayed paths are dynamically associated with real-time network topology parameters (such as path fingerprints and node hops) using dynamic identification bits, rather than relying on a fixed threshold to trigger compensation, thereby accurately locating the differential data caused by topology changes. Further, through a double-layer verification structure of a shard-level verification code and a packet-level hierarchical verification code (such as the hash mapping of path fingerprints and convolutional coding generation), combined with the frequency-domain feature vectors, packet loss rate gradients, and delay fluctuation values updated in real time in the path quality evaluation matrix, the priority and path selection of compensation transmission are dynamically adjusted. For example, the path reliability is calculated based on the stability weight formula, and the priority coefficient is generated through an S-shaped function, making the selection of the compensation path strongly correlated with the current network load, bit error rate, and topology hops, rather than static rules. In addition, the dynamic identification bits are bound to the path fingerprints and hierarchical verification codes of the data shards, and cross-layer verification is performed after compensation transmission to ensure the dynamic consistency of the data and the path, avoiding secondary transmission errors caused by topology changes in traditional methods. Finally, through the activation, compensation, and clearing mechanisms of the dynamic identification bits, fast closed-loop management of differential data is achieved, reducing redundant overhead while improving reliability and adapting to the highly dynamic environment of a single-soldier ad-hoc network. BRIEF DESCRIPTION OF THE DRAWINGS

[0058] Figure 1 It is a flowchart of a communication transmission method for a terminal device based on a single-soldier ad-hoc network disclosed in this application.

[0059] Figure 2 It is a framework schematic diagram of a communication transmission method for a terminal device based on a single-soldier ad-hoc network disclosed in this application

[0060] Figure 3 It is an update flowchart of a dynamic identification bit disclosed in this application.

[0061] Figure 4 It is a schematic diagram of the construction of a path quality evaluation matrix disclosed in this application.

[0062] Figure 5 It is a flowchart of the generation of a shard-level verification code and a packet-level hierarchical verification code disclosed in this application.

[0063] Figure 6It is a flowchart of dynamic threshold adjustment and compensation transmission priority coefficient generation disclosed in this application. Detailed implementation manners

[0064] To enable those skilled in the art of this technology to better understand the solution of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0065] According to the embodiments of the present invention, it should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions, and although the logical order is shown in the following manufacturing method, in some cases, the steps shown or described can be executed in a different order than here.

[0066] As Figure 1 、 Figure 2 shown, the present invention provides a communication transmission method for a terminal device based on a single-soldier ad hoc network, including the following steps:

[0067] Step S100, in the single-soldier ad hoc network, the terminal device establishes a first communication mode based on the dynamic network topology, and the first communication mode includes an initial routing path and a transmission protocol;

[0068] A single-soldier ad hoc network is a wireless network with a centerless and dynamic topology independently constructed by mobile terminal devices. Its nodes (i.e., terminal devices) can realize multi-hop communication without relying on fixed infrastructure. In the network, each terminal device has the functions of data transceiver, routing forwarding, and topology maintenance, and can dynamically adjust the communication path by sensing the link state in real time through a distributed protocol, and is suitable for highly mobile scenarios such as single-soldier operations and emergency rescue. For example, the terminal device carried by a soldier constructs a network topology table based on the dynamically detected neighbor node information (such as signal strength and node movement speed), and uses an adaptive routing algorithm (such as OLSR, AODV) to quickly respond to topology changes to ensure the continuous availability of the communication link.

[0069] The terminal device is a portable device with a wireless communication module, a processor, and a storage unit, such as a radio or a smart single-soldier communication terminal. In the single-soldier ad hoc network, the terminal device maintains a dynamic topology table by periodically broadcasting detection messages, and based on this, establishes an initial routing path and protocol parameters of the first communication mode (main mode).

[0070] Step S200: Create a second communication mode that is complementary to the first communication mode. The routing strategy or transmission protocol of the second communication mode is different from that of the first communication mode, and the data transmission capacities of the two modes are the same.

[0071] The second communication mode forms a differential complement with the first communication mode in terms of routing strategy or transmission protocol. For example, if the first communication mode uses the Open Shortest Path First (OSPF) routing protocol based on link state, the second communication mode may choose the Ad Hoc On-Demand Distance Vector (AODV) protocol based on load balancing to disperse traffic and adapt to node mobility; or when the first mode uses the TCP protocol to ensure reliable transmission, the second mode switches to the UDP protocol combined with forward error correction coding to reduce retransmission latency. The key is that the differential design of the two modes needs to meet the constraint of consistent transmission capacity, that is, the amount of data that can be carried per unit time is the same, to avoid congestion or resource idleness caused by capacity mismatch during compensatory transmission. Therefore, in the mode creation stage, the physical layer modulation method of the second mode is adjusted through a dynamic bandwidth allocation algorithm (for example, if the first mode uses QPSK modulation, the second mode uses 16-QAM but shortens the symbol period) so that the two maintain equivalent throughput under the same spectrum resources; at the same time, based on the network topology, the forwarding capabilities of each node are calculated in real time, and the second mode is dynamically allocated a cache queue capacity and channel access opportunity equivalent to the first mode to ensure data-bearing balance when the dual modes run in parallel.

[0072] Step S300: Bind the first communication mode and the second communication mode into a redundant communication group, monitor the status differences of data transmission in the two modes in real time, and associate the uncompleted transmission data packets or path delay information with dynamic identification bits.

[0073] The redundant communication group is a complementary transmission unit bound by the first communication mode and the second communication mode. By running two independent routing strategies or transmission protocols in parallel, a redundant backup mechanism is formed to ensure the continuity of data transmission in the event of network fluctuations or path failures.

[0074] The dynamic identification bit is a marking symbol used to track the differential data between the two modes in the redundant communication group in real time. By associating with uncompleted transmission data packets or delayed path information, it accurately locates transmission deviations, provides a target direction for subsequent compensatory transmission, and updates the network status dynamically to ensure that the redundant mechanism efficiently repairs data loss or delay problems, ultimately guaranteeing the integrity and reliability of the overall communication.

[0075] Step S400: Perform compensatory transmission on the differential data associated with the dynamic identification bit through the second communication mode. After the transmission is completed, clear the corresponding dynamic identification bit, and determine whether there are remaining dynamic identification bits in the redundant communication group.

[0076] When the first communication mode encounters incomplete packet transmission or path delay due to dynamic network topology changes, the dynamic identification bit will mark such abnormal states and the corresponding packet or path information in real time; the second communication mode locates the data units that need to be compensated based on the dynamic identification bit, and re-transmits the missing data or optimizes the transmission process through independent routing strategies or transmission protocols (such as alternative paths, error correction coding, or priority scheduling), while updating the status of the dynamic identification bit in real time. After the compensation is completed, the system automatically clears the dynamic identification bits corresponding to the repaired data, and dynamically judges the network recovery status by verifying the existence of the remaining identification bits in the redundant communication group: if there are no remaining identification bits, it indicates that the transmission problems caused by the first communication mode have been completely solved, and the system can safely switch to the high-efficiency transmission stage dominated by the second communication mode, thereby reducing redundant resource occupancy while ensuring data integrity and improving overall communication reliability.

[0077] Step S500, in response to the absence of dynamic identification bits in the redundant communication group, terminate the first communication mode and perform subsequent data transmission based on the second communication mode.

[0078] When step S400 completes the compensation transmission of the data associated with the dynamic identification bit and clears the corresponding identification, the system will detect in real time whether there are remaining dynamic identification bits in the redundant communication group: if the detection result is that there are no remaining identification bits, it indicates that the data loss, delay, etc. problems caused by the first communication mode due to network topology fluctuations or path failures have been completely repaired by the compensation mechanism of the second communication mode, and the second communication mode already has the ability to independently maintain high-efficiency transmission in the current network environment. At this time, the system will actively terminate the operation of the first communication mode, release the network resources it occupies (such as routing paths, bandwidth, or computing load), and perform subsequent data transmission based on the routing strategy and transmission protocol of the second communication mode. This decision not only improves the overall network efficiency by eliminating redundant resource consumption, but also ensures the smooth switching of the transmission mode, avoiding affecting communication continuity due to potential instability factors of the first communication mode. At the same time, this step implies a dynamic adaptive design logic: if the subsequent network environment changes again (such as the second communication mode encounters congestion), the system can reactivate the first communication mode or generate a new redundant group, forming a closed-loop fault tolerance mechanism, and ultimately achieving the communication goal of high reliability, low latency, and intelligent resource scheduling for single-soldier ad-hoc networks in complex battlefield environments.

[0079] As Figure 3 shown, the update steps of the dynamic identification bit include:

[0080] Step S401: When the data packet is fragmented and transmitted, generate a fragment-level check code and a packet-level hierarchical check code for each fragment. The fragment-level check code includes the source node ID, fragment sequence number, and path fingerprint. The packet-level hierarchical check code is generated by convolutional coding of the transmission path quality indicators of all fragments, where the convolutional coefficient is dynamically bound to the current network topology hop count.

[0081] As Figure 5 shown, the generation of the fragment-level check code is divided into two steps: First, the data packet is split into multiple fragments according to a preset rule, and metadata such as the source node ID, destination node ID, and fragment sequence number are embedded in the header of each fragment. Second, based on the source node ID and fragment sequence number, a hash mapping algorithm is used to generate a unique identifier for the fragment, and then this identifier is XORed with the node hop count of the transmission path to generate a fragment-level check code containing the path fingerprint. This process strongly binds the fragment identity to the real-time path state (such as the hop count), so that the check code can not only identify the uniqueness of the fragment but also reflect the dynamic characteristics of the transmission path.

[0082] The generation of the packet-level hierarchical check code is achieved through multi-dimensional path feature fusion: First, the path fingerprints of each fragment are spliced in the time domain, and the frequency domain energy distribution characteristics are extracted through Fourier transform to form a frequency domain feature vector representing the overall path quality difference. Second, a set of convolutional coefficients is dynamically generated according to the current network topology hop count, and its value has an exponential relationship with the reciprocal of the hop count, thereby strengthening the influence weight of the near-hop nodes on the check code. Finally, the frequency domain feature vector and the convolutional coefficients are subjected to hierarchical convolutional coding to generate a packet-level hierarchical check code, and the path fingerprint of each fragment is bound to its orthogonal component to form an adaptive hierarchical check structure. This design enables the packet-level check code to contain both the global path quality statistical characteristics and the correlation of the fragment-level path fingerprints, providing a cross-layer verification benchmark for subsequent dynamic flag activation and compensation transmission.

[0083] Step S402: When the transmission delay of the fragment in the first communication mode exceeds the dynamic threshold, extract the path fingerprint of this fragment and match it with the path fingerprint eigenvalue in the path quality evaluation matrix. The dynamic threshold is adjusted in real time according to the convolutional coefficient of the packet-level hierarchical check code, and the adjustment amplitude is proportional to the network throughput fluctuation range.

[0084] It can be understood that, as Figure 4 and Figure 6 shown, the generation of the dynamic threshold is achieved through multi-dimensional network parameter fusion: Based on the number of convolutional coding layers of the packet-level hierarchical check code, the system calculates the path quality attenuation factor corresponding to the current network topology hop count (this factor forms a reference value T base ) when multiplied by the convolutional coefficient. At the same time, the network throughput fluctuation data is collected through a sliding window, and the difference between the maximum and minimum values of the throughput within the window is calculated as the fluctuation range Δ, and Δ is compared with the throughput variance σ2 The linear superposition coefficient k driven by 2 is σ 2 After multiplying by η and linearly superposing with the reference value, the real-time adjustment threshold is obtained:

[0085] T adjust = T base + k·Δ

[0086] Where, T adjust represents the real-time adjustment value of the dynamic threshold; T base is the reference value, and the calculation formula is: C is a preset constant, λ i is the i-th layer convolution coefficient, m represents the total number of layers of convolutional coding, which is the same as the number of layers of the convolutional operation when generating the packet-level hierarchical check code; k is the linear superposition coefficient, which is positively correlated with the variance of the network throughput fluctuation range Δ, σ is the throughput variance, η is the adjustment factor; Δ is the throughput fluctuation range, which is calculated by the difference between the maximum and minimum throughputs within the sliding window.

[0087] This mechanism enables the dynamic threshold to adapt to the instantaneous fluctuations of the network throughput. When network congestion causes violent fluctuations in the throughput, the threshold automatically expands the tolerance range, and when the throughput is stable, the threshold is tightened to improve the detection sensitivity.

[0088] When the fragmentation transmission delay exceeds the real-time adjustment threshold, the system performs frequency-domain feature matching of the path fingerprint and stability weight calculation. Specifically, after extracting the path fingerprint of the fragmentation, candidate paths with a frequency-domain similarity exceeding the preset threshold are matched in the path quality evaluation matrix, and their packet loss rate gradient G (the first-order difference of the historical packet loss rate sequence) and delay fluctuation value D (the standard deviation of the delay within the sliding window) are calculated. Subsequently, the stability weight formula is used for quantitative evaluation, where the normalization coefficient suppresses the attenuation effect of the multi-hop topology on the weight, and the delay fluctuation coefficient dynamically adjusts the weight ratio of the delay impact according to the hop count H. If the calculation result W is lower than the preset threshold, the system will calculate the weight deviation value (threshold value - W) and input it into the S-shaped function to generate a compensated transmission priority coefficient, which is positively correlated with the deviation value, ensuring that paths with worse stability obtain higher compensation priorities.

[0089] Where, W represents the stability weight of the transmission path; α is the normalization coefficient associated with the network topology hop count, and the calculation formula is: H is the topology hop count of the current path; G is the packet loss rate gradient, which is calculated by the first-order difference of the historical packet loss rate sequence, that is, G = L t - L t-1 ,L t represents the packet loss rate at the t-th moment; β is the delay fluctuation coefficient, which is inversely proportional to the network topology hop count, γ is a preset constant; D is the delay fluctuation value, calculated by the standard deviation of the delay sequence, that is d i is the i-th delay measurement value, is the average delay, n represents the total number of delay measurements, is the number of delay samples collected within the sliding window, and i is the index variable of the delay measurement value.

[0090] Step S403: Based on the packet loss rate gradient and delay fluctuation value of the matching path in the path quality evaluation matrix, calculate the stability weight of the current transmission path through the stability weight formula. If the stability weight value is lower than the preset threshold, activate the dynamic flag bit and generate a compensation transmission priority coefficient, and the priority coefficient is negatively correlated with the weight value;

[0091] In this step, the stability of the current transmission path is quantitatively evaluated to trigger the dynamic compensation mechanism. Specifically, first extract the historical data matching the shard path fingerprint from the path quality evaluation matrix, and obtain the packet loss rate gradient (reflecting the change trend of the packet loss rate per unit time) and delay fluctuation value (reflecting the variance characteristics of the transmission delay) of this path. Based on these two key indicators, use the preset stability weight formula for weighted fusion calculation, where the packet loss rate gradient has a higher weight because it directly affects data integrity; the delay fluctuation reflects the time stability of the path. The calculation result generates the stability weight of the current path, and the higher this value, the more stable and reliable the path is.

[0092] When the stability weight is lower than the preset threshold, the dynamic flag bit will be activated and a compensation transmission priority coefficient P will be generated. This coefficient is dynamically calculated through the S function:

[0093]

[0094] where P represents the compensation transmission priority coefficient; W th is the preset stability weight threshold; W is the stability weight of the current transmission path; e is the base of the natural logarithm.

[0095] Its mathematical properties cause the priority coefficient to have a significant non-linear change near the weight critical value: when the stability weight is close to but slightly lower than the preset threshold, P shows a rapid upward trend, ensuring that the compensation response is triggered when the weight is slightly insufficient; and when the stability weight is far lower than the preset threshold, P approaches 1, giving the highest retransmission priority. This mechanism not only avoids system jitter caused by frequent path switching but also can quickly increase the compensation intensity when the network quality deteriorates. The generated P value will directly affect the path selection strategy in the second communication mode, forming a negative feedback regulation loop.

[0096] Step S404: In the second communication mode, a retransmission path is selected to perform compensation transmission according to the compensation transmission priority coefficient, and the real-time bit error rate and node load rate of the compensation path are injected into the path quality evaluation matrix, and the frequency domain feature vector and topology association parameters of the corresponding path fingerprint are updated;

[0097] After the compensation transmission priority coefficient P is generated in step S403, in the second communication mode (such as redundant transmission mode or multi-path concurrent mode), the system will prioritize the candidate retransmission paths according to the P value. Specifically, the compensation transmission priority coefficient P is positively correlated with the path selection weight: the higher the P value (corresponding to the worse stability of the original path), the system will give priority to alternative paths with lower load and better bit error rate (such as satellite links, cellular network backup links or edge computing node bypasses). When selecting a retransmission path, the system uses a weighted polling algorithm, using the P value as the path weight coefficient and the path inherent quality indicators (such as bandwidth, number of hops) for multi-objective optimization to ensure that high-priority fragments preferentially occupy low-latency, high-reliability physical channels.

[0098] After executing the compensation transmission, the system will conduct in-depth collection and fusion analysis of the real-time performance data of the new path, focusing on extracting the real-time bit error rate (reflecting the degree of signal interference) and node load rate (characterizing the network congestion status) of the compensation path. These data are counted through the sliding time window and injected into the corresponding path fingerprint record of the path quality assessment matrix. The update process uses the frequency domain feature vector reconstruction technology to perform a fast Fourier transform on the delay-packet loss rate sequence associated with the path fingerprint, and extract its frequency domain energy distribution characteristics (such as the main frequency fluctuation amplitude), so as to quantify transient anomalies such as network jitter into storable frequency domain parameters. At the same time, topology-related parameters (such as the channel coupling degree between adjacent nodes and the convergence speed of the routing table) are dynamically corrected through the graph neural network, ultimately achieving real-time synchronization between the network quality assessment model and the physical topology changes.

[0099] Step S405: Perform cross-layer verification on the slices after the compensation transmission. If the path fingerprint of the slice-level verification code matches the orthogonal decoding result of the packet-level layer verification code, clear the dynamic identification bit and release the path fingerprint binding; if the match fails, reactivate the dynamic identification bit based on the updated path quality evaluation matrix and trigger the secondary compensation transmission.

[0100] After the compensation transmission is completed, the compatibility of the slice-level check code and the packet-level check code is verified at the same time: the path fingerprint in the slice-level check code (including the source node ID, slice sequence number and original path characteristics) must maintain orthogonality with the orthogonal decoding result of the packet-level check code (based on the frequency domain projection of the full-slice path convolutional coding) in the time-frequency domain space. Specifically, a method combining multi-order cyclic redundancy check (CRC) and Fourier domain signature comparison is used to verify whether the slice path fingerprint is consistent with the baseband waveform of the packet-level path convolution in the frequency domain energy distribution. If the match is successful, it means that the slice path quality after the compensation transmission has met the overall transmission requirements. The dynamic identification bit will be cleared and the binding relationship between the path fingerprint and the physical link will be released, so that subsequent slices can be freely routed based on the updated path quality evaluation matrix.

[0101] If the match fails, the exception handling mechanism is triggered: based on the path quality evaluation matrix updated in the S404 stage (including the real-time bit error rate of the compensation path, the node load rate and the reconstructed frequency domain feature vector), the stability weight under the current network topology is recalculated. At this time, the dynamic identification bit will be activated for the second time, and the calculation parameters of the compensation transmission priority coefficient P will be adjusted according to the cause of failure (such as frequency domain energy offset or delay phase mismatch). The secondary compensation transmission will give priority to alternative paths whose main frequency fluctuation amplitude in the frequency domain feature vector is less than the threshold and whose topology-related parameters (such as the channel coupling degree between nodes) meet the minimum interference condition, and at the same time improve the fault tolerance by increasing the redundant coding order. This process forms a recursive optimization loop of "verification-compensation-reverification" until the fragment verification passes or the maximum retransmission threshold is reached, thereby ensuring transmission reliability while avoiding excessive consumption of network resources.

[0102] The present invention aims at the problem of low transmission efficiency caused by dynamic topology in a single-soldier ad hoc network, and proposes a dual-mode collaborative transmission method. A redundant communication group is formed by establishing two communication modes (first and second modes) that are complementary to each other, monitoring the transmission difference in real time and using dynamic identification bits to accurately mark unfinished data packets and their path fingerprints; dynamically generating a path quality assessment matrix in combination with the slice-level and packet-level check codes, calculating the compensation priority through the stability weight formula and the S-type function, and guiding the second mode to select the optimal path for differential data retransmission; at the same time, closed-loop management is achieved based on cross-layer checksum and real-time update of path parameters. This method reduces the waste of redundant resources while ensuring reliability by dynamically associating data status with topology changes, and significantly improves the transmission efficiency in a highly dynamic environment.

[0103] Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, and this embodiment will not be described in detail here.

[0104] To verify the effectiveness of the dynamic identification bit management, primary-backup communication mode coordination, and hierarchical verification mechanism proposed in this solution, this experiment conducts a comparative test in the single-soldier ad hoc network simulation environment and sets the following four configurations:

[0105] Traditional redundancy transmission (Baseline): Adopt fixed dual-path redundancy transmission and trigger retransmission based on a fixed threshold.

[0106] Without dynamic identification bit (w / o Dynamic Tag): Retain the primary-backup communication mode, but cancel the dynamic identification bit association and compensation priority mechanism.

[0107] Without hierarchical verification (w / o Hierarchical Check): Cancel the generation and verification of fragment-level and packet-level check codes.

[0108] Complete solution (Proposed): A complete technical solution including dynamic identification bits, primary-backup mode coordination, and hierarchical verification.

[0109] The experimental metrics include transmission success rate (%), average end-to-end delay (ms), redundancy overhead (%), and bit error rate (%). The results are shown in Table 1.

[0110] Configuration Transmission success rate Average latency Redundancy overhead Bit error rate Baseline 82.3％ 156ms 45％ 3.8％ w / o Dynamic Tag 88.1％ 132ms 38％ 2.5％ w / o Hierarchical 85.6％ 144ms 42％ 3.2％ Proposed 95.7％ 98ms 22％ 0.9％

[0111] As can be seen from Table 1, the complete solution (Proposed) is significantly superior to the traditional method in terms of transmission success rate (95.7% vs. Baseline 82.3%) and bit error rate (0.9% vs. 3.8%), verifying the synergistic effect of the dynamic identification bit and the hierarchical verification mechanism. When the dynamic identification bit is cancelled (w / o Dynamic Tag), the redundancy overhead (38%) is still higher than that of the complete solution (22%), indicating that the dynamic priority mechanism can accurately locate the differential data and reduce ineffective retransmissions. In addition, when there is no hierarchical verification (w / o Hierarchical), the bit error rate increases to 3.2%, indicating that the fragment-level path fingerprint and packet-level frequency domain verification can effectively suppress transmission errors caused by topological changes.

[0112] This experiment verifies the improvement of the dynamic identification bit management, primary-backup mode coordination, and hierarchical verification mechanism on the transmission performance of single-soldier ad hoc networks through comparison. While ensuring high reliability, the complete solution reduces the redundancy overhead to 22% and shortens the average delay to 98 ms, meeting the real-time communication requirements in high-dynamic battlefield environments.

[0113] According to another aspect of the embodiments of the present application, an electronic device is further provided, including a processor and a memory. When the processor executes the computer program stored in the memory, the steps of the method are implemented.

[0114] In the above embodiments of the present invention, the descriptions of the respective embodiments each have their own emphasis. For the parts not detailed in a certain embodiment, reference may be made to the relevant descriptions of other embodiments.

[0115] In several embodiments provided in the present application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are merely illustrative. For example, the division of the units can be a logical function division. In actual implementation, there can be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed couplings or direct couplings or communication connections to each other can be through some interfaces. The indirect couplings or communication connections of units or modules can be in electrical or other forms.

[0116] In addition, in each embodiment of the present invention, the functional units can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

[0117] If the above-mentioned integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in each embodiment of the present invention. And the foregoing storage medium includes: various media such as USB flash drives, read-only memories (ROMs), random access memories (RAMs), mobile hard disks, magnetic disks, or optical discs that can store program codes.

[0118] The above are only the preferred embodiments of the present invention. It should be noted that for those of ordinary skill in the art, without departing from the principle of the present invention, several improvements and refinements can be made, and these improvements and refinements should also be regarded as the protection scope of the present invention.

Claims

1. A communication transmission method for a terminal device based on a single-soldier ad-hoc network, characterized in that, The following steps are involved: In the single-soldier ad hoc network, the terminal device establishes a first communication mode based on a dynamic network topology, wherein the first communication mode includes an initial routing path and a transmission protocol; Creating a second communication mode complementary to the first communication mode, wherein the routing strategy or transmission protocol of the second communication mode is different from that of the first communication mode, and the data transmission capacity of the two modes is consistent; Binding the first communication mode and the second communication mode into a redundant communication group, monitoring the difference in data transmission status between the two modes in real time, and associating the data packets or path delay information of the uncompleted transmission with the dynamic identification bit; Compensating and transmitting the difference data associated with the dynamic identification bit through the second communication mode, clearing the corresponding dynamic identification bit after the transmission is completed, and determining whether there are any remaining dynamic identification bits in the redundant communication group; In response to the absence of a dynamic identification bit in the redundant communication group, the first communication mode is terminated, and subsequent data transmission is performed based on the second communication mode.

2. The communication transmission method of the terminal device based on the single-soldier ad-hoc network according to claim 1, wherein, The dynamic flag is updated in the following way: When the data packet is transmitted in fragments, a fragment-level check code and a packet-level hierarchical check code are generated for each fragment. The fragment-level check code includes the source node ID, fragment sequence number and path fingerprint. The packet-level hierarchical check code is generated by convolution coding the transmission path quality indicators of all fragments, where the convolution coefficient is dynamically bound to the current network topology hop count; When the transmission delay of the slice in the first communication mode exceeds the dynamic threshold, the path fingerprint of the slice is extracted and matched with the path fingerprint feature value in the path quality evaluation matrix, and the dynamic threshold is adjusted in real time according to the convolution coefficient of the packet level layer check code, and the adjustment range is proportional to the fluctuation range of the network throughput; Based on the packet loss rate gradient and delay fluctuation value of the matching path in the path quality assessment matrix, the stability weight of the current transmission path is calculated by the stability weight formula. If the stability weight value is lower than the preset threshold value, the dynamic identification bit is activated and a compensation transmission priority coefficient is generated. The priority coefficient is negatively correlated with the weight value. In the second communication mode, a retransmission path is selected to perform compensation transmission according to the compensation transmission priority coefficient, and the real-time bit error rate and node load rate of the compensation path are injected into the path quality evaluation matrix, and the frequency domain feature vector and topology association parameters of the corresponding path fingerprint are updated; Perform cross-layer verification on the slices after compensation transmission. If the path fingerprint of the slice-level verification code matches the orthogonal decoding result of the packet-level layer verification code, clear the dynamic flag and release the path fingerprint binding; If the match fails, the dynamic flag is reactivated based on the updated path quality evaluation matrix and a secondary compensation transmission is triggered.

3. The communication transmission method of the terminal device based on the single-soldier ad-hoc network according to claim 2, characterized in that, The path quality evaluation matrix is constructed in the following way: Collecting a set of time-varying parameters of each transmission path in real time, wherein the set of time-varying parameters includes instantaneous throughput, bit error rate distribution, and topology hop count difference; For the adjacent nodes of the transmission path, the time domain sequence of the channel state information is intercepted, the frequency domain features are extracted by sliding window Fourier transform, and the frequency domain feature vector of the path fingerprint corresponding to each path is generated; Perform tensor fusion on the set of time-varying parameters and the frequency-domain feature vector, and calculate the stability weight factors of each transmission path through a multi-layer perceptron model. The stability weight factors include quantization indexes of packet loss rate gradient and delay fluctuation value; Perform correlation mapping on the path fingerprints, stability weight factors and real-time topology states of each transmission path, and construct a path quality evaluation matrix including path fingerprint eigenvalue, weight factor matrix and hop count association table.

4. The communication transmission method of the terminal device based on the single-soldier ad-hoc network according to claim 2, characterized in that, The shard-level check code and packet-level hierarchical check code are generated in the following manner: Divide the data packet into multiple data shards according to a preset sharding rule, and attach shard header information to each data shard. The shard header information includes source node ID, destination node ID and shard sequence number; Based on the source node ID and shard sequence number in the shard header information, generate a shard unique identifier using a hash mapping algorithm, and perform an exclusive OR operation on the shard unique identifier and the node hop count of the current transmission path to generate the path fingerprint of the shard-level check code. Perform time-domain splicing on the path fingerprints of all shard-level check codes, extract the frequency-domain energy distribution characteristics of each path fingerprint, and generate the frequency-domain feature vector of the path fingerprint sequence. Dynamically generate a set of convolution coefficients according to the current network topology hop count. The convolution coefficient has an exponential relationship with the reciprocal of the topology hop count, and when the hop count increases by 1, the convolution coefficient decay factor increases by a preset ratio; Perform layer-by-layer convolutional coding on the frequency-domain feature vector and the set of convolution coefficients to generate a packet-level hierarchical check code, and bind the path fingerprint of each shard to the orthogonal component of the packet-level hierarchical check code to form a hierarchical check structure.

5. The communication transmission method of the terminal device based on the single-soldier ad hoc network according to claim 2, wherein, The dynamic threshold adjustment and compensation transmission priority coefficient generation are performed through the following steps: According to the number of convolutional coding layers of the packet-level hierarchical check code, calculate the path quality decay factor of the current network topology hop count. The product of the decay factor and the convolution coefficient constitutes the reference value of the dynamic threshold; Real-time collect network throughput fluctuation data, calculate the throughput fluctuation range through a moving average algorithm, and linearly superimpose the fluctuation range and the reference value to generate the real-time adjustment value of the dynamic threshold; When the shard transmission delay exceeds the real-time adjustment value, extract the path fingerprint of the shard, and match the frequency-domain similarity of the path fingerprint eigenvalue in the path quality evaluation matrix; If the frequency-domain similarity exceeds the matching threshold, extract the packet loss rate gradient and delay fluctuation value of the matching path. The packet loss rate gradient is calculated by the first-order difference of the historical packet loss rate sequence, and the delay fluctuation value is quantified by the standard deviation of the delay sequence; Calculate the stability weight of the transmission path using the stability weight formula; If the stability weight is lower than the preset threshold value, input the deviation value between the weight value and the dynamic threshold into an S-shaped function to generate a compensation transmission priority coefficient, and the priority coefficient is positively correlated with the deviation value.

6. The communication transmission method of the terminal device based on the single-soldier ad hoc network according to claim 5, wherein, The stability weight formula is: Among them, W represents the stability weight of the transmission path; α is a normalization coefficient associated with the network topology hop count, and its calculation formula is: H is the topology hop count of the current path; G is the packet loss rate gradient, which is calculated by the first-order difference of the historical packet loss rate sequence, that is, G = L t -L t-1 , L t represents the packet loss rate at the t-th moment; β is the delay fluctuation coefficient, which is inversely proportional to the network topology hop count. γ is a preset constant; D is the delay fluctuation value, which is calculated by the standard deviation of the delay sequence, that is d i is the i-th delay measurement value. is the average delay, n represents the total number of delay measurements, which is the number of delay samples collected within the sliding window, and i is the index variable of the delay measurement value.

7. The communication transmission method of the terminal device based on the single soldier ad hoc network according to claim 5, characterized in that, The real-time adjustment value of the dynamic threshold is calculated by the following formula: T adjust = T base + k·Δ Among them, T adjust represents the real-time adjustment value of the dynamic threshold; T base is the reference value, and the calculation formula is: C is a preset constant, λ i is the convolution coefficient of the i-th layer, m represents the total number of layers of convolutional coding, which is consistent with the number of layers of the convolutional operation when generating the packet-level hierarchical check code; k is the linear superposition coefficient, which is positively correlated with the variance of the network throughput fluctuation range Δ, and k = σ 2 ·η, σ is the throughput variance, η is the adjustment factor; Δ is the throughput fluctuation range, which is calculated by the difference between the maximum and minimum values of the throughput within the sliding window.

8. The communication transmission method of the terminal device based on the single-soldier ad-hoc network according to claim 5, characterized in that, The compensation transmission priority coefficient is generated by an S-shaped function: Among them, P represents the compensation transmission priority coefficient; W th is a preset stability weight threshold; W is the stability weight of the current transmission path; e is the base of the natural logarithm.

9. An electronic device, characterized in that, Including: At least one memory and at least one processor; The at least one memory is configured to store a readable program; the at least one processor is configured to call the readable program to execute the communication transmission method of the terminal device based on the single soldier ad hoc network according to any one of claims 1 to 8.

10. A computer-readable medium, characterized in that, A computer instruction is stored on the computer-readable medium, and when the computer instruction is executed by a processor, the processor is caused to execute the communication transmission method of the terminal device based on the single soldier ad hoc network according to any one of claims 1 to 8.

Images