Interference-aware D2D-Multicast Session Provisioning in LTE-A Networks

被引:0
作者
Bhardwaj, Ajay [1 ]
Agnihotri, Samar [1 ]
机构
[1] Indian Inst Technol, Sch Comp & Elect Engn, Mandi 175005, HP, India
来源
2017 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC) | 2017年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Device-to-device (D2D) multicast communication is considered as a potential solution to improve the spectral efficiency of cellular networks. This paper focuses on resource allocation in underlay D2D multicast networks where multiple D2D multicast groups (MGs) share the uplink frequency channels with multiple cellular users (CUs). An optimization problem that maximizes the system throughput while fulfilling the maximum power constraint of every mobile user and ensuring a certain level of quality of service (QoS) to every CU and D2D multicast group is formulated. This formulation leads to mixed integer non-linear programming (MINLP), which is computationally intractable for large scale networks. Therefore, to find a feasible solution, we propose a channel sharing algorithm which determines how many MGs can share a channel with certain QoS guarantees to CU and D2D MGs. Then, we propose a power allocation algorithm that maximizes the system throughput while satisfying the various constraints. The impact of geographical spread of MGs, number of MGs, maximum available transmission power, and QoS requirements of every CU on achievable system throughput is analyzed. Numerical results show the efficacy of proposed model in terms of D2D MG's throughput and spectrum efficiency.
引用
收藏
页数:6
相关论文
共 17 条
[1]  
Asadi A., 2014, IEEE COMMUN SURVEYS, V16
[2]  
Barbera M. V., 2014, AD HOC NETWORKS, V19
[3]  
Bhardwaj A., 2016, P IEEE WCNC
[4]  
Chai Y., 2013, P IEEE ICC
[5]  
F. C. Commission, 2016, 5 F C COMM
[6]  
Feng D., 2013, IEEE T COMMUN, V61
[7]  
Gong W., 2015, WIRELESS PERSONAL CO, V85
[8]  
Hajiaghayi M., 2014, WIRELESS NETWORKS, V20
[9]  
Im S., 2008, P IEEE VTC CAN SEPT
[10]  
Kannan R., 1978, On the Computational Complexity of Integer Programming Problems