Time Reusing in D2D-Enabled Cooperative Networks

doi:10.1109/TWC.2018.2808259

	Time Reusing in D2D-Enabled Cooperative Networks
	Zhu, Zhaowei1 ; Jin, Shengda1 ; Yang, Yang 2,3; Hu, Honglin 4; Luo, Xiliang1,3
	2018-05-01
会议录名称	IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS (IF:8.9[JCR-2023],8.6[5-Year])
ISSN	1536-1276
卷号	17
期号	5
页码	3185-3200
发表状态	已发表
DOI	10.1109/TWC.2018.2808259
摘要	Device-to-device (D2D) communication has become one important part of next-generation mobile networks particularly due to the booming of proximity-based services, e.g. the ProSe standardized in LTE. However, D2D communications may create strong interference to nearby users that are sharing the same spectrum. Thus, interference management in a D2D-enabled cooperative network is critical. In this paper, the time reuse problem and its distributed solution in a D2D-enabled cooperative network are investigated. Even though the total number of possible time reuse patterns increases exponentially with the quantity of the users, the authors first show that the optimal network performance can be achieved by only activating a limited number of time reuse patterns. The effects of the incentive mechanism on the reuse pattern selection are also investigated. Meanwhile, the set of active reuse patterns are determined efficiently with the Frank-Wolfe method. For a specific set of active time reuse patterns, the authors further show that the optimal resource allocation problem can be formulated as one consensus-building problem. Based on the alternating-direction method of multipliers, one low-complexity algorithm is proposed to determine the optimal resource allocations in a distributed fashion. Numerical simulations are carried out to corroborate our designs. © 2002-2012 IEEE.
关键词	Computational complexity Cooperative communication Fog computing Resource allocation Mobile telecommunication systems Parallel algorithms Alternating direction method of multipliers Cooperative networks device-to-device Deviceto-device (D2D) communication Low complexity algorithm Optimal resource allocation Time reuse User associations
收录类别	EI
语种	英语
出版者	Institute of Electrical and Electronics Engineers Inc., United States
EI入藏号	20181004879748
EI主题词	Heterogeneous networks
EISSN	1558-2248
EI分类号	721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory ; 722.3 Data Communication, Equipment and Techniques ; 722.4 Digital Computers and Systems ; 912.2 Management
原始文献类型	Conference article (CA)
引用统计	正在获取...
文献类型	会议论文
条目标识符	https://kms.shanghaitech.edu.cn/handle/2MSLDSTB/251890
专题	信息科学与技术学院信息科学与技术学院_PI研究组_罗喜良组信息科学与技术学院_硕士生
作者单位	1.School of Information Science and Technology, ShanghaiTech University, Shanghai; 201210, China; 2.Chinese Academy of Sciences, Shanghai Institute of Microsystem and Information Technology, Shanghai; 201210, China; 3.Shanghai Institute of Fog Computing Technology, Shanghai; 201210, China; 4.Chinese Academy of Sciences, Shanghai Advanced Research Institute, Shanghai; 201210, China
第一作者单位	信息科学与技术学院
第一作者的第一单位	信息科学与技术学院
推荐引用方式 GB/T 7714	Zhu, Zhaowei,Jin, Shengda,Yang, Yang,et al. Time Reusing in D2D-Enabled Cooperative Networks[C]:Institute of Electrical and Electronics Engineers Inc., United States,2018:3185-3200.