On Achievable Delay / Capacity Trade-offs in Mobile Ad Hoc Networks

@inproceedings{Sharma2004OnAD,
  title={On Achievable Delay / Capacity Trade-offs in Mobile Ad Hoc Networks},
  author={Gaurav Sharma and R. R. Mazumdar},
  year={2004}
}
Recent work of Gupta and Kumar (2000) has shown that in a multi-hop wireless network the throughput capacity per source-destination pair goes to zero as the node density increases. While it has been shown that a constant throughput scaling per source-destination pair can be achieved in mobile ad hoc networks, the delay related aspects have not been considered in detail. In this paper, we study the delay-capacity trade-off in mobile ad hoc networks. We consider two canonical random mobility… CONTINUE READING
Highly Cited
This paper has 86 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 58 extracted citations

86 Citations

051015'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 86 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Improved delay-capacity trade-off in large mobile ad hoc networks

  • X. Lin, N. B. Shroff
  • 2003
2 Excerpts

Multipath routing in presence of frequent topological changes

  • A.Tsirigos, Z. J. Haas
  • IEEE Communications Magazine,
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…