Resource Allocation Algorithms with Reduced Complexity in MIMO Multi-Hop Fading Channels

MIMO multi-hop channel plays an important role in wireless ad hoc networks. In this paper, we investigate the resource allocation optimization problem in order to achieve throughput maximization with given resource constraints. We propose algorithms with low complexity to achieve maximum capacity. The main idea is to determine the rank of the optimal transmit covariance matrix and the optimal power allocation of each node separately using our low-complexity algorithm. Further, we reduce the complexity of our algorithm by adding another pre-processing algorithm. Using our algorithms, we find that while dynamical allocation of time and power could increase channel capacity, equal time and power allocation among different nodes may not cause much capacity loss.