期刊检索

  • 2024年第56卷
  • 2023年第55卷
  • 2022年第54卷
  • 2021年第53卷
  • 2020年第52卷
  • 2019年第51卷
  • 2018年第50卷
  • 2017年第49卷
  • 2016年第48卷
  • 2015年第47卷
  • 2014年第46卷
  • 2013年第45卷
  • 2012年第44卷
  • 2011年第43卷
  • 2010年第42卷
  • 第1期
  • 第2期

主管单位 中华人民共和国
工业和信息化部
主办单位 哈尔滨工业大学 主编 李隆球 国际刊号ISSN 0367-6234 国内刊号CN 23-1235/T

期刊网站二维码
微信公众号二维码
引用本文:唐宏,刘小洁,甘陈敏,陈榕.超密集网络中基于改进DQN的接入选择算法[J].哈尔滨工业大学学报,2023,55(5):107.DOI:10.11918/202204106
TANG Hong,LIU Xiaojie,GAN Chenmin,CHEN Rong.Access selection algorithm based on improved DQN for ultra-dense networks[J].Journal of Harbin Institute of Technology,2023,55(5):107.DOI:10.11918/202204106
【打印本页】   【HTML】   【下载PDF全文】   查看/发表评论  下载PDF阅读器  关闭
过刊浏览    高级检索
本文已被:浏览 6693次   下载 7363 本文二维码信息
码上扫一扫!
分享到: 微信 更多
超密集网络中基于改进DQN的接入选择算法
唐宏1,2,刘小洁1,2,甘陈敏1,2,陈榕1,2
(1.重庆邮电大学 通信与信息工程学院,重庆 400065;2.移动通信技术重庆市重点实验室(重庆邮电大学),重庆 400065)
摘要:
在超密集网络环境中,各个接入点密集部署在热点区域,构成了复杂的异构网络,用户需要选择接入合适的网络以获得最好的性能。如何为用户选择最优的网络,使用户自身或网络性能达到最佳,称为网络接入选择问题。为了解决超密集网络中用户的接入选择问题,综合考虑网络状态、用户偏好以及业务类型,结合负载均衡策略,提出了一种基于改进深度Q网络(deep Q network,DQN)的超密集网络接入选择算法。首先,通过分析网络属性和用户业务的偏好对网络选择的影响,选择合适的网络参数作为接入选择算法的参数;其次,将网络接入选择问题利用马尔可夫决策过程建模,分别对模型中的状态、动作和奖励函数进行设计;最后,利用DQN求解选网模型,得到最优选网策略。此外,为了避免DQN过高估计Q值,对传统DQN的目标函数进行优化,并且在训练神经网络时,引入了优先经验回放机制以提升学习效率。仿真结果表明,所提算法能够解决传统DQN的高估问题,加快神经网络的收敛,有效减少用户的阻塞,并改善网络的吞吐能力。
关键词:  超密集网络  接入选择  深度Q网络(DQN)  优先经验回放  负载均衡
DOI:10.11918/202204106
分类号:TN92
文献标识码:A
基金项目:长江学者和创新团队发展计划(IRT_16R72)
Access selection algorithm based on improved DQN for ultra-dense networks
TANG Hong1,2,LIU Xiaojie1,2,GAN Chenmin1,2,CHEN Rong1,2
(1.School of Communications and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China; 2.Chongqing Key Lab of Mobile Communications Technology (Chongqing University of Posts and Telecommunications), Chongqing 400065, China)
Abstract:
In the ultra-dense network environment, each access point is deployed in the hotspot area, which forms a complex heterogeneous network. Users need to choose the appropriate network to access, so as to achieve the best performance. Network selection problem is to choose the optimal network for the user, so that the user or network performance reaches the best. In order to solve the access selection problem of users in ultra-dense networks, we proposed an ultra-dense network access selection algorithm based on the improved deep Q network (DQN), considering network states, user preferences, and service types, and combining with load balancing strategies. First, by analyzing the influence of network attributes and user preferences on network selection, the appropriate network parameters were selected as the parameters of the access selection algorithm. Then, the problem of network access selection was modeled by Markov decision-making process, and the states, actions, and reward functions of the model were designed. Finally, the optimal network strategy was obtained by using DQN to solve the network selection model. In addition, the target function of traditional DQN was optimized to avoid overestimation of Q value by DQN, and a priority experience replay mechanism was introduced to improve learning efficiency. Simulation results show that the method could well solve the problem of overestimation of traditional DQN, accelerate the convergence of neural network, effectively reduce user congestion, and improve network throughput performance.
Key words:  ultra-dense network  access selection  deep Q network (DQN)  priority experience replay  load balancing

友情链接LINKS