检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王振朝[1,2] 赵云 薛文玲[1] WANG Zhen-chao;ZHAO Yun;XUE Wen-ling(College of Electronic & Informational Engineering,Hebei University,Baoding,Hebei 071002,China;Key Laboratory of Digital Medical Engineering of Hebei Province,Baoding,Hebei 071002,China)
机构地区:[1]河北大学电子信息工程学院,河北保定071002 [2]河北省数字医疗工程重点实验室,河北保定071002
出 处:《计算机科学》2018年第7期104-109,共6页Computer Science
基 金:河北省自然基金项目(F2014201168)资助
摘 要:针对蜂窝下含D2D系统的资源分配问题,文中首次以共道链路间传输速率的公平性为目标来研究功率控制问题。首先,将建立的系统模型归结为以系统吞吐量最大化为目标的联合信道分配与功率控制的最优化问题。为了降低求解该问题的难度,将问题解耦为信道分配和功率控制两个子问题。在假设已得到最优链路匹配集合的基础上,重点研究功率控制问题,分别得出基于公平性原理的最佳发射功率的闭式解、基于系统吞吐量最大化的最佳发射功率的闭式求解域以及满足公平性前提下基于系统吞吐量最大化的最佳发射功率的闭式求解域。仿真结果表明,共道链路的公平性能得到了有效提升。For the resource allocation problem in device-to-device underlaid cellular networks,this paper studied the power control problem with regarding the fairness of transmitting rate between links as the goal for the first time.Joint channel allocation and power control optimization for maximization of the overall network throughput is formed for the system model.In order to reduce the complexity of the problem,it is decoupled into channel allocation and power control.Assuming that optimal matching set has been got previously,this paper focused on power control problem.Optimal transmitting power solutions which are in closed form or can be searched from a finite set are separately induced for the power control for fairness,the power control for maximization of the overall network throughput,and the power control for maximization of the overall network throughput under the condition that fairness has been guaranteed.Simulation results confirm that the fairness between links using the same channel can be improved significantly.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.175.71