Evidence map›Paper›PMID 37420386›Full record

ArticleEntropy (Basel, Switzerland)2022

A Clustering Scheme Based on the Binary Whale Optimization Algorithm in FANET.

Yonghang Yan, Xuewen Xia, Lingli Zhang, Zhijia Li, Chunbin Qin

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing 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

3 citing papers in PubMed.

  1. Article
  2. Review
  3. 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

5 authors.

Yonghang YanSchool of Computer and Information Engineering, Henan University, Kaifeng 475004, China.ORCID 0000-0002-8606-793X
Xuewen XiaSchool of Computer and Information Engineering, Henan University, Kaifeng 475004, China.ORCID 0000-0003-4241-0553
Lingli ZhangBeijing Aerospace Automatic Control Institute, Beijing 100854, China.
Zhijia LiSchool of Computer and Information Engineering, Henan University, Kaifeng 475004, China.ORCID 0000-0003-1472-5718
Chunbin QinSchool of Artificial Intelligence, Henan University, Kaifeng 475004, China.ORCID 0000-0002-8238-5922

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

With the continuous development of Unmanned Aerial Vehicle (UAV) technology, UAVs are widely used in military and civilian fields. Multi-UAV networks are often referred to as flying ad hoc networks (FANET). Dividing multiple UAVs into clusters for management can reduce energy consumption, maximize network lifetime, and enhance network scalability to a certain extent, so UAV clustering is an important direction for UAV network applications. However, UAVs have the characteristics of limited energy resources and high mobility, which bring challenges to UAV cluster communication networking. Therefore, this paper proposes a clustering scheme for UAV clusters based on the binary whale optimization (BWOA) algorithm. First, the optimal number of clusters in the network is calculated based on the network bandwidth and node coverage constraints. Then, the cluster heads are selected based on the optimal number of clusters using the BWOA algorithm, and the clusters are divided based on the distance. Finally, the cluster maintenance strategy is set to achieve efficient maintenance of clusters. The experimental simulation results show that the scheme has better performance in terms of energy consumption and network lifetime compared with the BPSO and K-means-based schemes.

Indexed as

binary whale optimization algorithm (BWOA)clusteringFANETUAV clusters

Identifiers

PMID37420386
PMCPMC9601410

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.