Skip to Main Content
This paper addresses the throughput maximization problem in wireless mesh networks. For the case of cooperative access points, we present a negotiation-based throughput maximization algorithm which adjusts the operating channel and power level among access points automatically, from a game-theoretical perspective. We show that this algorithm converges to the optimal channel and power assignment which yields the maximum overall throughput with arbitrarily high probability. Moreover, we analyze the scenario where access points belong to different regulation entities and hence non-cooperative. The long- term behavior and corresponding performance are investigated and the analytical results are verified by simulations.