Search Results (99)

This study presents a semi-random mobility model called Semi-Random Elliptical Movement (SREM), developed for relay-oriented Flying Ad Hoc Networks (FANETs). In FANETs, node distribution has a major impact on network performance, making the mobility model a critical design element. While random models offer simplicity and path diversity, they often result in unstable relay paths due to inconsistent node placement. In contrast, planned path models provide alignment but lack the flexibility needed in dynamic environments. SREM addresses these challenges by enabling nodes to move along elliptical trajectories, combining autonomous movement with alignment to the relay path. This approach encourages natural node concentration along the relay path while maintaining distributed mobility. The spatial characteristics of SREM have been analytically defined and validated through the Monte Carlo method, confirming stable node distributions that support effective relaying. Computer simulation results show that SREM performs better than general mobility models that do not account for relaying, offering more suitable performance in relay-focused scenarios. These findings suggest that SREM provides both structural consistency and practical effectiveness, making it a strong candidate for improving the realism and reliability of FANET simulations involving relay-based communication. Full article

Routing in flying ad hoc networks (FANETs) is hindered by high mobility, trajectory-induced topology dynamics, and energy constraints. Conventional topology-based or position-based protocols often fail due to stale link information and limited neighbor awareness. This paper proposes a trajectory-informed routing protocol enhanced by Q-learning: Traj-Q-GPSR, tailored for mission-oriented UAV swarm networks. By leveraging mission-planned flight trajectories, the protocol builds time-aware two-hop neighbor tables, enabling routing decisions based on both current connectivity and predicted link availability. This spatiotemporal information is integrated into a reinforcement learning framework that dynamically optimizes next-hop selection based on link stability, queue length, and node mobility patterns. To further enhance adaptability, the learning parameters are adjusted in real time according to network dynamics. Additionally, a delay-aware queuing model is introduced to forecast optimal transmission timing, thereby reducing buffering overhead and mitigating redundant retransmissions. Extensive ns-3 simulations across diverse mobility, density, and CBR connections demonstrate that the proposed protocol consistently outperforms GPSR, achieving up to 23% lower packet loss, over 80% reduction in average end-to-end delay, and improvements of up to 37% and 52% in throughput and routing efficiency, respectively. Full article

This paper contributes a two-step approach to monitor clusters of thermal targets on the ground using unmanned aerial vehicles (UAVs) and Gaussian mixture models (GMMs) in a distributed manner. The approach is tailored to networks of UAVs that establish a flying ad hoc network (FANET) and operate without central command. The first step is a monitoring algorithm that determines if the GMM corresponds to the current spatial distribution of clusters of thermal targets on the ground. UAVs make this determination using local data and a sequence of data exchanges with UAVs that are one-hop neighbors in the FANET. The second step is the calculation of a new GMM when the current GMM is found to be unfit, i.e., the GMM no longer corresponds to the new distribution of clusters on the ground due to the movement of thermal targets. A distributed expectation-maximization algorithm is developed for this purpose, and it operates on local data and data exchanged with one-hop neighbors only. Simulation results evaluate the performance of both algorithms in terms of the number of communication exchanges. This evaluation is completed for an increasing number of clusters of thermal targets and an increasing number of UAVs. The performance is compared with well-known solutions to the monitoring and GMM calculation problems, demonstrating convergence with a lower number of communication exchanges. Full article

The Flying Ad-Hoc Network (FANET) is an important component of the 6G communication system. In order to achieve the precise positioning of unmanned aerial vehicle (UAV) nodes in a FANET when satellite navigation signals are unavailable, simple and accurate direction-of-arrival (DOA) estimation methods are required. In this paper, we propose an improved correlative interferometer method to estimate the DOAs of the UAVs in a FANET. This method adopts a uniform funnel array (UFA) configuration, which consists of a uniform circular array (UCA) and an additional element located above the center. This configuration improves the estimation accuracy for DOAs with large polar angles because it utilizes the degree of freedom in the vertical aperture. In addition, the Fibonacci sampling strategy is employed to overcome the polar clustering phenomenon exhibited by latitude–longitude sampling. Furthermore, in the interferometer, only partial phase differences are used to reduce the storage burden. When calculating the similarity function, we adopt the triangular function instead of the cosine function to improve computational efficiency. The simulation results show that the proposed UFA improves the DOA estimation accuracy by $65.56\%$ over the planar UCA for signals with large polar angles. Moreover, Fibonacci sampling improves the DOA estimation accuracy by $11.54\%$ as compared to the latitude–longitude sampling. Full article

Flying ad hoc networks (FANETs) have highly dynamic and energy-limited characteristics. Compared with traditional mobile ad hoc networks, their nodes move faster and their topology changes more frequently. Therefore, the design of routing protocols faces greater challenges. The existing routing schemes rely on frequent and fixed-interval Hello transmissions, which exacerbates network load and leads to high communication energy consumption and outdated location information. MP-QGRD combined with the extended Kalman filter (EKF) is used for node position prediction, and the Hello packet transmission interval is dynamically adjusted to optimize neighbor discovery. At the same time, reinforcement learning methods are used to comprehensively consider link stability, energy consumption, and communication distance for routing decisions. The simulation results show that compared to QMR, QGeo, and GPSR, MP-QGRD has an increased packet delivery rate, end-to-end latency, and communication energy consumption by 10%, 30%, and 15%, respectively. Full article

