A Heuristic Approach for Prevention Vampire Attack in Flying Ad hoc Networks (HAPV)

Abstract

Unnamed Aerial Vehicles (UAVs) can freely move in the limited area to capture the desired information and also forward that information to other UAVs or base stations in Flying Ad hoc Networks (FANETs). UAVs come in various heavy models, each designed to meet specific requirements. A single UAV is sufficient for the survey of a particular area, but multiple UAVs are required for the better handling of large amounts of data and data sharing. Routing plays an important role in establishing the connection and data forwarding between the sender and receiver. FANET networks are highly dynamic and UAVs have sufficient storage capacity. The role of the vampire attacker is to consume the UAV's capabilities, energy resources, and memory, which degrades the network's performance. This research presents a heuristic solution for the prevention of vampire attacks (HAPV), functioning as a distributed, energy-efficient security mechanism integrated into the routing process of flying ad hoc networks (FANET). The system constantly checks how UAVs are acting based on local observations and uses conditional heuristics to find and stop vampire attack activities without affecting routing protocol constraints. In the proposed HAPV mechanism calculate energy utilization, hop-count which uses to detect behaviour of attacker node. During the initialization phase, each UAV gives all of its neighbouring UAVs the highest trust rating, believing that they would behave well and that there is no blacklist. In the next step, focus on energy consumption, the requirements for route establishment, and the needs for connection establishment and data forwarding. The performance of the novel HAPV approach is compared with the vampire attacker, TAODV, and SAODV across various UAV density scenarios. Reliable communication reduces delay and overhead in the network and improves the PDR and throughput performance of HAPV.