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
Le routage économe en énergie est l'un des problèmes de conception clés pour prolonger la durée de vie des réseaux de capteurs sans fil (WSN), car les nœuds de capteurs ne peuvent pas être facilement rechargés une fois déployés. Pendant le processus de routage, les itinéraires avec seulement quelques sauts ou avec trop de sauts ne sont pas économes en énergie. Les algorithmes de routage basés sur les sauts peuvent grandement améliorer l'efficacité énergétique du routage multi-sauts dans les WSN, car ils peuvent déterminer le nombre de sauts optimal ainsi que les nœuds intermédiaires correspondants au cours du processus de routage multi-sauts dans un réseau à moyenne ou haute densité. Dans cet article, nous nous concentrons non seulement sur l'étude de la relation entre la consommation d'énergie et le nombre de sauts d'un point de vue théorique, mais fournissons également un critère de sélection pratique du nombre de sauts sous-optimal sous un réseau de capteurs pratique afin de minimiser la consommation d'énergie. Nous étendons la déduction théorique du nombre de sauts optimal et proposons notre algorithme HEAR (Hop-based Energy Aware Routing) qui est totalement distribué et localisé. Les résultats de simulation montrent que notre algorithme HEAR peut réduire la consommation d'énergie moyenne d'environ 10 fois par rapport à l'algorithme de transmission directe et de 2 à 10 fois par rapport à d'autres algorithmes comme LEACH et HEED sous diverses topologies de réseau.
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.
Copier
Jin WANG, Jinsung CHO, Sungyoung LEE, Kwang-Cheng CHEN, Young-Koo LEE, "Hop-Based Energy Aware Routing Algorithm for Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 2, pp. 305-316, February 2010, doi: 10.1587/transcom.E93.B.305.
Abstract: Energy efficient routing is one of the key design issues to prolong the lifetime of wireless sensor networks (WSNs) since sensor nodes can not be easily re-charged once they are deployed. During routing process, the routes with only few hops or with too many hops are not energy efficient. Hop-based routing algorithms can largely improve the energy efficiency of multi-hop routing in WSNs because they can determine the optimal hop number as well as the corresponding intermediate nodes during multi-hop routing process under medium or high density network. In this paper, we not only focus on studying the relationship between energy consumption and hop number from theoretical point of view but also provide a practical selection criterion of the sub-optimal hop number under practical sensor network so as to minimize the energy consumption. We extend the theoretical deduction of optimal hop number and propose our Hop-based Energy Aware Routing (HEAR) algorithm which is totally distributed and localized. Simulation results show that our HEAR algorithm can reduce the average energy consumption about 10 times compared to the direct transmission algorithm and 2 to 10 times than other algorithms like LEACH and HEED under various network topologies.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.305/_p
Copier
@ARTICLE{e93-b_2_305,
author={Jin WANG, Jinsung CHO, Sungyoung LEE, Kwang-Cheng CHEN, Young-Koo LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Hop-Based Energy Aware Routing Algorithm for Wireless Sensor Networks},
year={2010},
volume={E93-B},
number={2},
pages={305-316},
abstract={Energy efficient routing is one of the key design issues to prolong the lifetime of wireless sensor networks (WSNs) since sensor nodes can not be easily re-charged once they are deployed. During routing process, the routes with only few hops or with too many hops are not energy efficient. Hop-based routing algorithms can largely improve the energy efficiency of multi-hop routing in WSNs because they can determine the optimal hop number as well as the corresponding intermediate nodes during multi-hop routing process under medium or high density network. In this paper, we not only focus on studying the relationship between energy consumption and hop number from theoretical point of view but also provide a practical selection criterion of the sub-optimal hop number under practical sensor network so as to minimize the energy consumption. We extend the theoretical deduction of optimal hop number and propose our Hop-based Energy Aware Routing (HEAR) algorithm which is totally distributed and localized. Simulation results show that our HEAR algorithm can reduce the average energy consumption about 10 times compared to the direct transmission algorithm and 2 to 10 times than other algorithms like LEACH and HEED under various network topologies.},
keywords={},
doi={10.1587/transcom.E93.B.305},
ISSN={1745-1345},
month={February},}
Copier
TY - JOUR
TI - Hop-Based Energy Aware Routing Algorithm for Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 305
EP - 316
AU - Jin WANG
AU - Jinsung CHO
AU - Sungyoung LEE
AU - Kwang-Cheng CHEN
AU - Young-Koo LEE
PY - 2010
DO - 10.1587/transcom.E93.B.305
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2010
AB - Energy efficient routing is one of the key design issues to prolong the lifetime of wireless sensor networks (WSNs) since sensor nodes can not be easily re-charged once they are deployed. During routing process, the routes with only few hops or with too many hops are not energy efficient. Hop-based routing algorithms can largely improve the energy efficiency of multi-hop routing in WSNs because they can determine the optimal hop number as well as the corresponding intermediate nodes during multi-hop routing process under medium or high density network. In this paper, we not only focus on studying the relationship between energy consumption and hop number from theoretical point of view but also provide a practical selection criterion of the sub-optimal hop number under practical sensor network so as to minimize the energy consumption. We extend the theoretical deduction of optimal hop number and propose our Hop-based Energy Aware Routing (HEAR) algorithm which is totally distributed and localized. Simulation results show that our HEAR algorithm can reduce the average energy consumption about 10 times compared to the direct transmission algorithm and 2 to 10 times than other algorithms like LEACH and HEED under various network topologies.
ER -