University of Calgary, Canada
Monday, May 9, 2-3PM in EE Conference Room
Abstract: Wireless ad hoc networks present numerous challenges which do not transform to classic networking problems due to the unique graph model. In the past decade research efforts were focused on the development of new optimization techniques which address various critical issues in wireless communication, such as energy efficiency, interference, topology control, and many others. Unfortunately, it is impossible to provide satisfactory guarantees for some of the optimization problems due to the existence of poor network deployments. We can, however, offer a more realistic analysis of the average case by permitting an assumption that the geographical layout of the wireless nodes is closer to the more common, random-like configuration.
In this talk we discuss the probabilistic approach to optimization when the wireless devices are randomly and uniformly distributed in a unit square area. We will present several interesting properties of random distribution and show how these can be effectively applied to several problems in wireless networks.
Speaker Biography: Hanan Shpungin has received the B.Sc., M.Sc., and Ph.D degrees in computer science from Ben-Gurion University of the Negev, Beer-Sheva, Israel, in 2000, 2005, and 2010, respectively. Currently, he is a Post-Doctoral Fellow with the Networks Research Group in the Department of Computer Science at the University of Calgary. His research interests revolve around combinatorial optimization in wireless ad Hoc networks. He is in particular interested in topology control, fundamental capacity bounds, distributed beamforming, and scheduling.