衬垫
计算机科学
资源配置
服务质量
蜂窝网络
资源管理(计算)
数学优化
计算机网络
最大最小公平
方案(数学)
发射机功率输出
整数规划
最优化问题
频率分配
分布式计算
信噪比(成像)
发射机
算法
电信
数学
数学分析
频道(广播)
作者
Hui Dun,Fang Ye,Shuhong Jiao
标识
DOI:10.23919/usnc/ursi49741.2020.9321668
摘要
In this paper, we investigate the resource allocation for device-to-device (D2D) communications with underlaying cellular networks. Specifically, in underlay mode, D2D communications optimize for maximizing the corresponding utility under cellular users' quality of service (QoS) requirement and transmit power constraints. To solve this challenging subchannel allocation problem, which is actually a nonconvex mixed-integer programming problem, we decompose the whole optimization problem into independent subproblems. Firstly, we find out the candidate D2D communications users who are permitted to share the same spectrum with cellular users in the admission control subproblem. Then, to solve the resource allocation subproblem, a novel fast and tradeoff subchannel allocation algorithm between utility and fairness is proposed with setting higher priority for unpopular D2D users. Simulation results validate our proposed novel fast allocation strategy achieves remarkable improvement with low complexity and fairness guaranteeing.
科研通智能强力驱动
Strongly Powered by AbleSci AI