An energy-aware routing method using firefly algorithm for flying ad hoc networks

Result code in IS VaVaI

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

Result on the web

<a href="https://www.nature.com/articles/s41598-023-27567-7" target="_blank" >https://www.nature.com/articles/s41598-023-27567-7</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1038/s41598-023-27567-7" target="_blank" >10.1038/s41598-023-27567-7</a>

Result language

angličtina

Original language name

An energy-aware routing method using firefly algorithm for flying ad hoc networks

Original language description

Flying ad-hoc networks (FANETs) include a large number of drones, which communicate with each other based on an ad hoc model. These networks provide new opportunities for various applications such as military, industrial, and civilian applications. However, FANETs have faced with many challenges like high-speed nodes, low density, and rapid changes in the topology. As a result, routing is a challenging issue in these networks. In this paper, we propose an energy-aware routing scheme in FANETs. This scheme is inspired by the optimized link state routing (OLSR). In the proposed routing scheme, we estimate the connection quality between two flying nodes using a new technique, which utilizes two parameters, including ratio of sent/received of hello packets and connection time. Also, our proposed method selects multipoint relays (MPRs) using the firefly algorithm. It chooses a node with high residual energy, high connection quality, more neighborhood degree, and higher willingness as MPR. Finally, our proposed scheme creates routes between different nodes based on energy and connection quality. Our proposed routing scheme is simulated using the network simulator version 3 (NS3). We compare its simulation results with the greedy optimized link state routing (G-OLSR) and the optimized link state routing (OLSR). These results show that our method outperforms G-OLSR and OLSR in terms of delay, packet delivery rate, throughput, and energy consumption. However, our proposed routing scheme increases slightly routing overhead compared to G-OLSR

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

S - Specificky vyzkum na vysokych skolach

Publication year

2023

Confidentiality

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

Name of the periodical

Scientific Reports

ISSN

2045-2322

e-ISSN

—

Volume of the periodical

13

Issue of the periodical within the volume

1

Country of publishing house

DE - GERMANY

Number of pages

18

Pages from-to

1-18

UT code for WoS article

000944127000010

EID of the result in the Scopus database

2-s2.0-85146864540