Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
A comparison of mechanisms for improving TCP performance over wireless links
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Fairness in Routing and Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
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
End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach
IEEE Transactions on Mobile Computing
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Congestion Avoidance Based on Lightweight Buffer Management in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Interference-aware fair rate control in wireless sensor networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Localized algorithm for aggregate fairness in wireless sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Distributed Flow Control and Medium Access in Multihop Ad Hoc Networks
IEEE Transactions on Mobile Computing
Distributed link scheduling with constant overhead
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fairness and optimal stochastic control for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Realising max-min fairness in 802.11e mesh networks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
IEEE Journal on Selected Areas in Communications
Max-min fairness in 802.11 mesh networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
To promote commercial deployment of multihop wireless networks, the research/industry communities must develop new theories and protocols for flexible traffic engineering in these networks in order to support diverse user applications. This paper studies an important traffic engineering problem-how to support fair bandwidth allocation among all end-to-end flows in a multihop wireless network-which, in a more precise term, is to achieve the global maxmin fairness objective in bandwidth allocation. There exists no distributed algorithm for this problem in multihop wireless networks using IEEE 802.11 DCF. We have two major contributions. The first contribution is to develop a novel theory that maps the global maxmin objective to four local conditions and prove their equivalence. The second contribution is to design a distributed rate adjustment protocol based on those local conditions to achieve the global maxmin objective through fully distributed operations. Comparing with the prior art, our protocol has a number of advantages. It is designed for the popular IEEE 802.11 DCF. It replaces per-flow queueing with per-destination queueing. It achieves far better fairness (or weighted fairness) among end-to-end flows.