Name
Abstract | ||
|---|---|---|
Two-hop energy harvesting communications are considered. The scenario consists of a source node which wants to send data to a destination node through a half-duplex amplify-and-forward relay station. The source node and the relay station harvest energy from the environment several times and use it to transmit the data. Our goal is to find the optimal power allocation that maximizes the throughput at the destination node. We show that the use of a half-duplex amplify-and-forward relay station leads to a non-convex optimization problem. Therefore, to find the optimal power allocation we propose to reformulate the problem as the difference between two concave functions (D.C. programming). Moreover, a branch-and-bound algorithm is tailored to fit the energy harvesting constraints. We show that the feasible region has to be adapted to facilitate the branching process. Additionally, we reduce the complexity in the calculation of the bounds by relaxing the problem into a convex problem with a linear objective function. Numerical results compare the performance in different energy harvesting scenarios. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ISWCS.2015.7454348 | 2015 International Symposium on Wireless Communication Systems (ISWCS) |
Keywords | Field | DocType |
throughput maximization,two-hop energy harvesting communications,source node,destination node,amplify-and-forward relay station,power allocation,D.C. programming,branch-and-bound algorithm | Mathematical optimization,Computer science,Concave function,Energy harvesting,Computer network,Real-time computing,Feasible region,Hop (networking),Throughput,Convex optimization,Optimization problem,Relay | Conference |
Citations | PageRank | References |
1 | 0.35 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrea Ortiz | 1 | 27 | 4.68 |
| Hussein Al-Shatri | 2 | 105 | 14.40 |
| Xiang Li | 3 | 33 | 4.68 |
| Tobias Weber | 4 | 105 | 12.55 |
| Anja Klein | 5 | 173 | 89.48 |