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
Dalam rangkaian multi-hop mudah alih, nod sumber S dan nod destinasi D kadangkala menghadapi situasi di mana tiada laluan multi-hop antara mereka apabila mesej M, ditakdirkan untuk D, tiba di S. Dalam situasi ini, kami tidak boleh menghantar M dari S ke D serta-merta; namun, kami boleh menghantar M ke D selepas menunggu beberapa lama dengan bantuan dua keupayaan mobiliti. Salah satu keupayaan adalah untuk membina laluan multi-hop yang disambungkan dengan menukar topologi rangkaian semasa masa menunggu (Keupayaan 1), dan satu lagi adalah untuk mengalihkan M lebih dekat kepada D semasa masa menunggu (Keupayaan 2). Dalam kertas ini, kami mempertimbangkan tiga kaedah untuk menyampaikan M dari S ke D dengan menggunakan keupayaan ini dengan cara yang berbeza. Kaedah 1 menggunakan Keupayaan 1 dan menghantar M dari S ke D selepas menunggu sehingga laluan multi-hop yang disambungkan muncul antara S dan D. Kaedah 2 menggunakan Keupayaan 2 dan menghantar M ke D dengan membenarkan nod mudah alih membawa M dari S ke D. Kaedah 3 adalah gabungan Kaedah 1 dan 2 dan meminimumkan masa menunggu. Kami menilai dan membandingkan ketiga-tiga kaedah ini dari segi purata masa menunggu, dari masa M tiba di S hingga masa D mula menerima M, sebagai pendekatan baharu untuk penilaian ketersambungan. Kami menganggap rangkaian multi-hop mudah alih satu dimensi yang terdiri daripada nod mudah alih yang mengalir ke arah bertentangan di sepanjang jalan. Pertama, kami memperoleh beberapa persamaan anggaran dan mencadangkan kaedah anggaran untuk mengira min masa menunggu Kaedah 1. Kedua, kami secara teori menganalisis purata masa menunggu Kaedah 2, dan mengira sempadan bawah Kaedah 3. Dengan membandingkan ketiga-tiga kaedah di bawah andaian yang sama menggunakan hasil analisis dan beberapa keputusan simulasi, kami menunjukkan hubungan antara masa menunggu min kaedah ini dan menunjukkan bagaimana Keupayaan 1 dan 2 memberi kesan berbeza kepada purata masa menunggu.
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.
Salinan
Keisuke NAKANO, Kazuyuki MIYAKITA, Masakazu SENGOKU, Shoji SHINODA, "Analysis and Relative Evaluation of Connectivity of a Mobile Multi-Hop Network" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 6, pp. 1874-1885, June 2008, doi: 10.1093/ietcom/e91-b.6.1874.
Abstract: In mobile multi-hop networks, a source node S and a destination node D sometimes encounter a situation where there is no multi-hop path between them when a message M, destined for D, arrives at S. In this situation, we cannot send M from S to D immediately; however, we can deliver M to D after waiting some time with the help of two capabilities of mobility. One of the capabilities is to construct a connected multi-hop path by changing the topology of the network during the waiting time (Capability 1), and the other is to move M closer to D during the waiting time (Capability 2). In this paper, we consider three methods to deliver M from S to D by using these capabilities in different ways. Method 1 uses Capability 1 and sends M from S to D after waiting until a connected multi-hop path appears between S and D. Method 2 uses Capability 2 and delivers M to D by allowing a mobile node to carry M from S to D. Method 3 is a combination of Methods 1 and 2 and minimizes the waiting time. We evaluate and compare these three methods in terms of the mean waiting time, from the time when M arrives at S to the time when D starts receiving M, as a new approach to connectivity evaluation. We consider a one-dimensional mobile multi-hop network consisting of mobile nodes flowing in opposite directions along a street. First, we derive some approximate equations and propose an estimation method to compute the mean waiting time of Method 1. Second, we theoretically analyze the mean waiting time of Method 2, and compute a lower bound of that of Method 3. By comparing the three methods under the same assumptions using results of the analyses and some simulation results, we show relations between the mean waiting times of these methods and show how Capabilities 1 and 2 differently affect the mean waiting time.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.6.1874/_p
Salinan
@ARTICLE{e91-b_6_1874,
author={Keisuke NAKANO, Kazuyuki MIYAKITA, Masakazu SENGOKU, Shoji SHINODA, },
journal={IEICE TRANSACTIONS on Communications},
title={Analysis and Relative Evaluation of Connectivity of a Mobile Multi-Hop Network},
year={2008},
volume={E91-B},
number={6},
pages={1874-1885},
abstract={In mobile multi-hop networks, a source node S and a destination node D sometimes encounter a situation where there is no multi-hop path between them when a message M, destined for D, arrives at S. In this situation, we cannot send M from S to D immediately; however, we can deliver M to D after waiting some time with the help of two capabilities of mobility. One of the capabilities is to construct a connected multi-hop path by changing the topology of the network during the waiting time (Capability 1), and the other is to move M closer to D during the waiting time (Capability 2). In this paper, we consider three methods to deliver M from S to D by using these capabilities in different ways. Method 1 uses Capability 1 and sends M from S to D after waiting until a connected multi-hop path appears between S and D. Method 2 uses Capability 2 and delivers M to D by allowing a mobile node to carry M from S to D. Method 3 is a combination of Methods 1 and 2 and minimizes the waiting time. We evaluate and compare these three methods in terms of the mean waiting time, from the time when M arrives at S to the time when D starts receiving M, as a new approach to connectivity evaluation. We consider a one-dimensional mobile multi-hop network consisting of mobile nodes flowing in opposite directions along a street. First, we derive some approximate equations and propose an estimation method to compute the mean waiting time of Method 1. Second, we theoretically analyze the mean waiting time of Method 2, and compute a lower bound of that of Method 3. By comparing the three methods under the same assumptions using results of the analyses and some simulation results, we show relations between the mean waiting times of these methods and show how Capabilities 1 and 2 differently affect the mean waiting time.},
keywords={},
doi={10.1093/ietcom/e91-b.6.1874},
ISSN={1745-1345},
month={June},}
Salinan
TY - JOUR
TI - Analysis and Relative Evaluation of Connectivity of a Mobile Multi-Hop Network
T2 - IEICE TRANSACTIONS on Communications
SP - 1874
EP - 1885
AU - Keisuke NAKANO
AU - Kazuyuki MIYAKITA
AU - Masakazu SENGOKU
AU - Shoji SHINODA
PY - 2008
DO - 10.1093/ietcom/e91-b.6.1874
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2008
AB - In mobile multi-hop networks, a source node S and a destination node D sometimes encounter a situation where there is no multi-hop path between them when a message M, destined for D, arrives at S. In this situation, we cannot send M from S to D immediately; however, we can deliver M to D after waiting some time with the help of two capabilities of mobility. One of the capabilities is to construct a connected multi-hop path by changing the topology of the network during the waiting time (Capability 1), and the other is to move M closer to D during the waiting time (Capability 2). In this paper, we consider three methods to deliver M from S to D by using these capabilities in different ways. Method 1 uses Capability 1 and sends M from S to D after waiting until a connected multi-hop path appears between S and D. Method 2 uses Capability 2 and delivers M to D by allowing a mobile node to carry M from S to D. Method 3 is a combination of Methods 1 and 2 and minimizes the waiting time. We evaluate and compare these three methods in terms of the mean waiting time, from the time when M arrives at S to the time when D starts receiving M, as a new approach to connectivity evaluation. We consider a one-dimensional mobile multi-hop network consisting of mobile nodes flowing in opposite directions along a street. First, we derive some approximate equations and propose an estimation method to compute the mean waiting time of Method 1. Second, we theoretically analyze the mean waiting time of Method 2, and compute a lower bound of that of Method 3. By comparing the three methods under the same assumptions using results of the analyses and some simulation results, we show relations between the mean waiting times of these methods and show how Capabilities 1 and 2 differently affect the mean waiting time.
ER -