Evidence map›Paper›PMID 36693862›Full record

ArticleScientific reports2023

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

Jan Lansky, Amir Masoud Rahmani, Mazhar Hussain Malik, Efat Yousefpoor, Mohammad Sadegh Yousefpoor, Muhammad Umair Khan, Mehdi Hosseinzadeh

Abstract read
In one paragraph

Article in Scientific reports, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors.

Jan LanskyDepartment of Computer Science and Mathematics, Faculty of Economic Studies, University of Finance and Administration, Prague, Czech Republic.
Amir Masoud RahmaniFuture Technology Research Center, National Yunlin University of Science and Technology, 123 University Road, Section 3, 64002, Douliou, Yunlin, Taiwan. rahmania@yuntech.edu.tw.
Mazhar Hussain MalikSchool of Computing and Creative Technologies, College of Arts, Technology and Environment (CATE), University of the West of England, Frenchay Campus, Coldharbour Lane, Bristol BS16 1QY, United Kingdom.
Efat YousefpoorDepartment of Computer Engineering, Dezful Branch, Islamic Azad University, Dezful, Iran.
Mohammad Sadegh YousefpoorDepartment of Computer Engineering, Dezful Branch, Islamic Azad University, Dezful, Iran.
Muhammad Umair KhanSchool of Computing, Gachon University, 1342, Seongnam-daero, Sujeong-gu, Seongnam-si 13120, Republic of Korea. mehdihosseinzadeh@duytan.edu.vn.
Mehdi HosseinzadehInstitute of Research and Development, Duy Tan University, Da Nang, Vietnam.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

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.

Identifiers

PMID36693862
PMCPMC9873979

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.