Concept

Simulation réseau

Publications associées (180)

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 significant 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 ...

2005

A Power Independent Detection Method for UltraWide Band (UWB) Impulse Radio Networks

Jean-Yves Le Boudec, Alaeddine El Fawal

We propose a novel detection method for non-coherent synchronization (signal acquisition) in multi-access UWB impulse radio (IR) networks. It is designed to solve the IUI (Inter-User Interference) that occurs in some ad-hoc networks where concurrent transm ...

2005

Large scale selective event dissemination

Sidath Handurukande

Event-based systems usually denote distributed infrastructures that are used to asynchronously disseminate information among geographically distant computing units. In these systems, the information sources (a.k.a. publishers) produce events and the system ...

EPFL2005

A Power Independent detection Method for Ultra Wide Band (UWB) Impulse Radio Networks

Jean-Yves Le Boudec, Alaeddine El Fawal

We propose a novel detection method for non-coherent synchronization in multi-access UWB impulse radio (IR) networks. It is designed to solve the IUI (Inter-User Interference) in particular the Near-Far scenario in the presence of concurrent UWB IR transmi ...

2005

Packet Combining in Sensor Networks

Martin Vetterli, Henri Julien Dubois-Ferrière

This paper presents the Simple Packet Combining (SPaC) error-correction scheme for wireless sensor networks. Nodes buffer corrupt packets, and when two or more corrupt versions of a packet have been received, a packet combining procedure attempts to recove ...

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

Real-Time Interaction over the Internet: Model for QOS Adaptation

Denis Gillet, Christophe Salzmann, Philippe Müllhaupt

Real-time Interaction over the Internet (RTI2) is an Internet service that is required typically by remote experimentation applications. From a quality of service (QoS) point of view, RTI2 has constraints that differ from usual real-time multimedia service ...

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

Single and Multi-Hop ARQ in Sensor Networks

Martin Vetterli, Henri Julien Dubois-Ferrière

We present a novel error-correction scheme for sensor networks called Multi-hop Hybrid ARQ (MHARQ). Rather than immediately discard a received corrupt packet, a node buffers it. When two corrupt versions of a packet have been received, a procedure attempts ...

2005

The Security of Vehicular Ad Hoc Networks

Jean-Pierre Hubaux, Maxime Raya

Vehicular networks are likely to become the most relevant form of mobile ad hoc networks. In this paper, we address the security of these networks. We provide a detailed threat analysis and devise an appropriate security architecture. We also describe some ...

2005

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