Seminar: Scaling Laws for Heterogeneous Wireless Networks

For NYU Community

Speaker: Dr. Urs Niesen

Faculty Host: Prof. Shivendra Panwar


We consider 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 of area 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*2^n-dimensional multicast capacity region and the 2^n*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.


Urs Niesen received a M.S. degree from the School of Computer and Communication Sciences at the Ecole Polytechnique Federale de Lausanne (EPFL) in 2005 and a Ph.D. degree from the department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT) in 2009. He is currently a member of technical staff at Alcatel-Lucent Bell Labs. His research interests are in the area of communication and information theory.