Scaling laws in random heterogeneous networks

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 369-

  Reznik, Alex ^a,b   Kulkarni, Sanjeev R ^c   Verdú, Sergio ^c  

^a INTERDIGITAL COMMUNICATIONS   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM NETWORKS; RANDOM VARIABLES; SCALING LAWS; WIRELESS AD-HOC NETWORKS;

CELLULAR RADIO SYSTEMS; RANDOM PROCESSES; TELECOMMUNICATION LINKS; THEOREM PROVING; WIRELESS TELECOMMUNICATION SYSTEMS;

TELECOMMUNICATION NETWORKS;

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

References (6)

1. P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, IT-46:388-404, March 2000.
2. M. Kaufman, J. F. Sibeyn, and T. Suel. Derandornizing routing and sorting algorithms for meshes. In Proc. 5th Symp. on Discrete Algorithms. LNCS, Springer-Verlag, 1995.
3. S. R. Kulkarni and P. Viswanath. A deterministic approach to throughput scaling in wireless networks. IEEE Transactions on Information Theory, to appear.
4. S. R. Kulkarni and P. Viswanath. Throuhgput scaling in heterogeneous networks. In Proc. 2003 Int. Symp. on Information Theory.
5. M. Kunde. Block gossiping on grids and tori: deterministic sorting and routing match the bisection bound. In Proc. European Symp. on Algorithms, pages 260-271, 1991.
6. B. Liu, Z. Liu, and D. Towsley. On the capacity of hybrid wireless networks. In Proc. INFOCOM 2003.