Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
ACM Transactions on Computer Systems (TOCS)
End-to-end performance and fairness in multihop wireless backhaul networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Distributed Fair Scheduling in a Wireless LAN
IEEE Transactions on Mobile Computing
Hop-by-hop congestion control over a wireless multi-hop network
IEEE/ACM Transactions on Networking (TON)
Fairness and load balancing in wireless LANs using association control
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
Understanding congestion control in multi-hop wireless mesh networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
Aziala-net: deploying a scalable multi-hop wireless testbed platform for research purposes
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Online optimization of 802.11 mesh networks
Proceedings of the 5th international conference on Emerging networking experiments and technologies
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
Elucidating the instability of random access wireless Mesh networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
IEEE/ACM Transactions on Networking (TON)
Elastic rate limiting for spatially biased wireless mesh networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
ns-3-click: click modular router integration for ns-3
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
IEEE Transactions on Information Theory
A measurement-based algorithm to maximize the utility of wireless networks
S3 '11 Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students
Channel switching control policy for wireless mesh networks
Journal of Parallel and Distributed Computing
WiFox: scaling WiFi performance for large audience environments
Proceedings of the 8th international conference on Emerging networking experiments and technologies
| Hi-index | 0.00 |
The goal of jointly providing efficiency and fairness in wireless networks can be seen as the problem of maximizing a given utility function. In contrast with wired networks, the capacity of wireless networks is typically time-varying and not known explicitly. Hence, as the capacity region is impossible to know or measure exactly, existing scheduling schemes either under-estimate it and are too conservative, or they over-estimate it and suffer from congestion collapse. We propose a new adaptive algorithm, called Enhance & Explore (E&E). It maximizes the utility of the network without requiring any explicit characterization of the capacity region. E&E works above the MAC layer and it does not demand any modification to the existing networking stack. We first evaluate our algorithm theoretically and we prove that it converges to a state of optimal utility. We then evaluate the performance of the algorithm in a WLAN setting, using both simulations and real measurements on a testbed composed of IEEE 802.11 wireless routers. Finally, we investigate a wireless mesh network setting and we find that, when coupled with an efficientmechanismfor congestioncontrol, the E&E algorithm greatly increases the utility achieved by multi-hop networks as well.