Capacity results for asymmetric wireless networks

International Zurich Seminar on Digital Communications

Volumn , Issue , 2004, Pages 180-183

  Toumpis, S ^a   Goldsmith, A J ^b   Sayir, J ^a  

^a TELECOMMUNICATIONS RESEARCH CENTER VIENNA FTW   (Austria)

^b Stanford University   (United States)

Author keywords

Asymmetric traffic; Capacity; Wireless ad hoc networks

Indexed keywords

ASYMMETRIC TRAFFIC; CAPACITY; CHANNEL FADING; WIRELESS AD HOC NETWORKS;

ACTUATORS; BANDWIDTH; ELECTRICAL ENGINEERING; PROBABILITY; PROBLEM SOLVING; TELECOMMUNICATION TRAFFIC; THEOREM PROVING; THROUGHPUT; TRANSMISSIONS; TRANSMITTERS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 2442625714     PISSN: None     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 Trans. Inform. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
2. U. C. Kozat and L. Tassiulas, "Throughput capacity of random ad hoc networks with infrastructure support," in Proc. ACM MobiCom, San Diego, CA, Sep. 2003, pp. 55-65.
3. S. Toumpis and A. J. Goldsmith, "Large wireless networks under fading, mobility, and delay constraints," in Proc. IEEE INFOCOM, Hong Kong, China, Mar 2004.
4. _, "Capacity results for three types of wireless ad hoc networks," under preparation for submission to journal publication, available at http:///userver.ftw.at/~toumpis.
5. S. Toumpis, "Capacity of wireless ad hoc networks," Ph.D. dissertation, Stanford University, 2003.
6. R. Motwani and P. Raghavan, Randomized Algorithms, 1st ed. Cambridge, UK: Cambridge University Press, 1995.