Publication

More on Castor: the Scalable Secure Routing for Ad-hoc Networks

Related publications (103)

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.

Even Small Birds are Unique: Population Protocols with Identifiers

Rachid Guerraoui, Eric Ruppert

Although much research has been devoted to designing and experimenting on ad hoc networks of tiny devices, very little has focussed on devising theoretical models to capture the inherent power and limitations of such networks. A notable exception is the po ...

2007

On the Cost of Modularity in Atomic Broadcast

André Schiper, Sergio Mena, Nils Richard Ekwall, Olivier Rütti

Modularity is a desirable property of complex software systems, since it simplifies code reuse, verification, maintenance, etc. However, the use of loosely coupled modules introduces a performance overhead. This overhead is often considered negligible, but ...

2007

Mobility in wireless networks: friend or foe

Jun Luo

Wireless networking technologies allow computing devices to move while keeping them online, but the device mobility poses considerable technical challenges. Network designers, on the one hand, consider mobility to be harmful because it leads to dynamic and ...

EPFL2006

Towards reliable communication and agreement in mobile ad-hoc networks

David Cavin

During the last decade, the number of wireless devices like digital organizers, mobile phones and laptop computers has drastically increased. At the same time, several technologies, like Bluetooth, GPRS, or WiFi have become mature and offer a high-performa ...

EPFL2006

A Network Coding Approach to Energy Efficient Broadcasting: from Theory to Practice

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

We show that network coding allows to realize energy savings in a wireless ad-hoc network, when each node of the network is a source that wants to transmit information to all other nodes. Energy efficiency directly affects battery life and thus is a critic ...

2006

Secure Ad Hoc Networking

Panagiotis Papadimitratos

The ad hoc networking technology can enable novel civilian and military applications. However, ad hoc networking protocols are vulnerable to a wide range of attacks. The design of defense mechanisms is a challenging problem, especially in comparison to sec ...

2006

Reliable Broadcast in Wireless Mobile Ad Hoc Networks

André Schiper, David Cavin, Yoav Sasson

We propose a single source reliable broadcasting algorithm for linear grid-based networks where a message is guaranteed to be delivered to all the nodes of the network. The nodes are mobile and can move from one grid point to another. The solution does not ...

2006

Performance Analysis of Self Limiting Epidemic Forwarding

Jean-Yves Le Boudec, Alaeddine El Fawal

Self limiting epidemic forwarding is a method of epidemic information dissemination in wireless ad-hoc networks that achieves congestion control by limiting spread (i.e. the number of nodes that receive a given message) and injection rate in order to prese ...

2006

Vulnerabilities in Epidemic Forwarding

Jean-Yves Le Boudec, Alaeddine El Fawal

We identify vulnerabilities in epidemic forwarding. We address broadcast applications over wireless ad-hoc networks. Epidemic forwarding employs several mechanisms such as inhibition and spread control and each of them can be achieved using different alter ...

2006

Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks

Matthias Grossglauser, Natasa Sarafijanovic-Djukic

Mobile wireless ad hoc and sensor networks can be permanently partitioned in many interesting scenarios. This implies that instantaneous end-to-end routes do not exist. Nevertheless, when nodes are mobile, it is possible to forward messages to their destin ...

2006