With the rapid development of wireless communication and edge computing, UAV-assisted networking technology has great significance in many application scenarios such as traffic forecasting, emergency rescue, military reconnaissance. However, due to dynamic topology changes of Flying Ad-hoc Networks (FANET), frequent identity authentication is easy to cause the instability of communications between UAV nodes, which makes FANET face serious identity security threats. Therefore, it is an inevitable trend to build a secure and reliable FANET. In this paper, we propose a lightweight mutual identity authentication scheme based on adaptive trust strategy for Flying Ad-hoc Networks (ATS-LIA), which selects the UAV with the highest trust value from the UAV swarm to authenticate with the ground control station (GCS). While ensuring the communication security, we reduce the energy consumption of UAV to the greatest extent, and reduce the frequent identity authentication between UAV and GCS. Through the security game verification under the random oracle model, it is proved that the proposed method can effectively resist some attacks, effectively reduce the computational overhead, and ensure the communication security of FANET. The results show that compared with the existing schemes, the proposed ATS-LIA scheme has lower computational overhead.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9135610 | PMC |
http://dx.doi.org/10.1007/s12083-022-01330-7 | DOI Listing |
Entropy (Basel)
December 2024
College of Information Engineering, Shanghai Maritime University, Shanghai 201306, China.
Natural disasters can severely disrupt conventional communication systems, hampering relief efforts. High-altitude tethered balloon base stations (HATBBSs) are a promising solution to communication disruptions, providing wide communication coverage in disaster-stricken areas. However, a single HATBBS is insufficient for large disaster zones, and limited resources may restrict the number and energy capacity of available base stations.
View Article and Find Full Text PDFSensors (Basel)
December 2024
Department of Computer Hardware, Department of Computer Engineering, Faculty of Technology, Marmara University, 34840 Maltepe, İstanbul, Turkey.
Unmanned Aerial Vehicles (UAVs) have become essential tools across various sectors due to their versatility and advanced capabilities in autonomy, perception, and networking. Despite over a decade of experimental efforts in multi-UAV systems, substantial theoretical challenges concerning coordination mechanisms still need to be solved, particularly in maintaining network connectivity and optimizing routing. Current research has revealed the absence of an efficient algorithm tailored for the routing problem of multiple UAVs connected to a central station, especially under the constraints of maintaining constant network connectivity and minimizing the average goal revisit time.
View Article and Find Full Text PDFSensors (Basel)
September 2024
Department of Computer Science and Engineering, University of Liberal Arts Bangladesh (ULAB), Dhaka 1207, Bangladesh.
Sci Rep
October 2024
Computers and Systems Dept, Electronics Research Institute, Elbahth Elelmy St. From Joseph Tito, El-Nozha El-Gedeeda, P.O.: 11843, Cairo, Egypt.
The Flying Ad-hoc Network (FANET) can be defined as the Ad-hoc network that connects unmanned aerial vehicles flying in the space with each other and with a ground base station. However, the 3D movement of these drones with higher speeds results in a network of highly dynamic topology and intermittent connections, making the standard Ad Hoc routing protocols are not suitable for FANET. The approaches followed to address this issue include designing from scratch a routing protocol specific to FANET or modifying the existing protocols.
View Article and Find Full Text PDFSensors (Basel)
August 2024
Institute of Computer Application Technology, Norinco Group, Beijing 100089, China.
Neighbor discovery and tracking with directional antennas in flying ad hoc networks (FANETs) is a challenging issue because of dispersed node distribution and irregular maneuvers in three-dimensional (3D) space. In this paper, we propose an adaptive 3D neighbor discovery and tracking algorithm in battlefield FANETs with directional antennas. With time synchronization, a flying node transmits/receives the neighbor discovery packets sequentially in each beam around it to execute a two-way handshake for neighbor discovery.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!