DMTofParallel-PathandLayeredNetworksUndertheHalf.PDFVIP

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 59, NO. 6, JUNE 2013 3875 DMT of Parallel-Path and Layered Networks Under the Half-Duplex Constraint K. Sreeram, S. Birenjith, and P. Vijay Kumar, Fellow, IEEE Abstract—In this paper, we study the diversity-multi- In a half-duplex network, a node cannot both transmit and re- plexing-gain tradeoff (DMT) of wireless relay networks under ceive simultaneously. When there is more than one relay node, the half-duplex constraint. It is often unclear what penalty if any, the transmission and reception of the various nodes have to be is imposed by the half-duplex constraint on the DMT of such networks. We study two classes of networks; the first class, called carefully orchestrated in order to meet the half-duplex constraint KPP(I) networks, is the class of networks with the relays organized for all the nodes, a process termed as scheduling. In the net- in parallel paths between the source and the destination. While working literature, while protocols for centralized and decen- we assume that there is no direct source-destination path, the tralized scheduling are extensively studied, physical layer ef- relaying paths can interfere with each other. The second class, fects are not fully considered. In the case of relay networks, an termed as layered networks, is comprised of relays organized in layers, where links exist only between adjacent layers. information theoretic understanding of even centralized sched- We present a communication scheme based on static schedules uling seems lacking. and amplify-and-forward relaying for these networks. We also