WiOpt main symposium
Abstract: Scheduling algorithms have been extensively studied in wireless network design. We first present a comprehensive taxonomy of this research area, including optimality and robustness issues in the frameworks of Layering as Optimization Decomposition and Stochastic NUM. Then we discuss the stability-delay-complexity tradeoff, as well as delay characterizations, in networks with non-saturated traffic. We conclude with reverse and forward engineering of random access protocols in networks with saturated traffic, including convergence and short-term fairness of utility-optimal CSMA with no message passing.
Bio: Mung Chiang is an Associate Professor of Electrical Engineering, and an Affiliated Faculty of Applied and Computational Mathematics and of Computer Science, at Princeton University. He received the B.S. (Honors) in Electrical Engineering and Mathematics, M.S. and Ph.D. degrees in Electrical Engineering from Stanford University in 1999, 2000, and 2003, respectively, and was an Assistant Professor at Princeton University 2003-2008. His research areas include optimization, distributed control, and stochastic analysis of communication networks, with applications to the Internet, wireless networks, broadband access networks, and content distribution.
Abstract: Multiuser information-theoretic analysis of achievable communication rate regions over networks traditionally assumes that individual sources of information are independent. However, fully exploiting network-wide synergies requires an understanding of how to handle correlated sources. Such correlations may arise because of underlying shared variates such as a network state affecting multiple nodes, or as a modeling approach to study communication using multiple paths in the network. This talk will discuss some recent results in Shannon theory for correlated sources. Recent work on exploiting correlations to create secret keys for security led to the development of a so-called ``potential function technique" for proving results in this area. This development together with a survey of the underlying secrecy capacity results will be presented. The use of this technique to study the channel capacity regions of traditional multiuser channels carrying correlated sources will then be outlined. This talk is based on the ongoing thesis work of Amin Aminzadeh Gohari.
Bio: Venkat Anantharam is on the faculty of the EECS department at the University of California at Berkeley. He a co-recipient of the 1998 Prize Paper award of the IEEE Information Theory Society (with S. Verdu) and a co-recipient of the 2000 Stephen O. Rice Prize Paper award of the IEEE Communications Theory Society (with N. Mckeown and J. Walrand). He received the Distinguished Alumnus Award from the Indian Institute of Technology at Madras in 2008. He is a Fellow of the IEEE.
Abstract: New and future mobile systems are characterized by highly increased complexity compared to legacy systems in order to achieve the improved spectral efficiency. Due to this complexity the configuration and optimization of these networks require more and more autonomous functionality for operation. The speech will address this topic and present some solutions for Self-X RAN functions.
Bio: Ulrich Barth received his Diploma Degree on Telecommunications from the FH Trier, Germany and joined Alcatel Research in 1988 which is Alcatel-Lucent Bell Labs today. His technical focus is on radio communication research. Currently he is heading the department for Wireless System Optimization of the Bell Labs with several teams working on new innovations for future intelligent wireless access systems.
RAWNET/WNC^3 2009
PHYSCOMNET 2009
SpaSWiN 2009
ConCom 2009
WinMee 2009