IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Multi-dimensional Mobile Information Networks
Analysis of Mean Waiting Time for Delivery of a Message in Mobile Multi-Hop Networks
Keisuke NAKANOKazuyuki MIYAKITAAkira OTSUKAMasakazu SENGOKUShoji SHINODA
Author information
JOURNALS RESTRICTED ACCESS

2009 Volume E92.A Issue 9 Pages 2236-2247

Details
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.

Information related to the author
© 2009 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top