Throughput Maximization in Latency-Critical Downlink Communication with Hybrid BC-TDMA Strategy

Xiaopeng Yuan, Weiqing Yao, Xian Luo, Zhiwei Bao, A. Schmeink
{"title":"Throughput Maximization in Latency-Critical Downlink Communication with Hybrid BC-TDMA Strategy","authors":"Xiaopeng Yuan, Weiqing Yao, Xian Luo, Zhiwei Bao, A. Schmeink","doi":"10.1109/ISWCS56560.2022.9940358","DOIUrl":null,"url":null,"abstract":"In this paper, we focus on a downlink communication network providing latency-critical services to multiple sensor nodes (SNs). In order to promote the service capability, we adopt a hybrid broadcasting time-division multiple access (BCTDMA) strategy, in which different groups of SNs are assigned to independent time slots and in each time slot the grouped SNs are served in a data broadcasting manner. Taking the reliability constraints into account, we formulate an optimization problem maximizing the minimum achievable throughput among multiple SNs and aim at a joint SN grouping and blocklength allocation design based on the hybrid BC-TDMA strategy. To address the mix-integer nonconvex problem, we first characterize the optimal blocklength allocation for any given user grouping into a closed-form solution, based on which an iterative approach is proposed for efficiently extracting out the optimal grouping, such that the optimal joint solution can be analytically constructed. Finally, the proposed algorithm is validated via numerical results. The performance advantages of the hybrid strategy in throughput improvement are also highlighted, in comparison with benchmarks.","PeriodicalId":141258,"journal":{"name":"2022 International Symposium on Wireless Communication Systems (ISWCS)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS56560.2022.9940358","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we focus on a downlink communication network providing latency-critical services to multiple sensor nodes (SNs). In order to promote the service capability, we adopt a hybrid broadcasting time-division multiple access (BCTDMA) strategy, in which different groups of SNs are assigned to independent time slots and in each time slot the grouped SNs are served in a data broadcasting manner. Taking the reliability constraints into account, we formulate an optimization problem maximizing the minimum achievable throughput among multiple SNs and aim at a joint SN grouping and blocklength allocation design based on the hybrid BC-TDMA strategy. To address the mix-integer nonconvex problem, we first characterize the optimal blocklength allocation for any given user grouping into a closed-form solution, based on which an iterative approach is proposed for efficiently extracting out the optimal grouping, such that the optimal joint solution can be analytically constructed. Finally, the proposed algorithm is validated via numerical results. The performance advantages of the hybrid strategy in throughput improvement are also highlighted, in comparison with benchmarks.
基于BC-TDMA混合策略的延迟关键下行通信吞吐量最大化
在本文中,我们专注于为多个传感器节点(SNs)提供延迟关键服务的下行通信网络。为了提高服务能力,我们采用混合广播时分多址(BCTDMA)策略,将不同分组的SNs分配到独立的时隙,并在每个时隙以数据广播的方式提供分组的SNs服务。在考虑可靠性约束的前提下,提出了以多个SN之间的最小可达吞吐量最大化为优化问题,并针对基于BC-TDMA混合策略的SN联合分组和块长分配设计进行了研究。为了解决混合整数非凸问题,我们首先将任意给定用户分组的最优块长度分配特征化为封闭解,在此基础上提出了一种迭代方法来有效地提取最优分组,从而可以解析构造最优联合解。最后,通过数值实验验证了算法的有效性。与基准测试相比,还强调了混合策略在吞吐量改进方面的性能优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信