Paper Info
Title
A Scheduling Algorithm for MIMO DoF Allocation in Multi-hop Networks
Abstract
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.
Year
DOI
Venue
2016
10.1109/TMC.2015.2413788
Mobile Computing, IEEE Transactions  
Keywords
Field
DocType
Interference,MIMO,Throughput,Integrated circuit modeling,Spread spectrum communication,Resource management
3G MIMO,Computer science,Scheduling (computing),Upper and lower bounds,Single antenna interference cancellation,MIMO,Computer network,Throughput,Solver,Spatial multiplexing,Distributed computing
Journal
Volume
Issue
ISSN
PP
99
1536-1233
Citations 
PageRank 
References 
6
0.51
16
Authors
7
Name
Order
Citations
PageRank
Huacheng Zeng18416.77
Yi Shi22110120.50
Yiwei Thomas Hou32825169.32
Wenjing Lou47822328.18
Hanif D. Sherali53403318.40
rongbo zhu6192.22
Scott F. Midkiff780269.35