朱琨

个人信息Personal Information

教授

招生学科专业:
计算机科学与技术 -- 【招收博士、硕士研究生】 -- 计算机科学与技术学院
软件工程 -- 【招收硕士研究生】 -- 计算机科学与技术学院
网络空间安全 -- 【招收博士、硕士研究生】 -- 计算机科学与技术学院
电子信息 -- 【招收博士、硕士研究生】 -- 计算机科学与技术学院

毕业院校:南洋理工大学

学历:新加坡南洋理工大学

学位:工学博士学位

所在单位:计算机科学与技术学院/人工智能学院/软件学院

办公地点:计算机学院314办公室

电子邮箱:

扫描关注

论文成果

当前位置: 中文主页 >> 科学研究 >> 论文成果

Context-Aware Decoupled Multiple Association in Ultra-Dense Networks

点击次数:

所属单位:计算机科学与技术学院/人工智能学院/软件学院

发表刊物:IEEE Glob. Commun. Conf., GLOBECOM - Proc.

摘要:The new trends in network denisification, heterogeneity, and the introduction of new techniques (e.g., full-duplex) introduce new challenges for user association. For most existing user association schemes, the uplink (UL) and downlink (DL) access are coupled. That is, a user equipment (UE) is associated with the same BS for UL and DL transmissions. However, in ultra-dense heterogeneous networks (UDNs), due to the large disparities among base stations in different tiers and among uplink and downlink, the coupled UL-DL user association will limit the system performance. In this paper, we propose a novel concept of decoupled multiple association for user association in UDNs, which allows a UE to be associated with multiple base stations (BSs) for UL and DL in a decoupled manner. Furthermore, the context information of UEs is considered when making association decisions. Specifically, a decoupled multiple association matching game is formulated and a context-aware swap matching algorithm is proposed. The proposed scheme could attain higher data rates and could satisfy the quality of service (QoS) requirements of different UEs. Additionally, it could overcome the back-haul limitation of individual BSs. We compare the proposed scheme with three other association schemes, and the simulation results show significant performance gains of our proposed scheme in UDNs. © 2018 IEEE.

是否译文:

发表时间:2018-01-01

合写作者:Li, Zhenzhen,F70206470,Xu, Yuanyuan

通讯作者:朱琨