Power Allocation for Conventional and Buffer-Aided Link Adaptive Relaying Systems with Energy Harvesting Nodes

被引:69
作者
Ahmed, Imtiaz [1 ]
Ikhlef, Aissa [2 ]
Schober, Robert [1 ]
Mallik, Ranjan K. [3 ]
机构
[1] Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V6T 1Z4, Canada
[2] Toshiba Res Europe Ltd, Bristol BS1 4ND, Avon, England
[3] Indian Inst Technol Delhi, Dept Elect Engn, New Delhi 110016, India
基金
加拿大自然科学与工程研究理事会;
关键词
Energy harvesting; power allocation; conventional relaying; buffer-aided link adaptive relaying; convex optimization; dynamic programming; BOUNDS;
D O I
10.1109/TWC.2014.012314.121185
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we consider optimal power allocation for conventional and buffer-aided link adaptive energy harvesting (EH) relay systems, where an EH source communicates with the destination via an EH decode-and-forward relay over fading channels. In conventional relaying, source and relay transmit signals in consecutive time slots whereas in buffer-aided link adaptive relaying, the state of the source-relay and relay-destination channels as well as the amounts of energy available at source and relay determine whether the source or the relay is selected for transmission. Our objective is to maximize the system throughput over a finite number of transmission time slots for both relaying protocols. In case of conventional relaying, we propose an offline and several online joint source and relay transmit power allocation schemes. For offline power allocation, we formulate a convex optimization problem whereas for the online case, we propose a dynamic programming (DP) approach to compute the optimal online transmit power. To alleviate the complexity inherent to DP, we also propose several suboptimal online power allocation schemes. For buffer-aided link adaptive relaying, we show that the joint offline optimization of the source and relay transmit powers along with the link selection results in a mixed integer non-linear program which we solve optimally using the spatial branch-and-bound method. We also propose efficient online power allocation schemes for buffer-aided link adaptive relaying. Simulation results show that buffer-aided link adaptive relaying provides significant performance gains compared to conventional relaying but requires a higher complexity for computation of the power allocation solution. We also show that buffer-aided link adaptive relaying is more robust to changes in the EH rate than conventional relaying.
引用
收藏
页码:1182 / 1195
页数:14
相关论文
共 27 条
[1]  
[Anonymous], 2011, CVX MATLAB SOFTWARE
[2]   Branching and bounds tightening techniques for non-convex MINLP [J].
Belotti, Pietro ;
Lee, Jon ;
Liberti, Leo ;
Margot, Francois ;
Waechter, Andreas .
OPTIMIZATION METHODS & SOFTWARE, 2009, 24 (4-5) :597-634
[3]  
Bertsekas D. P., 1995, Dynamic programming and optimal control, V1
[4]  
Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441
[5]   On the Lambert W function [J].
Corless, RM ;
Gonnet, GH ;
Hare, DEG ;
Jeffrey, DJ ;
Knuth, DE .
ADVANCES IN COMPUTATIONAL MATHEMATICS, 1996, 5 (04) :329-359
[6]  
Eu Z. A., P 2010 IEEE INT C CO
[7]  
Gurakan B., ENERGY COOP IN PRESS
[8]   Optimal Energy Allocation for Wireless Communications With Energy Harvesting Constraints [J].
Ho, Chin Keong ;
Zhang, Rui .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (09) :4808-4818
[9]   Capacity bounds and power allocation for wireless relay channels [J].
Host-Madsen, A ;
Zhang, JS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (06) :2020-2040
[10]  
Huang C., P 2012 IEEE INT C CO