Evidence map›Paper›PMID 37682948›Full record

ArticlePloS one2023

A cluster-tree-based trusted routing algorithm using Grasshopper Optimization Algorithm (GOA) in Wireless Sensor Networks (WSNs).

Mehdi Hosseinzadeh, Omed Hassan Ahmed, Jan Lansky, Stanislava Mildeova, Mohammad Sadegh Yousefpoor, Efat Yousefpoor, Joon Yoo, Lilia Tightiz, Amir Masoud Rahmani

Abstract read
In one paragraph

Article in PloS one, 2023. 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. Article
  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

9 authors.

Mehdi HosseinzadehInstitute of Research and Development, Duy Tan University, Da Nang, Vietnam.
Omed Hassan AhmedDepartment of Information Technology, University of Human Development, Sulaymaniyah, Iraq.
Jan LanskyDepartment of Computer Science and Mathematics, Faculty of Economic Studies, University of Finance and Administration, Prague, Czech Republic.
Stanislava MildeovaDepartment of Computer Science and Mathematics, Faculty of Economic Studies, University of Finance and Administration, Prague, Czech Republic.
Mohammad Sadegh YousefpoorDepartment of Computer Engineering, Dezful Branch, Islamic Azad University, Dezful, Iran.
Efat YousefpoorDepartment of Computer Engineering, Dezful Branch, Islamic Azad University, Dezful, Iran.
Joon YooSchool of Computing, Gachon University, Seongnam, Korea.
Lilia TightizSchool of Computing, Gachon University, Seongnam, Korea.ORCID 0000-0003-4114-9752
Amir Masoud RahmaniFuture Technology Research Center, National Yunlin University of Science and Technology, Yunlin, Taiwan.ORCID 0000-0001-8641-6119

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In wireless sensor networks (WSNs), existing routing protocols mainly consider energy efficiency or security separately. However, these protocols must be more comprehensive because many applications should guarantee security and energy efficiency, simultaneously. Due to the limited energy of sensor nodes, these protocols should make a trade-off between network lifetime and security. This paper proposes a cluster-tree-based trusted routing method using the grasshopper optimization algorithm (GOA) called CTTRG in WSNs. This routing scheme includes a distributed time-variant trust (TVT) model to analyze the behavior of sensor nodes according to three trust criteria, including the black hole, sink hole, and gray hole probability, the wormhole probability, and the flooding probability. Furthermore, CTTRG suggests a GOA-based trusted routing tree (GTRT) to construct secure and stable communication paths between sensor nodes and base station. To evaluate each GTRT, a multi-objective fitness function is designed based on three parameters, namely the distance between cluster heads and their parent node, the trust level, and the energy of cluster heads. The evaluation results prove that CTTRG has a suitable and successful performance in terms of the detection speed of malicious nodes, packet loss rate, and end-to-end delay.

Indexed as

GrasshoppersAlgorithmsAnimalsCommunicationFloods

Identifiers

PMID37682948
PMCPMC10491002

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.