Publication

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

Publications associées (103)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

Hierarchical location service for mobile ad-hoc networks

Jörg Widmer

Position-based routing has proven to be a scalable and efficient way for packet routing in mobile ad-hoc networks. To enable position-based routing, a node must be able to discover the location of the node it wants to communicate with. This task is typical ...

2004

PILOT: ProbabilistIc Lightweight grOup communication sysTem for Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

Providing reliable group communication is an ever recurring issue in distributed settings. In mobile ad hoc networks, this issue becomes more significant since all nodes act as peers, while the issue gets even more challenging due to highly dynamic and unp ...

2004

The Driving Philosophers

Rachid Guerraoui, Bastian Pochon

We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a round-about (set of shared resources organized along a logical ring). The crux ...

2004

The Driving Philosophers

Bastian Pochon

2004

Towards Flexible Finite-State-Machine-Based Protocol Composition

André Schiper, Sergio Mena, Nils Richard Ekwall, Stefan Pleisch

We propose a novel approach to the composition of group communication protocols. In this approach, components are modelled as finite state machines communicating via signals. We introduce two building blocks, called adaptor and adaplexor, that ease the dev ...

2004

Contention-based forwarding for street scenarios

Jörg Widmer

In this paper, we propose to apply Contention-Based Forwarding (CBF) to Vehicular Ad Hoc Networks (VANETs). CBF is a greedy position-based forwarding algorithm that does not require proactive transmission of beacon messages. CBF performance is analyzed usi ...

2004

Rate Performance Objectives of Multi-hop Wireless Networks

Jean-Yves Le Boudec

We consider the question of what performance metric to maximize when designing ad-hoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery lifetime and power constraints. Commonly used metrics are total capacity (in ...

2003

Contention-based forwarding for mobile ad-hoc networks

Jörg Widmer

Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is ...

2003

Equilibrium Analysis of Packet Forwarding Strategies in Wireless Ad Hoc Networks - the Dynamic Case

Jean-Pierre Hubaux, Mark Felegyhazi, Levente Buttyan

Ad hoc networks are expected to be used in a number of very different situations. But a common characteristic is that the nodes have to cooperate with each other. This problem is particularly crucial, if each node is its own authority. Reckoning the releva ...

2003

A novel forwarding paradigm for position-based routing (with implicit addressing)

Jörg Widmer

2003