2017
DOI: 10.1109/lcomm.2016.2641418
|View full text |Cite
|
Sign up to set email alerts
|

A Low-Complexity Policy for Outage Probability Minimization With an Energy Harvesting Transmitter

Abstract: Abstract-Outage probability in an energy harvesting (EH) block-fading communication system is studied in the finite-horizon online setting. First, the offline version of the problem is considered, and formulated as a mixed integer linear program (MILP). Then, the infinite-horizon online problem (IIL) is considered relaxing the battery constraints. Solutions of these two problems provide lower bounds on the finite-horizon online problem, for which we provide a low-complexity heuristic scheme, called the fixed t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(23 citation statements)
references
References 11 publications
(19 reference statements)
0
22
0
Order By: Relevance
“…As the minimum message size increases, the chances of transmitting messages with that size increases. Differently from the FTR scheme, P[k = k 0 ] will never reach the unity when using the KSC 14 and fCSI schemes, thus,k fCSI >k KSC >k FTR ≥ k 0 .…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…As the minimum message size increases, the chances of transmitting messages with that size increases. Differently from the FTR scheme, P[k = k 0 ] will never reach the unity when using the KSC 14 and fCSI schemes, thus,k fCSI >k KSC >k FTR ≥ k 0 .…”
Section: Numerical Resultsmentioning
confidence: 99%
“…since channel becomes conditionally Gaussian on γ, and we only require to take expectation over that RV to attain the corresponding average error probability. However, and as it has been shown in [36], the effect of the fading when evaluating (14) makes disappear the impact of the finite blocklength when k is not extremely small and there is not a strong LOS component, thus, the asymptotic outage probability, which is the Laplace approximation of (14), is a good match in those cases and is given bȳ…”
Section: Reliability-rate Trade-offmentioning
confidence: 85%
“…The offline solution is expressed in terms of water levels and the online solution minimizes successively the expected throughput losses with respect to the offline optimal decision. Finitehorizon optimization problem was also considered in [8] to minimize the outage probability in a EH system. A low complexity fixed threshold transmission is proposed based on the offline mixed integer linear programming solution.…”
Section: Introductionmentioning
confidence: 99%
“…Diverse strategies have been considered in the recent scientific literature in order to improve the performance of WPCNs, such as relay-assisted [11]- [23], Hybrid Automatic Repeat-reQuest (HARQ) [24], and power control [21]- [23], [25]- [27], mechanisms. Works in [21]- [23] are particularly interesting since they propose energy accumulation strategies so that a wirelesspowered relay can efficiently assist a communication link.…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, the maximum achievable channel coding rate at a given blocklength and error probability, when the codewords are subject to a long-term (e.g., averaged-over-all-codeword) power constraint is investigated in [45], in which power control strategies for both AWGN and fading channels are developed. However, to the best of our knowledge, there are only few papers, e.g., [25]- [27], where power allocation strategies are proposed for WPCNs but based on the assumption of infinite blocklength. Particularly interesting is the work in [27], where authors propose a low-complexity solution, called fixed threshold transmission (FTT) scheme, and show that its performance is very close to the optimal.…”
Section: Introductionmentioning
confidence: 99%