{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:53Z","timestamp":1750221113513,"version":"3.41.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T00:00:00Z","timestamp":1549756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSF of China","doi-asserted-by":"crossref","award":["61532012, 61877055, 61822206, 61702205, 61601287, 61602303, 61829201"],"award-info":[{"award-number":["61532012, 61877055, 61822206, 61702205, 61601287, 61602303, 61829201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF of Zhejiang Province of China","award":["LQ19F020007, LQ19F030010, LY18F030013"],"award-info":[{"award-number":["LQ19F020007, LQ19F030010, LY18F030013"]}]},{"name":"Open Research Fund of Tianjin Key Laboratory of Advanced Networking"},{"name":"CCF-Tencent RAGR","award":["20180116"],"award-info":[{"award-number":["20180116"]}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2018YFB1004702"],"award-info":[{"award-number":["2018YFB1004702"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2019,2,28]]},"abstract":"<jats:p>\n            Due to the random and dynamic energy-harvesting process, it is challenging to conduct optimal rate control in Energy-Harvesting Communication Systems (EHCSs). Existing works mainly focus on two cases: (1) the traffic load is infinite (as long as there is energy, there is data to transmit), in which the objective is to optimize the rate control policy subject to the dynamic energy arrivals, thus maximizing the average system throughput; and (2) the traffic load is finite, in which the objective is to optimize the rate control policy, thus minimizing the time by which all packets are delivered. In this work, we focus on the optimal rate control of EHCSs from another important and practical perspective, where the data and energy arrivals are both random. Given any deadline of\n            <jats:italic>T<\/jats:italic>\n            , our goal is to maximize the total throughput in [0,\n            <jats:italic>T<\/jats:italic>\n            ]. Specifically, two scenarios are considered: (1) energy is ready before the transmission; and (2) energy arrives randomly during the transmission. In both scenarios, we assume that the data arrive randomly during the transmission. For the first scenario, we develop a novel Stepwise Searching Algorithm (SSA) based on the cumulative curve methodology, which is shown to achieve the optimal solution and the complexity grows only linearly with the problem size. In addition, the SSA can provide a simple and appealing graphical visualization of approximating the optimal solution. For the second scenario, we provide a simplified case study that can be solved by the SSA with low computation overhead and demonstrate the difficulties in solving the general setting, which initiates a first step toward the full understanding of the scenario when energy arrives randomly during the transmission.\n          <\/jats:p>","DOI":"10.1145\/3293535","type":"journal-article","created":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T13:11:45Z","timestamp":1549890705000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Rate Control for Energy-Harvesting Systems with Random Data and Energy Arrivals"],"prefix":"10.1145","volume":"15","author":[{"given":"Riheng","family":"Jia","sequence":"first","affiliation":[{"name":"Zhejiang Normal University, Zhejiang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinbei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Yang","family":"Liu","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Liu","sequence":"additional","affiliation":[{"name":"Army Engineering University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luoyi","family":"Fu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0357-8356","authenticated-orcid":false,"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,2,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2346507"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2805357"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801419"},{"key":"e_1_2_1_4_1","volume-title":"New York: Springer.","author":"Boudec J. L.","year":"2001","unstructured":"J. L. Boudec and P. Thiran . 2001 . Network Calculus. Lecture Notes in Computer Science , Vol. 2050 . New York: Springer. J. L. Boudec and P. Thiran. 2001. Network Calculus. Lecture Notes in Computer Science, Vol. 2050. New York: Springer."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872409"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.102.080601"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.61110"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2391611"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.220"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594792"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517351.2517364"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2668332.2668382"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2809695.2809707"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3131672.3131673"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1860093.1860101"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1274858.1274870"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2032419"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2505729"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2345257"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183338"},{"volume-title":"Proc. of IEEE ICC","author":"Ortiz A.","key":"e_1_2_1_21_1","unstructured":"A. Ortiz , H. Shatri , X. Li , T. Weber , and A. Klein . 2016. Reinforcement learning for energy harvesting point-to-point communications . In Proc. of IEEE ICC . Kuala Lumpur, Malaysia. IEEE, 1--6. A. Ortiz, H. Shatri, X. Li, T. Weber, and A. Klein. 2016. Reinforcement learning for energy harvesting point-to-point communications. In Proc. of IEEE ICC. Kuala Lumpur, Malaysia. IEEE, 1--6."},{"volume-title":"Proc. of IEEE ISIT","author":"Ozel O.","key":"e_1_2_1_22_1","unstructured":"O. Ozel , S. Ulukus , and P. Grover . 2015. Optimal scheduling for energy harvesting transmitters under temperature constraints . In Proc. of IEEE ISIT . Hong Kong, China. IEEE, 1129--1133. O. Ozel, S. Ulukus, and P. Grover. 2015. Optimal scheduling for energy harvesting transmitters under temperature constraints. In Proc. of IEEE ISIT. Hong Kong, China. IEEE, 1129--1133."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1814433.1814463"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1859995.1860025"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594791"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/860176.860179"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566675"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1859995.1860037"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2391491"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2612039"},{"volume-title":"Proc. of IEEE ISIT","author":"Shaviv D.","key":"e_1_2_1_31_1","unstructured":"D. Shaviv , P. M. Nguyen , and A. Ozgur . 2015. Capacity of the energy harvesting channel with a finite battery . In Proc. of IEEE ISIT , Hong Kong, China. IEEE, 131--135. D. Shaviv, P. M. Nguyen, and A. Ozgur. 2015. Capacity of the energy harvesting channel with a finite battery. In Proc. of IEEE ISIT, Hong Kong, China. IEEE, 131--135."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348543.2348551"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126495"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.060710.00094"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2012.012412.110805"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2391511"},{"volume-title":"Proc. of IEEE INFOCOM","author":"Wang C.","key":"e_1_2_1_37_1","unstructured":"C. Wang , J. Li , Y. Yang , and F. Ye . 2016. A hybrid framework combining solar energy harvesting and wireless charging for wireless sensor networks . In Proc. of IEEE INFOCOM , San Francisco, CA. IEEE, 1--9. C. Wang, J. Li, Y. Yang, and F. Ye. 2016. A hybrid framework combining solar energy harvesting and wireless charging for wireless sensor networks. In Proc. of IEEE INFOCOM, San Francisco, CA. IEEE, 1--9."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2109042"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2769644"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2973750.2973780"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.112811.100349"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2020831"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1021\/nl4001053"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293535","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:01Z","timestamp":1750208521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293535"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,10]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2,28]]}},"alternative-id":["10.1145\/3293535"],"URL":"https:\/\/doi.org\/10.1145\/3293535","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"type":"print","value":"1550-4859"},{"type":"electronic","value":"1550-4867"}],"subject":[],"published":{"date-parts":[[2019,2,10]]},"assertion":[{"value":"2017-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-02-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}