TY - JOUR

T1 - Optimality of Energy-Efficient Scheduling and Relaying for Half-Duplex Relay Networks

AU - Jain, Sarthak

AU - Cardone, Martina

AU - Mohajer, Soheil

N1 - Publisher Copyright:
© 2020 IEEE.

PY - 2022/3/1

Y1 - 2022/3/1

N2 - This paper considers a single-source single-destination half-duplex $n$ -relay network with arbitrary topology, where the source communicates with the destination through a direct link and with the help of $n$ half-duplex relays. The focus is on the linear deterministic approximation of the Gaussian noise network model. First, sufficient conditions under which operating the network in the $n+1$ energy-efficient states (out of the $2^{ n}$ possible states) is sufficient to achieve the approximate capacity (that is, an additive gap approximation of the Shannon capacity) are characterized. Specifically, these $n+ 1$ energy-efficient states are those in which at most one relay is in transmit mode while the rest of the relays are in receive mode. Under such sufficient network conditions, closed-form expressions for the scheduling and the approximate capacity are provided. Then, a time-block relaying scheme, where at each point in time at most one relay is in transmit mode, is designed. In particular, the designed relaying scheme leverages information flow preservation at each relay to explicitly provide the information that each relay is exclusively responsible to store and forward to the destination. Furthermore, the destination can decode the information bits sent by the source in block $B$ by the end of block $B+1$ , and the proposed scheme is shown to achieve the approximate capacity whenever the sufficient conditions are satisfied. Such features make the designed scheme relevant for practical use.

AB - This paper considers a single-source single-destination half-duplex $n$ -relay network with arbitrary topology, where the source communicates with the destination through a direct link and with the help of $n$ half-duplex relays. The focus is on the linear deterministic approximation of the Gaussian noise network model. First, sufficient conditions under which operating the network in the $n+1$ energy-efficient states (out of the $2^{ n}$ possible states) is sufficient to achieve the approximate capacity (that is, an additive gap approximation of the Shannon capacity) are characterized. Specifically, these $n+ 1$ energy-efficient states are those in which at most one relay is in transmit mode while the rest of the relays are in receive mode. Under such sufficient network conditions, closed-form expressions for the scheduling and the approximate capacity are provided. Then, a time-block relaying scheme, where at each point in time at most one relay is in transmit mode, is designed. In particular, the designed relaying scheme leverages information flow preservation at each relay to explicitly provide the information that each relay is exclusively responsible to store and forward to the destination. Furthermore, the destination can decode the information bits sent by the source in block $B$ by the end of block $B+1$ , and the proposed scheme is shown to achieve the approximate capacity whenever the sufficient conditions are satisfied. Such features make the designed scheme relevant for practical use.

KW - Half duplex

KW - linear deterministic

KW - relay scheduling

KW - relaying scheme

UR - http://www.scopus.com/inward/record.url?scp=85159558430&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85159558430&partnerID=8YFLogxK

U2 - 10.1109/JSAIT.2022.3157829

DO - 10.1109/JSAIT.2022.3157829

M3 - Article

AN - SCOPUS:85159558430

SN - 2641-8770

VL - 3

SP - 37

EP - 53

JO - IEEE Journal on Selected Areas in Information Theory

JF - IEEE Journal on Selected Areas in Information Theory

IS - 1

ER -