The Price of Local Power Control in Wireless Scheduling

Authors Magnús M. Halldórsson, Tigran Tonoyan

Thumbnail PDF


  • Filesize: 0.53 MB
  • 14 pages

Document Identifiers

Author Details

Magnús M. Halldórsson
Tigran Tonoyan

Cite AsGet BibTex

Magnús M. Halldórsson and Tigran Tonoyan. The Price of Local Power Control in Wireless Scheduling. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 529-542, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


We consider the problem of scheduling wireless links in the physical model, where we seek an assignment of power levels and a partition of the given set of links into the minimum number of subsets satisfying the signal-to-interference-and-noise-ratio (SINR) constraints. Specifically, we are interested in the efficiency of local power assignment schemes, or oblivious power schemes, in approximating wireless scheduling. Oblivious power schemes are motivated by networking scenarios when power levels must be decided in advance, and not as part of the scheduling computation. We present the first O(log log Delta)-approximation algorithm, which is known to be best possible (in terms of Delta) for oblivious power schemes, where Delta is the longest to shortest link length ratio. We achieve this by representing interference by a conflict graph, which allows the application of graph-theoretic results for a variety of related problems, including the weighted capacity problem. We explore further the contours of approximability and find the choice of power assignment matters; that not all metric spaces are equal; and that the presence of weak links makes the problem harder. Combined, our results resolve the price of local power for wireless scheduling, or the value of allowing unfettered power control.
  • Wireless Scheduling
  • Physical Model
  • Oblivious Power


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, and Liam Roditty. SINR diagrams: Convexity and its applications in wireless networks. J. ACM, 59(4), 2012. Google Scholar
  2. Marijke Bodlaender and Magnús M. Halldórsson. Beyond geometry: Towards fully realistic wireless models. In PODC, 2014. Google Scholar
  3. D. Chafekar, V.S. Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan. Cross-layer latency minimization for wireless networks using SINR constraints. In Mobihoc, 2007. Google Scholar
  4. Rene L. Cruz and Arvind Santhanam. Optimal Routing, Link Scheduling, and Power Control in Multi-hop Wireless Networks. In INFOCOM, 2003. Google Scholar
  5. Sebastian Daum, Seth Gilbert, Fabian Kuhn, and Calvin C. Newport. Broadcast in the ad hoc SINR model. In DISC, pages 358-372, 2013. Google Scholar
  6. Michael Dinitz. Distributed algorithms for approximating wireless network capacity. In INFOCOM, pages 1397-1405, 2010. Google Scholar
  7. T. ElBatt and A. Ephremides. Joint Scheduling and Power Control for Wireless Ad-hoc Networks. In INFOCOM, 2002. Google Scholar
  8. A. Fanghänel, T. Kesselheim, H. Räcke, and B. Vöcking. Oblivious interference scheduling. In PODC, pages 220-229, August 2009. Google Scholar
  9. Alexander Fanghänel, Thomas Kesselheim, and Berthold Vöcking. Improved algorithms for latency minimization in wireless networks. Theor. Comput. Sci., 412(24):2657-2667, 2011. Google Scholar
  10. Liqun Fu, Soung Chang Liew, and Jianwei Huang. Power controlled scheduling with consecutive transmission constraints: complexity analysis and algorithm design. In INFOCOM, pages 1530-1538. IEEE, 2009. Google Scholar
  11. Olga Goussevskaia, Magnús M. Halldórsson, and Roger Wattenhofer. Algorithms for wireless capacity. IEEE/ACM Trans. Netw., 22(3):745-755, 2014. Google Scholar
  12. Olga Goussevskaia, Yvonne-Anne Oswald, and Roger Wattenhofer. Complexity in geometric SINR. In MobiHoc, pages 100-109, 2007. Google Scholar
  13. Helga Gudmundsdottir, Eyjólfur I. Ásgeirsson, Marijke Bodlaender, Joseph T. Foley, Magnús M. Halldórsson, and Ymir Vigfusson. Measurement based interference models for wireless scheduling algorithms. In MSWiM, 2014. arXiv:1401.1723. Google Scholar
  14. P. Gupta and P. R. Kumar. The Capacity of Wireless Networks. IEEE Trans. Inf. Theory, 46(2):388-404, 2000. Google Scholar
  15. M. M. Halldórsson. Wireless scheduling with power control. ACM Transactions on Algorithms, 9(1):7, December 2012. Google Scholar
  16. M. M. Halldórsson and P. Mitra. Nearly optimal bounds for distributed wireless scheduling in the SINR model. In ICALP, 2011. Google Scholar
  17. Magnús M. Halldórsson and Jorgen Bang-Jensen. A note on vertex coloring edge-weighted digraphs. Technical Report 29, Institute Mittag-Leffler, Preprints Graphs, Hypergraphs, and Computing, 2014. Google Scholar
  18. Magnús M. Halldórsson, Stephan Holzer, Pradipta Mitra, and Roger Wattenhofer. The power of non-uniform wireless power. In SODA, pages 1595-1606, 2013. Google Scholar
  19. Magnús M. Halldórsson and Pradipta Mitra. Wireless Capacity with Oblivious Power in General Metrics. In SODA, 2011. Google Scholar
  20. Magnús M. Halldórsson and Pradipta Mitra. Wireless capacity and admission control in cognitive radio. In INFOCOM, pages 855-863, 2012. Google Scholar
  21. Magnús M. Halldórsson and Pradipta Mitra. Wireless Connectivity and Capacity. In SODA, 2012. Google Scholar
  22. Magnús M. Halldórsson and Tigran Tonoyan. How well can graphs represent wireless interference? In STOC, 2015. Google Scholar
  23. Magnús M. Halldórsson and Roger Wattenhofer. Wireless communication is in APX. In ICALP, pages 525-536, 2009. Google Scholar
  24. Juha Heinonen. Lectures on Analysis on Metric Spaces. Springer, 1 edition, 2000. Google Scholar
  25. Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rozanski, and Grzegorz Stachowiak. On the impact of geometry on ad hoc communication in wireless networks. In PODC, pages 357-366, 2014. Google Scholar
  26. Bastian Katz, M Volker, and Dorothea Wagner. Energy efficient scheduling with power control for wireless networks. In WiOpt, pages 160-169. IEEE, 2010. Google Scholar
  27. T. Kesselheim. A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model. In SODA, 2011. Google Scholar
  28. T. Kesselheim. Approximation algorithms for wireless link scheduling with flexible data rates. In ESA, pages 659-670, 2012. Google Scholar
  29. T. Kesselheim and B. Vöcking. Distributed contention resolution in wireless networks. In DISC, pages 163-178, August 2010. Google Scholar
  30. Henry Lin and Frans Schalekamp. On the complexity of the minimum latency scheduling problem on the Euclidean plane. arXiv preprint 1203.2725, 2012. Google Scholar
  31. Ritesh Maheshwari, Shweta Jain, and Samir R. Das. A measurement study of interference modeling and scheduling in low-power wireless networks. In SenSys, pages 141-154, 2008. Google Scholar
  32. Thomas Moscibroda and Roger Wattenhofer. The complexity of connectivity in wireless networks. In INFOCOM, pages 1-13, 2006. Google Scholar
  33. Thomas Moscibroda, Roger Wattenhofer, and Yves Weber. Protocol design beyond graph-based models. In HotNets, 2006. Google Scholar
  34. Thomas Moscibroda, Roger Wattenhofer, and Aaron Zollinger. Topology control meets SINR: the scheduling complexity of arbitrary topologies. In MobiCom, pages 310-321, 2006. Google Scholar
  35. Theodore S. Rappaport. Wireless Communications: Principles and Practice. Prentice Hall, 2 edition, 2002. Google Scholar
  36. Dongjin Son, Bhaskar Krishnamachari, and John Heidemann. Experimental study of concurrent transmission in wireless sensor networks. In SenSys, pages 237-250. ACM, 2006. Google Scholar
  37. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automat. Contr., 37(12):1936-1948, 1992. Google Scholar
  38. Tigran Tonoyan. On the capacity of oblivious powers. In ALGOSENSORS, pages 225-237, 2011. Google Scholar
  39. Tigran Tonoyan. On some bounds on the optimum schedule length in the SINR model. In ALGOSENSORS, pages 120-131, 2012. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail