A rate-adaptive MAC protocol for multi-Hop wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Opportunistic media access for multirate ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
IEEE 802.11 rate adaptation: a practical approach
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Robust rate adaptation for 802.11 wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Dynamic Programming and Optimal Control, Vol. II
Dynamic Programming and Optimal Control, Vol. II
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Optimal power control for Rayleigh-faded multiuser systems with outage constraints
IEEE Transactions on Wireless Communications
Improvement of WLAN Contention Resolution by Loss Differentiation
IEEE Transactions on Wireless Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In Wireless LANs, users may adapt their transmission rates depending on the radio conditions of their links so as to maximize their throughput. Recently, there has been a significant research effort in developing distributed rate adaptation schemes. Unlike previous works that mainly focus on channel tracking, this paper characterizes the optimal reaction of a rate adaptation protocol to the contention information received from the MAC. We formulate this problem analytically. We study both competitive and cooperative user behaviors. In the case of competition, users selfishly adapt their rates so as to maximize their own throughput, whereas in the case of cooperation they adapt their rates so as to maximize the overall system throughput. We show that the Nash Equilibrium reached in the case of competition is inefficient (i.e. the price of anarchy goes to infinity as the number of users increases), and provide insightful properties of the socially optimal rate adaptation schemes. We find that recently proposed collision-aware rate adaptation algorithms decrease the price of anarchy. We also propose a novel collision-aware rate adaptation algorithm that further reduces the price of anarchy.