## 3 Implementation Strategy of Dynamic Routing Protocol for Awareness Combat Networks
### Node Status Routing
#### 3.1.2 \"Peak\" State of the Awareness Combat Network
To obtain the accurate instant speed \(v_{0}\) and accelerated speed \(a\) of the target, the reconnaissance vehicle has higher requirements on the aiming method and accuracy of the target. Set the target irradiation interval time \(t\), record the target position \(p_{2}\) obtained by the two irradiations, the target position \(p_{1}\) obtained by the previous irradiation, and the target position \(p_{0}\) obtained by the current irradiation, then:  
\[v_{0}=\frac{p_{0}-p_{1}}{t} \tag{4}\]  
\[a=\frac{v_{0}-\frac{p_{1}-p_{2}}{t}}{t} \tag{5}\]  
During the time when the route is interrupted, the attack vehicle assumes that the target uniformly accelerates and estimates the real-time moving distance \(S\) between the attack vehicle and the target position considering the last time it received the information. In this calculation, \(t\) is the duration of the route interruption. \[S=v_{0}t+\frac{1}{2}at^{2} \tag{6}\]  
When the route is restored, the target location is relocated with the newly received information. Similarly, when the intermediate node N of the routing forwards data packets, it also adds its own instant speed \(v_{0n}\) and accelerated speed \(a_{n}\) fields. During the route interruption, assuming that the next-hop node (N + 1) accelerates uniformly, the location of the next-hop node (N + 1) is estimated, and then the azimuth and distance between nodes N and (N + 1) are calculated according to the motion of node N. If the azimuth exceeds the broadcast range of node N, the distance exceeds the communication range of node N, or the route interruption time exceeds the maximum allowable time \(T_{\text{c}}\), then node N stops forwarding packets to node (N + 1) and re-looks for the next-hop forwarding node. Through such prediction, the node establishes a local space-time routing table. The node state routing algorithm for awareness combat networks is a distributed self-stabilization algorithm that implements rule constraints and information interactions among nodes. It adapts the topological change of each node in the network, maintains routing stability, and reduces routing overhead. The source node that transmits the target aiming information also needs to intelligently select the destination node; it broadcasts messages based on the link layer and carries out one flooding event across the whole network, and the convergence speed is fast. The source node broadcasts a message QD (to look for the destination node); the neighboring node receives the message and inquires its own status across the layers. For the mobile terminal in the \"standby\" state, if their confidence is within the range of 11 to 19, the message RB (confidence confirmation; the message contains the position coordinates of the node) is returned; in each RB, the source node will select the closet node as the destination node, and if the distance is equal, it will select the node with higher confidence as the destination node. If the source node does not receive any RB message, it switches to mobile cellular routing.