Scheduling algorithms for input-queued cell switches
Scheduling algorithms for input-queued cell switches
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
ATP: A Reliable Transport Protocol for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Understanding Linux Network Internals
Understanding Linux Network Internals
Resource Allocation and Cross Layer Control in Wireless Networks (Foundations and Trends in Networking, V. 1, No. 1)
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Horizon: balancing tcp over multiple paths in wireless mesh network
Proceedings of the 14th ACM international conference on Mobile computing and networking
Active capture of wireless traces: overcome the lack in protocol analysis
Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards utility-optimal random access without message passing
Wireless Communications & Mobile Computing - Recent Advances in Wireless Communications and Networks
Back-pressure routing and rate control for ICNs
Proceedings of the sixteenth annual international conference on Mobile computing and networking
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
XPRESS: a cross-layer backpressure architecture for wireless multi-hop networks
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions
IEEE/ACM Transactions on Networking (TON)
Understanding and tackling the root causes of instability in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Achieving efficient bandwidth utilization in wireless networks requires solving two important problems: (1) which packets to send (i.e., packet scheduling) and (2) which links to concurrently activate (i.e., link scheduling). To address these scheduling problems, many algorithms have been proposed and their throughput optimality and stability are proven in theory. One of the most well-known scheduling algorithms is backpressure scheduling which performs both link and packet scheduling assuming a TDMA (Time Division Multiple Access) MAC (Medium Access Control) layer. However, there has been limited work on realizing backpressure scheduling with a CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) MAC layer (e.g., IEEE 802.11). In IEEE 802.11 networks, it is expected that the throughput optimality will not be achieved. In this paper, we investigate the extent of this throughput gap between theoretical TDMA-based backpressure scheduling and an approximation of it for IEEE 802.11 WMNs (Wireless Mesh Networks). Through extensive testbed measurements, we verify that there is indeed a non-negligible throughput gap. We present two main reasons behind this gap: Control inaccuracy that results from approximation of link scheduling and information inaccuracy that results from late or incorrect information, for instance, about queue lengths or network topology. Our results show that losses by MAC-layer collisions and backoff, which mainly occur due to control inaccuracy plays a major role for the throughput gap. On the other hand, while losses by queue drops, typically due to information inaccuracy, do occur, their effect can be tolerated. Nevertheless, both types of inaccuracies need to be mitigated in order to improve throughput.