TY - JOUR
T1 - Energy-Efficient Cooperative Network Coding with Joint Relay Scheduling and Power Allocation
AU - Qi, Nan
AU - Xiao, Ming
AU - Tsiftsis, Theodoros A.
AU - Skoglund, Mikael
AU - Cao, Phuong L.
AU - Li, Lixin
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/11
Y1 - 2016/11
N2 - The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption, and EE, and formulate the maximizing EE problem under the outage probability constraint. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, and so on) and optimize the transmitting power under the practical channel and power consumption models. Since the optimization problem is NP hard, to reduce computational complexity, the outage probability is first tightly approximated to a log-convex form. Furthermore, the EE is converted into a subtractive form based on the fractional programming. Then, a convex mixed-integer nonlinear problem is eventually obtained. With a generalized outer approximation algorithm, RS and PA are solved in an iterative manner. The Pareto-optimal curves between the EE and the target outage probability show the EE gains from PA and RS. Moreover, by comparing with the no network coding (NoNC) scenario, we conclude that with the same number of relays, MDNC can lead to EE gains. However, if RS is implemented, NoNC can outperform MDNC in terms of the EE when more relays are needed in the MDNC scheme.
AB - The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption, and EE, and formulate the maximizing EE problem under the outage probability constraint. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, and so on) and optimize the transmitting power under the practical channel and power consumption models. Since the optimization problem is NP hard, to reduce computational complexity, the outage probability is first tightly approximated to a log-convex form. Furthermore, the EE is converted into a subtractive form based on the fractional programming. Then, a convex mixed-integer nonlinear problem is eventually obtained. With a generalized outer approximation algorithm, RS and PA are solved in an iterative manner. The Pareto-optimal curves between the EE and the target outage probability show the EE gains from PA and RS. Moreover, by comparing with the no network coding (NoNC) scenario, we conclude that with the same number of relays, MDNC can lead to EE gains. However, if RS is implemented, NoNC can outperform MDNC in terms of the EE when more relays are needed in the MDNC scheme.
KW - Energy efficiency-outage probability tradeoff
KW - Generalized outer approximation (GOA)
KW - network coding
KW - power allocation
KW - relay scheduling
UR - http://www.scopus.com/inward/record.url?scp=84999740124&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2016.2602830
DO - 10.1109/TCOMM.2016.2602830
M3 - 文章
AN - SCOPUS:84999740124
SN - 0090-6778
VL - 64
SP - 4506
EP - 4519
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 11
M1 - 7552469
ER -