A novel resource allocation strategy for distributed MIMO multi-hop multi-commodity communications

In this paper, we present a near-optimum resource allocation strategy for distributed multiple-input-multiple-output multiple hops multiple commodities OFDMA wireless networks. The novel per-hop-optimization strategy aims to reduce the total transmission power of the network while meeting the individual end-to-end outage probability constraint of each commodity, i.e. for each link of the network. It utilizes the Greedy edge-coloring algorithm to determine reused orthogonal subbands for overlapping hops and allows a distributed implementation per hop. In comparison to other bandwidth allocation strategies like equal or dynamic bandwidth for each commodity, our per-hop-bandwidth-allocation (PHBA) approach uses the bandwidth in a near-optimum way and reduces the total transmission power significantly.