能量收集信道的最优时分多址

Juan Liu, H. Dai, Wei Chen
{"title":"能量收集信道的最优时分多址","authors":"Juan Liu, H. Dai, Wei Chen","doi":"10.1109/GLOCOM.2014.7037566","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a multiple access channel, where multiple users equipped with energy harvesting batteries communicate to an access point. The users are supposed to share the channel via Time Division Multiple Access (TDMA). In many existing works, it is commonly assumed that the users' energy harvesting processes and storage status are known to all the users before transmissions. In practice, such knowledge may not be readily available. To avoid excessive overhead for realtime information exchange, we consider the scenario where the users schedule their individual transmissions according to the users' statistical energy harvesting profiles. We first show that in the case when each node has an infinite-capacity battery, equal-power TDMA is optimal for throughput maximization. Using Markov chain modeling, we then study the system performance for the finite-capacity battery case under the equal-power TDMA framework. We also consider an equal-time TDMA scheme, which assigns equal-length subslots to each user. It is found that equal-power TDMA always outperforms equal-time TDMA in the infinite-capacity battery case, while equal-time TDMA exhibits compatible or even slightly better performance in some scenarios when the batteries have finite capacities.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"11 1","pages":"4801-4806"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On optimum time division multiple access for energy harvesting channels\",\"authors\":\"Juan Liu, H. Dai, Wei Chen\",\"doi\":\"10.1109/GLOCOM.2014.7037566\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider a multiple access channel, where multiple users equipped with energy harvesting batteries communicate to an access point. The users are supposed to share the channel via Time Division Multiple Access (TDMA). In many existing works, it is commonly assumed that the users' energy harvesting processes and storage status are known to all the users before transmissions. In practice, such knowledge may not be readily available. To avoid excessive overhead for realtime information exchange, we consider the scenario where the users schedule their individual transmissions according to the users' statistical energy harvesting profiles. We first show that in the case when each node has an infinite-capacity battery, equal-power TDMA is optimal for throughput maximization. Using Markov chain modeling, we then study the system performance for the finite-capacity battery case under the equal-power TDMA framework. We also consider an equal-time TDMA scheme, which assigns equal-length subslots to each user. It is found that equal-power TDMA always outperforms equal-time TDMA in the infinite-capacity battery case, while equal-time TDMA exhibits compatible or even slightly better performance in some scenarios when the batteries have finite capacities.\",\"PeriodicalId\":6492,\"journal\":{\"name\":\"2014 IEEE Global Communications Conference\",\"volume\":\"11 1\",\"pages\":\"4801-4806\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Global Communications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2014.7037566\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2014.7037566","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在本文中,我们考虑了一个多址通道,其中多个用户配备了能量收集电池通信到一个接入点。用户应该通过时分多址(TDMA)共享信道。在现有的许多工作中,通常假设在传输之前所有用户都知道用户的能量收集过程和存储状态。在实践中,这样的知识可能并不容易获得。为了避免实时信息交换的过多开销,我们考虑这样的场景:用户根据用户的统计能量收集配置文件来安排他们的个人传输。我们首先表明,当每个节点都有一个无限容量的电池时,等功率TDMA对于吞吐量最大化是最优的。利用马尔可夫链模型,研究了等功率TDMA框架下有限容量电池情况下的系统性能。我们还考虑了一种等时TDMA方案,该方案为每个用户分配等长的子槽。研究发现,在电池容量无限的情况下,等功率TDMA总是优于等时间TDMA,而在电池容量有限的情况下,等时间TDMA表现出兼容甚至略好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On optimum time division multiple access for energy harvesting channels
In this paper, we consider a multiple access channel, where multiple users equipped with energy harvesting batteries communicate to an access point. The users are supposed to share the channel via Time Division Multiple Access (TDMA). In many existing works, it is commonly assumed that the users' energy harvesting processes and storage status are known to all the users before transmissions. In practice, such knowledge may not be readily available. To avoid excessive overhead for realtime information exchange, we consider the scenario where the users schedule their individual transmissions according to the users' statistical energy harvesting profiles. We first show that in the case when each node has an infinite-capacity battery, equal-power TDMA is optimal for throughput maximization. Using Markov chain modeling, we then study the system performance for the finite-capacity battery case under the equal-power TDMA framework. We also consider an equal-time TDMA scheme, which assigns equal-length subslots to each user. It is found that equal-power TDMA always outperforms equal-time TDMA in the infinite-capacity battery case, while equal-time TDMA exhibits compatible or even slightly better performance in some scenarios when the batteries have finite capacities.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信