Reaching consensus is fundamental for many coordination problems in distributed computing. Yet, this problem is impossible in an asynchronous system as soon as one process may crash. We show that an additional constraint on failure occurrences allows solving the consensus problem in crash-prone environments. We will consider so-called λ-constrained failures that can happen only while a predefined contention threshold λ has not yet been bypassed. Assuming these failures, we...
Répétition de soutenance de thèse
Dans le cadre de cette présentation, nous analysons d'abord les algorithmes d'adaptation de débit existants et leur impact sur les performances d'un réseau Wi-Fi. Ensuite, nous étudions les meilleures pratiques pour le déploiement de ces réseaux au sein d'une exploitation agricole, notamment le nombre de points d'accès requis et leur emplacement pour maximiser la couverture et les performances dans le cadre d'une application de...
Attracted by the advantages of Non-Orthogonal Multiple Access (NOMA) in accommodating multiple users within the same resources, this paper jointly addresses the resource allocation and power control problem for Machine Type Devices (MTDs) in a Hybrid NOMA system. Particularly, we model the problem using a Mean Field Game (MFG) framework underlying a Multi-Armed Bandit (MAB) approach. Firstly, the devices invoke the MAB tool to arrange themselves into multiple NOMA coalitions. Then, within...
With the advent of Industry 4.0, there is a convergence between industrial systems and IoT. As industry becomes more distributed, connected and service-oriented, it tends to move closer to IoT. On the other hand, IoT, which was initially limited to smart home devices and gadgets, is expanding into much more critical areas. What you find today in factories, healthcare, transportation or smart cities, are complex connected devices, often connected to a local network or even the cloud;...
Private permissioned blockchains are becoming gradually more sought-after. Such systems are reachable by authorized users, and tend to be completely transparent to whoever interacts with the blockchain. In this paper, we mitigate the latter. Authorized users can now stay unlinked to the transaction they propose in the blockchain while being authenticated before being allowed to interact. As a first contribution, we developed a consensus algorithm for private permissioned blockchains based...