A Price Based Decentralized Rate Selection in IEEE 802.11 Based WLANS

Authors:
Laxminarayana S. Pillutla;Vikram Krishnamurthy
Affiliations:
Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT), Gandhinagar, India 382007;Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, Canada V6T1Z4
Venue:
Wireless Personal Communications: An International Journal
Year:
2011

Citing 6
Cited 0

Variable-sample methods for stochastic optimization

ACM Transactions on Modeling and Computer Simulation (TOMACS)
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
Time-based fairness improves performance in multi-rate WLANs

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications
Distributed interference compensation for wireless networks

IEEE Journal on Selected Areas in Communications
CoopMAC: A Cooperative MAC for Wireless LANs

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of decentralized rate selection in IEEE 802.11 wireless local area networks (WLANs). Owing to the decentralized nature of WLANs, we formulate the current problem of rate selection as a non-cooperative game where individual users (players) of a WLAN can pick their actions from a finite set of physical layer modulation rates. The utility of each user is the difference of throughput and a cost incurred due to the price imposed by the access point. We prove the resulting non-cooperative game to be supermodular, and hence has at least one pure strategy Nash equilibrium, that is contained in a set bounded by the smallest and largest Nash equilibria. We also prove the smallest and largest Nash equilibria to be non-decreasing functions of the price and the smallest Nash equilibrium to be Pareto-dominant. We present an algorithm to compute the best response of each user asynchronously, that converges almost surely to the smallest Nash equilibrium of the game. Next we extend our price based approach to the multi-channel case and prove the resulting game to be supermodular in the special case of two channels. Our simulation results demonstrate the improvement in overall network throughput with appropriate tuning of the price.