Publication

On the Fairness of Large CSMA Networks

Publications associées (36)

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

Network-Coded Broadcast: from Canonical Networks to Random Topologies

Christina Fragouli, Jörg Widmer

We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the ...

2008

Modelling the IEEE 802.11 protocol in wireless multi-hop networks

Mathilde Durvy

IEEE 802.11 is probably the most widely used, medium access control protocol in current wireless networks. In the Wireless LAN (i.e., single-hop) setting, its performance is by now quite well understood. However, in the multi-hop setting where relay nodes ...

EPFL2007

Modeling the 802.11 protocol under different capture and sensing capabilities

Patrick Thiran, Olivier Dousse, Mathilde Durvy

Decentralized medium access control schemes for wireless networks based on CSMA/CA, such as the 802.11 protocol, are known to be unfair. In multi-hop networks, they can even favor some connections to such an extent that the others suffer from virtually com ...

2007

Thwarting selfish and malicious behavior in wireless networks

Mario Cagalj

Security is at the core of any communication system and, in particular, of wireless (radio) networks. In this thesis, we focus on three important security aspects in the framework of wireless networks: selfish (noncooperative) behavior at the Medium Access ...

EPFL2006

High Throughput Total Order Broadcast for Cluster Environments

Rachid Guerraoui, Bastian Pochon, Ron Levy

Total order broadcast is a fundamental communication primitive that plays a central role in bringing cheap software-based high availability to a wide array of services. This paper studies the practical performance of such a primitive on a cluster of homoge ...

2006

A Fair Scheduling for Wireless Mesh Networks

Jean-Pierre Hubaux, Naouel Ben Salem

Wireless Mesh Networks (WMNs) represent a new and promising paradigm that uses multi-hop communications to extend WiFi networks: By deploying only one hot spot (directly connected to the Internet) and several transient access points (TAPs), an Internet Ser ...

2005

A Cross-Layer Design Approach to Enhance 802.15.4

Panagiotis Papadimitratos

The low-power communication in wireless sensor networks can be impacted by severe channel impairments. In this paper, to address this problem and achieve high network goodput, we propose that the medium access control protocol takes into consideration the ...

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

Asymptotic properties of wireless multi-hop networks

Olivier Dousse

In this dissertation, we consider wireless multi-hop networks, where the nodes are randomly placed. We are particularly interested in their asymptotic properties when the number of nodes tends to infinity. We use percolation theory as our main tool of anal ...

EPFL2005

Information theoretic bounds 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 ...

2005