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
이 편지에서 우리는 무선 센서 네트워크에서 흔히 볼 수 있는 실시간 애플리케이션을 지원하기 위해 수정된 지리적 라우팅 프로토콜과 스케줄링 알고리즘을 제안합니다. 실시간 요구 사항을 충족하기 위해 특정 애플리케이션은 (m,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.
부
Ki-Il KIM, Tae-Eung SUNG, "Network Layer Approaches for (m,k)-Firm Stream in Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 11, pp. 3165-3168, November 2010, doi: 10.1587/transcom.E93.B.3165.
Abstract: In this letter, we propose a revised geographic routing protocol and a scheduling algorithm to support real-time applications, which are often observed in wireless sensor networks. In order to meet real-time requirement, a specific application is modeled as an (m,k)-firm stream that has a property of weakly hard real-time system. In addition, both a priority-based scheduling and a geographic forwarding scheme based on delay, distance, and remaining slack time are newly proposed. Simulations and their analysis are followed to validate the suitability of reduced dynamic failure probability and extended network lifetime.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.3165/_p
부
@ARTICLE{e93-b_11_3165,
author={Ki-Il KIM, Tae-Eung SUNG, },
journal={IEICE TRANSACTIONS on Communications},
title={Network Layer Approaches for (m,k)-Firm Stream in Wireless Sensor Networks},
year={2010},
volume={E93-B},
number={11},
pages={3165-3168},
abstract={In this letter, we propose a revised geographic routing protocol and a scheduling algorithm to support real-time applications, which are often observed in wireless sensor networks. In order to meet real-time requirement, a specific application is modeled as an (m,k)-firm stream that has a property of weakly hard real-time system. In addition, both a priority-based scheduling and a geographic forwarding scheme based on delay, distance, and remaining slack time are newly proposed. Simulations and their analysis are followed to validate the suitability of reduced dynamic failure probability and extended network lifetime.},
keywords={},
doi={10.1587/transcom.E93.B.3165},
ISSN={1745-1345},
month={November},}
부
TY - JOUR
TI - Network Layer Approaches for (m,k)-Firm Stream in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3165
EP - 3168
AU - Ki-Il KIM
AU - Tae-Eung SUNG
PY - 2010
DO - 10.1587/transcom.E93.B.3165
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2010
AB - In this letter, we propose a revised geographic routing protocol and a scheduling algorithm to support real-time applications, which are often observed in wireless sensor networks. In order to meet real-time requirement, a specific application is modeled as an (m,k)-firm stream that has a property of weakly hard real-time system. In addition, both a priority-based scheduling and a geographic forwarding scheme based on delay, distance, and remaining slack time are newly proposed. Simulations and their analysis are followed to validate the suitability of reduced dynamic failure probability and extended network lifetime.
ER -