Recently, with the advantages of easy deployment, flexibility, diverse functions, and low cost, flying ad hoc network (FANET) has captured great attention for its huge potential in military and civilian applications, whereas the high-speed movement and limited node energy of unmanned aerial vehicles (UAVs) leads to high dynamic topology and high packet loss rate in FANET. Thus, we introduce the software-defined networking (SDN) architecture into FANET and investigate routing scheme in an SDN-FANET to harvest the advantages of SDN centralized control. Firstly, a FANET segmented routing scheme based on the hybrid SDN architecture is proposed, where inter-segment conducts energy-balanced routing and intra-segment adopts three-dimensional (3D) greedy perimeter stateless routing (GPSR). Specifically, we design the specific process of message interaction between SDN controller and UAV nodes to ensure the execution of the inter-segment routing based on energy balance. Further, to reduce the packet loss rate in high-speed motion scenes, an adaptive extended Kalman prediction algorithm is also proposed to track and predict the 3D movement of UAVs. Simulations verify the effectiveness of the proposed routing scheme in terms of end-to-end delay and packet delivery ratio. Full article

Unmanned Aerial Vehicles (UAVs) have revolutionized numerous domains by introducing exceptional capabilities and efficiencies. As UAVs become increasingly integrated into critical operations, ensuring the security of their communication channels emerges as a paramount concern. This paper investigates the importance of safeguarding UAV communication against cyber threats, considering both intra-UAV and UAV–ground station interactions in the scope of the Flying Ad Hoc Networks (FANETs). To leverage the advancements in security methodologies, particularly focusing on Physical Unclonable Functions (PUFs), this paper proposes a novel authentication framework tailored for UAV networking systems. Investigating the existing literature, we categorize related studies into authentication strategies, illuminating the evolving landscape of UAV security. The proposed framework demonstrated a high level of security with lower communication and computation costs in comparison with selected studies with similar types of attacks. This paper highlights the urgent need for strong security measures to mitigate the increasing threats that UAVs encounter and ensure their sustained effectiveness in a variety of applications. The results indicate that the proposed protocol is sufficiently secure and, in terms of communication cost, achieves an 18% improvement compared to the best protocol in the referenced studies. Full article

The high mobility and dynamic nature of unmanned aerial vehicles (UAVs) pose significant challenges to clustering and routing in flying ad hoc networks (FANETs). Traditional methods often fail to achieve stable networks with efficient resource utilization and low latency. To address these issues, we propose a hybrid bio-inspired algorithm, HMAO, combining the mountain gazelle optimizer (MGO) and the aquila optimizer (AO). HMAO improves cluster stability and enhances data delivery reliability in FANETs. The algorithm uses MGO for efficient cluster head (CH) selection, considering UAV energy levels, mobility patterns, intra-cluster distance, and one-hop neighbor density, thereby reducing re-clustering frequency and ensuring coordinated operations. For cluster maintenance, a congestion-based approach redistributes UAVs in overloaded or imbalanced clusters. The AO-based routing algorithm ensures reliable data transmission from CHs to the base station by leveraging predictive mobility data, load balancing, fault tolerance, and global insights from ferry nodes. According to the simulations conducted on the network simulator (NS-3.35), the HMAO technique exhibits improved cluster stability, packet delivery ratio, low delay, overhead, and reduced energy consumption compared to the existing methods. Full article

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. To address these challenges, this study proposes a cluster deployment of tethered balloons to form flying ad hoc networks (FANETs) as a backbone for post-disaster communications. A meta-heuristic-based multi-objective particle swarm optimization (MOPSO) algorithm is employed to optimize the placement of balloons and power control to maximize target coverage and system energy efficiency. Comparative analysis with a stochastic algorithm (SA) demonstrates that MOPSO converges faster, with significant advantages in determining optimal balloon placement. The simulation results show that MOPSO effectively improves network throughput while reducing average delay and packet loss rate. Full article

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. This paper proposes a heuristic routing algorithm for multiple UAV systems to address the return visit challenge in flying ad hoc networks (FANETs) linked to a central station. Our approach introduces a composite valuation function for target prioritization and a mathematical model for task assignment with relay allocation, allowing any UAV to visit various objectives and gain an advantage or incur a cost for each. We exclusively utilized a simulation environment to mimic UAV operations, assessing communication range, connectivity, and routing performance. Extensive simulations demonstrate that our routing algorithm remains efficient in the face of frequent topological alterations in the network, showing robustness against dynamic environments and superior performance compared to existing methods. This paper presents different approaches to efficiently directing UAVs and explains how heuristic algorithms can enhance our understanding and improve current methods for task assignments. Full article

