Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
IEEE 802.11 Ad Hoc Networks: Performance Measurements
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED
Proceedings of the 9th annual international conference on Mobile computing and networking
End-to-end performance and fairness in multihop wireless backhaul networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Modeling media access in embedded two-flow topologies of multi-hop wireless networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Harnessing exposed terminals in wireless networks
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Understanding congestion control in multi-hop wireless mesh networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
| Hi-index | 0.00 |
Wireless mesh networks can provide scalable high-speed Internet access at a low cost. Fair channel access among different nodes in the wireless mesh network, however, is an important consideration that needs technological solutions before mesh networks can be widely deployed. Lack of fairness significantly decreases the throughput of nodes that are more than one hop away from mesh gateways. We propose an analytical model and use simulation studies to establish the existence of starvation in mesh networks even when we can ameliorate problems due to exposed terminals. Motivated by the inability of standard medium access control (MAC) protocols to limit starvation, we propose a modification to the MAC protocol to alleviate flow starvation. Our proposed algorithm improves the channel usage of short-term flows with nodes that are multiple hops from the gateway by a factor of 7 in some cases with a penalty of 20% reduction in total throughput across all nodes. Our proposed algorithm also has a better performance than two other schemes in terms of a higher fairness index.