March 8, 2010
Hosted by: Prof. Gil Zussman
Speaker: Dr. Matthew Andrews, Bell Labs
In this talk, we shall cover a number of resource allocation problems that arise in cellular data networks. We shall consider both CDMA-based 3G networks (where we are typically concerned with allocating time slots to a set of mobile users) as well as OFDM-based 4G networks (where we have to assign both time and frequency). Some questions that we shall examine include: - What is the best way to schedule over a time-varying channel when each user has a minimum acceptable data rate? - How can we schedule a large number of frequencies so that no user is assigned more bandwidth than it can use? - How can we create a time-frequency schedule such that each user is assigned a contiguous set of frequencies?
Matthew Andrews works in the Math of Networks and Communications Department at Alcatel-Lucent Bell Labs in Murray Hill, New Jersey, USA. He received his B.A. in mathematics from Oxford University, UK in 1993 and his Ph.D. in theoretical computer science from the Massachusetts Institute of Technology in 1997. His research interests include wireless resource allocation, packet scheduling and approximation algorithms. His recent work includes time-frequency scheduling algorithms for OFDM networks and complexity theoretic results on the hardness of network design.
The talk is given as a guest lecture in ELEN 6951 - Wireless and Mobile Networking II