Publication

Hierarchical Routing in Dynamic $\alpha$-Doubling Networks

Related publications (94)

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.

Last Encounter Routing under Random Waypoint Mobility

Matthias Grossglauser, Natasa Sarafijanovic-Djukic

Last Encounter Routing (LER) algorithms for mobile ad hoc networks rely only on encounter histories at every node to route packets, and therefore do not need control traffic to track topology changes due to node mobility. LER exploits the fact that past in ...

2004

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

Bandwidth-Constrained Mapping of Cores onto NoC Architectures

Giovanni De Micheli, Srinivasan Murali

We address the design of complex monolithic systems, where processing cores generate and consume a varying and large amount of data, thus bringing the communication links to the edge of congestion. Typical applications are in the area of multi-media proces ...

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

Optimal Power Control, Scheduling and Routing in UWB Networks

Jean-Yves Le Boudec

Ultra-Wide Band (UWB) is an emerging wireless physical layer technology that uses a very large bandwidth. We are interested in finding the design objectives of the medium access (MAC, namely, power control and scheduling) and routing protocols of a multi-h ...

2003

A Location Based Routing Method for Irregular Mobile Ad Hoc Networks

Jean-Yves Le Boudec, Ljubica Blazevic

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad-hoc networks. However, location based routing is difficult when there are holes in the network topology and nodes are mobile. Terminode routin ...

2003

A Test-Bed for Misbehavior Detection in Mobile Ad-hoc Networks --- How Much Can Watchdogs Really Do?

Jean-Yves Le Boudec, Cédric Tissières, Sonja Buchegger

Several misbehavior detection and reputation systems have been proposed for mobile ad-hoc networks, relying on direct network observation mechanisms, so-called watchdogs. While these approaches have so far only been evaluated in simulations and restricted ...

2003

BISS: Building Secure Routing out of an Incomplete Set of Security Associations

Jean-Pierre Hubaux, Srdan Capkun

We investigate secure routing in ad hoc networks in which security associations exist only between a subset of all pairs of nodes. We focus on source routing protocols. We show that to establish secure routes, it is in general not necessary that security a ...

2003

Secure Link State Routing for Mobile Ad Hoc Networks

Panagiotis Papadimitratos

The secure operation of the routing protocol is one of the major challenges to be met for the proliferation of the Mobile Ad hoc Networking (MANET) paradigm. Nevertheless, security enhancements have been proposed mostly for reactive MANET protocols. The pr ...

IEEE Computer Society2003