Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Stochastic properties of the random waypoint mobility model
Wireless Networks
Distribution of path durations in mobile ad-hoc networks: Palm's theorem to the rescue
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Delay management in delay-tolerant networks
International Journal of Network Management
A survey of message diffusion protocols in mobile ad hoc networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
DTN support for news dissemination in an urban area
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
DTN support for news dissemination in an urban area
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly different mobility patterns. We introduce and study the notion of relay throughput, i.e. the maximum rate at which a node can relay data from the source to the destination. Our findings include the results that (a) the relay throughput depends on the node mobility pattern only via its (stationary) node position distribution, and (b) that a node mobility pattern that results in a uniform steady-state distribution for all nodes achieves the lowest relay throughput. Random waypoint and random direction mobility models in both one and in two dimensions are studied and approximate simple expressions for the relay throughput are provided. Finally, the behavior of the relay buffer occupancy is examined for the random walk and random direction mobility models. For both models, the explicit form of the mean buffer is provided in the heavy-traffic case.