Eviction of Misbehaving and Faulty Nodes in Vehicular Networks

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

Distributed systems designers typically strive to improve performance and preserve availability despite failures or attacks; but, when strong consistency is also needed, they encounter fundamental limitations. The bottleneck is in replica coordination, whi ...

In a non-synchronous system with n processes, no t(0)-resilient (deterministic or probabilistic) Byzantine consensus protocol can prevent a disagreement among correct processes if the number of faulty processes is > n - 2t(0). Therefore, the community defi ...

The increase in wireless data traffic continues and is a product of several factors. First, new technologies and capabilities enable new use cases for which new products emerge. Then, with the growing user adoption over time, the data traffic is further in ...

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

Today, automatic control is integrated into a wide spectrum of real-world systems such as electrical grids and transportation networks. Many of these systems comprise numerous interconnected agents, perform safety-critical operations, or generate large amo ...

Mobile network operators constantly have to upgrade their cellular network to satisfy the public's hunger for increasing data capacity. However, regulatory limits regarding allowed electromagnetic field strength on existing cell sites often limit or preven ...

Internet blackouts are challenging environments for anonymity and censorship resistance. Existing popular anonymity networks (e.g., Freenet, I2P, Tor) rely on Internet connectivity to function, making them impracticable during such blackouts. In such a set ...

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether ...

There is an increasing interest in a fast-growing machine learning technique called Federated Learning (FL), in which the model training is distributed over mobile user equipment (UEs), exploiting UEs' local computation and training data. Despite its advan ...

Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. The invention proposes an approach to simplify asynchronous consensus by building it atop a novel threshold logic ...

The distribution network restoration problem is by nature a mixed integer and non-linear optimization problem due to the switching decisions and Optimal Power Flow (OPF) constraints, respectively. The link between these two parts involves logical implicati ...

Online services are becoming more and more ubiquitous and keep growing in scale. At the same time, they are required to be highly available, secure, energy-efficient, and to achieve high performance. To ensure these (and many other) properties, replication ...

This paper proposes a novel scalable model-based fault detection and isolation approach for the monitoring of nonlinear large-scale systems, consisting of a network of interconnected subsystems. The fault diagnosis architecture is designed to automatically ...

In our daily lives, people or devices frequently need to learn their location for many reasons as some services depend on the absolute location or the proximity. The outcomes of positioning systems can have critical effects e.g., on military, emergency. Th ...

We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem. Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our result confirms the conjectured constant integrality gap of th ...

The classical distributed storage problem can be modeled by a k-uniform complete hyper-graph where vertices represent servers and hyper-edges represent users. Hence each hyper-edge should be able to recover the full file using only the memories of the vert ...

Background: The gene family-free framework for comparative genomics aims at providing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity graph. We study two problems related to the b ...

Unexpected disruptions occur for many reasons in railway networks and cause delays, cancelations, and, eventually, passenger inconvenience. This research focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of larg ...

Eviction of Misbehaving and Faulty Nodes in Vehicular Networks

Chattez avec Graph Search

Planetary-Scale Byzantine Fault Tolerance

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Building Strongly-Consistent Systems Resilient to Failures, Partitions, and Slowdowns

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Cellular Fronthauling for Data Capacity Increase in Underserved Spaces

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Data-driven and Safe Networked Control with Applications to Microgrids

Beam Selection and Tracking for Amplify-and-Forward Repeaters

Moby: A Blackout-Resistant Anonymity Network for Mobile Devices

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

Federated Learning Over Wireless Networks: Convergence Analysis and Resource Allocation

Asynchronous distributed coordination and consensus with threshold logical clocks

A Novel Decomposition Solution Approach for the Restoration Problem in Distribution Networks

Scaling Byzantine Fault Tolerance

Plug-and-Play Fault Detection and Isolation for Large-Scale Nonlinear Systems With Stochastic Uncertainties

Implications of Position in Cryptography

A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

GDSP: A graphical perspective on the distributed storage systems

The gene family-free median of three

The multi-objective railway timetable rescheduling problem