In wireless networking, the security of flying ad hoc networks (FANETs) is a major issue, and the use of drones is growing every day. A distributed network is created by a drone network in which nodes can enter and exit the network at any time. Because malicious nodes generate bogus identifiers, FANET is unstable. In this research study, we proposed a threat detection method for detecting malicious nodes in the network. The proposed method is found to be most effective compared to other methods. Malicious nodes fill the network with false information, thereby reducing network performance. The secure ad hoc on-demand distance vector (AODV) that has been suggested algorithm is used for detecting and isolating a malicious node in FANET. In addition, because temporary flying nodes are vulnerable to attacks, trust models based on direct or indirect reliability similar to trusted neighbors have been incorporated to overcome the vulnerability of malicious/selfish harassment. A node belonging to the malicious node class is disconnected from the network and is not used to forward or forward another message. The FANET security performance is measured by throughput, packet loss and routing overhead with the conventional algorithms of AODV (TAODV) and reliable AODV secure AODV power consumption decreased by 16.5%, efficiency increased by 7.4%, and packet delivery rate decreased by 9.1% when compared to the second ranking method. Reduced packet losses and routing expenses by 9.4%. In general, the results demonstrate that, in terms of energy consumption, throughput, delivered packet rate, the number of lost packets, and routing overhead, the proposed secure AODV algorithm performs better than the most recent, cutting-edge algorithms.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC10991512PMC
http://dx.doi.org/10.1038/s41598-024-57480-6DOI Listing

Publication Analysis

Top Keywords

malicious node
12
malicious nodes
12
aodv algorithm
8
routing overhead
8
secure aodv
8
network
7
aodv
6
nodes
5
malicious
5
secure
4

Similar Publications

Enhanced Localization in Wireless Sensor Networks Using a Bat-Optimized Malicious Anchor Node Prediction Algorithm.

Sensors (Basel)

December 2024

Power Electronics, Machines and Control (PEMC) Research Institute, University of Nottingham, 15 Triumph Rd, Lenton, Nottingham NG7 2GT, UK.

The accuracy of node localization plays a crucial role in the performance and reliability of wireless sensor networks (WSNs), which are widely utilized in fields like security systems and environmental monitoring. The integrity of these networks is often threatened by the presence of malicious nodes that can disrupt the localization process, leading to erroneous positioning and degraded network functionality. To address this challenge, we propose the security-aware localization using bat-optimized malicious anchor prediction (BO-MAP) algorithm.

View Article and Find Full Text PDF

Spectral adversarial attack on graph via node injection.

Neural Netw

January 2025

School of Big Data and Computer Science, Guizhou Normal University, Guiyang 550025, China.

Graph Neural Networks (GNNs) have shown remarkable achievements and have been extensively applied in various downstream tasks, such as node classification and community detection. However, recent studies have demonstrated that GNNs are vulnerable to subtle adversarial perturbations on graphs, including node injection attacks, which negatively affect downstream tasks. Existing node injection attacks have mainly focused on the limited local nodes, neglecting the analysis of the whole graph which restricts the attack's ability.

View Article and Find Full Text PDF

An improved practical Byzantine fault tolerance algorithm for aggregating node preferences.

Sci Rep

December 2024

School of Information Engineering, Yangzhou University, Yangzhou, Jiangsu, China.

Consensus algorithms play a critical role in maintaining the consistency of blockchain data, directly affecting the system's security and stability, and are used to determine the binary consensus of whether proposals are correct. With the development of blockchain-related technologies, social choice issues such as Bitcoin scaling and main chain forks, as well as the proliferation of decentralized autonomous organization (DAO) applications based on blockchain technology, require consensus algorithms to reach consensus on a specific proposal among multiple proposals based on node preferences, thereby addressing the multi-value consensus problem. However, existing consensus algorithms, including Practical Byzantine Fault Tolerance (PBFT), do not support nodes expressing preferences.

View Article and Find Full Text PDF

Routing Protocol for Underwater Wireless Sensor Networks Based on a Trust Model and Void-Avoided Algorithm.

Sensors (Basel)

November 2024

Key Laboratory of Internet Information Retrieval of Hainan Province, School of Cyberspace Security, Hainan University, 58 Renmin Avenue, Haikou 570228, China.

Underwater wireless sensor networks have a wide range of application prospects in important fields such as ocean exploration and underwater environment monitoring. However, the influence of complex underwater environments makes underwater wireless sensor networks subject to many limitations, such as resource limitation, channel openness, malicious attacks, and other problems. To address the above issues, we propose a routing scheme for underwater wireless networks based on a trust model and Void-Avoided algorithm.

View Article and Find Full Text PDF

The Underwater Sensor Network (UWSN) comprises sensor nodes with sensing, data processing, and communication capabilities. Due to the limitation of underwater radio wave propagation, nodes rely on acoustic signals to communicate. The data gathered by these nodes is transmitted to coordinating nodes or ground stations for additional processing and analysis.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!