Variable-Width Channel Allocation for Access Points: A Game-Theoretic Perspective
Channel allocation is a crucial concern in variable-width Wireless Local Area Networks (WLANs). This paper aims to obtain the stable and fair non-overlapped variable-width channel allocation for selfish Access Points (APs). In the scenario of single collision domain, the channel allocation problem reduces to a channel-width allocation problem, which can be formulated as a non-cooperative game. Nash Equilibrium (NE) of the game corresponds to a desired channel-width allocation. A distributed algorithm is developed to achieve the NE channel-width allocation that globally maximizes the network utility. A punishment-based cooperation self-enforcement mechanism is further proposed to ensure that the APs obey the proposed scheme.