Communication over a wireless network with random connections

IEEE Transactions on Information Theory

Volumn 52, Issue 7, 2006, Pages 2857-2871

  Gowaikar, Radhika ^a   Hochwald, Bertrand ^b   Hassibi, Babak ^a  

^a California Institute of Technology   (United States)

^b Beceem Communications Inc   (United States)

Author keywords

Ad hoc networks; Random connections; Throughput

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); MATHEMATICAL MODELS; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

AD-HOC NETWORKS; AGGREGATE TRAFFIC FLOW; CHANNEL DISTRIBUTION; RANDOM CONNECTIONS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33746926344     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.876254     Document Type: Article

References (29)

1. F. Baccelli, M. Klein, M. Lebourges, and S. Zuyev, "Stochastic geometry and architecture of communication networks," J. Telecommun. Syst., vol. 7, pp. 209-227, 1997.
2. B. Bollobás, Random Graphs, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2001.
3. O. Dousse and P. Thiran, "Connectivity versus capacity in dense ad hoc networks," in Proc. 23rd INFOCOM, Hong Kong, Mar. 2004, pp. 476-486.
4. G. J. Foschini, "Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas," Bell Labs. Tech. J., vol. 1, no. 2, pp. 41-59, 1996.
5. M. Gastpar and M. Vetterli, "On the capacity of wireless networks: The relay case," in Proc. 21st INFOCOM, New York, Jun. 2002, pp. 1577-1586.
6. M. Grossglauser and D. Tse, "Mobility increases the capacity of ad-hoc wireless networks," IEEE/ACM Trans. Netw., vol. 10, no. 4, pp. 477-486, Aug. 2002.
7. R. Hekmat and P. van Mieghem, "Degree distribution and hopcount in wireless ad-hoc networks," in Proc. 11th IEEE Int. Conf. on Networks (ICON), Sydney, Australia, Sep. 2003, pp. 603-609.
8. R. Hekmat and P. V. Mieghem, "Study of connectivity in wireless ad-hoc networks with an improved radio model," in Proc. 2nd Workshop on Model. and Optim. in Mobile, Ad Hoc and Wireless Networks, Cambridge, U.K., Mar. 2004, pp. 142-151.
9. O. Léveque and E. Telatar, "Information theoretic upper bounds on the capacity of large extended ad-hoc wireless networks," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 858-865, Mar. 2005.
10. M. Franceschetti, O. Dousse, D. N. C. Tse, and P. Thiran, "On the throughput capacity of random wireless networks," IEEE Trans. Inf. Theory, 2004, submitted for publication.
11. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 3, pp. 388-404, Mar. 2000.
12. P. Gupta and P. R. Kumar, "Toward an information theory of large networks: An achievable rate region," IEEE Trans. Inf. Theory, vol. 49, no. 8, pp. 1877-1894, Aug. 2003.
13. I. E. Telatar, "Capacity of multi-antenna Gaussian channels," Eur. Trans. Telecom., vol. 10, pp. 585-595, Nov. 1999.
14. O. Tonguz and G. Ferrari, "Connectivity and transport capacity in ad hoc wireless networks," in Proc. 32nd IEEE Communication Theory Workshop, Mesa, AZ, Apr. 2003.
15. L.-L. Xie and P. R. Kumar, "A network information theory for wireless communication: Scaling laws and optimal operation," IEEE Trans. Inf. Theory, vol. 50, no. 5, pp. 748-767, May 2004.
16. S. Toumpis and A. Goldsmith, "Capacity bounds for large wireless networks under fading and node mobility," in Proc. 41st Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2003, pp. 1369-1378.
17. S. Weber, X. Yang, J. Andrews, and G. de Veciana, "Transmission capacity of wireless ad hoc networks with outage constraints," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4091-4102, Dec. 2005.
18. F. Chung and L. Lu, "The diameter of random sparse graphs," Adv. Appl. Math., vol. 26, pp. 257-279, 2001.
19. A. Z. Broder, A. M. Frieze, S. Suen, and E. Upfal, "An efficient algorithm for the vertex-disjoint paths problem in random graphs," in Proc 7th Symp. Discrete Algorithms, Atlanta, GA, 1996, pp. 261-268.
20. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press, 2001.
21. J. M. Abram and I. B. Rhodes, "Some shortest path algorithms with decentralized information and communication requirements," IEEE Trans. Autom. Control, vol. AC-27, no. 3, pp. 570-582, Jun. 1982.
22. F. Xue, L.-L. Xie, and P. R. Kumar, "The transport capacity of wireless networks over fading channels," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 834-847, Mar. 2005.
23. A. Jovicic, P. Viswanath, and S. R. Kulkarni, "Upper bounds to transport capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2555-2565, Nov. 2004.
24. D. Miorandi and E. Altman, "Coverage and connectivity of ad hoc networks presence of channel randomness," in Proc. IEEE INFOCOM 2005, pp. 491-502.
25. P. Balister, B. Bollobás, and M. Walters, "Continuum percolation with steps in an annulus," Ann. Appl. Probab., vol. 14, no. 4, pp. 1869-1879, 2004.
26. M. Franceschetti, L. Booth, M. Cook, J. Bruck, and R. Meester, "Continuum percolation with unreliable and spread out connections," J. Statist. Phys., vol. 118, no. 3/4, Feb. 2005.
27. R. Gowaikar, B. Hochwald, and B. Hassibi, "An achievability result for random networks," in Proc. IEEE ISIT 2005, Adelaide, Australia, pp. 946-950.
28. R. Gowaikar and B. Hassibi, "On the achievable throughput in two-scale wireless networks," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, to be published.
29. M. Penrose, Random Geometric Graphs. Oxford, U.K.: Oxford Univ. Press, 2003.