Universal Framework for Wireless Scheduling Problems

An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and rate adjustment? We propose the first framework for approximation algorithms in the physical model that addresses these questions in full, including rate control. The approximations obtained are doubly logarithmic in the link length and rate diversity. Where previous bounds are known, this gives an exponential improvement. A key contribution is showing that the complex interference relationship of the physical model can be simplified into a novel type of amenable conflict graphs, at a small cost. We also show that the approximation obtained is provably the best possible for any conflict graph formulation.

[1]  Magnús M. Halldórsson,et al.  Wireless capacity with oblivious power in general metrics , 2011, SODA '11.

[2]  Tigran Tonoyan,et al.  On Some Bounds on the Optimum Schedule Length in the SINR Model , 2012, ALGOSENSORS.

[3]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[4]  Marcos Augusto M. Vieira,et al.  Wireless scheduling with multiple data rates: From physical interference to disk graphs , 2016, Comput. Networks.

[5]  Allan Borodin,et al.  Elimination graphs , 2009, TALG.

[6]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[7]  Aravind Srinivasan,et al.  Cross-layer latency minimization in wireless networks with SINR constraints , 2007, MobiHoc '07.

[8]  Akcoglu Karhan,et al.  Opportunity Cost Algorithms for Combinatorial Auctions , 2000 .

[9]  Karhan Akcoglu,et al.  Opportunity Cost Algorithms for Combinatorial Auctions , 2000, ArXiv.

[10]  Magnús M. Halldórsson,et al.  How Well Can Graphs Represent Wireless Interference? , 2014, STOC.

[11]  Berthold Vöcking,et al.  Improved algorithms for latency minimization in wireless networks , 2009, Theor. Comput. Sci..

[12]  John N. Tsitsiklis,et al.  Hardness of Low Delay Network Scheduling , 2011, IEEE Transactions on Information Theory.

[13]  Thomas Kesselheim.  Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates , 2012, ESA.

[14]  Michael Dinitz,et al.  Distributed Algorithms for Approximating Wireless Network Capacity , 2010, 2010 Proceedings IEEE INFOCOM.

[15]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[16]  Jean C. Walrand,et al.  Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling , 2010, IEEE Transactions on Information Theory.

[17]  Jørgen Bang-Jensen,et al.  Vertex coloring edge-weighted digraphs , 2015, Inf. Process. Lett..

[18]  Peng-Jun Wan,et al.  Multiflows in multihop wireless networks , 2009, MobiHoc '09.

[19]  Bastian Katz,et al.  Energy efficient scheduling with power control for wireless networks , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[20]  Magnús M. Halldórsson.  Wireless scheduling with power control , 2012, TALG.

[21]  Magnús M. Halldórsson,et al.  Wireless capacity and admission control in cognitive radio , 2012, 2012 Proceedings IEEE INFOCOM.

[22]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[23]  R. Srikant,et al.  Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[24]  Henry Lin,et al.  Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane , 2012, SPAA '12.

[25]  Roger Wattenhofer,et al.  Complexity in geometric SINR , 2007, MobiHoc '07.

[26]  Thomas Kesselheim,et al.  A constant-factor approximation for wireless capacity maximization with power control in the SINR model , 2010, SODA '11.

[27]  Liqun Fu,et al.  Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design , 2009, IEEE INFOCOM 2009.

[28]  Klaus Jansen,et al.  Approximate strong separation with application in fractional graph coloring and preemptive scheduling , 2002, Theor. Comput. Sci..

[29]  Xiaohua Jia,et al.  Scalable algorithms for wireless link schedulings in multi-channel multi-radio wireless networks , 2013, 2013 Proceedings IEEE INFOCOM.

[30]  Roger Wattenhofer,et al.  The Complexity of Connectivity in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[31]  Ness B. Shroff,et al.  Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks , 2008, IEEE/ACM Transactions on Networking.

[32]  Lixin Wang,et al.  A Constant-Approximation for Maximum Weight Independent Set of Links under the SINR Model , 2011, 2011 Seventh International Conference on Mobile Ad-hoc and Sensor Networks.

[33]  Mahmoud Al-Ayyoub,et al.  Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models , 2010, IEEE Transactions on Mobile Computing.

[34]  Magnús M. Halldórsson,et al.  The Price of Local Power Control in Wireless Scheduling , 2015, FSTTCS.

[35]  Sai Ji,et al.  From least interference-cost paths to maximum (Concurrent) multiflow in MC-MR wireless networks , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[36]  J. Heinonen.  Lectures on Analysis on Metric Spaces , 2000 .