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
소스 S에서 목적지 D까지 메시지 M이 전달되기까지의 대기 시간 분석은 이동 다중 홉 네트워크의 기초 연구에서 중요한 문제인 연결성 분석과 깊은 관련이 있습니다. [1]에서는 M을 전달하는 두 가지 방법의 평균 대기 시간을 최소 대기 시간의 평균값과 비교했습니다. 평균 최소대기시간은 이론적으로 분석하기 위한 두 가지 방법이 있지만 평균의 이론적 분석이 쉽지 않기 때문에 컴퓨터 시뮬레이션을 통해 구하였다. 본 논문에서는 XNUMX차원 거리 네트워크에서 평균 최소 대기 시간을 이론적으로 분석하기 위한 근사 방법을 제안하고, 이 방법이 평균 최소 대기 시간에 대한 좋은 근사치를 제공함을 보여줍니다. 또한 교차점에서 이동 노드의 그림자 현상과 방향 변화를 XNUMX차원 거리 네트워크에서 발생하는 부정적인 요인으로 간주합니다. 위의 방법을 확장하여 이러한 요소를 고려한 평균 최소 대기 시간을 계산하고, 평균 최소 대기 시간이 이러한 요소에 의해 어떻게 영향을 받는지 논의합니다.
모바일 멀티홉 네트워크, 연결, 유동성, 전염병 라우팅
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.
부
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
부
@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},}
부
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 -