Multi-population coevolutionary dynamic multi-objective particle swarm optimization algorithm for power control based on improved crowding distance archive management in CRNs

计算机科学 粒子群优化 数学优化 衬垫 惩罚法 人口 吞吐量 元启发式 算法 数学 信噪比(成像) 电信 社会学 人口学 无线
作者
Lingling Chen,Qi Li,Xiaohui Zhao,Zhiyi Fang,Furong Peng,Jiaqi Wang
出处
期刊:Computer Communications [Elsevier]
卷期号:145: 146-160 被引量:14
标识
DOI:10.1016/j.comcom.2019.06.009
摘要

This paper aims to resolve the problem of power control in underlay CRNs better. Firstly, a multi-objective optimization problem of maximizing the throughput of PUs and SUs is proposed, which satisfied the constraints of PU’ interference temperature, the normal communication quality of all users and the transmission power limitation of users. Moreover, according to the theory of penalty function and particle swarm optimization (PSO), an improved multi-objective particle swarm optimization (IMOPSO) algorithm is proposed based on the archives management, which can achieve the maximum throughput of PUs and SUs as well as the minimum penalty constraints term. On this basis, in order to improve the boundary searching ability and diversity of the power control scheme, an improved coevolutionary multi-objective particle swarm optimization (ICMOPSO) in multiple population is proposed based on crowding distance archival management. Further, in order to adapt to the dynamic communication environment well, three different dynamic response schemes are presented correspondingly to cope with the instability of three types of environment. In the end, simulation results show that ICMOPSO and IMOPSO algorithm based on the archives management can obtain the maximum throughput compared with the conventional PSO. Through comparing with the performances in IMOPSO and ICMOPSO, it can be concluded that ICMOPSO algorithm has good abilities of stability, diversity and local search ability, which can provide more throughput optimal allocation schemes for decision makers and ensure the quality of customer service. On the basis of ICMOPSO algorithm, dynamic response strategy is better than the static response strategy at computational cost compared with the average number of iterations. And it can cope with the dimensional change of decision space in dynamic communication environment.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
白枫完成签到 ,获得积分10
刚刚
chen完成签到,获得积分10
1秒前
包容猕猴桃完成签到 ,获得积分10
3秒前
yulong完成签到,获得积分10
3秒前
neurist完成签到,获得积分10
3秒前
zy0411完成签到,获得积分10
4秒前
Ray完成签到,获得积分10
5秒前
贪玩的万仇完成签到 ,获得积分10
6秒前
Duxian完成签到 ,获得积分10
13秒前
alvin完成签到,获得积分10
13秒前
天行健完成签到,获得积分10
14秒前
唐僧肉臊子面完成签到,获得积分10
14秒前
珠珠崽子完成签到 ,获得积分10
15秒前
爱听歌的大地完成签到 ,获得积分10
17秒前
SciGPT应助YOUNG-M采纳,获得10
17秒前
秋临完成签到 ,获得积分10
19秒前
22秒前
loricae2005完成签到,获得积分10
23秒前
orixero应助二狗子采纳,获得20
24秒前
顺利的慕儿完成签到,获得积分10
28秒前
阳光的幻雪完成签到 ,获得积分10
28秒前
菲菲高完成签到 ,获得积分10
29秒前
韭菜发布了新的文献求助10
32秒前
Diaory2023完成签到 ,获得积分10
34秒前
李小鑫吖完成签到,获得积分10
36秒前
37秒前
yuke发布了新的文献求助10
44秒前
46秒前
leo发布了新的文献求助10
50秒前
pforjivcn完成签到,获得积分10
50秒前
51秒前
笑点低的半青完成签到 ,获得积分10
51秒前
科研小虫完成签到 ,获得积分10
52秒前
小李完成签到,获得积分10
53秒前
舒服的幼荷完成签到,获得积分10
54秒前
小妮完成签到 ,获得积分10
56秒前
养乐多发布了新的文献求助10
57秒前
57秒前
57秒前
敬老院1号应助褚忆灵采纳,获得200
58秒前
高分求助中
One Man Talking: Selected Essays of Shao Xunmei, 1929–1939 1000
巫和雄 -《毛泽东选集》英译研究 (2013) 800
Yuwu Song, Biographical Dictionary of the People's Republic of China 700
[Lambert-Eaton syndrome without calcium channel autoantibodies] 520
The three stars each: the Astrolabes and related texts 500
Revolutions 400
Diffusion in Solids: Key Topics in Materials Science and Engineering 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2451461
求助须知:如何正确求助?哪些是违规求助? 2124472
关于积分的说明 5406003
捐赠科研通 1853334
什么是DOI,文献DOI怎么找? 921734
版权声明 562263
科研通“疑难数据库(出版商)”最低求助积分说明 493051