18/02/2019, 10h30, LIP6 25-26/105
Title: Algorithm Design and Analysis in Wireless Networks
Algorithms are one of the most fundamental elements in computer science. Networks and networked systems are no exception. In this talk, I will present our recent research on some algorithmic problems of both fundamental and practical importance in modern networks and networked systems, more specifically, wireless networks. Methodologically, most of our analysis is systematically articulated as follows: (1) Establishment of theoretical performance bound, (2) Optimum or approximation algorithm design, (3) Further extension and generalization. Our objective is to make a tiny while systematic step forwards in the design and analysis of algorithms that can scale elegantly, act efficiently in terms of computation and communication, while keeping operations as local and distributed as possible.