{"title":"Opportunistic scheduling in two-way wireless communication with energy harvesting","authors":"Ashwini Marathe, S. R. Pillai, R. Vaze","doi":"10.23919/WIOPT.2017.7959897","DOIUrl":null,"url":null,"abstract":"A two-way half-duplex communication model is considered, where two nodes want to exchange a fixed number of bits with each other, and both nodes are powered by energy harvesting (EH) sources. The problem of minimizing the sum of the time required to send the required bits in both the directions is considered. The model also includes the processing cost at each node, that models the power needed for nodes to stay powered on during transmission. In the offline setting, where the EH arrival profile is known non-causally, an iterative algorithm based on alternating maximization is shown to be optimal. In the more realistic setting of causal knowledge of the EH arrival profile, an online algorithm is shown to be optimal in terms of the competitive ratio and the optimal competitive ratio is shown to be 2.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"1 1","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WIOPT.2017.7959897","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
A two-way half-duplex communication model is considered, where two nodes want to exchange a fixed number of bits with each other, and both nodes are powered by energy harvesting (EH) sources. The problem of minimizing the sum of the time required to send the required bits in both the directions is considered. The model also includes the processing cost at each node, that models the power needed for nodes to stay powered on during transmission. In the offline setting, where the EH arrival profile is known non-causally, an iterative algorithm based on alternating maximization is shown to be optimal. In the more realistic setting of causal knowledge of the EH arrival profile, an online algorithm is shown to be optimal in terms of the competitive ratio and the optimal competitive ratio is shown to be 2.