Publication

Scalable routing protocols with applications to mobility

Related publications (221)

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.

Using End-to-End Data to Infer Lossy Links in Sensor Networks

Patrick Thiran, Xuan Hung Nguyen

Compared to wired networks, sensor networks pose two additional challenges for monitoring functions: they support much less probing traffic, and they change their routing topologies much more frequently. We propose therefore to use only end-to-end applicat ...

2006

Structural and Algorithmic Issues of Dynamic Protocol Update

André Schiper, Olivier Rütti

In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel solution to DPU. The key idea is to add a level of indirection between the ser ...

2006

Data Management for a Smart Earth: The Swiss NCCR-MICS initiative

Karl Aberer

The Swiss National Competence Center for Research in mobile Information and Communication Systems (NCCR-MICS or MICS) is one of several research initiatives sponsored by the Swiss National Science Foundation to promote long term research projects in areas ...

2006

Rating of Routing by Redundancy Overall Need

Emin Gabrielyan

Thanks to the large buffering time of off-line streaming applications, erasure resilient Forward Error Correction (FEC) codes can improve the reliability of communication particularly well. However real-time streaming puts hard restrictions on the buffer s ...

2006

A Location Based Routing Method for 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 or frequently dis ...

2005

A cross-layer design of wireless ad-hoc networks

We consider a cross-layer design of wireless ad-hoc networks. Traditional networking approaches optimize separately each of the three layers: physical layer, medium access and routing. This may lead to largely suboptimal network designs. In this work, we p ...

EPFL2005

Probabilistic Path Discovery with Snakes in Ad Hoc Networks

Thomas Lochmatter

Many routing protocols for wireless ad hoc networks proposed in the literature use ﬂooding to discover paths between the source and the destination node. Despite various broadcast optimization techniques, ﬂooding remains expensive in terms of bandwidth and ...

2005

On the Throughput of Ad Hoc Networks using Connectivity Graphs

Christina Fragouli

In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair ...

2005

An Artificial Immune System Approach with Secondary Response for Misbehavior Detection in Mobile Ad-Hoc Networks

Jean-Yves Le Boudec, Slavisa Sarafijanovic

In mobile ad hoc networks, nodes act both as terminals and information relays, and they participate in a common routing protocol, such as dynamic source routing (DSR). The network is vulnerable to routing misbehavior, due to faulty or malicious nodes. Misb ...

2005

Deux applications de processus ponctuels aux réseaux de communication

Patrick Thiran, Olivier Dousse, Xuan Hung Nguyen

This paper (in Frensh) summarizes recent results obtained by using shot noise processes for two applications in communication networks: first, TCP/IP traffic models for backbone networks; and next the study of connectivity under rate constraints in wireles ...

2005