The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Visando o problema do “buraco de energia” causado pela distribuição aleatória de nós em redes de sensores sem fio (RSSFs) de grande escala, este artigo propõe um protocolo de roteamento de cluster desigual equilibrado (AEBUC) adaptativo e eficiente em termos energéticos para RSSFs. O raio de competição é ajustado adaptativamente com base na densidade do nó e na distância do chefe do cluster candidato (CH) à estação base (BS) para obter clustering adaptativo ideal controlado por escala; em CHs candidatos, a densidade relativa de energia e a densidade relativa de CH candidato são amplamente consideradas para alcançar a seleção dinâmica de CH. Na comunicação entre clusters, com base no princípio do equilíbrio de energia, a função de custo de comunicação do relé é estabelecida e combinada com o método de árvore geradora mínima para realizar o roteamento multi-hop entre clusters otimizado, formando uma árvore de roteamento de comunicação eficiente. Os resultados experimentais mostram que o protocolo economiza efetivamente energia da rede, prolonga significativamente a vida útil da rede e resolve melhor o problema do “buraco de energia”.
Mingyu LI
China University of Mining and Technology
Jihang YIN
University of Chinese Academy of Sciences
Yonggang XU
China University of Mining and Technology
Gang HUA
China University of Mining and Technology
Nian XU
Jiangsu Earthquake Agency
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Mingyu LI, Jihang YIN, Yonggang XU, Gang HUA, Nian XU, "An Adaptive Energy-Efficient Uneven Clustering Routing Protocol for WSNs" in IEICE TRANSACTIONS on Communications,
vol. E107-B, no. 2, pp. 296-308, February 2024, doi: 10.23919/transcom.2023EBP3097.
Abstract: Aiming at the problem of “energy hole” caused by random distribution of nodes in large-scale wireless sensor networks (WSNs), this paper proposes an adaptive energy-efficient balanced uneven clustering routing protocol (AEBUC) for WSNs. The competition radius is adaptively adjusted based on the node density and the distance from candidate cluster head (CH) to base station (BS) to achieve scale-controlled adaptive optimal clustering; in candidate CHs, the energy relative density and candidate CH relative density are comprehensively considered to achieve dynamic CH selection. In the inter-cluster communication, based on the principle of energy balance, the relay communication cost function is established and combined with the minimum spanning tree method to realize the optimized inter-cluster multi-hop routing, forming an efficient communication routing tree. The experimental results show that the protocol effectively saves network energy, significantly extends network lifetime, and better solves the “energy hole” problem.
URL: https://global.ieice.org/en_transactions/communications/10.23919/transcom.2023EBP3097/_p
Copiar
@ARTICLE{e107-b_2_296,
author={Mingyu LI, Jihang YIN, Yonggang XU, Gang HUA, Nian XU, },
journal={IEICE TRANSACTIONS on Communications},
title={An Adaptive Energy-Efficient Uneven Clustering Routing Protocol for WSNs},
year={2024},
volume={E107-B},
number={2},
pages={296-308},
abstract={Aiming at the problem of “energy hole” caused by random distribution of nodes in large-scale wireless sensor networks (WSNs), this paper proposes an adaptive energy-efficient balanced uneven clustering routing protocol (AEBUC) for WSNs. The competition radius is adaptively adjusted based on the node density and the distance from candidate cluster head (CH) to base station (BS) to achieve scale-controlled adaptive optimal clustering; in candidate CHs, the energy relative density and candidate CH relative density are comprehensively considered to achieve dynamic CH selection. In the inter-cluster communication, based on the principle of energy balance, the relay communication cost function is established and combined with the minimum spanning tree method to realize the optimized inter-cluster multi-hop routing, forming an efficient communication routing tree. The experimental results show that the protocol effectively saves network energy, significantly extends network lifetime, and better solves the “energy hole” problem.},
keywords={},
doi={10.23919/transcom.2023EBP3097},
ISSN={1745-1345},
month={February},}
Copiar
TY - JOUR
TI - An Adaptive Energy-Efficient Uneven Clustering Routing Protocol for WSNs
T2 - IEICE TRANSACTIONS on Communications
SP - 296
EP - 308
AU - Mingyu LI
AU - Jihang YIN
AU - Yonggang XU
AU - Gang HUA
AU - Nian XU
PY - 2024
DO - 10.23919/transcom.2023EBP3097
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E107-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2024
AB - Aiming at the problem of “energy hole” caused by random distribution of nodes in large-scale wireless sensor networks (WSNs), this paper proposes an adaptive energy-efficient balanced uneven clustering routing protocol (AEBUC) for WSNs. The competition radius is adaptively adjusted based on the node density and the distance from candidate cluster head (CH) to base station (BS) to achieve scale-controlled adaptive optimal clustering; in candidate CHs, the energy relative density and candidate CH relative density are comprehensively considered to achieve dynamic CH selection. In the inter-cluster communication, based on the principle of energy balance, the relay communication cost function is established and combined with the minimum spanning tree method to realize the optimized inter-cluster multi-hop routing, forming an efficient communication routing tree. The experimental results show that the protocol effectively saves network energy, significantly extends network lifetime, and better solves the “energy hole” problem.
ER -