Institute of Computing Technology, Chinese Academy IR
Complexity of minimum uplink scheduling in backbone-assisted successive interference cancellation-based wireless networks | |
Xu, Chaonong1; Ma, Kaichi1; Xu, Yongjun2 | |
2018-03-14 | |
发表期刊 | COMPUTER NETWORKS |
ISSN | 1389-1286 |
卷号 | 133页码:120-129 |
摘要 | Relative to the networks with multiple independent sinks, in backbone -assisted networks, multiple sinks are connected together with high-speed wirelines. So, by exchanging decoded signals of User Equipments (UEs) among sinks through the backbones, more interferences to undecoded signals could be cancelled further. Thus, potential optimization rooms for reducing access delays are provided. In this paper, we study the problem of minimum uplink scheduling for Backbone-Assisted Successive Interference Cancellation-based Wireless Networks (BASICWNs), so as to reduce the mean access delays of UEs. We formulate the problem, and prove that it is NP-Complete by presenting a reduction from the partition problem. We further propose a polynomial-time heuristic algorithm based on the greedy strategy that as many UEs as possible are simultaneously scheduled in one slot. Experimental results show, relative to that with multiple independent sinks, the uplink frame length of BASICWNs is reduced by 48% with the heuristic algorithm proposed, and the performance is virtually very close to the optimum. (C) 2018 Elsevier B.V. All rights reserved. |
关键词 | Successive interference cancellation Backbone networks Realtime Uplink scheduling Complexity |
DOI | 10.1016/j.comnet.2018.01.014 |
收录类别 | SCI |
语种 | 英语 |
资助项目 | Science Foundation of China University of Petroleum, Beijing[ZX20150089] ; National Natural Science Foundation of China[61702487] |
WOS研究方向 | Computer Science ; Engineering ; Telecommunications |
WOS类目 | Computer Science, Hardware & Architecture ; Computer Science, Information Systems ; Engineering, Electrical & Electronic ; Telecommunications |
WOS记录号 | WOS:000428009900009 |
出版者 | ELSEVIER SCIENCE BV |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | http://119.78.100.204/handle/2XEOYT63/5748 |
专题 | 中国科学院计算技术研究所期刊论文_英文 |
通讯作者 | Xu, Chaonong |
作者单位 | 1.China Univ Petr, Beijing Key Lab Petr Data Min, Beijing 102249, Peoples R China 2.Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China |
推荐引用方式 GB/T 7714 | Xu, Chaonong,Ma, Kaichi,Xu, Yongjun. Complexity of minimum uplink scheduling in backbone-assisted successive interference cancellation-based wireless networks[J]. COMPUTER NETWORKS,2018,133:120-129. |
APA | Xu, Chaonong,Ma, Kaichi,&Xu, Yongjun.(2018).Complexity of minimum uplink scheduling in backbone-assisted successive interference cancellation-based wireless networks.COMPUTER NETWORKS,133,120-129. |
MLA | Xu, Chaonong,et al."Complexity of minimum uplink scheduling in backbone-assisted successive interference cancellation-based wireless networks".COMPUTER NETWORKS 133(2018):120-129. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论