Abstract: The talk will be a general overview of our recent work in the general area of delay- and complexity - limited wireless communications. We will begin with the general setting of the Rate-Reliability-Delay-Complexity tradeoff for wireless communications where we will describe the mathematical machinery that allows for a unified exposition of the problem, and which it self allows for practical solutions for MIMO and cooperative-communications settings, and which yield meaningful fundamental limits that can be used for planning different cooperative networks. We will then move to address explicitly the setting of cooperative communications under delay constraints, and provide information theoretic limits, as well as simplified relaying algorithms. A natural extension to that comes next, when we address the problem of constructing simple and delay-constrained interference management algorithms, that are of very practical interest in the setting of cellular systems. Using the same mathematical framework as all of the results above, we are also able to handle the case where we have delay-constrained communications with bursty traffic.

Petros Elia received the M.Sc. and Ph.D. in electrical engineering from the University of Southern California (USC), Los Angeles, in 2001 and 2006 respectively. From October 2006 to December of 2007 he was a postdoctoral researcher at the University of California San Diego, and at FTW Vienna. Since February 2008 he has been an Assistant Professor with the Department of Mobile Communications at EURECOM in Sophia Antipolis, France. His research interests include combining approaches from different sciences, such as mathematics, physics, and from information theory, complexity theory, and game theory, towards analysis and algorithmic design for distributed and decentralized communication networks. His latest research deals with MIMO transceivers, complexity of communication, isolation and connectivity in dense networks, queueing theory and cross-layer design, coding theory, information theoretic limits in cooperative communications, search in unstructured data, and surveillance systems.