On Approximately Universal Schemes for Two-Hop Network
Full-duplex and half-duplex two-hop networks are considered. Explicit coding schemes which are approximately universal over a class of fading distributions are identified, for the case when the network has either one or two relays. A single-source single-sink (ss-ss) wireless relay network is one which there is one source (labeled S) and one sink (labeled D) and there are multiple relay nodes. The link between any two nodes is modeled as a fading channel. The performance limits of a coding scheme for such networks can be characterized approximately using Diversity-Multiplexing Tradeoff (DMT).