On a game theoretic approach to capacity maximization in wireless networks
Preprint
Abstract
We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the number of successful connections in arbitrary wireless networks where a transmission is successful only if the signal-to-interference-plus-noise ratio at the receiver is greater than some threshold. We study a game theoretic approach towards capacity maximization introduced by Andrews and Dinitz (INFOCOM 2009) and Dinitz (INFOCOM 2010). We prove vastly improved bounds for the game theoretic algorithm. In doing so, we achieve the first distributed constant factor approximation algorithm for capacity maximization for the uniform power assignment. When compared to the optimum where links may use an arbitrary power assignment, we prove a $O(\log \Delta)$ approximation, where $\Delta$ is the ratio between the largest and the smallest link in the network. This is an exponential improvement of the approximation factor compared to existing results for distributed algorithms. All our results work for links located in any metric space. In addition, we provide simulation studies clarifying the picture on distributed algorithms for capacity maximization.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Improved algorithms for latency minimization in wireless networksTheoretical Computer Science, 2011
- Wireless Capacity with Oblivious Power in General Metrics2011
- Distributed Algorithms for Approximating Wireless Network Capacity2010
- Distributed Contention Resolution in Wireless NetworksLecture Notes in Computer Science, 2010
- Capacity of Arbitrary Wireless Networks2009
- Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory2009
- Wireless Communication Is in APX2009
- The Complexity of Connectivity in Wireless Networks2006
- Radio propagation characteristics in subway platform and tunnel in 2.5 GHz band2002
- The Nonstochastic Multiarmed Bandit ProblemSIAM Journal on Computing, 2002