基于APG合并及拓扑势优化的启发式用户关联策略

胡志蕊; 毕美华; 许方敏; 何美霖; 郑长亮

doi:10.11959/j.issn.1000-436x.2022121

您当前的位置：

首页 >

文章列表页 >

基于APG合并及拓扑势优化的启发式用户关联策略

学术论文 | 更新时间：2024-06-06

- 基于APG合并及拓扑势优化的启发式用户关联策略
- APG mergence and topological potential optimization based heuristic user association strategy
- 通信学报 2022年43卷第6期页码：98-107
- 作者机构：
  
  杭州电子科技大学通信工程学院，浙江杭州 310018
- 作者简介：
  
  [ "胡志蕊（1987- ），女，山东德州人，博士，杭州电子科技大学讲师，主要研究方向为协作通信、资源分配、信能同传技术" ]
  [ "毕美华（1981- ），女，山东济宁人，博士，杭州电子科技大学副教授，主要研究方向为光与无线融合接入、新型光接入网系统的物理层安全、可重构的智能数据中心网络系统、IMDD/相干光传输系统中的新型均衡算法等" ]
  [ "许方敏（1980- ），女，浙江瑞安人，博士，杭州电子科技大学讲师，主要研究方向为小区间干扰抑制、无线资源管理、MIMO建模及干扰删除等" ]
  [ "何美霖（1986- ），女，湖南衡阳人，博士，杭州电子科技大学讲师，主要研究方向为 NOMA、多速率编码、多用户信息论和无线通信等" ]
  [ "郑长亮（1980- ），男，河北唐山人，博士，杭州电子科技大学讲师，主要研究方向为无线通信、移动通信等" ]
- 基金信息：
  
  浙江省自然科学基金资助项目(LY22F010012);浙江省自然科学基金资助项目(LY20F050004);浙江省自然科学基金资助项目(LQ20F010007);国家自然科学基金资助项目(62101169);江苏省新型光纤技术与通信网络工程研究中心开放研究课题基金资助项目(SDGC2120);毫米波国家重点实验室开放课题基金资助项目(K202111)
- DOI：10.11959/j.issn.1000-436x.2022121
  中图分类号： TN929.5
- 网络出版日期：2022-06，
  
  纸质出版日期：2022-06-25
- 稿件说明：
移动端阅览
胡志蕊, 毕美华, 许方敏, 等. 基于APG合并及拓扑势优化的启发式用户关联策略[J]. 通信学报, 2022,43(6):98-107.

Zhirui HU, Meihua BI, Fangmin XU, et al. APG mergence and topological potential optimization based heuristic user association strategy[J]. Journal on communications, 2022, 43(6): 98-107.
胡志蕊, 毕美华, 许方敏, 等. 基于APG合并及拓扑势优化的启发式用户关联策略[J]. 通信学报, 2022,43(6):98-107. DOI： 10.11959/j.issn.1000-436x.2022121.

Zhirui HU, Meihua BI, Fangmin XU, et al. APG mergence and topological potential optimization based heuristic user association strategy[J]. Journal on communications, 2022, 43(6): 98-107. DOI： 10.11959/j.issn.1000-436x.2022121.

摘要

目的：去蜂窝网络通过接入点（AP）间协同服务网络内的用户，可突破传统蜂窝网络因密集小区间干扰造成的性能瓶颈，但需要大量的信息交互及信号处理，导致网络的可扩展性较差。为此，本文研究可提升去蜂窝网络可扩展性的用户关联策略。

方法：设计网络可扩展度作为可扩展性的衡量指标，以此为基础，利用优化理论研究提高网络可扩展度的用户关联策略。1）优化问题建模方面，首先，以节点间关联度是影响网络可扩展度的关键因素为突破点，构造表征节点间关联度的网络耦合度指标，以此建立起网络可扩展度与接入点簇（APG）间的数学关系，从而将提高网络可扩展度问题建模为最小化网络耦合度问题。然后，建立网络耦合度最小和用户速率最大的多目标优化问题，以此寻求网络可扩展度与网络服务质量的均衡。2）优化问题求解方面，为避免求解多目标优化问题的高计算复杂度，提出基于APG合并及拓扑势优化的启发式算法。所提算法通过APG合并的方式降低APG数目，并通过AP退出APG的方式降低AP所属APG的数目，从而降低网络耦合度，提高网络可扩展度。在APG合并方面，定义

