## 3 Implementation Strategy of Dynamic Routing Protocol for Awareness Combat Networks
### Node Status Routing  
#### 3.1.1 The \"Flat\" State of the Awareness Combat Network Routing  
(1) Construction of AODV-DTN protocol and its algorithm  
When there is no real-time information to be transmitted, the awareness combat network maintains connectivity as much as possible, shares the situation information between nodes (periodically transmits information such as the location and working state to adjacent nodes), and uses a small transmission power. The running state of the network at this time is referred to as the \"flat\" state; the state of the awareness combat network when transmitting real-time information is called the \"peak\" state. The operational environment of the awareness combat network determines that its \"flat\" state is consistent with the DTN network model, and the network protocol can still work without crashing under the condition of frequent connection and disconnection between moving nodes [11]. The core idea of the \"flat\" state routing algorithm is to adopt the method of storing firstly and then looking for an opportunity to forward data packets, overcoming the limitations of traditional routing methods due to limited node caching and the absence of continuously available end-to-end routing, thus realizing the maximum possible transmission of information. The \"flat\" state of the awareness combat network is the basis of the \"peak\" state. It enables each node in the network to obtain time-varying information of neighboring nodes and provides information support for the efficient selection of \"peak\" state nodes. The \"flat\" state routing algorithm, which is based on the AODV protocol, implements the DTN overlay, the DTN message mechanism, the DTN route discovery mechanism, and the store-and-forward mechanism, i.e., the AODV-DTN protocol. The algorithm is as follows:  
1. Adding a DTN overlay immediately to the AODV network layer. 2. Adding new control messages and response messages to implement the DTN message mechanism. 3. Implementing the disruption tolerant function in the DTN overlay. When the link is disconnected, no connection repair is required and data packets continue to be transmitted. 4. When the routing link selected by AODV is about to break, try to find out a route that can replace the broken route. If there is no available route, the delay is tolerated and it waits for another opportunity; once there is an \"opportunity link\" available, the data packet will continue to be transmitted. An \"opportunity link\" is a link that is currently temporarily unavailable but may become available as the nodes move or channel interference factors disappear. 5. After the routing link is interrupted, the node stores the data packet, namely, the packet is encapsulated into a DTN packet and stored in the storage area of the DTN overlay instead of sending a large number of route control broadcast messages. The DTN packet format is shown in Figure 3.  
The DTN packet is passed in the DTN overlay, as shown in Figure 4, from the previous-hop DTN storage area to the next-hop DTN storage area. When the previous-hop node sends a DTN packet, if no response is received from the next-hop node within a certain time range, the previous-hop node sends the DTN packet again from its own DTN storage area. If a response is received from the next-hop node within a certain time range, the previous-hop node deletes the DTN packet from its own DTN storage area. After the link interruption area is skipped, the DTN packet removes the control message restored to the original data packet and will then be passed on to the destination node. 2. The AODV-DTN flood routing discovers, which uses geo-location information  
Each node of the awareness combat network has a high-precision positioning function and the function of real-time perception of its own state. The routing protocol of the awareness combat network should make full use of these capabilities [12]. The awareness combat network mainly transmits the target aiming information, and the position information of each node is indispensable.