Name
Abstract | ||
|---|---|---|
This paper considers the allocation of time slots in a frame, as well as power and rate to multiple receivers on an energy harvesting downlink. Energy arrival times that will occur within the frame are known at the beginning of the frame. The goal is to optimize throughput in a proportionally fair way, taking into account the inherent differences of channel quality among users. Analysis of structural characteristics of the problem reveals that it can be formulated as a biconvex optimization problem, and that it has multiple optima. Due to the biconvex nature of the problem, a Block Coordinate Descent (BCD) based optimization algorithm that converges to an optimal solution is presented. However, finding the optimal allocation with BCD entails a computational complexity that increases sharply in terms of the number of users or slots. Therefore, certain structural characteristics of the optimal power-time allocation policy are derived. Building on those, two simple and computationally scalable heuristics, PTF and ProNTO are proposed. Simulation results suggest that PTF and ProNTO can closely track the performance of BCD which achieves a good balance between total throughput and fairness. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TWC.2013.021213.120523 | IEEE Transactions on Wireless Communications |
Keywords | Field | DocType |
computational complexity,convex programming,energy harvesting,radio networks,resource allocation,wireless channels,PTF,ProNTO,biconvex optimization problem,block coordinate descent based optimization algorithm,broadcast channel,channel quality,computational complexity,energy arrival times,energy harvesting downlink,optimal power-time allocation policy,proportional fair resource allocation,throughput optimization,time slot allocation,wireless communication systems,Broadcast channel,biconvex,block coordinate descent,energy harvesting,offline algorithms,optimization,proportional fairness,time sharing | Biconvex optimization,Computer network,Real-time computing,Heuristics,Resource allocation,Throughput,Coordinate descent,Mathematics,Proportionally fair,Computational complexity theory,Telecommunications link | Journal |
Volume | Issue | ISSN |
12 | 4 | 1536-1276 |
Citations | PageRank | References |
5 | 0.43 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Neyre Tekbiyik | 1 | 11 | 2.27 |
| Tolga Girici | 2 | 98 | 17.12 |
| Elif Uysal-Biyikoglu | 3 | 1050 | 132.01 |
| Kemal Leblebicioglu | 4 | 22 | 9.82 |