University of Cambridge > > Optimization and Incentives Seminar > Rate Adaptation Games in Wireless LANs: Nash Equilibrium and Price of Anarchy

Rate Adaptation Games in Wireless LANs: Nash Equilibrium and Price of Anarchy

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sarah Lilienthal.

In Wireless LANs, users may adapt their transmission rates depending on the observed radio conditions on their links to maximize their throughput. Recently, there has been a significant research effort in developing distributed rate adaptation schemes offering better performance than that of the current ARF (Automatic Rate Fallback). Unlike previous works, we 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 aim at adapting their rates to maximize the overall system throughput. We show that the Nash Equilibrium reached in the case of competition can be inefficient (i.e., the price of anarchy is high, up to 50% of the social optimum), and provide insightful properties of the socially optimal rate adaptation schemes. We also show that RTS /CTS does not make the competitive scenario more efficient. We then apply the same analysis to recently proposed collision-aware rate adaptation algorithms and observe similar conclusions. Finally, we propose a novel collision-aware rate adaptation algorithm that significantly reduces the price of anarchy in many scenarios of interest.

This is a joint work with Prasanna Chaporkar and Alexandre Proutiere.

This talk is part of the Optimization and Incentives Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity