# Research on Multi-Strategy Routing Protocol in Flying Ad Hoc Networks
## 4 Forwarding Strategy Design
### Reactive Mechanism Design Based on Joint Measurement Optimization
The 3 DRNG neighbor node of the minimum local node constructs the projection plane according to its position, the position of the destination node, and the local minimum position recorded in the packet header and encapsulates the information of the projection plane into the projection plane information of the projection face parameter field of the packet header. 6. The 3 DRNG neighbor node of the minimum local node sets the last-hop node's IP in the projection face parameter field as the IP of this node. 7. The 3 DRNG neighbor node of the minimum local node determines the initial forwarding rule according to sub-rule 1 of the DAF rule. It saves it to the forwarding rule in the projection face parameter field of the packet header. 8. The local minimum node's 3 DRNG neighbor node projects its 3 DRNG neighbor node vertically onto the projection plane. 9. The local minimum node's 3 DRNG neighbor node selects the next-hop node according to the forwarding rules used and forwards the packets. ```
**Algorithm 5**The projection face of the RGF protocol forwards packets
```
1. The intermediate node checks whether it is the packet's destination node. If it is, it receives the packet. Otherwise, it continues. 2. The intermediate node checks and updates the destination node information in the packet header or its routing table. 3. The intermediate node calculates the current positions of all its hop neighbor nodes and the previous hop nodes according to the relevant information in the node information table. It calculates the current positions of the destination nodes according to the destination node information in the packet header. 4. If the intermediate node judges whether it can switch to greedy forwarding or reactive mechanism forwarding, it will modify the forwarding policy field in the packet header to switch to the corresponding forwarding policy. Otherwise, it will continue to follow the steps below. 5. The middle node constructs a 3 DRNG graph to determine its 3 DRNG neighbor nodes. 6. The intermediate node saves its IP to the previous node's IP in the projection face parameter field of the packet header. 7. The middle node reads the projection plane information from the projection face parameter field of the packet header. It then vertically projects this node, the 3 DRNG neighbor node, the previous hop node, and the destination node onto the projection plane. 8. The intermediate node judges whether the connection between itself and the previous hop node crosses the connection between the local minimum value position and the destination node on the projection plane. If yes, it switches the forwarding rules according to sub-rule 2 of the DAF rule and saves the switched forwarding rules to the forwarding rules in the projection face parameter field of the packet header. Otherwise, it will continue to perform the original transfer rules. 9. The intermediate node selects the next-hop node according to the forwarding rules and forwards the packets. 10. The above steps are repeated until the packet is delivered to the destination node.