</mo><mi mathvariant="script">J</mi><mo>}</mo><mo>=</mo><mn>2</mn><mrow><mo>|</mo> <mrow> <mi mathvariant="script">I</mi><mo>∩</mo><mi mathvariant="script">J</mi></mrow> <mo>|</mo></mrow><mo>/</mo><mrow><mo>(</mo> <mrow> <mrow><mo>|</mo> <mi mathvariant="script">I</mi> <mo>|</mo></mrow><mo>+</mo><mrow><mo>|</mo> <mi mathvariant="script">J</mi> <mo>|</mo></mrow></mrow> <mo>)</mo></mrow></math>

表示集合

</mo><mi mathvariant="script">J</mi></math>

间的重叠率，并将重叠率超过一定门限值的APG进行合并；在AP退出APG方面，利用拓扑势函数建立网络耦合度和用户速率的关系，以此作为AP选择退出APG的性能指标。

结果：1）问题建模的合理性方面，如图2和图5所示，网络可扩展度η与网络耦合度κ的大小成反比，因此将提高网络可扩展度问题建模为最小化网络耦合度问题是合理的，通过降低网络耦合度来提高网络可扩展度是可行的；2）启发式算法的计算复杂度方面，所提算法的计算复杂度上限为

，而直接求解优化问题的计算复杂度为

;3）网络可扩展度的理论分析方面，以图3为例，假设AP2发生变动，图3(a)中受影响的AP有12个，网络可扩展度为η

=0.51，而图3(c)中受影响的AP有4个，网络可扩展度为η

=0.79;4）网络可扩展度的仿真验证方面，如图5所示，与传统策略相比，用户速率损失4.43%时，可扩展度可提高9.59%；与文献[10

]

的策略相比，用户速率损失4.99%时，可扩展度可提高22.15%;5）所提算法中重叠率门限β

和AP所关联AP数上限N

的影响方面，如图6所示，随着β

或N

的减小，h提高，用户总速率降低。随着

的增大，β

的影响度增加，N

的影响度降低。以

</mo><mn>60</mn></math>

为例，β

=0.5和β

=0.9间h的差距由5.97%增大到14.17%，用户速率差距由47 bit/(s·Hz)增大到155 bit/(s·Hz)；而N

=20和N

=60间η的差距由1.4%减小到0.4%，用户速率差距由76 bit/(s·Hz)减小到29 bit/(s·Hz)。

结论：所提用户关联策略以较小的用户速率损失为代价，提高了去蜂窝网络的可扩展度。所提策略中重叠率门限或AP所关联AP数上限越小，则网络可扩展度提升越多，速率损失越大。

Abstract

Objective: In cell-free networks

access points (AP) collaborate to serve users. This coordination can break the performance bottleneck of traditional cellular network caused by inter-cell interference. However

it needs significant amounts information interaction and signal processing

which results in poor scalability. This paper studied the user association strategy that could improve the scalability of cell-free networks.

Methods:The network scalable degree was designed as a measure of scalability

and then a user association strategy to improve network scalable degree was studied by using optimization theory. 1) For modelling the optimization problem

firstly

the network coupling degree

representing the degree of association among nodes

was constructed to establish the mathematical relationship between the network scalable degree and AP group (APG).Thus

the problem of improving the network scalable degree was modeled as the problem of minimizing the network coupling degree.Then

a multi-objective optimization problem of minimum network coupling degree and maximum user rate was established to find the balance between network scalable degree and network service quality. 2) For solving the optimization problem

to avoid the high computational complexity

a heuristic user association strategy based on APG mergence and topological potential optimization was proposed.With the proposed algorithm

the number of APG could be reduced by APG mergence

and the number of APG that AP belongs to could be reduced by AP exiting APG. Thus

it can reduce the network coupling degree and improve the network scalable degree. For APG mergence

was defined as the overlap rate between set

</mo><mi mathvariant="script">J</mi></math>

and the APG whose overlap rate exceeds a certain threshold value would be merged. In terms of AP exiting APG

the relationship between network coupling degree and user rate was established by topological potential function

which was used as the performance index of AP exiting APG.

Results:1)For the rationality of problem modeling

Fig.2 and Fig.5 show that the network scalable degree is inversely proportional to the network coupling degree. Therefore

it is reasonable to model the problem of improving network scalable degree as minimizing network coupling degree

and it is feasible to improve network scalable degree by reducing network coupling degree.2)The upper limit of computational complexity of the proposed algorithm is

while that of directly solving the optimization problem is

.3)For theoretical analysis of the network scalable degree

take Fig.3 as an example.If AP2 changes

12 APs in Fig. 3(a)are affected and the network scalable degree is η

