Computer Science Seminar - University of Houston
Skip to main content

Computer Science Seminar

Computer Science Distinguished Speaker

SINR Maps and their Algorithmic Applications in Wireless Communication

When: Friday, February 19, 2016
Where: PGH 232
Time: 11:00 AM - 1:00 PM

Speaker: Prof. David Peleg, Weizmann Institute of Science

Host: Prof. Gopal Pandurangan

The traditional approach to wireless network algorithms relies on graph-based models such as the unit disk graph (UDG) model, which simplify the effects of interference and attenuation, and thus makes it easier to handle algorithmic issues, but provides a less accurate representation of some basic aspects of wireless communication. The alternative of using physical models such as the SINR model provides a more faithful representation of signal reception quality but results in a more complex picture. A few years ago, SINR maps were proposed as a tool for facilitating easier algorithmic treatment of wireless communication. The talk will review the basic properties of SINR maps and some of their algorithmic applications.

Bio:

David Peleg received the B.A. degree in 1980 from the Technion, Israel, the M.Sc. degree in 1982 from Bar-Ilan University, Israel, and the Ph.D. degree in 1985 from the Weizmann Institute, Israel, all in computer science. He then spent a post-doctoral period at IBM Almaden and at Stanford University. In 1988 he joined the Department of Computer Science and Applied Mathematics at The Weizmann Institute of Science, where he is the incumbent of the Norman D. Cohen Professorial Chair of Computer Sciences. He chaired the Weizmann Institute's Council of Professors in 2007-2008, and serves as Dean of the Faculty of Mathematics and Computer Science since 2010. His research interests include distributed network algorithms, fault-tolerant computing, communication network theory, approximation algorithms and graph theory, and he is the author of a book titled "Distributed Computing: A Locality-Sensitive Approach," as well as numerous papers in these areas. He received the ACM Edsger W. Dijkstra Prize in Distributed Computing in 2008 and the SIROCCO Prize for Innovation In Distributed Computing in 2011.