Distributed algorithms for approximating wireless network capacity

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Dinitz, Michael ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC GAME THEORY; DISTRIBUTED ALGORITHM; INTERFERENCE GRAPHS; MACHINE-LEARNING; PHYSICAL ASSUMPTIONS; PHYSICAL MODEL; PROTOCOL MODEL; WIRELESS NETWORK CAPACITY;

GAME THEORY; MODELS; NETWORK PROTOCOLS; TRANSMITTERS; WIRELESS NETWORKS;

LEARNING ALGORITHMS;

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

References (20)

1. M. Andrews and M. Dinitz, "Maximizing capacity in arbitrary wireless networks in the SINR model: complexity and game theory," in INFOCOM, 2009.
2. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire, "The nonstochastic multiarmed bandit problem," SIAM J. Comput., vol. 32, no. 1, pp. 48-77, 2003.
3. A. Blum, M. Hajiaghayi, K. Ligett, and A. Roth, "Regret minimization and the price of total anarchy," in STOC '08: Proceedings of the 40th annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 2008, pp. 373-382.
4. C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou, "The complexity of computing a nash equilibrium," in STOC '06: Proceedings of the thirty-eighth annual ACM Symposium on Theory of Computing. NewYork, NY, USA: ACM, 2006, pp. 71-78.
5. T. Erlebach, K. Jansen, and E. Seidel, "Polynomial-time approximation schemes for geometric graphs," in SODA '01: Proceedings of the twelfth annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2001, pp. 671-679.
6. O. Goussevskaia, M. Halldórsson, R. Wattenhofer, and E. Welzl, "Capacity of arbitrary wireless networks," in INFOCOM, 2009.
7. O. Goussevskaia, Y. A. Oswald, and R. Wattenhofer, "Complexity in geometric SINR," in MobiHoc '07: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York, NY, USA: ACM, 2007, pp. 100-109.
8. P. Gupta and P. Kumar, "The capacity of wireless networks," , IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388-404, Mar 2000.
9. M. Halldorsson and R. Wattenhofer, "Wireless Communication is in APX," in 36th International Colloquium on Automata, Languages and Programming (ICALP), Rhodes, Greece, July 2009.
10. V. Kanade and S. Vempala, "Life (and routing) on the wireless manifold," in Sixth Workshop on Hot Topics in Networks (HotNets-VI). NewYork, NY, USA: ACM, 2007.
11. F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer, "Fast deterministic distributed maximal independent set computation on growth-bounded graphs," in DISC, 2005, pp. 273-287.
12. N. Littlestone and M. Warmuth, "The weighted majority algorithm," Symposium on Foundations of Computer Science, vol. 0, pp. 256-261, 1989.
13. T. Moscibroda and R. Wattenhofer, "The complexity of connectivity in wireless networks," INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, pp. 1-13, April 2006.
14. T. Moscibroda, R. Wattenhofer, and A. Zollinger, "Topology control meets SINR: the scheduling complexity of arbitrary topologies," in MobiHoc '06: Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York, NY, USA: ACM, 2006, pp. 310-321.
15. T. Nieberg, J. Hurink, and W. Kern, "Approximation schemes for wireless networks," ACM Trans. Algorithms, vol. 4, no. 4, pp. 1-17, 2008.
16. T. Rappaport, Wireless Communications: Principles and Practice. Upper Saddle River, NJ, USA: Prentice Hall PTR, 2001.
17. C. Saraydar, N. Mandayam, and D. Goodman, "Efficient power control via pricing in wireless data networks," IEEE Transactions on Communications, vol. 50, no. 2, pp. 291-303, Feb 2002.
18. J. Schneider and R. Wattenhofer, "A log-star distributed maximal independent set algorithm for growth-bounded graphs," in PODC '08: Proceedings of the twenty-seventh ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2008, pp. 35-44.
19. A. Stolyar and H. Viswanathan, "Self-organizing dynamic fractional frequency reuse in ofdma systems," INFOCOM 2008. The 27th IEEE Conference on Computer Communications, pp. 691-699, April 2008.
20. S. Yi, Y. Pei, and S. Kalyanaraman, "On the capacity improvement of ad hoc wireless networks using directional antennas," in MobiHoc '03: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing. New York, NY, USA: ACM, 2003, pp. 108-116.