Resource allocation and admission control algorithm based on non-cooperation game in wireless mesh networks

Abstract

With wireless mesh networks widely deployed in daily life, more and more researchers have begun to put their eyes on the problem of resource allocation and load balancing as well as networking security in wireless mesh networks. The admission control strategy takes great advantages in resource allocation and network load, thus having been widely applied in wireless networking. To maximize the benefits of game participants, it is essential to build an effective admission control model for user admission and resource allocation. Game theory, as an effective analytical modeling tool, is widely used in wireless networking researches. The access points determine whether to allow user’s access according to the admission control mechanism, for which this paper investigates resource allocation in wireless mesh networks. Our main works and contributions are as follows. Firstly, this paper analysis the importance of admission control in wireless mesh network, and addresses the problem of resource allocation and user admission control with game theory on the basis of existing researches. Secondly, this paper depicts the architecture and features of wireless mesh network as well as the functionality of admission control. Then, an admission control algorithm with the non-cooperative game theory for bandwidth and connections allocation in each network area is proposed based on the networking coverage, in which the Nash equilibrium existence is proved. This paper evaluates the proposed algorithm with blocking rate and system efficiency in the networks, which indicates that it is effective and efficient to allocate resource for each area dynamically.