RF Energy Harvesting in Wireless Networks with HARQ

被引:0
作者
Zohdy, Maha [1 ]
ElBatt, Tamer [1 ,2 ]
Nafie, Mohammed [1 ,2 ]
Ercetin, Ozgur [3 ]
机构
[1] Nile Univ, WINC, Giza, Egypt
[2] Cairo Univ, Dept EECE, Fac Engn, Giza, Egypt
[3] Sabanci Univ, Fac Engn & Nat Sci, Istanbul, Turkey
来源
2016 IEEE GLOBECOM WORKSHOPS (GC WKSHPS) | 2016年
基金
欧盟地平线“2020”;
关键词
OPPORTUNISTIC FILE TRANSFER; FADING CHANNEL; POWER TRANSFER; INFORMATION; CODES;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we consider a class of wireless powered communication networks using data link layer hybrid automatic repeat request (HARQ) protocol to ensure reliable communications. In particular, we analyze the trade-off between accumulating mutual information and accumulating RF energy at the receiver of a point-to-point link using HARQ with incremental redundancy over a Rayleigh fading channel. The transmitter is assumed to have a constant energy source while the receiver relies, solely, on the RF energy harvested from the received signal. First, we target the optimal time switching (TS) policy in order to maximize the probability of successful decoding within a fixed number of re-transmissions, in the absence of CSI information at the receiver. Towards this objective, we cast the problem as a finite time-horizon dynamic programming problem. However, motivated by the sheer complexity of the problem attributed to the continuous state space, we characterize the optimal solution for a discrete version of the problem. Second, we propose a simple greedy algorithm and compare its performance to the optimal and a non-causal lower bound. Third, when CSI is available at the receiver, we introduce a heuristic TS policy which is shown to have a performance superior to the greedy policy and close to that of the lower bound. Finally, the numerical results exhibit the merits of the proposed heuristic and greedy algorithms, approaching the lower bound, for a variety of scenarios.
引用
收藏
页数:6
相关论文
共 19 条
[1]  
[Anonymous], 2014, Markov decision processes: discrete stochastic dynamic programming
[2]  
[Anonymous], AUTOMATIC REPEAT REQ
[3]   The throughput of hybrid-ARQ protocols for the Gaussian collision channel [J].
Caire, G ;
Tuninetti, D .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (05) :1971-1988
[4]   CODE COMBINING - A MAXIMUM-LIKELIHOOD DECODING APPROACH FOR COMBINING AN ARBITRARY NUMBER OF NOISY PACKETS [J].
CHASE, D .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1985, 33 (05) :385-393
[5]   Applications of error-control coding [J].
Costello, DJ ;
Hagenauer, J ;
Imai, H ;
Wicker, SB .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2531-2560
[6]  
de Witt FA, 2014, 2014 IFIP WIRELESS DAYS (WD)
[7]   Shannon meets Tesla: Wireless information and power transfer [J].
Grover, Pulkit ;
Sahai, Anant .
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, :2363-2367
[9]  
Johnston LA, 2006, IEEE T WIREL COMMUN, V5, P394, DOI 10.1109/TWC.2006.02019
[10]   ANALYSIS OF A TYPE-II HYBRID ARQ SCHEME WITH CODE COMBINING [J].
KALLEL, S .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1990, 38 (08) :1133-1137