135905
20190316234534.0
000274763900018
ISI
CONF
Elucidating the Instability of Random Access Wireless Mesh Networks
2009
2009
Conference Papers
We investigate both theoretically and experimentally the stability of CSMA-based wireless mesh networks, where a network is said to be stable if and only if the queue of each relay node remains (almost surely) finite. We identify two key factors that impact stability: the network size and the so-called “stealing effect”, a consequence of the hidden node problem and non-zero propagation delays. We consider the case of a greedy source and prove, by using Foster’s theorem, that 3-hop networks are stable, but only if the stealing effect is accounted for. On the other hand, we prove that 4-hop networks are always unstable (even with the stealing effect) and show by simulations that instability extends to more complex linear and non-linear topologies. We devise a stabilization strategy that throttles the source and prove that there exists a finite, non-zero rate at which the source can transmit while keeping the system stable. We run real experiments on a testbed composed of IEEE 802.11 nodes, which show the contrasting behavior of 3-hop and 4-hop networks and the effectiveness of our stabilization strategy.
Throughput
Stability
Systems
Aziz, Adel
149125
242765
Starobinski, David
Thiran, Patrick
103925
240373
SECON 2009
Rome
June 22-26, 2009
SECON
URL
http://www.ieee-secon.org/2009/
1063558
n/a
http://infoscience.epfl.ch/record/135905/files/SECON09_AST.pdf
LCA
252614
US00024
LCA3
252454
U10431
oai:infoscience.tind.io:135905
IC
conf
GLOBAL_SET
LCA-CONF-2009-010
EPFL
PUBLISHED
REVIEWED
CONF