Algorithms for the spatial single relay channel

The spatial single relay channel consists of a transmitter, a relay and a receiver located in an environment with distance-dependent path loss as well as scattering. We describe an optimal and a heuristic algorithm for achieving the maximum data rate from the transmitter to the receiver on non-overlapping spatial channels. These algorithms can be applied to existing wireless LAN systems that aim to increase their performance via relays. We demonstrate the effects of proximity gain and multiplexing gain in determining the optimal relay position. By simulation, we demonstrate the effects of randomly generated scatterers, scatterer position asymmetries, and the scatterer area on the maximum data rate.