Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ICASSP.2012.6288503
Title: | Optimal resource allocation for Gaussian relay channel with energy harvesting constraints | Authors: | Huang, C. Zhang, R. Cui, S. |
Keywords: | cooperative communication energy harvesting relay channel Throughput |
Issue Date: | 2012 | Citation: | Huang, C., Zhang, R., Cui, S. (2012). Optimal resource allocation for Gaussian relay channel with energy harvesting constraints. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings : 2817-2820. ScholarBank@NUS Repository. https://doi.org/10.1109/ICASSP.2012.6288503 | Abstract: | In this paper, we study the three-node Gaussian relay channel with decode-and-forward (DF) relaying, in which the source and relay nodes transmit with power drawn from energy-harvesting sources. Assuming a deterministic energy-harvesting model under which the energy arrival time and the harvested amount are known prior to transmission, the throughput maximization problem over a finite horizon of N transmission blocks is investigated. We consider the nodelay-constrained (NDC) traffic case, for which the relay can store the decoded information from the source with arbitrary delay before forwarding it to the destination in each N-block transmission. Although the formulated problem is non-convex, we prove the optimality of a separation principle for the source and relay power allocation over time, based upon which a two-stage algorithm is developed to obtain the optimal source and relay power profiles separately. © 2012 IEEE. | Source Title: | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings | URI: | http://scholarbank.nus.edu.sg/handle/10635/71298 | ISBN: | 9781467300469 | ISSN: | 15206149 | DOI: | 10.1109/ICASSP.2012.6288503 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.