Scaling laws for heterogeneous wireless networks
Name
603543063-MIT.pdf
Description
Full printable version
Size
12.6 MB
Format
Adobe PDF
Checksum (MD5)
19df1f22efe3408188cf8f6227e2c4f6
Author(s)
Niesen, Urs
Advisor(s)
Devavrat Shah and Gregory W. Wornell.
Date Issued
2009
Publisher
Massachusetts Institute of Technology
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 x n dimensional unicast capacity region. For service heterogeneity, we consider the impact of multicasting and caching. This gives rise to the n x 2n dimensional multicast capacity region and the 2" x n dimensional caching capacity region. In each of these cases, we obtain an explicit information-theoretic characterization of the scaling of achievable rates by providing a converse and a matching (in the scaling sense) communication architecture.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 211-215).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
Persistent DSpace Link
