Resource Allocation for Wireless Networks with Energy Harvesting Constraints Over Fading Channels
Abstract
This research work considers the utilize of energy harvesters, instead of conventional time-invariant energy sources, in wireless communication. For the purpose of exposition, we study the traditional two-hop communication system for delay limited (DL) and delay tolerant (DT) relaying networks over fading channels, in which the source node transmits with power drawn from energy harvesting (EH) sources and the relay transmits with conventional non-EH sources. We address the throughput maximization problem for the proposed system model for DL and DT cases. We find that the optimal power allocation algorithm for the single-hop communication system with EH constraints, namely, recursive geometric water-filling
(RGWF), can be utilized as a guideline for the design of the two-hop system. We first introduce RGWF algorithm and we show the advantages of the geometric approach in eliminating the complexity of the Karush-Kuhn-Tucker (KKT) condition as well as providing a closed-form and exact solutions to the proposed problem. Based on the RGWF algorithm, we propose offline joint power allocation and transmission time scheduling schemes for DL relaying network and DT relaying network. We also propose efficient online resource allocation schemes for both relays’ cases. The performance of the proposed schemes is evaluated via simulation and the results demonstrate that a network with delay tolerant ability provides better performance in term of throughput.
Downloads
References
[1] International Energy Agency, “Energy technology scenarios and strategies for a more secure and sustainable energy future,” International Energy Agency, Paris, 2006.
[2] G. Liu, H. Ji, F.R. Yu, Y. Li, and R. Xie, “Energy-efficient resource allocation in full-duplex relaying networks,” Communications (ICC), 2014 IEEE International Conference on, pp. 2400–2405, June 2014.
[3] W. Ye, J. Heidemann, and D. Estrin, “An energy-efficient mac protocol for wireless sensor networks,” IEEE-INFOCOM, vol. 3, pp. 1567 – 1576, June 2002.
[4] R. C. Shah and J. M. Rabaey, “Energy aware routing for low energy ad hoc sensor networks,” in Proc. IEEE Wireless Communications and Networking Conf., vol. 1, pp. 350 – 355, 2002.
[5] A. Kansal, J. Hsu, S. Zahedi, and M. B. Srivastava, “Power management in energy harvesting sensor networks,” ACM Trans. Embedded Computer System, vol. 6, no. 4, Sept. 2007.
[6] C. Vigorito, D. Ganesan, and A. Barto, “Adaptive control of duty-cycling in energy harvesting wireless sensor networks,” in Proc. IEEE SECON, pp. 180–185, Oct. 2006.
[7] V. Sharma, U. Mukherji, V. Joseph, and S. Gupta, “Optimal energy management policies for energy harvesting sensor nodes,” IEEE trans. on wireless communications, vol. 9, no. 4, pp. 1326 – 1336, April 2010.
[8] O. Ozel, K. Tutuncuoglu, J. Yang, S. Ulukus, and A. Yener, “Transmission with energy harvesting nodes in fading wireless channels: Optimal policies,” IEEE Journal on Selected Areas in Communications, vol. 29, no. 8, pp. 1732–1743, Sept. 2011.
[9] C. K. Ho and R. Zhang, “Optimal energy allocation for wireless communications with energy harvesting constraints,”IEEE Trans. Signal Processing, vol. 60, no. 9, pp. 4808 – 4818, Sept. 2012.
[10] P. He, L. Zhao, S. Zhou, and Z. Niu, “Recursive water-filling for wireless links with energy harvesting transmitters,” IEEE Trans. Vehicular Tech., vol. 63, no. 3, pp. 1232 – 1241, March 2014.
[11] D. Gunduz and B. Devillers, “Two-hop communication with energy harvesting,” in Proc. 2011 International Workshop on Computational Advances in Multi-Sensor Adaptive Process (CAMSAP), 2011.
[12] O. Orhan and E. Erkip, “Energy harvesting two-hop networks: optimal policies for the multi-energy arrival case,” in Proc. 2012 IEEE Sarnoff Symp.
[13] M. Baljon and L. Zhao, “Resource allocation for two-hop communication with energy harvesting constraints,” IEEE International Conference on Wireless Communications and Signal Processing (WCSP), pp. 1–5, Oct. 2015.
[14] P. He, L. Zhao, S. Zhou, and Z. Niu, “Water-filling: A geometric approach and its application to solve generalized radio resource allocation problems,” IEEE Transactions on Wireless Communications, vol. 12, no. 7, pp. 3637 – 3647, 2013.
[15] Y. Luo, J. Zhang, and K. B. Letaief, “Optimal scheduling and power allocation for two-hop energy harvesting communication systems,” IEEE Trans. Wireless Communications, vol. 12, no. 9, pp. 4729 – 4741, Sept. 2013.
[16] S. Boyd and L. Vandenberghe, Convex optimization, Cambridge university press, 2004.
[17] A. Wachter and L. T. Biegler, “On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming,” Mathematical Programming, pp. 25 - 57, 2006.
[18] R. Fletcher and S. Leyffer, “Nonlinear programming without a penalty function,” Mathematical Programming, vol. 91, no. 2, pp. 239—-269, 2002.
[19] “Apopt, an exact solver for minlps.,” Available: https://apopt.com.
