Publication

EZ-Flow: Removing Turbulence in IEEE 802.11 Wireless Mesh Networks without Message Passing

Publications associées (61)

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

On the throughput scaling of wireless relay networks

Patrick Thiran, Olivier Dousse

The throughput of wireless networks is known to scale poorly when the number of users grows. The rate at which an arbitrary pair of nodes can communicate must decrease to zero as the number of users tends to infinity, under various assumptions. One of them ...

2006

Securing Wireless Mesh Networks

Jean-Pierre Hubaux, Naouel Ben Salem

Using wireless mesh networks to offer Internet connectivity is becoming a popular choice for wireless Internet service providers as it allows fast, easy, and inexpensive network deployment. However, security in WMNs is still in its infancy as very little a ...

2006

Performance Analysis of Self Limiting Epidemic Forwarding

Jean-Yves Le Boudec, Alaeddine El Fawal

Self limiting epidemic forwarding is a method of epidemic information dissemination in wireless ad-hoc networks that achieves congestion control by limiting spread (i.e. the number of nodes that receive a given message) and injection rate in order to prese ...

2006

A Game for Ad Hoc Network Connectivity in the Presence of Malicious Users

Georgios Theodorakopoulos

Ad hoc network users are resource constrained: Before transmitting data, they have to take into account the energy expenditure involved. Even if a user is, in principle, willing to spend energy to improve network connectivity, his actual decision will be h ...

2006

Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks

Matthias Grossglauser, Natasa Sarafijanovic-Djukic

Mobile wireless ad hoc and sensor networks can be permanently partitioned in many interesting scenarios. This implies that instantaneous end-to-end routes do not exist. Nevertheless, when nodes are mobile, it is possible to forward messages to their destin ...

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

Information theoretic bounds on the throughput scaling of wireless relay networks

Patrick Thiran, Olivier Dousse

2005

Joint rate and power control algorithms for wireless networks

Ali H. Sayed

There is a fundamental tradeoff between power consumption, data transmission rates, and congestion levels in a wireless network. These three elements influence the performance of rate and power control strategies, and they need to be coordinated judiciousl ...

IEEE2005

Energy-efficient Broadcasting in All-wireless Networks

Jean-Pierre Hubaux, Christian Enz, Mario Cagalj

In all-wireless networks, minimizing energy consumption is crucial as in most cases the nodes are battery-operated. We focus on the problem of power-optimal broadcast, for which it is well known that the broadcast nature of radio transmissions can be explo ...

2005

Self-Policing Mobile Ad-Hoc Networks by Reputation

Jean-Yves Le Boudec, Sonja Buchegger

Node misbehavior due to selfish or malicious reasons or faulty nodes can significantly degrade the performance of mobile ad-hoc networks. To cope with misbehavior in such self-organized networks, nodes need to be able to automatically adapt their strategy ...

2005