Scaling laws for capacity and delay in wireless ad hoc networks with random mobility
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7, 3869-3873 Vol.7
- https://doi.org/10.1109/icc.2004.1313277
Abstract
We study the asymptotic throughput capacity and delay in mobile ad hoc networks following the 2-hop relaying algorithm proposed by Grossglauser and Tse (2001). We assume the nodes to be uniformly distributed on a sphere, and consider two canonical mobility models: the Brownian mobility model (BMM), and the random way-point mobility model (RWMM). We show that for an ad hoc network formed by n mobile nodes the delay scales as O (log/sup 2/n//spl sigma//sup 2/(n)) under the BMM, and, /spl Theta/ (1/r(n)v(n)) under the RWMM, where /spl sigma//sup 2/(n) is the variance parameter of the BMM, v(n) is the average speed of nodes under the RWMM, and r(n) is the communication radius of the nodes.Keywords
This publication has 6 references indexed in Scilit:
- Delay limited capacity of ad hoc networks: asymptotically optimal transmission and relaying strategyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Capacity, delay and mobility in wireless ad-hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A survey of mobility models for ad hoc network researchWireless Communications and Mobile Computing, 2002
- Multipath routing in the presence of frequent topological changesIEEE Communications Magazine, 2001
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- A Particle Migrating Randomly on a SphereJournal of Theoretical Probability, 1997