A Constant-factor approximation for wireless capacity maximization with power control in the SINR model

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 1549-1559

  Kesselheim, Thomas ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; SET THEORY; SIGNAL INTERFERENCE; TOPOLOGY;

CONSTANT FACTOR APPROXIMATION; GENERAL METRIC SPACES; MAXIMIZATION PROBLEM; MINIMUM DISTANCE; MULTI-HOP SCHEDULING; NETWORK PARAMETERS; PHYSICAL INTERFERENCE MODELS; WIRELESS CAPACITY;

POWER CONTROL;

EID: 79955729313     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.120     Document Type: Conference Paper

References (22)

1. Matthew Andrews and Michael Dinitz. Maximizing capacity in arbitrary wireless networks in the sinr model: Complexity and game theory. In Proceedings of the 28th Conference of the IEEE Communications Society (INFOCOM), 2009.
2. Gurashish Brar, Douglas M. Blough, and Paolo Santi. Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks. In Proceedings of the 12th annual international conference on Mobile computing and networking (MobiCom), pages 2-13, 2006. (Pubitemid 44758699)
3. Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, and Aravind Srinivasan. Cross-layer latency minimization in wireless networks with SINR constraints. In Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pages 110-119, 2007.
4. Devdatt P. Dubhashi and Desh Ranjan. Balls and bins: A study in negative dependence. Random Structures and Algorithms, 13(2):99-124, 1998.
5. Tamer A. ElBatt and Anthony Ephremides. Joint scheduling and power control for wireless ad hoc networks. IEEE Transactions on Wireless Communication, 3 (1): 74-85, 2004.
6. Alexander Fanghänel, Sascha Geulen, Martin Hoefer, and Berthold Vöcking. Online capacity maximization in wireless networks. In Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures (SPAA), pages 92-99, 2010.
7. Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, and Berthold Vöcking. Oblivious interference scheduling. In Proceedings of the 28th ACM symposium on Principles of distributed computing (PODC), pages 220-229, 2009.
8. Alexander Fanghänel, Thomas Kesselheim, and Berthold Vöcking. Improved algorithms for latency minimization in wireless networks. In Proceedings of the 36th International EATCS Colloquium on Automata, Languages and Programming (ICALP), pages 447-458, 2009.
9. Olga Goussevskaia, Magnús M. Halldórsson, Roger Wattenhofer, and Emo Welzl. Capacity of arbitrary wireless networks. In Proceedings of the 28th Conference of the IEEE Communications Society (INFOCOM), 2009.
10. Olga Goussevskaia, Yvonne Anne Oswald, and Roger Wattenhofer. Complexity in geometric SINR. In Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pages 100-109, 2007.
11. Magnús M. Halldórsson. Wireless scheduling with power control. In Proceedings of the 17th annual European Symposium on Algorithms (ESA), pages 361- 372, 2009.
12. Magnús M. Halldórsson and Pradipta Mitra. Wireless capacity with oblivious power in general metrics. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011.
13. Magnús M. Halldórsson and Roger Wattenhofer. Computing wireless capacity. unpublished manuscript, 2010.
14. Thomas Kesselheim and Berthold Vöcking. Distributed contention resolution in wireless networks. In Proceedings of the 24th International Symposium on Distributed Computing (DISC), pages 163-178, 2010.
15. F. T. Leighton, Bruce M. Maggs, and Satish B. Rao. Packet routing and job-shop scheduling in O(congestion-l-dilation) steps. Combinatorica, 1994.
16. Thomas Moscibroda, Yvonne Anne Oswald, and Roger Wattenhofer. How optimal are wireless scheduling protocols? In Proceedings of the 26th Conference of the IEEE Communications Society (INFOCOM), 2007.
17. Thomas Moscibroda and Roger Wattenhofer. The complexity of connectivity in wireless networks. In Proceedings of the 25th Conference of the IEEE Communications Society (INFOCOM), pages 1-13, 2006.
18. Thomas Moscibroda, Roger Wattenhofer, and Yves Weber. Protocol design beyond graph-based models. In In Proceedings of the 5th ACM SIGCOMM Workshop on Hot Topics in Networks (HotNets) 2006, 2006.
19. Thomas Moscibroda, Roger Wattenhofer, and Aaron Zollinger. Topology control meets SINR: The scheduling complexity of arbitrary topologies. In Proceedings of the 7th ACM International Symposium Mobile Ad- Hoc Networking and Computing (MOBIHOC), pages 310-321, 2006. (Pubitemid 44300729)
20. Prabhakar Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37(2):130-143. 1988.
21. Peng-Jun Wan, Xiaohua Jia, and Frances Yao. Maximum independent set of links under physical interference model. In Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (WASA), pages 169-178, 2009.
22. J. Zander. Performance of optimum transmitter power control in cellular radio systems. IEEE Transactions on Vehicular Technology, 41(1):57, 1992.