期刊文献+

一种基于价格竞争的D2D通信资源分配算法 被引量:2

An Algorithm of D2D Communication Resource Allocation Based on Price Competition
下载PDF
导出
摘要 针对蜂窝用户与D2D用户所构成的混合网络系统中同频干扰问题,提出一种基于价格竞争的D2D通信资源分配算法。该算法不仅考虑利用基站定价来减小对蜂窝系统的干扰,而且联合基站端的干扰容限对干扰功率进行约束。首先将问题公式化制定非合作博弈过程,利用效用函数模型分析D2D用户的利润和对蜂窝基站的干扰,从而调整发射功率最大化系统整体收益;然后通过通信的D2D用户来更新干扰继而更新复用价格;最后采用注水算法利用拉格朗日条件来优化价格。仿真表明,该算法不仅可以简单地控制干扰功率,而且还有效地提高了系统吞吐量。 In order to solve the problem of co-channel interference in the mixed network system of cellular users and D2 D users, a resource allocation algorithm for D2 D communication based on price competition is proposed. The algorithm not only considers the use of base station pricing to reduce the interference to the original cellular system, but also combines the interference tolerance of the base station to constrain the interference power. Firstly, the problem was formulated as a "non-cooperative game" process, the utility function model was used to analyze the profit of D2 D users and the interference to the cellular base station, so as to adjust the transmission power to maximize the overall system revenue. And then the interference was updated through the D2 D users of the communication and then the multiplex price was updated. Finally, the water injection algorithm was used to optimize the price by using Lagrangian condition. Simulation results show that the algorithm can not only control the interference power simply, but also improve the system throughput effiectively.
作者 薛建彬 李俞虹 XUE Jian-bin;LI Yu - hong(School of Computer and Communication, Lanzhou University of Technology, Lanzhou 730050, China;National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China)
出处 《测控技术》 CSCD 2018年第7期14-18,共5页 Measurement & Control Technology
基金 东南大学移动通信国家重点实验室开放研究基金资助课题(2014D13) 国家自然科学基金资助项目(61461026) 甘肃省自然科学基金项目(1310RJZA003)
关键词 资源分配 非合作博弈 干扰功率 吞吐量 resource allocation non-cooperative game interference power throughput
  • 相关文献

同被引文献8

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部