Cargando…

Outage-Based Resource Allocation for DF Two-Way Relay Networks with Energy Harvesting

A joint resource allocation algorithm to minimize the system outage probability is proposed for a decode-and-forward (DF) two-way relay network with simultaneous wireless information and power transfer (SWIPT) under a total power constraint. In this network, the two sources nodes exchange informatio...

Descripción completa

Detalles Bibliográficos
Autores principales: Peng, Chunling, Li, Fangwei, Liu, Huaping, Wang, Guozhong
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2018
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6263727/
https://www.ncbi.nlm.nih.gov/pubmed/30441871
http://dx.doi.org/10.3390/s18113946
Descripción
Sumario:A joint resource allocation algorithm to minimize the system outage probability is proposed for a decode-and-forward (DF) two-way relay network with simultaneous wireless information and power transfer (SWIPT) under a total power constraint. In this network, the two sources nodes exchange information with the help of a passive relay, which is assumed to help the two source nodes’ communication without consuming its own energy by exploiting an energy-harvesting protocol, the power splitting (PS) protocol. An optimization framework to jointly optimize power allocation (PA) at the source nodes and PS at the relay is developed. Since the formulated joint optimization problem is non-convex, the solution is developed in two steps. First, the conditionally optimal PS ratio at the relay node for a given PA ratio is explored; then, the closed-form of the optimal PA in the sense of minimizing the system outage probability with instantaneous channel state information (CSI) is derived. Analysis shows that the optimal design depends on the channel condition and the rate threshold. Simulation results are obtained to validate the analytical results. Comparison with three existing schemes shows that the proposed optimized scheme has the minimum system outage probability.