Scaling Laws for Heterogeneous Wireless Networks

Friday, February 12, 2010
ENS 637

Abstract:We consider the problem of determining achievable rates inheterogeneous wireless networks. We analyze the impact of location,traffic, and service heterogeneity. Consider a wireless network with nnodes located in a square of area n communicating with each other overGaussian fading channels. Location heterogeneity is modeled byallowing the nodes in the wireless network to be deployed in anarbitrary manner on the square area instead of the usual randomuniform node placement. For traffic heterogeneity, we analyze then*n-dimensional unicast capacity region. For service heterogeneity, weconsider the impact of multicasting and caching. This gives rise tothe n*2^n-dimensional multicast capacity region and the 2^n*n-dimensional caching capacity region. In each of these cases, we obtainan explicit information-theoretic characterization of the scaling ofachievable rates by providing a converse and a matching (in thescaling sense) communication architecture.

Biography:Urs Niesen received the M.S. degree from the School of Computer andCommunication Sciences at the Ecole Polytechnique Federale de Lausanne(EPFL) in 2005 and the Ph.D. degree from the department of ElectricalEngineering and Computer Science at the Massachusetts Institute ofTechnology (MIT) in 2009. He is currently a member of technical staffat Alcatel-Lucent Bell Labs. His research interests are in the areas ofcommunication and information theory.


Alcatel-Lucent Bell Labs