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
무선 센서 네트워크는 다양한 이유로 노드 및 링크 오류가 발생할 수 있습니다. 이 논문은 k- 분리된 경로의 수를 변화시키는 분리된 경로 라우팅 알고리즘(k) 중요한 이벤트의 목표 전달 비율을 충족하고 에너지 소비를 줄이기 위해. 제안하는 알고리즘은 크리티컬 이벤트 발생 없이 단일 경로를 통해 기지국으로 패킷을 전송하지만, k 분리된 경로(k>1) 중대한 사건이 발생한 경우 k 잘 정의된 결함 모델로부터 계산됩니다. 제안하는 알고리즘은 수집된 데이터 패턴을 모니터링하여 중요 이벤트 발생을 탐지한다. 시뮬레이션 결과, 제안된 알고리즘은 다른 라우팅 알고리즘에 비해 무작위 노드 장애 및 패턴 장애에 대한 복원력이 뛰어나며, 다중 경로 및 경로 복구 알고리즘보다 에너지 소비를 훨씬 더 절감하는 것으로 나타났습니다.
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.
부
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
부
@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},}
부
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 -