Publication

DRIFT: Efficient message ordering in ad hoc networks using virtual flooding

Publications associées (88)

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

Break WEP Faster with Statistical Analysis

Rafik Chaabouni

The Wired Equivalent Protocol is nowadays considered as unsafe. However the only academic research that tries to break WEP has been done by Fluhrer, Mantin and Shamir, who have published a report on a specific attack. Nevertheless, an unknown person under ...

2006

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

A new relaying scheme for cheap wireless relay nodes

Ramin Khalili

In this paper we will propose a relaying scheme for wireless multi-hop networks. It is based on collaboration of intermediate relays at network layer to forward useful side information in place of dumbly forwarding packets. In our scheme we assume that the ...

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

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

Synchronizing Method for Impulse Radio Network

Jean-Yves Le Boudec, Alaeddine El Fawal

In IR (Impulse Radio) network, the conventional synchronization (also called signal acquisition) method becomes inefficient and results in a certain failure of synchronization when concurrent transmissions are allowed without controlling their powers. The ...

2005

Synchronizing Method for Impulse Radio Network

Jean-Yves Le Boudec, Alaeddine El Fawal

2005

A robust power and rate control method for state-delayed wireless networks

Ali H. Sayed

A robust power and rate control algorithm is proposed for distributed wireless networks where the network dynamics is modelled as an uncertain discrete-time state-delayed system. ...

Elsevier2005

Rate Performance Objectives of Multihop 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 ...

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

2004