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
A análise do tempo de espera para entregar uma mensagem M de uma origem S para um destino D está profundamente relacionada à análise de conectividade, que é uma questão importante em estudos fundamentais de redes móveis multi-hop. Em [1], comparamos os tempos médios de espera de dois métodos para entregar M com o valor médio do tempo mínimo de espera. A média do tempo mínimo de espera foi obtida por simulação computacional porque a análise teórica desta média não é fácil, embora outros dois métodos tenham sido analisados teoricamente. Neste artigo, propomos um método aproximado para analisar teoricamente o tempo mínimo de espera médio em uma rede viária unidimensional e mostramos que este método fornece uma boa aproximação do tempo mínimo de espera médio. Além disso, consideramos o sombreamento e a mudança de direção dos nós móveis nas interseções como fatores negativos que surgem em redes viárias bidimensionais. Estendemos o método acima para calcular o tempo mínimo de espera médio considerando esses fatores e discutimos como o tempo mínimo de espera médio é afetado por esses fatores.
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.
Copiar
Keisuke NAKANO, Kazuyuki MIYAKITA, Akira OTSUKA, Masakazu SENGOKU, Shoji SHINODA, "Analysis of Mean Waiting Time for Delivery of a Message in Mobile Multi-Hop Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 9, pp. 2236-2247, September 2009, doi: 10.1587/transfun.E92.A.2236.
Abstract: Analysis of waiting time to deliver a message M from a source S to a destination D is deeply related to connectivity analysis, which is an important issue in fundamental studies of mobile multi-hop networks. In [1], we compared the mean waiting times of two methods to deliver M with the mean value of the minimum waiting time. The mean minimum waiting time was obtained by computer simulation because theoretical analysis of this mean is not easy, although another two methods were analyzed theoretically. In this paper, we propose an approximate method to theoretically analyze the mean minimum waiting time in a one-dimensional street network, and show that this method gives a good approximation of the mean minimum waiting time. Also, we consider shadowing and change of directions of mobile nodes at intersections as negative factors arising in two-dimensional street networks. We extend the above method to compute the mean minimum waiting time considering these factors, and discuss how the mean minimum waiting time is affected by these factors.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2236/_p
Copiar
@ARTICLE{e92-a_9_2236,
author={Keisuke NAKANO, Kazuyuki MIYAKITA, Akira OTSUKA, Masakazu SENGOKU, Shoji SHINODA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Analysis of Mean Waiting Time for Delivery of a Message in Mobile Multi-Hop Networks},
year={2009},
volume={E92-A},
number={9},
pages={2236-2247},
abstract={Analysis of waiting time to deliver a message M from a source S to a destination D is deeply related to connectivity analysis, which is an important issue in fundamental studies of mobile multi-hop networks. In [1], we compared the mean waiting times of two methods to deliver M with the mean value of the minimum waiting time. The mean minimum waiting time was obtained by computer simulation because theoretical analysis of this mean is not easy, although another two methods were analyzed theoretically. In this paper, we propose an approximate method to theoretically analyze the mean minimum waiting time in a one-dimensional street network, and show that this method gives a good approximation of the mean minimum waiting time. Also, we consider shadowing and change of directions of mobile nodes at intersections as negative factors arising in two-dimensional street networks. We extend the above method to compute the mean minimum waiting time considering these factors, and discuss how the mean minimum waiting time is affected by these factors.},
keywords={},
doi={10.1587/transfun.E92.A.2236},
ISSN={1745-1337},
month={September},}
Copiar
TY - JOUR
TI - Analysis of Mean Waiting Time for Delivery of a Message in Mobile Multi-Hop Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2236
EP - 2247
AU - Keisuke NAKANO
AU - Kazuyuki MIYAKITA
AU - Akira OTSUKA
AU - Masakazu SENGOKU
AU - Shoji SHINODA
PY - 2009
DO - 10.1587/transfun.E92.A.2236
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2009
AB - Analysis of waiting time to deliver a message M from a source S to a destination D is deeply related to connectivity analysis, which is an important issue in fundamental studies of mobile multi-hop networks. In [1], we compared the mean waiting times of two methods to deliver M with the mean value of the minimum waiting time. The mean minimum waiting time was obtained by computer simulation because theoretical analysis of this mean is not easy, although another two methods were analyzed theoretically. In this paper, we propose an approximate method to theoretically analyze the mean minimum waiting time in a one-dimensional street network, and show that this method gives a good approximation of the mean minimum waiting time. Also, we consider shadowing and change of directions of mobile nodes at intersections as negative factors arising in two-dimensional street networks. We extend the above method to compute the mean minimum waiting time considering these factors, and discuss how the mean minimum waiting time is affected by these factors.
ER -