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 mobiles ad hoc (MANET), la capacité de transport des liaisons sans fil varie en fonction de la taille des paquets qu'elles transportent. Cette instabilité, qui est plus aiguë dans les liaisons longues, a reçu peu d'attention dans les schémas de stabilisation proposés jusqu'à présent pour MANET. De nombreuses recherches ont été menées pour utiliser des liens plus fiables dans la création de routes de bout en bout afin d'éviter des pannes de route fréquentes et d'obtenir un taux de livraison de paquets plus élevé. Cependant, ces approches considèrent principalement la disponibilité d’un lien dans le temps et dépendent de l’historique des liens, difficile à acquérir dans les systèmes hautement dynamiques. Dans cet article, nous présentons une méthode facile à mettre en œuvre mais efficace pour trouver des routes de bout en bout appropriées, capables de transporter différentes tailles de paquets de données d'application. Notre système est apatride et ne repose pas sur la liaison de données ni sur les couches physiques sous-jacentes. Une simulation approfondie montre la validité de notre concept et met en évidence l'amélioration réalisée par notre proposition.
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
Ashiq KHAN, Toshihiro SUZUKI, Motonari KOBAYASHI, Wataru TAKITA, Kenichi YAMAZAKI, "Packet Size Based Routing for Stable Data Delivery in Mobile Ad-Hoc Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 7, pp. 2244-2254, July 2008, doi: 10.1093/ietcom/e91-b.7.2244.
Abstract: In Mobile Ad-hoc Networks (MANET), transportation capability of wireless links' varies according to the size of the packets they transport. This instability, which is more acute in long links, has received little attention in the stabilizing schemes proposed so far for MANET. A lot of research has been carried out to utilize more reliable links in making end-to-end routes to avoid frequent route failures and realize higher packet delivery ratio. However, these approaches mainly consider the availability of a link over time and depend on link history which is difficult to acquire in highly dynamic systems. In this paper, we present an easy-to-implement but efficient method to find suitable end-to-end routes that are capable of transporting different sizes of the application data packets. Our scheme is stateless and does not rely on the underlying data link and physical layers. An extensive simulation shows the validity of our concept and highlights the improvement achieved by our proposal.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.7.2244/_p
Copier
@ARTICLE{e91-b_7_2244,
author={Ashiq KHAN, Toshihiro SUZUKI, Motonari KOBAYASHI, Wataru TAKITA, Kenichi YAMAZAKI, },
journal={IEICE TRANSACTIONS on Communications},
title={Packet Size Based Routing for Stable Data Delivery in Mobile Ad-Hoc Networks},
year={2008},
volume={E91-B},
number={7},
pages={2244-2254},
abstract={In Mobile Ad-hoc Networks (MANET), transportation capability of wireless links' varies according to the size of the packets they transport. This instability, which is more acute in long links, has received little attention in the stabilizing schemes proposed so far for MANET. A lot of research has been carried out to utilize more reliable links in making end-to-end routes to avoid frequent route failures and realize higher packet delivery ratio. However, these approaches mainly consider the availability of a link over time and depend on link history which is difficult to acquire in highly dynamic systems. In this paper, we present an easy-to-implement but efficient method to find suitable end-to-end routes that are capable of transporting different sizes of the application data packets. Our scheme is stateless and does not rely on the underlying data link and physical layers. An extensive simulation shows the validity of our concept and highlights the improvement achieved by our proposal.},
keywords={},
doi={10.1093/ietcom/e91-b.7.2244},
ISSN={1745-1345},
month={July},}
Copier
TY - JOUR
TI - Packet Size Based Routing for Stable Data Delivery in Mobile Ad-Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2244
EP - 2254
AU - Ashiq KHAN
AU - Toshihiro SUZUKI
AU - Motonari KOBAYASHI
AU - Wataru TAKITA
AU - Kenichi YAMAZAKI
PY - 2008
DO - 10.1093/ietcom/e91-b.7.2244
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2008
AB - In Mobile Ad-hoc Networks (MANET), transportation capability of wireless links' varies according to the size of the packets they transport. This instability, which is more acute in long links, has received little attention in the stabilizing schemes proposed so far for MANET. A lot of research has been carried out to utilize more reliable links in making end-to-end routes to avoid frequent route failures and realize higher packet delivery ratio. However, these approaches mainly consider the availability of a link over time and depend on link history which is difficult to acquire in highly dynamic systems. In this paper, we present an easy-to-implement but efficient method to find suitable end-to-end routes that are capable of transporting different sizes of the application data packets. Our scheme is stateless and does not rely on the underlying data link and physical layers. An extensive simulation shows the validity of our concept and highlights the improvement achieved by our proposal.
ER -