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
Les réseaux de capteurs sans fil sont sujets à des défaillances de nœuds et de liaisons pour diverses raisons. Cet article propose un k-algorithme de routage de chemins disjoints qui fait varier le nombre de chemins disjoints (k) afin d'atteindre un ratio cible-livraison d'événements critiques et de réduire la consommation d'énergie. L'algorithme proposé envoie des paquets à la station de base via un chemin unique sans apparition d'événements critiques. Cependant, il envoie des paquets à la station de base via k chemins disjoints (k>1) en cas de survenance d'événements critiques, où k est calculé à partir d’un modèle de faute bien défini. L'algorithme proposé détecte l'apparition d'événements critiques en surveillant les modèles de données collectées. Les résultats de la simulation révèlent que l'algorithme proposé est plus résistant aux pannes aléatoires de nœuds et aux pannes structurées que les autres algorithmes de routage, et qu'il réduit également la consommation d'énergie bien plus que les algorithmes multi-trajets et de réparation de chemin.
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
Jang Woon BAEK, Young Jin NAM, Dae-Wha SEO, "Adaptive Multi-Path Routing with Guaranteed Target-Delivery Ratio of Critical Events in Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 2, pp. 392-395, February 2010, doi: 10.1587/transcom.E93.B.392.
Abstract: Wireless sensor networks are subject to node and link failures for a variety of reasons. This paper proposes a k-disjoint-path routing algorithm that varies the number of disjoint paths (k) in order to meet a target-delivery ratio of critical events and to reduce energy consumption. The proposed algorithm sends packets to the base station through a single path without the occurrence of critical events, however, it sends packets to the base station through k disjoint paths (k>1) under the occurrence of critical events, where k is computed from a well-defined fault model. The proposed algorithm detects the occurrence of critical events by monitoring collected data patterns. The simulation results reveal that the proposed algorithm is more resilient to random node failure and patterned failure than other routing algorithms, and it also decreases energy consumption much more than the multi-path and path-repair algorithms.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.392/_p
Copier
@ARTICLE{e93-b_2_392,
author={Jang Woon BAEK, Young Jin NAM, Dae-Wha SEO, },
journal={IEICE TRANSACTIONS on Communications},
title={Adaptive Multi-Path Routing with Guaranteed Target-Delivery Ratio of Critical Events in Wireless Sensor Networks},
year={2010},
volume={E93-B},
number={2},
pages={392-395},
abstract={Wireless sensor networks are subject to node and link failures for a variety of reasons. This paper proposes a k-disjoint-path routing algorithm that varies the number of disjoint paths (k) in order to meet a target-delivery ratio of critical events and to reduce energy consumption. The proposed algorithm sends packets to the base station through a single path without the occurrence of critical events, however, it sends packets to the base station through k disjoint paths (k>1) under the occurrence of critical events, where k is computed from a well-defined fault model. The proposed algorithm detects the occurrence of critical events by monitoring collected data patterns. The simulation results reveal that the proposed algorithm is more resilient to random node failure and patterned failure than other routing algorithms, and it also decreases energy consumption much more than the multi-path and path-repair algorithms.},
keywords={},
doi={10.1587/transcom.E93.B.392},
ISSN={1745-1345},
month={February},}
Copier
TY - JOUR
TI - Adaptive Multi-Path Routing with Guaranteed Target-Delivery Ratio of Critical Events in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 392
EP - 395
AU - Jang Woon BAEK
AU - Young Jin NAM
AU - Dae-Wha SEO
PY - 2010
DO - 10.1587/transcom.E93.B.392
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2010
AB - Wireless sensor networks are subject to node and link failures for a variety of reasons. This paper proposes a k-disjoint-path routing algorithm that varies the number of disjoint paths (k) in order to meet a target-delivery ratio of critical events and to reduce energy consumption. The proposed algorithm sends packets to the base station through a single path without the occurrence of critical events, however, it sends packets to the base station through k disjoint paths (k>1) under the occurrence of critical events, where k is computed from a well-defined fault model. The proposed algorithm detects the occurrence of critical events by monitoring collected data patterns. The simulation results reveal that the proposed algorithm is more resilient to random node failure and patterned failure than other routing algorithms, and it also decreases energy consumption much more than the multi-path and path-repair algorithms.
ER -