The adoption of UAVs in defence and civilian sectors necessitates robust communication networks. This paper presents a routing protocol for Cognitive Radio Unmanned Aerial Vehicles (CR-UAVs) in Flying Ad-hoc Networks (FANETs). The protocol is engineered to optimize route selection by considering crucial parameters such as distance, speed, link quality, and energy consumption. A standout feature is the introduction of the Central Node Resolution Factor (CNRF), which enhances routing decisions. Leveraging the Received Signal Strength Indicator (RSSI) enables accurate distance estimation, crucial for effective routing. Moreover, predictive algorithms are integrated to tackle the challenges posed by high mobility scenarios. Security measures include the identification of malicious nodes, while the protocol ensures resilience by managing multiple routes. Furthermore, it addresses route maintenance and handles link failures efficiently, cluster formation, and re-clustering with joining and leaving new nodes along with the predictive algorithm. Simulation results showcase the protocol’s self-comparison under different packet sizes, particularly in terms of end-to-end delay, throughput, packet delivery ratio, and normalized routing load. However, superior performance compared to existing methods, particularly in terms of throughput and packet transmission delay, underscoring its potential for widespread adoption in both defence and civilian UAV applications. Full article

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. The transmitting or receiving status of each discovery slot depends on the binary code corresponding to the identification of the node. Discovered neighbor nodes exchange their 3D positions in tracking slots periodically for node tracking, and the maximum tracking period is determined by node velocity, beamwidth, and the minimum distance between nodes. By configuring the relevant parameters, the proposed algorithm can also apply to two-dimensional planar ad hoc networks. The simulation results suggest that the proposed algorithm can achieve shorter neighbor discovery time and longer link survival time in comparison with the random scanning algorithm in scenarios with narrow beamwidth and wide moving area. When the frame length increases, the protocol overhead decreases but the average neighbor discovery time increases. The suitable frame length should be determined based on the network range, node count, beamwidth, and node mobility characteristics. Full article

In the event of a sudden natural disaster, the damaged communication infrastructure cannot provide a necessary network service for vehicles. Unfortunately, this is the critical moment when the occupants of trapped vehicles need to urgently use the vehicular network’s emergency service. How to efficiently connect the trapped vehicle to the base station is the challenge facing the emergency vehicular network. To address this challenge, this study proposes a UAV-assisted multi-objective and multi-hop ad hoc network (UMMVN) that can be used as an emergency vehicular network. Firstly, it presents an integrated design of a search system to find a trapped vehicle, the communication relay, and the networking, which significantly decreases the UAV’s networking time cost. Secondly, it presents a multi-objective search for a trapped vehicle and navigates UAVs along multiple paths to different objectives. Thirdly, it presents an optimal branching node strategy that allows the adequate use of the overlapping paths to multiple targets, which decreases the networking cost within the limited communication and searching range. The numerical experiments illustrate that the UMMVN performs better than other state-of-the-art networking methods. Full article

This paper proposes the design of virtual antenna arrays with frequency diversity for radar systems in fifth-generation flying ad hoc networks. These virtual arrays permit us to detect targets from the sky with flying drones. Each array element is composed of a microstrip antenna mounted on quadcopter drones and is virtually connected with the other elements. The antennas are tuned to work at the lower fifth-generation frequency band of 3.5 GHz. The design process considers the optimization of frequency offsets and positions for each element to obtain a side lobe level reduction. This methodology is carried out by particle swarm optimization. Several design examples are presented with random frequency offsets and non-uniform positions. These designs are compared to uniform-spaced arrays excited with Hamming frequency offsets. The simulation results show that using random frequency offsets and non-uniform positions provides a minor side lobe level reduction. This research demonstrates the feasibility of using virtual arrays for radar systems in fifth-generation flying ad hoc networks. Full article

Unmanned aerial vehicles (UAVs) are becoming more common in wireless communication networks. Using UAVs can lead to network problems. An issue arises when the UAVs function in a network-access-limited environment with nodes causing interference. This issue could potentially hinder UAV network connectivity. This paper introduces an intelligent packet priority module (IPPM) to minimize network latency. This study analyzed Network Simulator–3 (NS-3) network modules utilizing Manhattan long short-term memory (MaLSTM) for packet classification of critical UAV, ground control station (GCS), or interfering nodes. To minimize network latency and packet delivery ratio (PDR) issues caused by interfering nodes, packets from prioritized nodes are transmitted first. Simulation results and evaluation show that our proposed intelligent packet priority module (IPPM) method outperformed previous approaches. The proposed IPPM based on MaLSTM implementation for the priority packet module led to a lower network delay and a higher packet delivery ratio. The performance of the IPPM averaged 62.2 ms network delay and 0.97 packet delivery ratio (PDR). The MaLSTM peaked at 97.5% accuracy. Upon further evaluation, the stability of LSTM Siamese models was observed to be consistent across diverse similarity functions, including cosine and Euclidean distances. Full article