Scaling laws for capacity and delay in wireless ad hoc networks with random mobility

@article{Sharma2004ScalingLF,
  title={Scaling laws for capacity and delay in wireless ad hoc networks with random mobility},
  author={Gaurav Sharma and Ravi Mazumdar},
  journal={2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)},
  year={2004},
  volume={7},
  pages={3869-3873 Vol.7}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 82 CITATIONS, ESTIMATED 32% COVERAGE

FILTER CITATIONS BY YEAR

2004
2018

CITATION STATISTICS

  • 9 Highly Influenced Citations

  • Averaged 2 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

Delay and Capacity Trade-offs in Wireless Ad Hoc Networks with Random Mobility

  • G. Sharma, R. R. Mazumdar
  • Preprint, School of ECE, Purdue University
  • 2004
Highly Influential
4 Excerpts

LaMaire, On the Capture Probability of Large Number of Stations

  • B. Hajek, R.O.A. Krishna
  • IEEE Transactions on Information Theory,
  • 2000
1 Excerpt

Stochastic Processes

  • S. Ross
  • Wiley, New York
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…