Publication

NASCENT: Network Layer Service for Vicinity Ad-hoc Groups

Related publications (52)

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.

Routing Attacks as a Viable Threat: Can Software Systems Protect Themselves?

Dan Alistarh

In this paper, we show that distributed systems are vul- nerable to routing attacks and propose an architecture to obviate this vulnerability. A somewhat surprising finding is that even a small-scale routing attack can completely dis- rupt the operation of ...

2010

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

Gossip, also known as epidemic dissemination, is becoming an increasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural extension of the random phone-call mode ...

2010

Order-Optimal Consensus Through Randomized Path Averaging

Martin Vetterli, Patrick Thiran, Florence Bénézit

Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust mes- sage-passing schemes for distributed information processing over networks. However, for many topologies that are realistic for wire- less ...

Institute of Electrical and Electronics Engineers2010

Mobility-centric design of collaborative transportation systems

Embedded sensors and actuators are revolutionizing the way we perceive and interact with the physical world. Current research on such Cyber-Physical Systems (CPSs) has focused mostly on distributed sensing and data gathering. The next step is to move from ...

EPFL2009

Robustness to failures in two-layer communication networks

Maciej Kurant

A close look at many existing systems reveals their two- or multi-layer nature, where a number of coexisting networks interact and depend on each other. For instance, in the Internet, any application-level graph (such as a peer-to-peer network) is mapped o ...

EPFL2009

Extending Paxos/LastVoting with an Adequate Communication Layer for Wireless Ad Hoc Networks

André Schiper, Fatemeh Borran

Most papers addressing consensus in wireless ad hoc networks adopt system models similar to those developed for wired networks. These models are focused towards node failures while ignoring link failures, and thus are poorly suited for wireless ad hoc netw ...

IEEE2008

Consensus in Wireless Ad hoc Networks

André Schiper, Fatemeh Borran

Solving consensus in wireless ad hoc networks has started to be addressed in several papers. Most of these papers adopt system models similar to those developed for wired networks. These models are focused towards node failures while ignoring link failures ...

2008

Secure incentives to cooperate for wireless networks

The operating principle of certain wireless networks makes essential the cooperation between the mobile nodes. However, if each node is an autonomous selfish entity, cooperation is not guaranteed and therefore we need to use incentive techniques. In this t ...

EPFL2007

Least-Cost Opportunistic Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In opportunistic routing, each node maintains a group of candidate next-hops to reach a particular destination, and transmits packets to any node in this group. The choice of candidate next-hops at each node is a key question that is central to the perform ...

2007

Modeling and predicting mobility in wireless ad hoc networks

Jérôme Härri

Wireless Ad Hoc Networks are a particular paradigm where wireless devices communicate in a decentralized fashion, without any centralized infrastructure or decision. In order to avoid a situation where nodes chaotically try to communicate, distributed and ...

EPFL2007