Faculty habilitation
Group : Graphs, ALgorithms and Combinatorics
Algorithm Design and Analysis in Wireless Networks
Starts on
Advisor :
Funding :
Affiliation : vide
Laboratory :
Defended on 11/07/2017, committee :
- M. BASAR Tamer, Professeur à University of Illinois at Urbana-Champaign
- M. FRAIGNIAUD Pierre, Directeur de Recherche au CNRS
- M. GAUJAL Bruno, Directeur de Recherche à l’INRIA
- M. ALTMAN Eitan, Directeur de Recherche à l’INRIA
- M. DEBBAH Mérouane, Professeur à Supélec, Directeur de Mathematical and Algorithmic Sciences Lab, Huawei France Research Center
- Mme. COHEN Johanne, Directeur de Recherche au CNRS
- M. BEAUQUIER Joffroy, Professeur à Université Paris-Sud
- M. MARTIGNON Fabio, Professeur à Université Paris-Sud
Research activities :
Abstract :
Algorithms are perhaps the most fundamental and fascinating elements in computer science as a whole. Networks and networked systems are no exception. This habilitation thesis summarizes my research during the last eight years on some algorithmic problems of both fundamental and practical importance in modern networks and networked systems, more specifically, wireless networks. Generically, wireless networks have a number of common features which form a common ground on which algorithms for wireless networks are designed. These features include the lack of network-wide coordination, large number of nodes, limited energy and computation resource, and the unreliable wireless links. These constraints and considerations make the algorithmic study for wireless networks an emerging research field requiring new tools and methodologies, some of which cannot be drawn from existing state-of-the-art research in either algorithm or networking community.
Motivated by this observation, we aim at making 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. Specifically, we expose our works on a number of algorithmic problems in emerging wireless networks that are simple to state and intuitively understandable, while of both fundamental and practical importance, and require non-trivial efforts to solve. These problems include (1) channel rendezvous and neighbor discovery, (2) opportunistic channel access, (3) distributed learning, (4) path optimization and scheduling, (5) algorithm design and analysis in radio-frequency identification systems.
