能量收集广播链路的最优离线分组调度

F. M. Ozcelik, Hakan Erkal, E. Uysal-Biyikoglu, mehmet. ozcelik
{"title":"能量收集广播链路的最优离线分组调度","authors":"F. M. Ozcelik, Hakan Erkal, E. Uysal-Biyikoglu, mehmet. ozcelik","doi":"10.1109/ISIT.2011.6034103","DOIUrl":null,"url":null,"abstract":"We consider the minimization of packet transmission duration on an energy harvesting broadcast channel (BC). Energy and data arrivals are assumed to occur at arbitrary but known instants. An achievable rate region with structural properties satisfied by the two-user AWGN BC capacity region is assumed. Structural properties of power and rate allocation in an optimal policy are established, as well as the uniqueness of the optimal policy under the condition that all the data of the “weaker” user are available at the beginning. An iterative algorithm, DuOpt, based on block coordinate descent that achieves the same structural properties as the optimal is described.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"237 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Optimal offline packet scheduling on an energy harvesting broadcast link\",\"authors\":\"F. M. Ozcelik, Hakan Erkal, E. Uysal-Biyikoglu, mehmet. ozcelik\",\"doi\":\"10.1109/ISIT.2011.6034103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the minimization of packet transmission duration on an energy harvesting broadcast channel (BC). Energy and data arrivals are assumed to occur at arbitrary but known instants. An achievable rate region with structural properties satisfied by the two-user AWGN BC capacity region is assumed. Structural properties of power and rate allocation in an optimal policy are established, as well as the uniqueness of the optimal policy under the condition that all the data of the “weaker” user are available at the beginning. An iterative algorithm, DuOpt, based on block coordinate descent that achieves the same structural properties as the optimal is described.\",\"PeriodicalId\":208375,\"journal\":{\"name\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"volume\":\"237 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2011.6034103\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6034103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

我们考虑了能量收集广播信道(BC)上数据包传输时间的最小化。假设能量和数据到达发生在任意但已知的时刻。假设了一个可实现的速率区域,其结构性质满足双用户AWGN BC容量区域。建立了最优策略中功率和费率分配的结构性质,以及最优策略在一开始“较弱”用户的所有数据都可用的条件下的唯一性。描述了一种基于块坐标下降的迭代算法DuOpt,该算法与最优算法具有相同的结构特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal offline packet scheduling on an energy harvesting broadcast link
We consider the minimization of packet transmission duration on an energy harvesting broadcast channel (BC). Energy and data arrivals are assumed to occur at arbitrary but known instants. An achievable rate region with structural properties satisfied by the two-user AWGN BC capacity region is assumed. Structural properties of power and rate allocation in an optimal policy are established, as well as the uniqueness of the optimal policy under the condition that all the data of the “weaker” user are available at the beginning. An iterative algorithm, DuOpt, based on block coordinate descent that achieves the same structural properties as the optimal is described.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信