Variable-width channel allocation in wireless LAN: a game-theoretic perspective

Authors:
Wei Yuan;Wei Liu;Wenqing Cheng;Shu Wang
Affiliations:
The Department of Electronics and Information Engineering, HuaZhong University of Science and Technology, China;The Department of Electronics and Information Engineering, HuaZhong University of Science and Technology, China;The Department of Electronics and Information Engineering, HuaZhong University of Science and Technology, China;The Department of Electronics and Information Engineering, HuaZhong University of Science and Technology, China
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 8
Cited 0

Elements of information theory

Elements of information theory
Characterizing mobility and network usage in a corporate wireless local-area network

Proceedings of the 1st international conference on Mobile systems, applications and services
Partially overlapped channels not considered harmful

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Game Theory for Wireless Engineers (Synthesis Lectures on Communications)

Game Theory for Wireless Engineers (Synthesis Lectures on Communications)
A case for adapting channel width in wireless networks

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Enabling dynamic spectrum allocation in cognitive radio networks

Enabling dynamic spectrum allocation in cognitive radio networks
Repeated open spectrum sharing game with cheat-proof strategies

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The fixed channelization structure used by IEEE 802.11-based WLANs constrains the total capacity and leads to unfairness. The concept of variable-width channels is recently proposed to overcome these drawbacks. To investigate the problem of the non-overlapping variable-width channel allocation for selfish access points (APs) in a WLAN, we model it as a non-cooperative game. we aim to investigate two fundamental issues on it in this paper: 1) Are there some fair and system-optimal Nash equilibrium (NE) allocations? 2) How to achieve one of these desirable allocations if they exist? At first, the existence of fair and system-optimal Nash equilibria in this game is proved. Then, a simple protocol to achieve one of these desirable NE allocations is proposed. Considering the implementation issues, a punishment-based method and a transfer-based self-enforcing truth-telling method are proposed for single-stage and multi-stage game scenarios respectively. The numerical results show the effectiveness of our approaches.