A new version of the greedy perimeter stateless routing scheme in flying ad hoc networks

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F04274644%3A_____%2F24%3A%230001130" target="_blank" >RIV/04274644:_____/24:#0001130 - isvavai.cz</a>

Result on the web

<a href="https://www.sciencedirect.com/science/article/pii/S1319157824001551?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S1319157824001551?via%3Dihub</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.jksuci.2024.102066" target="_blank" >10.1016/j.jksuci.2024.102066</a>

Result language

angličtina

Original language name

A new version of the greedy perimeter stateless routing scheme in flying ad hoc networks

Original language description

Flying ad hoc networks (FANETs) belong to the family of mobile ad hoc networks (MANETs). They have gained high popularity due to their extensive applications in various industries such as emergency management, military missions, and supervision. However, these networks face important challenges in guaranteeing reliable data transmission because of their dynamic nature and lack of infrastructure. In this paper, a new version of the greedy perimeter stateless routing scheme called GPSR+AODV is proposed in FANET. It combines two routing schemes, namely GPSR and AODV, and is a family member of geographic routing methods. In GPSR+AODV, each UAV consists of a certain hello broadcast period that is adjusted based on the prediction of its spatial coordinates in the future. Additionally, GPSR+AODV modifies the greedy forwarding process and restricts the search space for finding the next-hop node by obtaining a refined candidate set, calculated in the cylindrical coordinate system. Then, each UAV in the refined candidate set is evaluated under a fitness function, and the most suitable next-hop node with the maximum fitness is determined. This function is a combination of four criteria, namely relative velocity, energy level, buffer capacity, and distance to destination. When failing in the greedy forwarding process, GPSR+AODV changes the forwarding technique and uses an AODV-based perimeter forwarding technique to select the best next-hop node. Lastly, GPSR+AODV is implemented by the NS2 simulator, and the simulation results show a successful performance in terms of packet delivery rate, throughput, and delay compared to AGGR, AeroRP, and GPSR. However, the routing overhead in the proposed scheme is higher than that in AGGR.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2024

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Journal of King Saud University - Computer and Information Sciences

ISSN

1319-1578

e-ISSN

2213-1248

Volume of the periodical

36

Issue of the periodical within the volume

5

Country of publishing house

SA - THE KINGDOM OF SAUDI ARABIA

Number of pages

18

Pages from-to

1-18

UT code for WoS article

001247586300001

EID of the result in the Scopus database

2-s2.0-85194335862