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
Dans les réseaux de capteurs sans fil, les systèmes de transmission de données en temps réel atteignent généralement la vitesse de transmission souhaitée en effectuant de manière proactive une analyse anticipée à un saut. Récemment, pour réduire le taux de non-respect des délais par rapport à la vitesse de livraison souhaitée, une étude a proposé un schéma de livraison de données en temps réel basé sur une analyse proactive à deux sauts. Cependant, la proposition récente pourrait entraîner une surcharge importante d'échange de messages et une complexité informatique élevée afin d'obtenir de manière proactive des informations sur la vitesse des voisins à deux sauts dans tous les nœuds de capteurs, que les données soient fournies ou non. Dans cet article, nous proposons un nouveau schéma de livraison de données en temps réel qui applique une anticipation multi-sauts à la demande uniquement autour des chemins de transfert de données. Par conséquent, le système peut fournir un taux de non-respect des délais plus faible pour la livraison de données en temps réel avec une faible surcharge d'échange de messages que les systèmes existants.
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
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
Copier
@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},}
Copier
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 -