Achievable Rates and Fairness in Rateless Coded Decode-and-Forward Half-Duplex and Full-Duplex Opportunistic Relaying

The achievable rates of three decode-and-forward half-duplex (DFHD) and two decode-and-forward full-duplex (DFFD) protocols are studied under a peak power constraint (PPC) and an average power constraint (APC). Two of the DFHD and one of the DFFD protocols are known. One new, much simpler, DFHD protocol, and one new DFFD protocol are proposed. The fairness in comparing the protocols in terms of energy cost is formulated, and the protocols are compared to each other in a power-fair regime. The two previously proposed DFHD protocols, one of which is superior to the other under the PPC, are found to have almost the same performances when compared power-fairly. The proposed protocols are built upon the water filling principle and power optimization such that, although inferior to their predecessors in a PPC regime, they can slightly surpass them under the APC. The protocols considered here take advantage of the previously proposed opportunistic relaying (ORe) concept. The original ORe is not directly applicable to the rateless schemes. However, it is shown that the ORe, after a novel modification, is compatible with, and implementable in the rateless protocols. The ORe brings about practical benefits and economical use of network resources in relaying systems.