Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 1332-1340

  Andrews, Matthew ^a   Dinitz, Michael ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; BACKGROUND NOISE; BELL LABS; DISTRIBUTED ALGORITHM; NASH EQUILIBRIUM; NP-HARD; POLYNOMIAL-TIME; PRICE OF ANARCHY; PURE NASH EQUILIBRIUM; SIGNAL TO INTERFERENCE PLUS NOISE RATIO; TRANSMISSION STRATEGIES; WIRELESS NETWORKING;

CELLULAR RADIO SYSTEMS; COMPUTATIONAL COMPLEXITY; GAME THEORY; LINEARIZATION; OPTIMIZATION; PARALLEL ALGORITHMS; POLYNOMIAL APPROXIMATION; POWER TRANSMISSION; SIGNAL RECEIVERS; WIRELESS NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 70349689930     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062048     Document Type: Conference Paper

References (23)

1. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes and systems of linear equations. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pages 724-733, 1993.
2. P. Bahl, M. Hajiaghayi, K. Jain, V. Mirrokni, L. Qiu and A. Saberi. Cell breathing in wireless LANs: Algorithms and evaluation. IEEE Transactions on Mobile Computing 6(2):164-178, 2007.
3. S. Borbash and A. Ephremides. Wireless link scheduling with power control and SINR constraints. IEEE Transactions on Information Theory 52(11): 5106-5111, 2006.
4. H. Breu. Algorithmic aspects of constrained unit disk graphs. PhD thesis. University of British Columbia, 1996.
5. D. Chafekar, V. Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan. Approximation algorithms for computing capacity of wireless networks with SINR constraints. In Proceedings of INFOCOM 08, April 2008.
6. M. Chiang, C. Tan, D. Palomar, D. O'Neill, and D. Julian. Power Control by Geometric Programming. IEEE Trans. on Wireless Communications, 6(7):2640-2651, 2007.
7. T. Erlebach, K. Jansen, and E. Seidel. Polynomial-time approximation schemes for geometric graphs. In Proceedings of the 12th annual ACMSIAM symposium on Discrete algorithms, pages 671-679, 2001.
8. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45(4):634-653, 1998.
9. O. Goussevskaia, Y. Oswald and R. Wattenhofer. Complexity in geometric SINR. In Proceedings of MobiHoc 07, September 2007.
10. P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388-404, 2000.
11. J. Huang, R. Berry and M. Honig. Game theoretic analysis of distributed power control for spread spectrum ad coc networks. In Proceedings of 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 2005.
12. H. Hunt, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz and R. Stearns. NC-approximation schemes for NP-and PSPACE-hard problems for geometric graphs. Journal of Algorithms, 26(2):238-274, 1998.
13. A. Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan. Algorithmic aspects of capacity in wireless networks. In SIGMETRICS, 2005.
14. M. Marathe, H. Breu, H. Hunt III, S. Ravi, and D. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25:59-68, 1995.
15. T. Moscibroda, Y. Oswald and R. Wattenhofer. How optimal are wireless scheduling protocols? In Proceedings of INFOCOM 07, May 2007.
16. T. Moscibroda, R. Wattenhofer and A. Zollinger. Topology control meets SINR: The scheduling complexity of arbitrary topologies. In Proceedings of MobiHoc 06, May 2006.
17. T. Nieberg, J. Hurink, and W. Kern. A robust PTAS for maximum weight independent sets in unit disk graphs. In WG 2004, pages 214-221, 2004.
18. T. Rappaport. Wireless Communications: Principles and Practice. Wiley, 2001.
19. C. Saraydar, N. Mandayam and D. Goodman. Efficient power control via pricing in wireless data networks. IEEE Transactions on Communications, 50(2):291-303, 2002.
20. A. Stolyar and H. Viswanathan. Self-organizing dynamic fractional frequency reuse in OFDMA systems. In Infocom, 2008.
21. L. Tassiulas and A. Ephremides Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12):1936-1949, 1992
22. R. Yates. A framework for uplink power control in cellular radio systems. IEEE Journal on Selected Areas in Communications, 13(7):1341-1347, 1995.
23. S. Yi, Y. Pei, and S. Kalyanaraman. On the capacity improvement of ad hoc wireless networks using directional antennas. In MobiHoc, pages 108-116, 2003.