首页 > 最新文献

IET Communications最新文献

英文 中文
Spectrum utilization improvement for multi‐channel EH‐CRN with spectrum sensing 利用频谱感应提高多通道 EH-CRN 的频谱利用率
IF 1.6 4区 计算机科学 Q2 Computer Science Pub Date : 2024-01-18 DOI: 10.1049/cmu2.12728
Kechen Zheng, Jiahong Wang, Anping Chen, Wendi Sun, Xiaoying Liu, Jia Liu
Due to the ever‐growing applications and services of the Internet of Things (IoT), designing energy‐efficient and spectral‐efficient transmission schemes to support IoT devices for the 6G space–air–ground integrated networks becomes much more challenging. Fortunately, energy harvesting (EH) and cognitive radio (CR) technologies have been proposed to alleviate these challenges. Inspired by this fact, this paper studies the issue of spectrum reuse in terms of spectrum utilization efficiency (SUE) in the energy harvesting cognitive radio network (EH‐CRN), where multiple primary transceiver pairs, one multi‐antenna secondary transmitter (ST), and one secondary base station (SBS) coexist. To characterize the impact of small‐scale fading and improve the SUE of the EH‐CRN with perfect spectrum sensing (SS), an adaptive scheme concerning SS, channel selection, EH, and data transmission (SCED) scheme are proposed, where the ST selects the channels for SS based on the residual energy, and adjusts the duration of EH and data transmission with respect to the sensing results. Then the Markov decision process problem of SUE is formulated, which is challenging due to the infinite system space and action space. To tackle the Markov decision process problem, the system space and action space are discreted, and divide the ST into the energy‐limited case and energy‐sufficient case according to specific energy condition. Moreover, theoretical results are extended to the EH‐CRN with imperfect SS. Numerical results show that the SUE under the SCED scheme in perfect SS and imperfect SS scenarios is better than that under other schemes.
由于物联网(IoT)的应用和服务不断增长,设计高能效和高频谱效率的传输方案以支持 6G 空-空-地一体化网络中的物联网设备变得更具挑战性。幸运的是,能量收集(EH)和认知无线电(CR)技术的提出缓解了这些挑战。受此启发,本文从频谱利用效率(SUE)的角度研究了能量收集认知无线电网络(EH-CRN)中的频谱重用问题,在该网络中,多个主收发器对、一个多天线副发射器(ST)和一个副基站(SBS)共存。为了描述小尺度衰落的影响并改善具有完美频谱感知(SS)的 EH-CRN 的 SUE,提出了一种关于 SS、信道选择、EH 和数据传输(SCED)方案的自适应方案,其中 ST 根据剩余能量为 SS 选择信道,并根据感知结果调整 EH 和数据传输的持续时间。然后提出了 SUE 的马尔可夫决策过程问题,由于系统空间和行动空间的无限性,该问题具有挑战性。为了解决马尔可夫决策过程问题,对系统空间和行动空间进行了离散化处理,并根据具体的能量条件将 ST 划分为能量受限情况和能量充足情况。此外,还将理论结果扩展到具有不完美 SS 的 EH-CRN 上。数值结果表明,在完美 SS 和不完美 SS 情况下,SCED 方案的 SUE 优于其他方案。
{"title":"Spectrum utilization improvement for multi‐channel EH‐CRN with spectrum sensing","authors":"Kechen Zheng, Jiahong Wang, Anping Chen, Wendi Sun, Xiaoying Liu, Jia Liu","doi":"10.1049/cmu2.12728","DOIUrl":"https://doi.org/10.1049/cmu2.12728","url":null,"abstract":"Due to the ever‐growing applications and services of the Internet of Things (IoT), designing energy‐efficient and spectral‐efficient transmission schemes to support IoT devices for the 6G space–air–ground integrated networks becomes much more challenging. Fortunately, energy harvesting (EH) and cognitive radio (CR) technologies have been proposed to alleviate these challenges. Inspired by this fact, this paper studies the issue of spectrum reuse in terms of spectrum utilization efficiency (SUE) in the energy harvesting cognitive radio network (EH‐CRN), where multiple primary transceiver pairs, one multi‐antenna secondary transmitter (ST), and one secondary base station (SBS) coexist. To characterize the impact of small‐scale fading and improve the SUE of the EH‐CRN with perfect spectrum sensing (SS), an adaptive scheme concerning SS, channel selection, EH, and data transmission (SCED) scheme are proposed, where the ST selects the channels for SS based on the residual energy, and adjusts the duration of EH and data transmission with respect to the sensing results. Then the Markov decision process problem of SUE is formulated, which is challenging due to the infinite system space and action space. To tackle the Markov decision process problem, the system space and action space are discreted, and divide the ST into the energy‐limited case and energy‐sufficient case according to specific energy condition. Moreover, theoretical results are extended to the EH‐CRN with imperfect SS. Numerical results show that the SUE under the SCED scheme in perfect SS and imperfect SS scenarios is better than that under other schemes.","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139613873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Research on hierarchical and sub‐area network control technology of LEO giant constellation 低地轨道巨型星座分层分区网络控制技术研究
IF 1.6 4区 计算机科学 Q2 Computer Science Pub Date : 2024-01-15 DOI: 10.1049/cmu2.12725
Ci He, Yasheng Zhang, Yuejun Yu, Cong Li
The low‐earth‐orbit (LEO) telecommunication constellation network is foreseen as a merging interconnection method for future sixth‐generation (6G) systems. However, how to implement constellation system composition, consider network design constraints and envision application scenarios in a low‐orbit giant constellation system, is still an open problem. In this paper, by exploring the constellation characteristics in the future LEO systems, the design of hierarchical and sub‐area network control architecture for giant constellation is first suggested. After that, a detailed research on the partition mechanism of control domain for the giant LEO constellation systems is implemented. To make the architecture design and partition mechanism feasible, the hierarchical and domain controlling flow is also discussed. Finally, a performance verification method is present with elaborate numerical results and evaluations. The results verified the correctness and effectiveness of the proposed network control architecture and partition mechanism.
低地轨道(LEO)电信星座网络被认为是未来第六代(6G)系统的一种合并互联方式。然而,如何在低轨道巨型星座系统中实现星座系统的组成、考虑网络设计约束和设想应用场景,仍然是一个未决问题。本文通过探讨未来低地轨道系统的星座特点,首先提出了巨型星座的分层、分区域网络控制架构设计。随后,详细研究了巨型低地轨道星座系统的控制域划分机制。为了使架构设计和分区机制切实可行,还讨论了分层和分域控制流程。最后,提出了一种性能验证方法,并给出了详细的数值结果和评估。结果验证了所提出的网络控制架构和分区机制的正确性和有效性。
{"title":"Research on hierarchical and sub‐area network control technology of LEO giant constellation","authors":"Ci He, Yasheng Zhang, Yuejun Yu, Cong Li","doi":"10.1049/cmu2.12725","DOIUrl":"https://doi.org/10.1049/cmu2.12725","url":null,"abstract":"The low‐earth‐orbit (LEO) telecommunication constellation network is foreseen as a merging interconnection method for future sixth‐generation (6G) systems. However, how to implement constellation system composition, consider network design constraints and envision application scenarios in a low‐orbit giant constellation system, is still an open problem. In this paper, by exploring the constellation characteristics in the future LEO systems, the design of hierarchical and sub‐area network control architecture for giant constellation is first suggested. After that, a detailed research on the partition mechanism of control domain for the giant LEO constellation systems is implemented. To make the architecture design and partition mechanism feasible, the hierarchical and domain controlling flow is also discussed. Finally, a performance verification method is present with elaborate numerical results and evaluations. The results verified the correctness and effectiveness of the proposed network control architecture and partition mechanism.","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139623032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Error analysis for face coded modulation system 面编码调制系统的误差分析
IF 1.6 4区 计算机科学 Q2 Computer Science Pub Date : 2024-01-15 DOI: 10.1049/cmu2.12727
Peter O. Akuon

This paper discusses a new mapping scheme known as face coded modulation (FCM) system. In FCM, peak energy symbols are mapped onto an innermost ring according to the eight sockets in the human face, that is, brain, mouth, nostrils, eyes and ears. For example, FCM is formed when the constellation diagram from M-ary quadrature amplitude modulation (MQAM) system is modified to reduce peak-to-average power ratio (PAPR) by relocating the four corner symbols of the MQAM, with peak energy, to the innermost ring in a way that forms the figure of a cross. Unlike APSK, FCM mapping introduces non-uniform sequence of symbols on the ring, face width factor and multiple modulator circuits that can be used to lower power requirements for high power amplifiers (HPA) as used in MQAM transmission systems. Symbol error rate (SER) for FCM is calculated and the results compared with MQAM and MPSK. It is shown that at equal energy efficiency, FCM scheme has a better response to errors than both MPSK and MQAM and a better energy efficiency due to lowered PAPR than MQAM. Moreover, the simulation results exhibit a tight match for the proposed analytical framework when assessed under Additive White Gaussian Noise (AWGN) channel.

本文讨论了一种新的映射方案,即人脸编码调制(FCM)系统。在 FCM 中,峰值能量符号根据人脸的八个部位(即大脑、嘴巴、鼻孔、眼睛和耳朵)映射到最内层的环上。例如,为了降低峰均功率比(PAPR),对 M-ary quadrature amplitude modulation(MQAM)系统的星座图进行了修改,将 MQAM 中具有峰值能量的四个角符号以形成十字形的方式移至最内环,从而形成了 FCM。与 APSK 不同,FCM 映射引入了环上不均匀的符号序列、面宽系数和多调制器电路,可用于降低 MQAM 传输系统中使用的高功率放大器(HPA)的功率要求。计算了 FCM 的符号错误率(SER),并将结果与 MQAM 和 MPSK 进行了比较。结果表明,在能效相同的情况下,FCM 方案对错误的响应比 MPSK 和 MQAM 都要好,而且由于降低了 PAPR,能效也比 MQAM 高。此外,在加性白高斯噪声(AWGN)信道下进行评估时,仿真结果显示与所提出的分析框架非常吻合。
{"title":"Error analysis for face coded modulation system","authors":"Peter O. Akuon","doi":"10.1049/cmu2.12727","DOIUrl":"10.1049/cmu2.12727","url":null,"abstract":"<p>This paper discusses a new mapping scheme known as face coded modulation (FCM) system. In FCM, peak energy symbols are mapped onto an innermost ring according to the eight sockets in the human face, that is, brain, mouth, nostrils, eyes and ears. For example, FCM is formed when the constellation diagram from <i>M</i>-ary quadrature amplitude modulation (<i>M</i>QAM) system is modified to reduce peak-to-average power ratio (PAPR) by relocating the four corner symbols of the <i>M</i>QAM, with peak energy, to the innermost ring in a way that forms the figure of a cross. Unlike APSK, FCM mapping introduces non-uniform sequence of symbols on the ring, face width factor and multiple modulator circuits that can be used to lower power requirements for high power amplifiers (HPA) as used in <i>M</i>QAM transmission systems. Symbol error rate (SER) for FCM is calculated and the results compared with <i>M</i>QAM and <i>M</i>PSK. It is shown that at equal energy efficiency, FCM scheme has a better response to errors than both <i>M</i>PSK and <i>M</i>QAM and a better energy efficiency due to lowered PAPR than <i>M</i>QAM. Moreover, the simulation results exhibit a tight match for the proposed analytical framework when assessed under Additive White Gaussian Noise (AWGN) channel.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12727","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139529955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Three‐dimensional geometry‐based channel modeling and simulations for reconfigurable intelligent surface‐assisted uav‐to‐ground MIMO communications 基于三维几何的信道建模与仿真,用于可重构智能地表辅助飞行器对地多输入多输出通信
IF 1.6 4区 计算机科学 Q2 Computer Science Pub Date : 2024-01-11 DOI: 10.1049/cmu2.12724
Muyan Wang, Xiao Chen, Sicheng Wang, Wangqi Shi
Consisting of a large number of passive reflectors, reconfigurable intelligent surface (RIS) has gained traction as an approach to enhance communication quality. The specular reflection assumption is common when ideal conditions are considered. In this paper, an anomalous‐reflector model was found for each RIS reflection unit, deviating from the specular reflector assumption, and the impacts of the aperture area and radiation pattern of the RIS reflecting elements are taken into account. A three‐dimensional (3D) geometry‐based RIS‐assisted channel model is proposed for stochastic multiple‐input multiple‐output (MIMO) unmanned aerial vehicle (UAV)‐to‐ground communications. The RIS is deployed on an additional UAV in the proposed model, which assists the UAV transmitter for reflecting its own signals to the mobile receiver (MR) on the ground level, thereby boosting the quality of signal transmission. In order to achieve a perfect beam alignment towards the desired direction, the reflection phase is regulated by considering the propagation distances among UAV, RIS, and MR.
可重构智能表面(RIS)由大量无源反射器组成,作为一种提高通信质量的方法,它已获得广泛关注。在理想条件下,镜面反射假设很常见。本文偏离镜面反射假设,为每个 RIS 反射单元找到了异常反射模型,并考虑了 RIS 反射元件的孔径面积和辐射模式的影响。针对随机多输入多输出(MIMO)无人飞行器(UAV)-地面通信,提出了一种基于三维(3D)几何的 RIS 辅助信道模型。在所提出的模型中,RIS 被部署在额外的无人飞行器上,协助无人飞行器发射器将自身信号反射到地面上的移动接收器(MR),从而提高信号传输质量。为了使波束完美地对准所需的方向,需要考虑无人机、RIS 和 MR 之间的传播距离来调节反射相位。
{"title":"Three‐dimensional geometry‐based channel modeling and simulations for reconfigurable intelligent surface‐assisted uav‐to‐ground MIMO communications","authors":"Muyan Wang, Xiao Chen, Sicheng Wang, Wangqi Shi","doi":"10.1049/cmu2.12724","DOIUrl":"https://doi.org/10.1049/cmu2.12724","url":null,"abstract":"Consisting of a large number of passive reflectors, reconfigurable intelligent surface (RIS) has gained traction as an approach to enhance communication quality. The specular reflection assumption is common when ideal conditions are considered. In this paper, an anomalous‐reflector model was found for each RIS reflection unit, deviating from the specular reflector assumption, and the impacts of the aperture area and radiation pattern of the RIS reflecting elements are taken into account. A three‐dimensional (3D) geometry‐based RIS‐assisted channel model is proposed for stochastic multiple‐input multiple‐output (MIMO) unmanned aerial vehicle (UAV)‐to‐ground communications. The RIS is deployed on an additional UAV in the proposed model, which assists the UAV transmitter for reflecting its own signals to the mobile receiver (MR) on the ground level, thereby boosting the quality of signal transmission. In order to achieve a perfect beam alignment towards the desired direction, the reflection phase is regulated by considering the propagation distances among UAV, RIS, and MR.","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139626007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
PageRank talent mining algorithm of power system based on cognitive load and DPCNN 基于认知负荷和 DPCNN 的电力系统 PageRank 人才挖掘算法
IF 1.6 4区 计算机科学 Q2 Computer Science Pub Date : 2024-01-11 DOI: 10.1049/cmu2.12721
Kan Feng, Changliang Yang, Wenqiang Zhu, Kun Li, Ya Chen

PageRank talent mining in power system is an effective means for enterprises to recruit talents, which can correctly recommend talents in practical applications. At present, the mining evaluation index system is not perfect, and the consistency coefficient between the evaluation results and the actual situation is low in practical applications. Therefore, PageRank talent mining algorithm in power system based on cognitive load and dilated convolutional neural network (DPCNN) is proposed. The cognitive load and DPCNN are used to establish a talent capability evaluation system, calculate the index weight value, construct the PageRank talent capability evaluation model of the power system according to the corresponding weight of the index, determine the membership range of the index, calculate the comprehensive score of the appraiser's ability, and determine the ability level of the appraiser, thus realizing the PageRank talent mining algorithm of the power system. The experimental results show that the algorithm has high accuracy and objectivity, good encryption effect, cannot crack the attack node, the prediction error and the prediction relative error are closest to the standard value, the maximum error is 0.51, the maximum relative error is 0.82, and can achieve the accurate prediction of talent demand.

电力系统 PageRank 人才挖掘是企业招聘人才的有效手段,在实际应用中能够正确推荐人才。目前,挖掘评价指标体系并不完善,在实际应用中评价结果与实际情况的一致性系数较低。因此,提出了基于认知负荷和扩张卷积神经网络(DPCNN)的电力系统 PageRank 人才挖掘算法。利用认知负荷和 DPCNN 建立人才能力评价体系,计算指标权重值,根据指标对应的权重构建电力系统 PageRank 人才能力评价模型,确定指标的成员范围,计算评价者的能力综合得分,确定评价者的能力水平,从而实现电力系统 PageRank 人才挖掘算法。实验结果表明,该算法准确性和客观性高,加密效果好,无法破解攻击节点,预测误差和预测相对误差最接近标准值,最大误差为0.51,最大相对误差为0.82,能够实现对人才需求的准确预测。
{"title":"PageRank talent mining algorithm of power system based on cognitive load and DPCNN","authors":"Kan Feng,&nbsp;Changliang Yang,&nbsp;Wenqiang Zhu,&nbsp;Kun Li,&nbsp;Ya Chen","doi":"10.1049/cmu2.12721","DOIUrl":"10.1049/cmu2.12721","url":null,"abstract":"<p>PageRank talent mining in power system is an effective means for enterprises to recruit talents, which can correctly recommend talents in practical applications. At present, the mining evaluation index system is not perfect, and the consistency coefficient between the evaluation results and the actual situation is low in practical applications. Therefore, PageRank talent mining algorithm in power system based on cognitive load and dilated convolutional neural network (DPCNN) is proposed. The cognitive load and DPCNN are used to establish a talent capability evaluation system, calculate the index weight value, construct the PageRank talent capability evaluation model of the power system according to the corresponding weight of the index, determine the membership range of the index, calculate the comprehensive score of the appraiser's ability, and determine the ability level of the appraiser, thus realizing the PageRank talent mining algorithm of the power system. The experimental results show that the algorithm has high accuracy and objectivity, good encryption effect, cannot crack the attack node, the prediction error and the prediction relative error are closest to the standard value, the maximum error is 0.51, the maximum relative error is 0.82, and can achieve the accurate prediction of talent demand.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12721","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139625492","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bat algorithm based semi-distributed resource allocation in ultra-dense networks 超密集网络中基于蝙蝠算法的半分布式资源分配
IF 1.6 4区 计算机科学 Q2 Computer Science Pub Date : 2024-01-09 DOI: 10.1049/cmu2.12720
Yaozong Fan, Yu Ma, Peng Pan, Can Yang

This paper addresses the resource allocation (RA) for ultra-dense network (UDN), where base stations (BSs) are densely deployed to meet the demands of future wireless communications. However, the design of RA in UDN is challenging, as the RA problem is non-convex and NP-hard. Therefore, this paper considers and studies a semi-distributed resource block (RB) allocation scheme, in order to achieve a well-balanced trade-off between performance and complexity. In the context of semi-distributed RB allocation scheme, the problem can be decomposed into the subproblem of clustering and the subproblem of cluster-based RB allocation. We first improve the K-means clustering algorithm by employing the Gaussian modified method, which can significantly decrease the number of iterations for carrying out the K-means algorithm as well as the failure possibility of clustering. Then, bat algorithm (BA) is introduced to attack the problem of cluster-based RB allocation. In order to make the original BA applicable to the problem of RB allocation, chaotic sequences are adopted to discretize the initial position of the bats, and simultaneously increase the population diversity of the bats. Furthermore, in order to speed up the convergence of BA, the logarithmic decreasing inertia weight is employed for improving the original BA. Our studies and performance results show that the proposed approaches are capable of achieving a desirable trade-off between the performance and the implementation complexity.

本文探讨了超密集网络(UDN)的资源分配(RA)问题,在这种网络中,基站(BS)被密集部署,以满足未来无线通信的需求。然而,UDN 中的 RA 设计具有挑战性,因为 RA 问题是非凸和 NP 难的。因此,本文考虑并研究了一种半分布式资源块(RB)分配方案,以实现性能与复杂性之间的平衡。在半分布式 RB 分配方案中,问题可分解为聚类子问题和基于聚类的 RB 分配子问题。我们首先采用高斯修正法改进了 K-means 聚类算法,从而大大减少了 K-means 算法的迭代次数以及聚类失败的可能性。然后,引入蝙蝠算法(BA)来解决基于聚类的 RB 分配问题。为了使原有的蝙蝠算法适用于 RB 分配问题,采用了混沌序列来离散化蝙蝠的初始位置,同时增加了蝙蝠种群的多样性。此外,为了加快 BA 的收敛速度,还采用了对数递减惯性权重来改进原始 BA。我们的研究和性能结果表明,所提出的方法能够在性能和实施复杂度之间实现理想的权衡。
{"title":"Bat algorithm based semi-distributed resource allocation in ultra-dense networks","authors":"Yaozong Fan,&nbsp;Yu Ma,&nbsp;Peng Pan,&nbsp;Can Yang","doi":"10.1049/cmu2.12720","DOIUrl":"10.1049/cmu2.12720","url":null,"abstract":"<p>This paper addresses the resource allocation (RA) for ultra-dense network (UDN), where base stations (BSs) are densely deployed to meet the demands of future wireless communications. However, the design of RA in UDN is challenging, as the RA problem is non-convex and NP-hard. Therefore, this paper considers and studies a semi-distributed resource block (RB) allocation scheme, in order to achieve a well-balanced trade-off between performance and complexity. In the context of semi-distributed RB allocation scheme, the problem can be decomposed into the subproblem of clustering and the subproblem of cluster-based RB allocation. We first improve the K-means clustering algorithm by employing the Gaussian modified method, which can significantly decrease the number of iterations for carrying out the K-means algorithm as well as the failure possibility of clustering. Then, bat algorithm (BA) is introduced to attack the problem of cluster-based RB allocation. In order to make the original BA applicable to the problem of RB allocation, chaotic sequences are adopted to discretize the initial position of the bats, and simultaneously increase the population diversity of the bats. Furthermore, in order to speed up the convergence of BA, the logarithmic decreasing inertia weight is employed for improving the original BA. Our studies and performance results show that the proposed approaches are capable of achieving a desirable trade-off between the performance and the implementation complexity.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12720","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139442137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Chunk2vec: A novel resemblance detection scheme based on Sentence-BERT for post-deduplication delta compression in network transmission Chunk2vec:基于句子ERT的新型相似性检测方案,用于网络传输中的重复后三角压缩
IF 1.6 4区 计算机科学 Q2 Computer Science Pub Date : 2024-01-04 DOI: 10.1049/cmu2.12719
Chunzhi Wang, Keguan Wang, Min Li, Feifei Wei, Neal Xiong

Delta compression, as a complementary technique for data deduplication, has gained widespread attention in network storage systems. It can eliminate redundant data between non-duplicate but similar chunks that cannot be identified by data deduplication. The network transmission overhead between servers and clients can be greatly reduced by using data deduplication and delta compression techniques. Resemblance detection is a technique that identifies similar chunks for post-deduplication delta compression in network storage systems. The existing resemblance detection approaches fail to detect similar chunks with arbitrary similarity by setting a similarity threshold, which can be suboptimal. In this paper, the authors propose Chunk2vec, a resemblance detection scheme for delta compression that utilizes deep learning techniques and Approximate Nearest Neighbour Search technique to detect similar chunks with any given similarity range. Chunk2vec uses a deep neural network, Sentence-BERT, to extract an approximate feature vector for each chunk while preserving its similarity with other chunks. The experimental results on five real-world datasets indicate that Chunk2vec improves the accuracy of resemblance detection for delta compression and achieves higher compression ratio than the state-of-the-art resemblance detection technique.

三角压缩作为重复数据删除的补充技术,在网络存储系统中得到了广泛关注。它可以消除重复数据删除无法识别的非重复但相似的数据块之间的冗余数据。通过使用重复数据删除和 delta 压缩技术,可以大大减少服务器和客户端之间的网络传输开销。相似性检测是一种在网络存储系统中为重复数据删除后的 delta 压缩识别相似数据块的技术。现有的相似性检测方法无法通过设置相似性阈值来检测任意相似性的相似块,这可能是次优的。在本文中,作者提出了用于 delta 压缩的相似性检测方案 Chunk2vec,该方案利用深度学习技术和近似近邻搜索技术来检测任意给定相似性范围内的相似块。Chunk2vec 利用深度神经网络 Sentence-BERT 为每个语块提取近似特征向量,同时保留其与其他语块的相似性。在五个真实世界数据集上的实验结果表明,Chunk2vec 提高了 delta 压缩相似性检测的准确性,并实现了比最先进的相似性检测技术更高的压缩率。
{"title":"Chunk2vec: A novel resemblance detection scheme based on Sentence-BERT for post-deduplication delta compression in network transmission","authors":"Chunzhi Wang,&nbsp;Keguan Wang,&nbsp;Min Li,&nbsp;Feifei Wei,&nbsp;Neal Xiong","doi":"10.1049/cmu2.12719","DOIUrl":"10.1049/cmu2.12719","url":null,"abstract":"<p>Delta compression, as a complementary technique for data deduplication, has gained widespread attention in network storage systems. It can eliminate redundant data between non-duplicate but similar chunks that cannot be identified by data deduplication. The network transmission overhead between servers and clients can be greatly reduced by using data deduplication and delta compression techniques. Resemblance detection is a technique that identifies similar chunks for post-deduplication delta compression in network storage systems. The existing resemblance detection approaches fail to detect similar chunks with arbitrary similarity by setting a similarity threshold, which can be suboptimal. In this paper, the authors propose <i>Chunk2vec</i>, a resemblance detection scheme for delta compression that utilizes deep learning techniques and Approximate Nearest Neighbour Search technique to detect similar chunks with any given similarity range. Chunk2vec uses a deep neural network, Sentence-BERT, to extract an approximate feature vector for each chunk while preserving its similarity with other chunks. The experimental results on five real-world datasets indicate that Chunk2vec improves the accuracy of resemblance detection for delta compression and achieves higher compression ratio than the state-of-the-art resemblance detection technique.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12719","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139386613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the design of cost minimization for D2D-enabled wireless caching networks: A joint recommendation, caching, and routing perspective 论启用 D2D 的无线缓存网络的成本最小化设计:联合推荐、缓存和路由的视角
IF 1.6 4区 计算机科学 Q2 Computer Science Pub Date : 2024-01-03 DOI: 10.1049/cmu2.12716
Yu Hua, Yaru Fu, Qi Zhu

Cache-enabled device-to-device (D2D) network has been deemed as an effective technique to offload the data traffic. However, the gain of the caching schemes is closely related to the homogeneity among users' preference distribution. To tackle this issue, recommendation is a promising proactive approach. It increases the request probability of recommended contents, reshaping users' contents demand patterns, and improving caching performance. Moreover, considering the heterogeneous network settings, i.e. content retrieval costs vary, the routing design becomes a non-negligible factor on caching performance optimization. On these grounds, the average system cost of D2D-enabled wireless caching networks with multiple BSs is first described. Then the routing strategies are designed together with caching and recommendation policies by minimizing the average cost of these networks. The optimization problem is proven as NP-hard. To facilitate the analysis, the original problem is decoupled into two sub-problems and solve them respectively. Afterwards, all the variables are optimized in an alternating manner until the convergence is achieved. The proposed algorithm's convergence performance and benefits over benchmark strategies in terms of total cost and cache hit ratio are supported by Monte-Carlo simulation results.

支持缓存的设备到设备(D2D)网络被认为是卸载数据流量的有效技术。然而,缓存方案的收益与用户偏好分布的一致性密切相关。为了解决这个问题,推荐是一种很有前途的主动方法。它能提高被推荐内容的请求概率,重塑用户的内容需求模式,提高缓存性能。此外,考虑到异构网络设置(即内容检索成本各不相同),路由设计成为优化缓存性能的一个不可忽视的因素。在此基础上,首先描述了具有多个 BS 的 D2D 无线高速缓存网络的平均系统成本。然后,通过最小化这些网络的平均成本,设计路由策略以及缓存和推荐策略。优化问题被证明为 NP 难。为便于分析,将原问题分解为两个子问题并分别求解。然后,交替优化所有变量,直至达到收敛。蒙特卡洛模拟结果证明了所提算法的收敛性能,以及在总成本和缓存命中率方面优于基准策略的优势。
{"title":"On the design of cost minimization for D2D-enabled wireless caching networks: A joint recommendation, caching, and routing perspective","authors":"Yu Hua,&nbsp;Yaru Fu,&nbsp;Qi Zhu","doi":"10.1049/cmu2.12716","DOIUrl":"10.1049/cmu2.12716","url":null,"abstract":"<p>Cache-enabled device-to-device (D2D) network has been deemed as an effective technique to offload the data traffic. However, the gain of the caching schemes is closely related to the homogeneity among users' preference distribution. To tackle this issue, recommendation is a promising proactive approach. It increases the request probability of recommended contents, reshaping users' contents demand patterns, and improving caching performance. Moreover, considering the heterogeneous network settings, i.e. content retrieval costs vary, the routing design becomes a non-negligible factor on caching performance optimization. On these grounds, the average system cost of D2D-enabled wireless caching networks with multiple BSs is first described. Then the routing strategies are designed together with caching and recommendation policies by minimizing the average cost of these networks. The optimization problem is proven as NP-hard. To facilitate the analysis, the original problem is decoupled into two sub-problems and solve them respectively. Afterwards, all the variables are optimized in an alternating manner until the convergence is achieved. The proposed algorithm's convergence performance and benefits over benchmark strategies in terms of total cost and cache hit ratio are supported by Monte-Carlo simulation results.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12716","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139389588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Segmentation-enhanced gamma spectrum denoising based on deep learning 基于深度学习的分割增强型伽马频谱去噪
IF 1.6 4区 计算机科学 Q2 Computer Science Pub Date : 2024-01-02 DOI: 10.1049/cmu2.12706
Xiangqun Lu, Hongzhi Zheng, Yaqiong Liu, Hongxing Li, Qingyun Zhou, Tao Li, Hongguang Yang

Gamma spectrum denoising can reduce the adverse effects of statistical fluctuations of radioactivity, gamma ray scattering, and electronic noise on the measured gamma spectrum. Traditional denoising methods are intricate and require analytical expertise in gamma spectrum analysis. This paper proposes a segmentation-enhanced Convolutional Neural Network-Stacked Denoising Autoencoder (CNN-SDAE) method based on convolutional feature extraction network and stacked denoising autoencoder to achieve gamma spectrum denoising, which adopts the idea of data segmentation to enhance the learning ability of the neural network. By dividing the complete gamma spectrum into multiple segments and then using the segmentation-enhanced CNN-SDAE method for denoising, the method can achieve adaptive denoising without manually setting the threshold. The experimental results show that our method can effectively achieve gamma spectrum denoising while retaining the characteristics of the gamma spectrum. Compared with traditional methods, the denoising speed and effectiveness have been significantly improved, and the proposed method demonstrates an approximately 1.72-fold enhancement in smoothing performance than the empirical mode decomposition method. Furthermore, in terms of retaining gamma spectrum characteristics, it also achieves a performance improvement of approximately three orders of magnitude than the wavelet method.

伽马能谱去噪可以减少放射性统计波动、伽马射线散射和电子噪声对测量伽马能谱的不利影响。传统的去噪方法非常复杂,需要伽马能谱分析方面的专业知识。本文提出了一种基于卷积特征提取网络和堆叠去噪自动编码器的分段增强型卷积神经网络-堆叠去噪自动编码器(CNN-SDAE)方法来实现伽马能谱去噪,该方法采用数据分段的思想来增强神经网络的学习能力。通过将完整的伽马频谱分割成多个片段,然后使用分割增强的 CNN-SDAE 方法进行去噪,该方法无需手动设置阈值即可实现自适应去噪。实验结果表明,我们的方法能有效地实现伽马频谱去噪,同时保留了伽马频谱的特性。与传统方法相比,该方法的去噪速度和效果都有显著提高,其平滑性能比经验模式分解法提高了约 1.72 倍。此外,在保留伽马频谱特征方面,它也比小波方法提高了约三个数量级。
{"title":"Segmentation-enhanced gamma spectrum denoising based on deep learning","authors":"Xiangqun Lu,&nbsp;Hongzhi Zheng,&nbsp;Yaqiong Liu,&nbsp;Hongxing Li,&nbsp;Qingyun Zhou,&nbsp;Tao Li,&nbsp;Hongguang Yang","doi":"10.1049/cmu2.12706","DOIUrl":"10.1049/cmu2.12706","url":null,"abstract":"<p>Gamma spectrum denoising can reduce the adverse effects of statistical fluctuations of radioactivity, gamma ray scattering, and electronic noise on the measured gamma spectrum. Traditional denoising methods are intricate and require analytical expertise in gamma spectrum analysis. This paper proposes a segmentation-enhanced Convolutional Neural Network-Stacked Denoising Autoencoder (CNN-SDAE) method based on convolutional feature extraction network and stacked denoising autoencoder to achieve gamma spectrum denoising, which adopts the idea of data segmentation to enhance the learning ability of the neural network. By dividing the complete gamma spectrum into multiple segments and then using the segmentation-enhanced CNN-SDAE method for denoising, the method can achieve adaptive denoising without manually setting the threshold. The experimental results show that our method can effectively achieve gamma spectrum denoising while retaining the characteristics of the gamma spectrum. Compared with traditional methods, the denoising speed and effectiveness have been significantly improved, and the proposed method demonstrates an approximately 1.72-fold enhancement in smoothing performance than the empirical mode decomposition method. Furthermore, in terms of retaining gamma spectrum characteristics, it also achieves a performance improvement of approximately three orders of magnitude than the wavelet method.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12706","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139390351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Whale optimization-based PTS scheme for PAPR reduction in UFMC systems 基于鲸鱼优化的 PTS 方案,用于降低 UFMC 系统的 PAPR
IF 1.6 4区 计算机科学 Q2 Computer Science Pub Date : 2024-01-02 DOI: 10.1049/cmu2.12708
Esmot Ara Tuli, Rubina Akter, Jae Min Lee, Dong-Seong Kim

This paper proposes a whale optimization algorithm (WOA)-based partial transmit sequence (PTS) scheme called WOA-PTS to reduce the high peak-to-average power ratio (PAPR) for universal filtered multi-carrier (UFMC) systems. High PAPR is a prevalent challenge encountered in multi-carrier systems. In the conventional PTS technique, the optimization of phase rotation factors is achieved through multiplication with the sub-blocks. In this undertaking, WOA optimization is integrated as a phase optimizer in the PTS-based PAPR reduction scheme. The experimental results show that, when compared with PTS-based UFMC signal, the UFMC signal with WOA-PTS can achieve 4.15 dB PAPR reduction at the complementary cumulative distribution function value of 10−3, additionally power spectral density performance and bit error rate also improved.

本文提出了一种基于鲸鱼优化算法(WOA)的部分发送序列(PTS)方案,称为 WOA-PTS,以降低通用滤波多载波(UFMC)系统的高峰值-平均功率比(PAPR)。高 PAPR 是多载波系统普遍面临的挑战。在传统的 PTS 技术中,相位旋转因子的优化是通过与子块相乘来实现的。在这项工作中,WOA 优化作为相位优化器被集成到基于 PTS 的 PAPR 降低方案中。实验结果表明,与基于 PTS 技术的 UFMC 信号相比,采用 WOA-PTS 技术的 UFMC 信号在互补累积分布函数值为 10-3 时,PAPR 降低了 4.15 dB,功率谱密度性能和误码率也得到了改善。
{"title":"Whale optimization-based PTS scheme for PAPR reduction in UFMC systems","authors":"Esmot Ara Tuli,&nbsp;Rubina Akter,&nbsp;Jae Min Lee,&nbsp;Dong-Seong Kim","doi":"10.1049/cmu2.12708","DOIUrl":"10.1049/cmu2.12708","url":null,"abstract":"<p>This paper proposes a whale optimization algorithm (WOA)-based partial transmit sequence (PTS) scheme called WOA-PTS to reduce the high peak-to-average power ratio (PAPR) for universal filtered multi-carrier (UFMC) systems. High PAPR is a prevalent challenge encountered in multi-carrier systems. In the conventional PTS technique, the optimization of phase rotation factors is achieved through multiplication with the sub-blocks. In this undertaking, WOA optimization is integrated as a phase optimizer in the PTS-based PAPR reduction scheme. The experimental results show that, when compared with PTS-based UFMC signal, the UFMC signal with WOA-PTS can achieve 4.15 dB PAPR reduction at the complementary cumulative distribution function value of 10<sup>−3</sup>, additionally power spectral density performance and bit error rate also improved.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12708","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139452792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
IET Communications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1