Capacity-delay scaling in arbitrary wireless networks

43rd Annual Allerton Conference on Communication, Control and Computing 2005

Volumn 3, Issue , 2005, Pages 1463-1472

  Madan, Ritesh ^a   Shah, Devavrat ^b  

^a STANFORD UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Scaling laws; Spectral graph theory; Throughput scaling; Throughput delay trade off; Wireless networks

Indexed keywords

EID: 84962091357     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. S. N. Diggavi, M. Grossglauser and D. Tse, "Even One-Dimensional Mobility Increases Ad Hoc Wireless Capacity" In Proc. of IEEE ISIT, Laussane, Switzerland, July 2002.
2. A. El Gamal, J. Mammen, B. Prabhakar, D. Shah, "Throughput-Delay Trade-off in Wireless Networks", In Proc. of IEEE INFOCOM, Hong Kong, 2004.
3. A. El Gamal, J. Mammen, B. Prabhakar, D. Shah, "Optimal Throughput-Delay Trade-off in Energy Constrained Wireless Networks ", IEEE ISIT, pp. 439, Chicago, 2004.
4. A. El Gamal, J. Mammen, B. Prabhakar, D. Shah, "Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets", Submitted, 2005.
5. A. El Gamal, J. Mammen, B. Prabhakar, D. Shah, "Optimal Throughput-Delay Trade-off in Wireless Networks - Part I: The Fluid Model ", Submitted, 2005.
6. M. Grossglauser and D. Tse, "Mobility Increases the Capacity of Ad-hoc Wireless Networks", In Prof. of IEEE INFOCOM, Anchorage, Alaska, pp. 1360-1369, 2001.
7. P Diaconis and DW Stroock, "Geometric bounds for reversible Markov chains", Annals of Applied Probability, 1991.
8. P. Gupta and P. R. Kumar, "The Capacity of Wireless Networks", IEEE Trans. on Information Theory, 46 (2), pp. 388-404, March 2000.
9. S. R. Kulkarni and P. Viswanath, "A Deterministic Approach to Throughput Scaling in Wireless Networks", IEEE Trans. on Information Theory, 50 (6), pp. 1041-1049, June 2004.
10. FT Leighton and S Rao, " An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms", FOCS, 1988.
11. L. G. Valiant and G. J. Brebner, "Universal schemes for parallel communication". In Proceedings of ACM STOC, 1981.
12. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Mixing Times for Random Walks on Geometric Random Graphs", SIAM ANALCO, 2005.
13. D. Mosk-Aoyama and D. Shah, "Information Dissemination via Gossip: Applications to Averaging and Coding". available at http:// www.arXiv.org /cs.NI/0504029.
14. A. Sinclair, " Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow Alistair Sinclair, Combinatorics, Probability and Computing 1, 1992.