FRESH: Push the Limit of D2D Communication Underlaying Cellular Networks

被引:10
作者
Yang, Yang [1 ]
Liu, Tingwei [1 ]
Ma, Xiaoqiang [1 ]
Jiang, Hongbo [1 ]
Liu, Jiangchuan [2 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Elect Informat & Commun, Wuhan 430074, Hubei, Peoples R China
[2] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada
基金
中国国家自然科学基金;
关键词
Cellular networks; D2D communication; resource sharing; TO-DEVICE COMMUNICATIONS; RESOURCE-ALLOCATION; OPTIMIZATION; SYSTEMS;
D O I
10.1109/TMC.2016.2601917
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Device-to-device (D2D) communication has been recently proposed to mitigate the burden of base stations by leveraging the underutilized cellular spectrum resources, where high overall network throughput and D2D access rate are critical for its service performance and availability. In this paper, we study the resource allocation problem to push the limit of D2D communication underlaying cellular networks by allowing multiple D2D links to share resource with multiple cellular links. We propose FRESH, a full resource sharing scheme where each subchannel can be shared by a cellular link and an arbitrary number of D2D links. In particular, FRESH first divides the communication links into so-called full resource sharing sets such that, within each set, all D2D link members are able to reuse the whole allocated resources. Thereafter, it allocates a sum of spectrum resources to each obtained full resource sharing set. As compared with state-of-the-art schemes, FRESH provides fine-grained resource allocation, resulting in throughput improvements of up to one order of magnitude, and D2D access rate improvements of up to 5 times with a moderate node density (e. g., on the order of 1 user per 400 square meters).
引用
收藏
页码:1630 / 1643
页数:14
相关论文
共 36 条
[1]  
[Anonymous], 2009, VTC SPRING 2009 IEEE
[2]  
[Anonymous], 2003, Practical Cryptography
[3]  
[Anonymous], CISC VIS NETW IND GL
[4]  
[Anonymous], P 5 INT C COGN RAD O
[5]  
[Anonymous], 2014, 23703 3GPP TR
[6]  
[Anonymous], P IEEE WIR COMM NETW
[7]  
[Anonymous], 2014, CISCO VISUAL NETWORK
[8]  
[Anonymous], 22468 3GPP TS
[9]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[10]  
[Anonymous], TR 22 803 V12 2 0