=0.51

while 4 APs in Fig.3(c)are affected and the network scalable degree is η

=0.79.4)Fig.5 shows the simulation results of network scalable degree.Compared with the traditi

onal strategy

the network scalable degree is improved by 9.59% with 4.43% user rate loss.Compared with the strategy in[10

]

the network scalable degree is improved by 22.15% with 4.99% user rate loss. 5) The algorithm parameters

the threshold β

of overlap rate and the upper limit number N

of AP associated

effect the performance.As shown in Fig.6

with β

or N

decreases

η increases and the total user rate decreases. With

increases

the effect of β

increases and that of N

decreases.Take

</mo><mn>60</mn></math>

as an example.The η gap between β

=0.5 and β

=0.9 increases from 5.97% to 14.17%

and the user rate gap increases from 47 bit/(s·Hz) to 155 bit/(s·Hz). The η gap between N

=20 and N

=60 decreases from 1.4% to 0.4%

and the user rate gap decreases from 76 bit/(s·Hz)to 29 bit/(s·Hz).

Conclusions: The proposed user association strategy can improve the network scalable degree of cell-free networks at the cost of less rate loss. The smaller the overlap rate threshold or the upper limit of APs associated with an AP

the more the network scalable degree increases and the greater the rate loss.

关键词

Keywords

references

NGO H Q , ASHIKHMIN A , YANG H , et al . Cell-free massive MIMO versus small cells [J ] . IEEE Transactions on Wireless Communications , 2017 , 16 ( 3 ): 1834 - 1850 .

NGUYEN L D , DUONG T Q , NGO H Q , et al . Energy efficiency in cell-free massive MIMO with zero-forcing precoding design [J ] . IEEE Communications Letters , 2017 , 21 ( 8 ): 1871 - 1874 .

CHEN Z , BJÖRNSON E , . Channel hardening and favorable propagation in cell-free massive MIMO with stochastic geometry [J ] . IEEE Transactions on Communications , 2018 , 66 ( 11 ): 5205 - 5219 .

CHEN Z , BJOERNSON E . Can we rely on channel hardening in cell-free massive MIMO? [C ] // Proceedings of 2017 IEEE Globecom Workshops . Piscataway:IEEE Press , 2017 : 1 - 6 .

YOU X H , WANG C X , HUANG J , et al . Towards 6G wireless communication networks:vision,enabling technologies,and new paradigm shifts [J ] . Science China (Information Sciences) , 2021 , 64 ( 1 ): 1 - 74 .

BUZZI S , D’ANDREA C , . Cell-free massive MIMO:user-centric approach [J ] . IEEE Wireless Communications Letters , 2017 , 6 ( 6 ): 706 - 709 .

BUZZI S , D’ANDREA C , ZAPPONE A , et al . User-centric 5G cellular networks:resource allocation and comparison with the cell-free massive MIMO approach [J ] . IEEE Transactions on Wireless Communications , 2020 , 19 ( 2 ): 1250 - 1264 .

BJÖRNSON E , SANGUINETTI L . Scalable cell-free massive MIMO systems [J ] . IEEE Transactions on Communications , 2020 , 68 ( 7 ): 4247 - 4261 .

CHEN S F , ZHANG J Y , BJÖRNSON E , , et al . Structured massive access for scalable cell-free massive MIMO systems [J ] . IEEE Journal on Selected Areas in Communications , 2021 , 39 ( 4 ): 1086 - 1100 .

INTERDONATO G , FRENGER P , LARSSON E G . Scalability aspects of cell-free massive MIMO [C ] // Proceedings of 2019 IEEE International Conference on Communications . Piscataway:IEEE Press , 2019 : 1 - 6 .

HAN R , FENG C Y , XIA H L . Optimal user association based on topological potential in heterogeneous networks [C ] // Proceedings of 2013 IEEE 24th Annual International Symposium on Personal,Indoor,and Mobile Radio Communications . Piscataway:IEEE Press , 2013 : 2409 - 2413 .

ZHANG T K , XU H Z , LIU D T , et al . User association for energy-load tradeoffs in HetNets with renewable energy supply [J ] . IEEE Communications Letters , 2015 , 19 ( 12 ): 2214 - 2217 .

浏览量

408

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

面向学位/学历证书可信管理的可扩展类PBFT算法

支持多模态网络的可扩展异构服务功能链并行编排部署系统

并行社区发现算法的可扩展性研究

软件定义网络可扩展性研究综述

基于同步点的IDS评估评分方法