Optimal Joint Routing and Scheduling in Millimeter-Wave Cellular Networks

Millimeter-wave (mmWave) communication is a promising technology to cope with the expected exponential increase in data traffic in 5G networks. mmWave networks typically require a very dense deployment of mmWave base stations (mmBS). To reduce cost and increase flexibility, wireless backhauling is needed to connect the mmBSs. The characteristics of mmWave communication, and specifically its high directionality, imply new requirements for efficient routing and scheduling paradigms. We propose an efficient scheduling method, so-called schedule-oriented optimization, based on matching theory that optimizes QoS metrics jointly with routing. It is capable of solving any scheduling problem that can be formulated as a linear program whose variables are link times and QoS metrics. As an example of the schedule-oriented optimization, we show the optimal solution of the maximum throughput fair scheduling (MTFS). Practically, the optimal scheduling can be obtained even for networks with over 200 mmBSs. To further increase the runtime performance, we propose an efficient edge-coloring based approximation algorithm with provable performance bound. It achieves over 80% of the optimal max-min throughput and runs 5 to 100 times faster than the optimal algorithm in practice. Finally, we extend the optimal and approximation algorithms for the cases of multi-RF-chain mmBSs and integrated backhaul and access networks.

[1]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  Michael J. Todd,et al.  Polynomial Algorithms for Linear Programming , 1988 .

[3]  Bo Ji,et al.  Node-based service-balanced scheduling for provably guaranteed throughput and evacuation time performance , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[4]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[5]  Vladimir Kolmogorov,et al.  Blossom V: a new implementation of a minimum cost perfect matching algorithm , 2009, Math. Program. Comput..

[6]  Theodore S. Rappaport,et al.  Millimeter-Wave Enhanced Local Area Systems: A High-Data-Rate Approach for Future Wireless Networks , 2014, IEEE Journal on Selected Areas in Communications.

[7]  Athanasios V. Vasilakos,et al.  Exploiting Device-to-Device Communications in Joint Scheduling of Access and Backhaul for mmWave Small Cells , 2015, IEEE Journal on Selected Areas in Communications.

[8]  Shin-Ichi Nakano,et al.  Edge-Coloring Algorithms , 1995, Computer Science Today.

[9]  Qing He,et al.  Minimum-Time Link Scheduling for Emptying Wireless Systems: Solution Characterization and Algorithmic Framework , 2014, IEEE Transactions on Information Theory.

[10]  Yun Zhu,et al.  QoS-aware scheduling for small cell millimeter wave mesh backhaul , 2016, 2016 IEEE International Conference on Communications (ICC).

[11]  Richard Cole,et al.  Edge-Coloring Bipartite Multigraphs in O(E logD) Time , 1999, Comb..

[12]  David B. Shmoys,et al.  Efficient Parallel Algorithms for Edge Coloring Problems , 1987, J. Algorithms.

[13]  Theodore S. Rappaport,et al.  Millimeter Wave Channel Modeling and Cellular Capacity Evaluation , 2013, IEEE Journal on Selected Areas in Communications.

[14]  Sungsoo Park,et al.  A polyhedral approach to edge coloring , 1991, Oper. Res. Lett..

[15]  Jeffrey G. Andrews,et al.  Tractable Model for Rate in Self-Backhauled Millimeter Wave Cellular Networks , 2014, IEEE Journal on Selected Areas in Communications.

[16]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[17]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[18]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[19]  Jian Tang,et al.  Maximum Throughput and Fair Bandwidth Allocation in Multi-Channel Wireless Mesh Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[20]  Ness B. Shroff,et al.  On Sample-Path Optimal Dynamic Scheduling for Sum-Queue Minimization in Trees Under the $K$ -Hop Interference Model , 2016, IEEE/ACM Transactions on Networking.

[21]  Theodore S. Rappaport,et al.  Millimeter-Wave Cellular Wireless Networks: Potentials and Challenges , 2014, Proceedings of the IEEE.

[22]  Xiaojun Lin,et al.  A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay , 2011, 2011 Proceedings IEEE INFOCOM.

[23]  Theodore S. Rappaport,et al.  Millimeter Wave Mobile Communications for 5G Cellular: It Will Work! , 2013, IEEE Access.

[24]  Giuseppe Caire,et al.  A Joint Scheduling and Resource Allocation Scheme for Millimeter Wave Heterogeneous Networks , 2017, 2017 IEEE Wireless Communications and Networking Conference (WCNC).

[25]  lexander,et al.  THE GENERALIZED SIMPLEX METHOD FOR MINIMIZING A LINEAR FORM UNDER LINEAR INEQUALITY RESTRAINTS , 2012 .

[26]  Sheng Chen,et al.  Millimetre-Wave Backhaul for 5G Networks: Challenges and Solutions , 2016, Sensors.