An Adaptive-based Predicted Nodes Behavior Algorithm in Flying Ad Hoc Networks

This paper discusses implementing unmanned aerial vehicles (UAVs) for various military & civil parts with the creation of flying ad-hoc networks (FANETs), as recent applications include remote aerial nodes. Communication among UAVs in FANETs must be flexible, dependable, and delay-bounded so that network can continue to provide the needed level of service while also accommodating the ever-increasing number of UAVs. Data routing between UAVs in a FANET is much more complex than in a MANET due to the more significant mobility requirements of the former. Modifications to the network’s topology need real-time adjustments to the routing tables. FANET provides a reliable connection between UAVs by ignoring metric computations of most current routing algorithms. Due to the extreme mobility of nodes in FANET, route reliability is also a significant issue. Based on these findings, this study presents PF-WGTR, a novel routing method. A consistent routine route is determined using a weighted algorithm that predicts the future values of specific parameters at each node in a FANH F. The suggested routing method uses each node’s predicted future value to determine the node’s weight within the network. This enables the communication nodes to set up a dedicated and stable route over a lengthy period. This dynamic routing system optimizes energy usage by looking ahead and making predictions. It reduces the amount of data lost in transit while maintaining the same or greater throughput than current routing protocols. The proposed protocol PF-WGTR could achieve laetter results than others hised on the valuation of simulation results.