Complexity of minimum uplink power scheduling with delay bound for Backbone-assisted PD-NOMA wireless networks
文献类型：期刊论文
| 作者 | Wu, Fan3; Xu, Chaonong3; Zhu, Yutong1; Li, Chao2 |
| 刊名 | COMPUTER NETWORKS
 |
| 出版日期 | 2022-10-09 |
| 卷号 | 215页码:7 |
| 关键词 | Backbone NOMA Complexity Uplink Scheduling |
| ISSN号 | 1389-1286 |
| DOI | 10.1016/j.comnet.2022.109194 |
| 英文摘要 | Although it has high spectrum utilization ratio, the technique of Power-Domain Non-orthogonal Multiplexing Access (PD-NOMA) has a fatal disadvantage of high power consumptions. Backbone-Assisted PD-NOMA provides a feasible way to lowering power consumptions, since scheduling flexibilities are further enhanced by sharing both decoding capabilities of wireline-connected multiple sinks and the geographical diversity of the sinks. In this paper, we study the problem of minimizing uplink power consumption sum for backbone-assisted PD-NOMA wireless networks, under the constraint of given uplink delay bound. We formulate the problem, and prove that it is NP-Complete by presenting an original reduction from the classic problem of partition into triangles, which is known to be NP-Complete. We further propose a low-complexity heuristic algorithm based on the greedy strategy that as many user equipments as possible are simultaneously scheduled in one slot, which is also the optimal for one sink scenario. The analysis based on experimental results shows that the power consumption sum achieved by the heuristic algorithm will exponentially decrease with linearly-relaxed delay bound, and besides, it is virtually very close to the optimum. |
| 资助项目 | National Natural Science Foundation of China[61173132] |
| WOS研究方向 | Computer Science ; Engineering ; Telecommunications |
| 语种 | 英语 |
| WOS记录号 | WOS:000838698600002 |
| 出版者 | ELSEVIER |
| 源URL | [http://119.78.100.204/handle/2XEOYT63/19470]  |
| 专题 | 中国科学院计算技术研究所期刊论文_英文 |
| 通讯作者 | Xu, Chaonong |
| 作者单位 | 1.UCAS, Hangzhou Inst Adv Study, Hangzhou 310016, Peoples R China 2.Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China 3.China Univ Petr, Beijing Key Lab Petr Data Min, Beijing 102249, Peoples R China |
| 推荐引用方式 GB/T 7714 | Wu, Fan,Xu, Chaonong,Zhu, Yutong,et al. Complexity of minimum uplink power scheduling with delay bound for Backbone-assisted PD-NOMA wireless networks[J]. COMPUTER NETWORKS,2022,215:7. |
| APA | Wu, Fan,Xu, Chaonong,Zhu, Yutong,&Li, Chao.(2022).Complexity of minimum uplink power scheduling with delay bound for Backbone-assisted PD-NOMA wireless networks.COMPUTER NETWORKS,215,7. |
| MLA | Wu, Fan,et al."Complexity of minimum uplink power scheduling with delay bound for Backbone-assisted PD-NOMA wireless networks".COMPUTER NETWORKS 215(2022):7. |
入库方式： OAI收割
来源：计算技术研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。