2018/05/08 by Silas L. Fong, Jing Yang, Fong, Silas L. +3
Engineering · #Energy Harvesting in Wireless Networks #Wireless Communication Security Techniques #Advanced MIMO Systems Optimization
paper · pdf · doi:10.48550/arxiv.1805.02829
An additive white Gaussian noise energy-harvesting channel with an\ninfinite-sized battery is considered. The energy arrival process is modeled as\na sequence of independent and identically distributed random variables. The\nchannel capacity \(1)/(2)\log(1+P) is achievable by the so-called\nbest-effort and save-and-transmit schemes where P denotes the battery\nrecharge rate. This paper analyzes the save-and-transmit scheme whose transmit\npower is strictly less than P and the best-effort scheme as a special case of\nsave-and-transmit without a saving phase. In the finite blocklength regime, we\nobtain new non-asymptotic achievable rates for these schemes that approach the\ncapacity with gaps vanishing at rates proportional to 1/\√(n) and\n\√((\log n)/n) respectively where~n denotes the blocklength. The proof\ntechnique involves analyzing the escape probability of a Markov process. When\nP is sufficiently large, we show that allowing the transmit power to back off\nfrom P can improve the performance for save-and-transmit. The results are\nextended to a block energy arrival model where the length of each energy block\nL grows sublinearly in n. We show that the save-and-transmit and\nbest-effort schemes achieve coding rates that approach the capacity with gaps\nvanishing at rates proportional to \√(L/n) and \√\max \log n,\nL /n respectively.\n