Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

Assessing the Performance of a Particle Swarm Optimization Mobility Algorithm in a Hybrid Wi-Fi/LoRa Flying Ad Hoc Network

Abstract

Research on Flying Ad-Hoc Networks (FANETs) has increased due to the availability of Unmanned Aerial Vehicles (UAVs) and the electronic components that control and connect them. Many applications, such as 3D mapping, construction inspection, or emergency response operations could benefit from an application and adaptation of swarm intelligence-based deployments of multiple UAVs. Such groups of cooperating UAVs, through the use of local rules, could be seen as network nodes establishing an ad-hoc network for communication purposes. One FANET application is to provide communication coverage over an area where communication infrastructure is unavailable. A crucial part of a FANET implementation is computing the optimal position of UAVs to provide connectivity with ground nodes while maximizing geographic span. To achieve optimal positioning of FANET nodes, an adaptation of the Particle Swarm Optimization (PSO) algorithm is proposed. A 3D mobility model is defined by adapting the original PSO algorithm and combining it with a fixed-trajectory initial flight. A Long Range (LoRa) mesh network is used for air-to-air communication, while a Wi-Fi network provides air-to-ground communication to several ground nodes with unknown positions. The optimization problem has two objectives: maximizing coverage to ground nodes and maintaining an end-to-end communication path to a control station, through the UAV mesh. The results show that the hybrid mobility approach performs similarly to the fixed trajectory flight regarding coverage, and outperforms fixed trajectory and PSO-only algorithms in both path maintenance and overall network efficiency, while using fewer UAVs

Similar works

This paper was published in UNF Digital Commons.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.