Advanced Search

Scaling Laws for Heterogeneous Wireless Networks

Research and Teaching Output of the MIT Community

Show simple item record Niesen, Urs 2009-09-15T14:02:56Z 2009-09-15T14:02:56Z 2009-09-15T14:02:56Z
dc.description Thesis Supervisor: Devavrat Shah Title: Associate Professor Thesis Supervisor: Gregory W. Wornell Title: Professor en
dc.description.abstract This thesis studies the problem of determining achievable rates in heterogeneous wireless networks. We analyze the impact of location, traffic, and service heterogeneity. Consider a wireless network with n nodes located in a square area of size n communicating with each other over Gaussian fading channels. Location heterogeneity is modeled by allowing the nodes in the wireless network to be deployed in an arbitrary manner on the square area instead of the usual random uniform node placement. For traffic heterogeneity, we analyze the n × n dimensional unicast capacity region. For service heterogeneity, we consider the impact of multicasting and caching. This gives rise to the n × 2n dimensional multicast capacity region and the 2n × n dimensional caching capacity region. In each of these cases, we obtain an explicit informationtheoretic characterization of the scaling of achievable rates by providing a converse and a matching (in the scaling sense) communication architecture. en
dc.description.sponsorship National Science Foundation. DARPA, and Hewlett-Packard under the MIT/HP Alliance. en
dc.language.iso en_US en
dc.relation.ispartofseries Technical Report (Massachusetts Institute of Technology, Research Laboratory of Electronics);729
dc.title Scaling Laws for Heterogeneous Wireless Networks en
dc.type Technical Report en

Files in this item

Name Size Format Description
main_3.pdf 1.066Mb PDF

This item appears in the following Collection(s)

Show simple item record