A Scheduling Algorithm for MIMO DoF Allocation in Multi-Hop Networks

Recently, a new MIMO degree-of-freedom (DoF) model was proposed to allocate DoF resources for spatial multiplexing (SM) and interference cancellation (IC) in a multi-hop network. Although this DoF model promises many benefits, it hinges upon a global node ordering to keep track of IC responsibilities among all the nodes. An open question about this model is whether its global ordering property can be achieved among the nodes in the network through distributed operations. In this paper, we explore this question by studying DoF scheduling in a multi-hop MIMO network, with the objective of maximizing the minimum throughput among a set of sessions. We propose an efficient DoF scheduling algorithm to solve it and show that our algorithm only requires local operations. We prove that the resulting DoF scheduling solution is globally feasible and show that there exists a corresponding feasible global node ordering for IC, albeit such global ordering is implicit. Simulation results show that the solution values obtained by our algorithm are relatively close to the upper bound values computed by CPLEX solver, thereby indicating that our algorithm is highly competitive.

[1]  Xiaodong Wang,et al.  Cross-Layer Design of Wireless Multihop Backhaul Networks With Multiantenna Beamforming , 2007, IEEE Transactions on Mobile Computing.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[4]  Kang G. Shin,et al.  Characterization and analysis of multi-hop wireless MIMO network throughput , 2007, MobiHoc '07.

[5]  Yiwei Thomas Hou,et al.  On the Throughput of MIMO-Empowered Multihop Cognitive Radio Networks , 2011, IEEE Transactions on Mobile Computing.

[6]  Kang G. Shin,et al.  NEMOx: scalable network MIMO for wireless networks , 2013, MobiCom.

[7]  L.B. Milstein,et al.  Distributed Link Scheduling, Power Control and Routing for Multi-hop Wireless MIMO Networks , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[8]  Randeep Bhatia,et al.  Throughput Optimization of Wireless Mesh Networks with MIMO Links , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[9]  Yiwei Thomas Hou,et al.  On the Asymptotic Capacity of Multi-Hop MIMO Ad Hoc Networks , 2011, IEEE Transactions on Wireless Communications.

[10]  H. Sherali,et al.  Applied Optimization Methods for Wireless Networks: Methods for Near-optimal and Approximation Solutions , 2014 .

[11]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[12]  Stephan Eidenbenz,et al.  Algorithmic aspects of communication in ad-hoc networks with smart antennas , 2006, MobiHoc '06.

[13]  Vivek S. Borkar,et al.  A New Distributed Time Synchronization Protocol for Multihop Wireless Networks , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[14]  Vahid Tarokh,et al.  On the degrees-of-freedom of the MIMO interference channel , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[15]  David Gesbert,et al.  From theory to practice: an overview of MIMO space-time coded wireless systems , 2003, IEEE J. Sel. Areas Commun..

[16]  Jian Tang,et al.  Algorithmic Aspects of Communications in Multihop Wireless Networks with MIMO Links , 2010, 2010 IEEE International Conference on Communications.

[17]  Ross D. Murch,et al.  A transmit preprocessing technique for multiuser MIMO systems using a decomposition approach , 2004, IEEE Transactions on Wireless Communications.

[18]  Yang Yu,et al.  IEEE 802.16J relay-based wireless access networks: an overview , 2008, IEEE Wireless Communications.

[19]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[20]  Xinyu Zhang,et al.  Adaptive feedback compression for MIMO networks , 2013, MobiCom.

[21]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[22]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[23]  Yiwei Thomas Hou,et al.  A novel MIMO DoF model for multi-hop networks , 2014, IEEE Network.

[24]  Martin Haardt,et al.  Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels , 2004, IEEE Transactions on Signal Processing.

[25]  Mary Ann Ingram,et al.  Medium access control in ad hoc networks with MIMO links: optimization considerations and algorithms , 2004, IEEE Transactions on Mobile Computing.

[26]  Shmuel Zaks,et al.  Optimal Distributed Algorithms for Sorting and Ranking , 1985, IEEE Transactions on Computers.

[27]  Ness B. Shroff,et al.  CSMA-Based Distributed Scheduling in Multi-hop MIMO Networks under SINR Model , 2010, 2010 Proceedings IEEE INFOCOM.

[28]  Paolo Santi,et al.  Optimal one-shot scheduling for MIMO networks , 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[29]  Parameswaran Ramanathan,et al.  Exploiting spatial multiplexing and reuse in multi-antenna wireless ad hoc networks , 2009, Ad Hoc Networks.

[30]  Mario Gerla,et al.  SPACE-MAC: enabling spatial reuse using MIMO channel-aware MAC , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.