Hop-by-hop congestion control over a wireless multi-hop network
IEEE/ACM Transactions on Networking (TON)
Throughput analysis of IEEE802.11 multi-hop ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Complexity in wireless scheduling: impact and tradeoffs
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
On throughput in linear wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Understanding congestion control in multi-hop wireless mesh networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
Stability of Parallel Queueing Systems with Coupled Service Rates
Discrete Event Dynamic Systems
Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Stability of N interacting queues in random-access systems
IEEE Transactions on Information Theory
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
IEEE Transactions on Information Theory
The IEEE 802.11s Extended Service Set Mesh Networking Standard
IEEE Communications Magazine
EZ-Flow: removing turbulence in IEEE 802.11 wireless mesh networks without message passing
Proceedings of the 5th international conference on Emerging networking experiments and technologies
FloorNet: deployment and evaluation of a multihop wireless 802.11 testbed
EURASIP Journal on Wireless Communications and Networking - Special issue on simulators and experimental testbeds design and development for wireless networks
Extra back-off flow control in multi-hop wireless networks
Performance Evaluation
Enhance & explore: an adaptive algorithm to maximize the utility of wireless networks
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Tandem queueing networks with neighbor blocking and back-offs
Queueing Systems: Theory and Applications
Understanding and tackling the root causes of instability in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.