Français Anglais
Accueil Annuaire Plan du site
Home > Research results > Dissertations & habilitations
Research results
Faculty habilitation de CHEN Lin
CHEN Lin
Faculty habilitation
Group : Graphs, ALgorithms and Combinatorics

Algorithm Design and Analysis in Wireless Networks

Starts on 00/00/0000
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.

Ph.D. dissertations & Faculty habilitations
DECODING THE PLATFORM SOCIETY: ORGANIZATIONS, MARKETS AND NETWORKS IN THE DIGITAL ECONOMY
The original manuscript conceptualizes the recent rise of digital platforms along three main dimensions: their nature of coordination devices fueled by data, the ensuing transformations of labor, and the accompanying promises of societal innovation. The overall ambition is to unpack the coordination role of the platform and where it stands in the horizon of the classical firm – market duality. It is also to precisely understand how it uses data to do so, where it drives labor, and how it accommodates socially innovative projects. I extend this analysis to show continuity between today’s society dominated by platforms and the “organizational society”, claiming that platforms are organized structures that distribute resources, produce asymmetries of wealth and power, and push social innovation to the periphery of the system. I discuss the policy implications of these tendencies and propose avenues for follow-up research.

DISTRIBUTED COMPUTING WITH LIMITED RESOURCES


VALORISATION DES DONNéES POUR LA RECHERCHE D'EMPLO