Evidence map›Paper›PMID 36298281›Full record

ArticleSensors (Basel, Switzerland)2022

IACRA: Lifetime Optimization by Invulnerability-Aware Clustering Routing Algorithm Using Game-Theoretic Approach for Wsns.

Jun Wang, Yadan Zhang, Chunyan Hu, Pengjun Mao, Bo Liu

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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.

Jun WangSchool of Information Engineering, Henan University of Science and Technology, Luoyang 471000, China.ORCID 0000-0001-7837-422X
Yadan ZhangSchool of Information and Electrical Engineering, China Agriculture University, Beijing 100083, China.ORCID 0000-0002-1818-1482
Chunyan HuSchool of Information Engineering, Henan University of Science and Technology, Luoyang 471000, China.
Pengjun MaoSchool of International Education, University of Science and Technology, Luoyang 471000, China.
Bo LiuSchool of Information Engineering, Henan University of Science and Technology, Luoyang 471000, China.ORCID 0000-0001-6776-1988

Funding

Key Science and Technology Project of Henan Province 2221022102164Key Scientific Research Projects in Universities of Henan Province 19A460021Major Special Science and Technology Project of Luoyang 2101018ANational Natural Science Foundation of China 61771184Program for Science & Technology Innovation Talents in Universities of Henan Province 20HASTIT029
6 · The paper itself

Abstract

Energy limitation is one of the intrinsic shortcomings of wireless sensor networks (WSNs), although it has been widely applied in disaster response, battlefield surveillance, wildfire monitoring, radioactivity detection, etc. Due to the large amount of energy consumed for data transmission, how to prolong the network lifespan by designing various hierarchical routing protocols has attracted more and more attention. As a result, numerous achievements have emerged successively. However, these presented mechanisms can rarely guarantee the satisfactory quality of service (QoS), while lowering the energy cost level of WSNs. Meanwhile, invulnerability is undoubtedly an excellent quantitative index to assess QoS. Therefore, it is critical to develop a practical routing method to optimize network lifetime by considering both invulnerability and energy efficiency. Game theory is suitable for such a critical problem as it can be used in node or at network level to encourage the decision-making capabilities of WSNs. In this paper, a novel invulnerability-aware clustering routing algorithm (IACRA) using game-theoretic method is proposed to solve the predicament. The core features of the addressed game-theory-based routing protocol include integral invulnerability awareness, optimal cluster head selection in hierarchical routing, distance-aware cluster head discovery, and cluster rotation update mechanism for lifetime optimization. Particularly, the integral network invulnerability based on weighted fusion is constructed for further defining the profit model by combining the invulnerability indicators used to evaluate the local and whole network. Meanwhile, the optimal probability function of every node elected as CH in per cluster is established through the game between invulnerability and node energy consumption. In addition, the cluster update mechanism base on cluster rotation is proposed to avoid the rapid death of nodes with large energy consumption for maximizing network lifetime. The experimental results indicated a significant improvement in energy balance as well as in invulnerability compared with the other three kinds of well-known clustering routing protocols including GEEC (Game-theory-based energy efficient clustering routing protocol), HGTD (Hybrid, game-theory-based distributed clustering protocol), and EEGC (Efficient energy-aware and game-theory-based clustering protocol). Concretely, at the 400 communication rounds, the invulnerability of IACRA was higher than that of GEEC, HGTD, and EEGC by 77.56%, 29.45% and 15.90%, respectively, and the average residual energy of IACRA was 8.61%, 18.35% and 6.36% larger than that of GEEC, HGTD, and EEGC, respectively. Based on these results, the proposed protocol can be utilized to increase the capability of WSNs against deterioration of QoS and energy constraints.

Indexed as

Computer Communication NetworksWireless TechnologyAlgorithmsCluster AnalysisGame Theoryaverage residual energyclustering routing protocolgame theoryinvulnerabilitylifetimewireless sensor networks

Identifiers

PMID36298281
PMCPMC9607191

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.