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
무선 센서 네트워크에서 실시간 데이터 전달 방식은 일반적으로 원홉 미리보기를 사전에 수행하여 원하는 전달 속도를 달성합니다. 최근에는 원하는 전달 속도에 대한 데드라인 미스율을 줄이기 위해 선제적으로 2-홉 예측을 수행하는 기반의 실시간 데이터 전달 방식을 제안한 연구가 있다. 그러나 최근 제안은 데이터 전달 여부에 관계없이 모든 센서 노드에서 2홉 인접 속도 정보를 사전에 획득하기 위해 과도한 메시지 교환 오버헤드와 높은 컴퓨팅 복잡성을 유발할 수 있습니다. 본 논문에서는 데이터 전달 경로 주변에만 주문형 다중 홉 예측을 적용하는 새로운 실시간 데이터 전달 방식을 제안합니다. 따라서 이 기법은 기존 기법에 비해 낮은 메시지 교환 오버헤드로 실시간 데이터 전달에 대한 더 낮은 데드라인 미스율을 제공할 수 있다.
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.
부
Soochang PARK, Euisin LEE, Juhyun JUNG, Sang-Ha KIM, "Real-Time Routing Based on On-Demand Multi-Hop Lookahead in Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 2, pp. 569-572, February 2011, doi: 10.1587/transcom.E94.B.569.
Abstract: In wireless sensor networks, real-time data delivery schemes typically achieve the desired delivery speed by proactively performing one-hop lookahead. Recently, to reduce the deadline miss ratio with respect to the desired delivery speed, a study has proposed a real-time data delivery scheme based on proactively performing two-hop lookahead. However, the recent proposal might cause heavy message exchange overhead and high computing complexity in order to proactively obtain two-hop neighbor speed information in all sensor nodes whether data are delivered or not. In this paper, we propose a novel real-time data delivery scheme that applies on-demand multi-hop lookahead only around data forwarding paths. Hence, the scheme can provide lower deadline miss ratio for real-time data delivery with low message exchange overhead than existing schemes.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.569/_p
부
@ARTICLE{e94-b_2_569,
author={Soochang PARK, Euisin LEE, Juhyun JUNG, Sang-Ha KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Real-Time Routing Based on On-Demand Multi-Hop Lookahead in Wireless Sensor Networks},
year={2011},
volume={E94-B},
number={2},
pages={569-572},
abstract={In wireless sensor networks, real-time data delivery schemes typically achieve the desired delivery speed by proactively performing one-hop lookahead. Recently, to reduce the deadline miss ratio with respect to the desired delivery speed, a study has proposed a real-time data delivery scheme based on proactively performing two-hop lookahead. However, the recent proposal might cause heavy message exchange overhead and high computing complexity in order to proactively obtain two-hop neighbor speed information in all sensor nodes whether data are delivered or not. In this paper, we propose a novel real-time data delivery scheme that applies on-demand multi-hop lookahead only around data forwarding paths. Hence, the scheme can provide lower deadline miss ratio for real-time data delivery with low message exchange overhead than existing schemes.},
keywords={},
doi={10.1587/transcom.E94.B.569},
ISSN={1745-1345},
month={February},}
부
TY - JOUR
TI - Real-Time Routing Based on On-Demand Multi-Hop Lookahead in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 569
EP - 572
AU - Soochang PARK
AU - Euisin LEE
AU - Juhyun JUNG
AU - Sang-Ha KIM
PY - 2011
DO - 10.1587/transcom.E94.B.569
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2011
AB - In wireless sensor networks, real-time data delivery schemes typically achieve the desired delivery speed by proactively performing one-hop lookahead. Recently, to reduce the deadline miss ratio with respect to the desired delivery speed, a study has proposed a real-time data delivery scheme based on proactively performing two-hop lookahead. However, the recent proposal might cause heavy message exchange overhead and high computing complexity in order to proactively obtain two-hop neighbor speed information in all sensor nodes whether data are delivered or not. In this paper, we propose a novel real-time data delivery scheme that applies on-demand multi-hop lookahead only around data forwarding paths. Hence, the scheme can provide lower deadline miss ratio for real-time data delivery with low message exchange overhead than existing schemes.
ER -