Concept

Hidden node problem

Publications associées (55)

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

Closing the gap in the capacity of random wireless networks via percolation theory

Patrick Thiran, Olivier Dousse

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the ...

2007

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

Reliable Broadcast in Wireless Mobile Ad Hoc Networks

André Schiper, David Cavin, Yoav Sasson

We propose a single source reliable broadcasting algorithm for linear grid-based networks where a message is guaranteed to be delivered to all the nodes of the network. The nodes are mobile and can move from one grid point to another. The solution does not ...

2006

MAC layer functions for SLEF

Alaeddine El Fawal, Lorenzo Keller

We develop three functions around the MAC layer: (1) Pseudo broadcast is a technique used to improve throughput of broadcast transmissions in case of congested networks. The mechanism consists in sending a packet in unicast to a station using RTS/CTS. Othe ...

2006

A Packing Approach to Compare Slotted and Non-Slotted Medium Access Control

Patrick Thiran, Mathilde Durvy

In multi-hop ad hoc networks, the efficiency of a medium access control protocol under heavy traffic load depends mainly on its ability to schedule a large number of simultaneous non-interfering transmissions. However, as each node has only a local view of ...

2006

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

Rate Adaptation, Power Adaptation and Mutual Exclusion in Variable Rate Wireless Networks

Jean-Yves Le Boudec

We consider the joint design of rate adaptation, power adaptation and mutual exclusion for the MAC layer of a multi-hop, ad-hoc wireless network. We assume the physical layer supports a variable bit-rate. Most of the existing MACs analyze impacts of only o ...

2005

Reputation-based Wi-Fi Deployment

Jean-Pierre Hubaux, Naouel Ben Salem

Wi-Fi networks have a very strong potential: They are easy to deploy, they use unlicensed frequencies and they provide Internet connectivity that is several times faster than by cable modem. However, two major problems still need to be solved: the lack of ...

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

Collaborative algorithms for bandwidth and rate allocation in wireless networks

Ali H. Sayed

We propose resource allocation strategies for a class of wireless networks with a clustering protocol. The nodes are assumed stationary and establish connections with the master node according to a priority scheme that relates to their distances from the m ...

2004