Paper Info
Title
Theoretical Analysis of Mean Waiting Time for Message Delivery in Lattice Ad Hoc Networks
Abstract
In ad hoc networks, the analysis of connectivity performance is crucial. The waiting time to deliver message M from source S to destination D is a measure of connectivity that reflects the effects of mobility, and some approximate methods have been proposed to theoretically analyze the mean waiting time in one-dimensional ad hoc networks that consist of mobile nodes moving along a street. In this paper, we extend these approximate methods to analyze the mean waiting time in two-dimensional networks with a lattice structure with various flows of mobile nodes. We discuss how the mean waiting times behave in such complicated street networks and how to approximate two kinds of mean waiting times. We show that our approximate methods can successfully compute the mean waiting times for even traffic patterns and roughly estimate them for uneven traffic patterns in two-dimensional lattice networks. In these analyses, we consider two shadowing models to investigate how shadowing affects the waiting time. We also discuss the effect of different positions of S on the mean waiting time.
Year
DOI
Venue
2010
10.1142/S0218126610007006
JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS
Keywords
Field
DocType
Ad hoc network,connectivity,mobility,epidemic routing
Lattice (order),Computer science,Computer network,Message delivery,Wireless ad hoc network,Distributed computing
Journal
Volume
Issue
ISSN
19
8
0218-1266
Citations 
PageRank 
References 
0
0.34
5
Authors
3
Name
Order
Citations
PageRank
Akira Otsuka125836.20
Keisuke Nakano221224.62
Kazuyuki Miyakita3114.11