Publication

Securing Every Bit: Authenticated Broadcast in Radio Networks

Related publications (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Analysis of black-startup and islanding capabilities of a combined cycle power plant

Mario Paolone

The paper presents the analysis of black-startup and islanding capabilities of an 80 MW combined cycle power plant. The analysis is carried out by means of a computer dynamic simulator suitably developed in the EMTP-RV simulation environment in order to re ...

2008

Towards Provable Secure Neighbor Discovery in Wireless Networks

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski

In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocols and a wide range of applications. To thwart abuse of ND and the resultant c ...

2008

Towards Provable Secure Neighbor Discovery in Wireless Networks

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski

ACM2008

Traffic-responsive linked ramp-metering control

A new traffic-responsive ramp-metering strategy is presented that coordinates local ramp-metering actions, thus enabling the linked control of the inflow from two (or more) consecutive on-ramps to the freeway mainstream. The proposed linked ramp-metering s ...

Institute of Electrical and Electronics Engineers2008

Revocation Games in Ephemeral Networks

Jean-Pierre Hubaux, Mark Felegyhazi, Maxime Raya

A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact times between nodes are short and neighbors change frequently - reputations ...

2008

Frugal Event Dissemination in a Mobile Environment

Rachid Guerraoui

This paper describes an event dissemination algorithm that implements a topic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is frugal in two senses. First, it reduces the total number of duplicates and pa ...

2005

Mobility Friendly Publish/Subscribe

Rachid Guerraoui

This paper describes an event dissemination algorithm that implements a topic-based publish/subscribe abstraction in mobile ad-hoc networks (MANETs). Our algorithm relies on (1) the mobility of the processes and (2) the validity period of the events to ens ...

2004

Comparing the Performance of Two Consensus Algorithms with Centralized and Decentralized Communication Schemes

André Schiper

Comparing the Performance of Two Consensus Algorithms with Centralized and Decentralized Communication Schemes Peter Urban and Andre Schiper Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While ...

2004

Vibrational coherence and solvent-induced non-adiabatic couplings

Majed Chergui

The ultrafast non-radiative relaxation processes between electronic states of Hg2 trapped in a cryogenic argon matrix after photon excitation at 266 nm is studied by mol. dynamics with quantum transitions (MDQT). Population transfer by matrix-induced coupl ...

2002

Self Organized Terminode Routing - Version 2

Jean-Yves Le Boudec, Ljubica Blazevic

We consider the problem of routing in a wide area mobile ad hoc network called Terminode Network. Routing in this network is designed with the following objectives. First, it should scale well in terms of the number of nodes and geographical coverage; seco ...

2001