Data networks (2nd ed.)
Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
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
Modeling the 802.11 distributed coordination function in nonsaturated heterogeneous conditions
IEEE/ACM Transactions on Networking (TON)
A unified framework for max-min and min-max fairness with applications
IEEE/ACM Transactions on Networking (TON)
Maxmin fair scheduling in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Achieving End-to-end Fairness in 802.11e Based Wireless Multi-Hop Mesh Networks Without Coordination
Mobile Networks and Applications
Max-min fairness in 802.11 mesh networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.01 |
To extend established concepts of fair resource allocation in wired networks to wireless networks, wired model assumptions must be adapted to be relevant for wireless networks as for example, in wireless networks losses due to environmental conditions may occur even in the absence of queueing congestion. Thus fundamental questions of the existence and uniqueness of fair rate allocations must be reconsidered. We treat wireless networks characterized by lossy channels, spatial channel reuse, multiple routes and multiple frequencies. We establish the existence and uniqueness of utility fair and max-min fair solutions and that, as loss rates decrease, fair allocations converge to the loss-less ones.