How many simultaneous users with a minimum rate requirement can a wireless network support under fading conditions?

Add to your list(s) Download to your calendar using vCal

• Professor Ravi R. Mazumdar, University of Waterloo, Canada
• Monday 15 December 2014, 13:30-14:30
• EEE Department, Room 611.

If you have a question about this talk, please contact Kin K Leung.

Traditionally capacity issues in wireless systems have been posed as finding the maximum rate that is supportable under a given power budget. A simple solution to this problem is to transmit to the user with the best channel at maximum power and the rate is determined by the best channel gain. However, in practice users have delay tradeoffs in that they have minimum rate requirements that will allow them to obtain guarantees on delays when they have channel access. Meeting minimum rate guarantees opens up power to be shared amongst users who can achieve their minimum rates and thus more than one user can be allowed.

In the talk I will begin by presenting the case of broadcast and multiple access channels with independent Rayleigh fading channels where the scaling law for the number of simultaneous channels that can support a minimum rate is of the order of log log n where n is the number of users.

We will then consider the case of random wireless networks with n transmitter-receiver pairs that are uniformly distributed over a region and where path loss attenuation now plays a role in the interference. In this case the number of simultaneous transmitter-receiver pairs that can support a minimum rate is of the order n^1/4, for n large, which is substantially larger.

The results follow from the order statistics of both light-tailed and heavy-tailed random variables, and strong typicality or concentration.

Joint work with Hengameh Keshavarz (USB, Iran) and Rahul Roy (Indian Statistical Institute)

Biography: The speaker was educated at the Indian Institute of Technology, Bombay (B.Tech, 1977), Imperial College, London (MSc, DIC , 1978) and UCLA (PhD, 1983).

He is currently a University Research Chair Professor in the Dept. of ECE at the University of Waterloo, Ont., Canada where he has been since September 2004. Prior to this he was Professor of ECE at Purdue University, West Lafayette, USA . Since 2012 he is a D.J. Gandhi Distinguished Visiting Professor at the Indian Institute of Technology, Bombay, India.

He is a Fellow of the IEEE and the Royal Statistical Society. He is a recipient of the INFOCOM 2006 Best Paper Award and was runner-up for the Best Paper Award at INFOCOM 1998 . He has served as an editor of the IEEE /ACM Trans on Networking (2004-09) and a currently a Senior Editor of the IEEE Journal on Selected Areas in Communications (J-SAC). He is the author of a recent monograph on point processes and stochastic networks with applications to statistical multiplexing published by Morgan and Claypool, San Francisco.

His current research interests are in network science, complex systems, and distributed inference.

This talk is part of the Featured talks series.

This talk is included in these lists:

• Andrea Picciau's list
• COMMSP & CP list
• COMMSP Seminar
• EEE Department, Room 611
• Featured talks
• SAP Talks

Note that ex-directory lists are not shown.