首页 > 最新文献

IET Communications最新文献

英文 中文
Keywords Extraction Technology for Few-Shot Learning in Customer Service 客户服务中少镜头学习的提取技术
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2025-05-22 DOI: 10.1049/cmu2.70049
Xiaol Ma, Bangxing Yang, Dequan Du, RuQiang Zhao, Congjian Deng

Customer service primarily involves interaction with clients through phone calls. Precise keyword extraction from customer complaint texts facilitates the implementation of intelligent task assignment and efficient response systems. However, existing keyword extraction technologies perform sub-optimally in the customer service domain of telecommunications operators and require substantial manual word segmentation. Given the pronounced clustering of customer service data, this research introduces a synonym matching approach and a few-shot learning-based method tailored for extracting keywords in this sector. This enables model training with minimal labelled data and computational resources. Using a dataset generated from the transcription of customer service calls, the proposed model demonstrates a 24.94% improvement in accuracy compared to popular existing methods.

客户服务主要包括通过电话与客户互动。从客户投诉文本中精确提取关键字有助于实现智能任务分配和高效响应系统。然而,现有的关键字提取技术在电信运营商的客户服务领域表现不佳,并且需要大量的人工分词。鉴于客户服务数据的明显聚类,本研究引入了一种同义词匹配方法和一种基于少量学习的方法,用于该领域的关键词提取。这使得模型训练与最小的标记数据和计算资源。使用由客户服务电话转录生成的数据集,与流行的现有方法相比,所提出的模型的准确性提高了24.94%。
{"title":"Keywords Extraction Technology for Few-Shot Learning in Customer Service","authors":"Xiaol Ma,&nbsp;Bangxing Yang,&nbsp;Dequan Du,&nbsp;RuQiang Zhao,&nbsp;Congjian Deng","doi":"10.1049/cmu2.70049","DOIUrl":"10.1049/cmu2.70049","url":null,"abstract":"<p>Customer service primarily involves interaction with clients through phone calls. Precise keyword extraction from customer complaint texts facilitates the implementation of intelligent task assignment and efficient response systems. However, existing keyword extraction technologies perform sub-optimally in the customer service domain of telecommunications operators and require substantial manual word segmentation. Given the pronounced clustering of customer service data, this research introduces a synonym matching approach and a few-shot learning-based method tailored for extracting keywords in this sector. This enables model training with minimal labelled data and computational resources. Using a dataset generated from the transcription of customer service calls, the proposed model demonstrates a 24.94% improvement in accuracy compared to popular existing methods.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70049","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144108961","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
Relay-Assisted Communications Over Multi-Cluster Fluctuating Two-Ray Faded Channels 多簇波动双射线衰落信道中继辅助通信
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2025-05-20 DOI: 10.1049/cmu2.70050
Haider Mehdi, Zakir Hussain, Syed Muhammad Atif Saleem, Syed Areeb Ahmed

In this paper, a decode-and-forward relay-assisted device-to-device (D2D) network is examined over novel multi-cluster fluctuating two-ray (MFTR) fading channels. All communication links are functioning in terahertz (THz) conditions. Co-channel interference (CCI) is considered as well. We assume an eavesdropper is also present near the receiver and overhears the relay's signal. With the help of characteristic functions, expressions of outage, success probability, capacity with outage, secrecy outage, probability of strictly positive secrecy capacity and intercept probability are presented. These expressions are functions of MFTR fading conditions, THz channel parameters and distances between various nodes in the system. Numerical results based on the derived expressions are discussed under various scenarios.

本文研究了一种基于多簇波动双射线衰落信道的中继辅助设备对设备(D2D)网络。所有通信链路都在太赫兹(THz)条件下工作。同时还考虑了同信道干扰(CCI)。我们假设在接收器附近也有窃听者,窃听到中继器的信号。借助特征函数,给出了中断、成功概率、中断容量、保密中断、严格正保密容量概率和拦截概率的表达式。这些表达式是MFTR衰落条件、太赫兹信道参数和系统各节点之间距离的函数。文中讨论了各种情况下的数值结果。
{"title":"Relay-Assisted Communications Over Multi-Cluster Fluctuating Two-Ray Faded Channels","authors":"Haider Mehdi,&nbsp;Zakir Hussain,&nbsp;Syed Muhammad Atif Saleem,&nbsp;Syed Areeb Ahmed","doi":"10.1049/cmu2.70050","DOIUrl":"10.1049/cmu2.70050","url":null,"abstract":"<p>In this paper, a decode-and-forward relay-assisted device-to-device (D2D) network is examined over novel multi-cluster fluctuating two-ray (MFTR) fading channels. All communication links are functioning in terahertz (THz) conditions. Co-channel interference (CCI) is considered as well. We assume an eavesdropper is also present near the receiver and overhears the relay's signal. With the help of characteristic functions, expressions of outage, success probability, capacity with outage, secrecy outage, probability of strictly positive secrecy capacity and intercept probability are presented. These expressions are functions of MFTR fading conditions, THz channel parameters and distances between various nodes in the system. Numerical results based on the derived expressions are discussed under various scenarios.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70050","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144091774","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
A DRL-Based Algorithm for DNN Partition, Subtask Offloading and Resource Allocation in Multi-Hop Computing Nodes with Cloud 基于drl的多跳云计算节点DNN分区、子任务卸载和资源分配算法
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2025-05-20 DOI: 10.1049/cmu2.70048
Ruiyu Yang, Zhili Wang, Yang Yang, Sining Wang

Nowadays, deep neural network (DNN) partition is an effective strategy to accelerate deep learning (DL) tasks. A pioneering technology, computing and network convergence (CNC), integrates dispersed computing resources and bandwidth via the network control plane to utilize them efficiently. This paper presents a novel network-cloud (NC) architecture designed for DL task inference in CNC scenario, where network devices directly participate in computation, thereby reducing extra transmission costs. Considering multi-hop computing-capable network nodes and one cloud node in a chain path, leveraging deep reinforcement learning (DRL), we develop a joint-optimization algorithm for DNN partition, subtask offloading and computing resource allocation based on deep Q network (DQN), referred to as POADQ, which invokes a subtask offloading and computing resource allocation (SORA) algorithm with low complexity, to minimize delay. DQN searches the optimal DNN partition point, and SORA identifies the next optimal offloading node for next subtask through our proposed NONPRA (next optimal node prediction with resource allocation) method, which selects the node that exhibits the smallest predicted increase in cost. We conduct some experiments and compare POADQ with other schemes. The results show that our proposed algorithm is superior to other algorithms in reducing the average delay of subtasks.

目前,深度神经网络(DNN)划分是加速深度学习(DL)任务的有效策略。计算与网络融合(computing and network convergence, CNC)是一项前沿技术,它通过网络控制平面将分散的计算资源和带宽整合起来,从而有效地利用它们。本文提出了一种新的网络云(network-cloud, NC)架构,用于CNC场景下的深度学习任务推理,网络设备直接参与计算,从而减少了额外的传输成本。考虑到具有多跳计算能力的网络节点和链路径中的一个云节点,利用深度强化学习(DRL),我们开发了一种基于深度Q网络(DQN)的DNN分区、子任务卸载和计算资源分配的联合优化算法,称为POADQ,该算法调用了低复杂度的子任务卸载和计算资源分配(SORA)算法,以最小化延迟。DQN搜索最优DNN分区点,SORA通过提出的NONPRA(下一个最优节点预测与资源分配)方法识别下一个子任务的下一个最优卸载节点,该方法选择预测成本增加最小的节点。我们进行了一些实验,并将POADQ与其他方案进行了比较。结果表明,该算法在降低子任务平均延迟方面优于其他算法。
{"title":"A DRL-Based Algorithm for DNN Partition, Subtask Offloading and Resource Allocation in Multi-Hop Computing Nodes with Cloud","authors":"Ruiyu Yang,&nbsp;Zhili Wang,&nbsp;Yang Yang,&nbsp;Sining Wang","doi":"10.1049/cmu2.70048","DOIUrl":"10.1049/cmu2.70048","url":null,"abstract":"<p>Nowadays, deep neural network (DNN) partition is an effective strategy to accelerate deep learning (DL) tasks. A pioneering technology, computing and network convergence (CNC), integrates dispersed computing resources and bandwidth via the network control plane to utilize them efficiently. This paper presents a novel network-cloud (NC) architecture designed for DL task inference in CNC scenario, where network devices directly participate in computation, thereby reducing extra transmission costs. Considering multi-hop computing-capable network nodes and one cloud node in a chain path, leveraging deep reinforcement learning (DRL), we develop a joint-optimization algorithm for DNN partition, subtask offloading and computing resource allocation based on deep Q network (DQN), referred to as POADQ, which invokes a subtask offloading and computing resource allocation (SORA) algorithm with low complexity, to minimize delay. DQN searches the optimal DNN partition point, and SORA identifies the next optimal offloading node for next subtask through our proposed NONPRA (next optimal node prediction with resource allocation) method, which selects the node that exhibits the smallest predicted increase in cost. We conduct some experiments and compare POADQ with other schemes. The results show that our proposed algorithm is superior to other algorithms in reducing the average delay of subtasks.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70048","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144100604","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
An Efficient Neural Network Algorithm for Physical Layer Spoofing Attack Detection 一种高效的物理层欺骗攻击检测神经网络算法
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2025-05-15 DOI: 10.1049/cmu2.70043
Min Zhang, JinTao Cai

Spoofing attacks, which impersonate legitimate users, pose significant challenges to communication security by exploiting the dependence of received signal strength (RSS) on the spatial position of the transmitter. An enhanced GA_BPNNC algorithm was proposed to learn the distribution of RSS vectors to classify positions, distinguishing between attackers and legitimate users. The algorithm's performance was evaluated using real datasets which are collected in a room of the University of California, San Diego, demonstrating accuracy and robustness compared to existing neural network models. Our method achieved accuracy of over 95% and execution time of less 0.56 s. The experimental results indicate that the proposed algorithm outperforms other state-of-the-art algorithms, with the advantage of not relying on specific communication protocols, offering high throughput and fast decision-making capabilities.

欺骗攻击冒充合法用户,利用接收信号强度(RSS)对发射机空间位置的依赖性,对通信安全构成重大挑战。提出了一种增强的GA_BPNNC算法,通过学习RSS向量的分布对位置进行分类,从而区分攻击者和合法用户。使用加利福尼亚大学圣地亚哥分校的一个房间收集的真实数据集对该算法的性能进行了评估,与现有的神经网络模型相比,显示了准确性和鲁棒性。该方法的准确率在95%以上,执行时间小于0.56 s。实验结果表明,该算法不依赖于特定的通信协议,具有高吞吐量和快速决策能力,优于其他先进算法。
{"title":"An Efficient Neural Network Algorithm for Physical Layer Spoofing Attack Detection","authors":"Min Zhang,&nbsp;JinTao Cai","doi":"10.1049/cmu2.70043","DOIUrl":"10.1049/cmu2.70043","url":null,"abstract":"<p>Spoofing attacks, which impersonate legitimate users, pose significant challenges to communication security by exploiting the dependence of received signal strength (RSS) on the spatial position of the transmitter. An enhanced GA_BPNNC algorithm was proposed to learn the distribution of RSS vectors to classify positions, distinguishing between attackers and legitimate users. The algorithm's performance was evaluated using real datasets which are collected in a room of the University of California, San Diego, demonstrating accuracy and robustness compared to existing neural network models. Our method achieved accuracy of over 95% and execution time of less 0.56 s. The experimental results indicate that the proposed algorithm outperforms other state-of-the-art algorithms, with the advantage of not relying on specific communication protocols, offering high throughput and fast decision-making capabilities.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70043","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143949828","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
Mobile SDNs: Associating End-User Commands with Network Flows in Android Devices 移动sdn:将终端用户命令与Android设备的网络流关联
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2025-05-10 DOI: 10.1049/cmu2.70047
Shuwen Liu, Craig A. Shue, Joseph P. Petitti, Yunsen Lei, Yu Liu

Mobile devices pose several distinct challenges from a security perspective. First, they have varied and ephemeral network connections, often using a cellular provider network as a backup option when connectivity is not available via wireless local access networks. This varied network connectivity makes it difficult to comprehensively deploy in-network solutions, such as firewalls or intrusion detection systems, since they would have to be active in every network the device would use. Second, with personally owned devices, the device owner may have security goals and privacy priorities that are distinct from organizations that provide connectivity or data assets, such as employers or schools. These complex relationships may complicate efforts to protect the devices. This paper explores a technique that runs on the mobile device endpoints to learn about the usage patterns associated with the device, in order to enforce network policy. We explore sensors that examine the mobile device's user interface, using physical inputs via finger taps, and that link them with the network activity on the device. We incorporate with allow-list policies that can be provided by organizations to make on-device access control decisions. Using IP address and DNS host name allow-lists as a baseline, we explore the accuracy of interface-aware allow-lists. We find the interface-aware allow-lists can reach over 98.5% accuracy, even when user-specified destinations are used, greatly exceeding the baseline accuracy. Our performance evaluation indicates our approach introduces a median of 3.87 ms of overall delay with low CPU usage.

从安全的角度来看,移动设备带来了几个不同的挑战。首先,它们的网络连接多种多样且短暂,当无法通过无线本地接入网络连接时,通常使用蜂窝网络作为备份选择。这种不同的网络连接使得全面部署网络内解决方案(如防火墙或入侵检测系统)变得困难,因为它们必须在设备使用的每个网络中都处于活动状态。其次,对于个人拥有的设备,设备所有者可能有不同于提供连接或数据资产的组织(如雇主或学校)的安全目标和隐私优先级。这些复杂的关系可能会使保护设备的努力复杂化。本文探讨了一种在移动设备端点上运行的技术,以了解与设备相关的使用模式,从而实施网络策略。我们探索传感器,检查移动设备的用户界面,使用物理输入通过手指点击,并将它们与设备上的网络活动联系起来。我们结合组织提供的允许列表策略来制定设备上的访问控制决策。使用IP地址和DNS主机名允许列表作为基线,我们探索了接口感知允许列表的准确性。我们发现,即使使用了用户指定的目的地,感知接口的允许列表也可以达到98.5%以上的精度,大大超过了基线精度。我们的性能评估表明,我们的方法在低CPU使用率下引入了中位数3.87 ms的总延迟。
{"title":"Mobile SDNs: Associating End-User Commands with Network Flows in Android Devices","authors":"Shuwen Liu,&nbsp;Craig A. Shue,&nbsp;Joseph P. Petitti,&nbsp;Yunsen Lei,&nbsp;Yu Liu","doi":"10.1049/cmu2.70047","DOIUrl":"10.1049/cmu2.70047","url":null,"abstract":"<p>Mobile devices pose several distinct challenges from a security perspective. First, they have varied and ephemeral network connections, often using a cellular provider network as a backup option when connectivity is not available via wireless local access networks. This varied network connectivity makes it difficult to comprehensively deploy in-network solutions, such as firewalls or intrusion detection systems, since they would have to be active in every network the device would use. Second, with personally owned devices, the device owner may have security goals and privacy priorities that are distinct from organizations that provide connectivity or data assets, such as employers or schools. These complex relationships may complicate efforts to protect the devices. This paper explores a technique that runs on the mobile device endpoints to learn about the usage patterns associated with the device, in order to enforce network policy. We explore sensors that examine the mobile device's user interface, using physical inputs via finger taps, and that link them with the network activity on the device. We incorporate with allow-list policies that can be provided by organizations to make on-device access control decisions. Using IP address and DNS host name allow-lists as a baseline, we explore the accuracy of interface-aware allow-lists. We find the interface-aware allow-lists can reach over 98.5% accuracy, even when user-specified destinations are used, greatly exceeding the baseline accuracy. Our performance evaluation indicates our approach introduces a median of 3.87 ms of overall delay with low CPU usage.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70047","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143930449","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
A Secured Supply Chain Management System Using Blockchain Technology 基于区块链技术的安全供应链管理系统
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2025-05-08 DOI: 10.1049/cmu2.70046
Md. Masud Rana, Sheikh Md. Rabiul Islam

Security in supply chain management has become a critical concern due to the increasing complexity and interconnectivity of global supply chains. Therefore, the need for robust security measures to protect against various risks becomes paramount. The traditional supply chain management system does not ensure several parameters, such as regulatory compliance, immutability, latency, scalability, traceability, and authenticity. The main contributions of our proposed system are to integrate a supply chain management system using blockchain to ensure the above parameters, mitigate the challenges associated with blockchain-based methods, and reduce deployment and operational costs associated with the proposed blockchain-based system. The proposed model includes smart contract mechanisms to enhance security, efficiency, and transparency by recording every transaction and action on the blockchain. Its immutable behaviour minimises the risk of fraud, is tamper-resistant, and ensures security. We used a consensus mechanism to ensure integrity and security by validating the transaction within a blockchain-based supply chain management system. Proof of Work (PoW) is a consensus algorithm used in our model to prevent single points of failure and reduce the risk of manipulation or fraud. This paper describes the hash generation process, the digital signature generation process, the digital signature verification process, and the Merkle tree construction process. The security analysis ensures that our proposed model can detect all possible security threats and ensure the security of the supply chain management system.

由于全球供应链的复杂性和互联性日益增加,供应链管理中的安全问题已成为一个关键问题。因此,需要健壮的安全措施来防止各种风险变得至关重要。传统的供应链管理系统不能保证几个参数,如法规遵从性、不变性、延迟、可扩展性、可追溯性和真实性。我们提出的系统的主要贡献是使用区块链集成供应链管理系统,以确保上述参数,减轻与基于区块链的方法相关的挑战,并降低与拟议的基于区块链的系统相关的部署和运营成本。提议的模型包括智能合约机制,通过记录区块链上的每笔交易和操作来提高安全性、效率和透明度。它的不可变行为将欺诈风险降至最低,具有防篡改性,并确保了安全性。我们使用共识机制,通过验证基于区块链的供应链管理系统中的交易来确保完整性和安全性。工作量证明(PoW)是我们模型中使用的共识算法,用于防止单点故障并降低操纵或欺诈的风险。本文介绍了哈希生成过程、数字签名生成过程、数字签名验证过程和默克尔树构造过程。安全分析保证了我们提出的模型能够检测出所有可能的安全威胁,确保供应链管理系统的安全。
{"title":"A Secured Supply Chain Management System Using Blockchain Technology","authors":"Md. Masud Rana,&nbsp;Sheikh Md. Rabiul Islam","doi":"10.1049/cmu2.70046","DOIUrl":"10.1049/cmu2.70046","url":null,"abstract":"<p>Security in supply chain management has become a critical concern due to the increasing complexity and interconnectivity of global supply chains. Therefore, the need for robust security measures to protect against various risks becomes paramount. The traditional supply chain management system does not ensure several parameters, such as regulatory compliance, immutability, latency, scalability, traceability, and authenticity. The main contributions of our proposed system are to integrate a supply chain management system using blockchain to ensure the above parameters, mitigate the challenges associated with blockchain-based methods, and reduce deployment and operational costs associated with the proposed blockchain-based system. The proposed model includes smart contract mechanisms to enhance security, efficiency, and transparency by recording every transaction and action on the blockchain. Its immutable behaviour minimises the risk of fraud, is tamper-resistant, and ensures security. We used a consensus mechanism to ensure integrity and security by validating the transaction within a blockchain-based supply chain management system. Proof of Work (PoW) is a consensus algorithm used in our model to prevent single points of failure and reduce the risk of manipulation or fraud. This paper describes the hash generation process, the digital signature generation process, the digital signature verification process, and the Merkle tree construction process. The security analysis ensures that our proposed model can detect all possible security threats and ensure the security of the supply chain management system.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70046","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143919912","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
Optimising Energy Harvesting and Throughput for UAV-Assisted IRS Systems With Adaptive Energy Harvesting 具有自适应能量收集的无人机辅助IRS系统的能量收集和吞吐量优化
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2025-05-06 DOI: 10.1049/cmu2.70045
Jeng-Shin Sheu, Chun-Yu Ho

Integrating intelligent reflecting surfaces (IRS) with unmanned aerial vehicles (UAVs) presents a promising approach for future energy-efficient wireless communications. This paper proposes an adaptive framework that dynamically balances energy harvesting (EH) efficiency and system throughput by adjusting the required EH efficiency based on the UAV's power levels and communication needs. Utilising real-coded genetic algorithm (RCGA), the framework effectively tackles challenges posed by multi-user interference (MUI) and imperfect channel estimation (CE). Our results demonstrate that the RCGA-based approach outperforms deep reinforcement learning (DRL) methods, delivering superior energy harvesting and throughput in realistic conditions. The adaptive EH strategy not only optimises throughput performance but also ensures efficient UAV energy management, particularly in dynamic and energy-constrained environments, making it a robust solution for sustained UAV operations in dynamic and energy-constrained environments.

将智能反射面(IRS)与无人机(uav)集成为未来节能无线通信提供了一种很有前途的方法。本文提出了一种基于无人机功率水平和通信需求,通过调整所需的能量收集效率来动态平衡能量收集效率和系统吞吐量的自适应框架。该框架利用实编码遗传算法(RCGA),有效地解决了多用户干扰(MUI)和不完全信道估计(CE)带来的挑战。我们的研究结果表明,基于rcga的方法优于深度强化学习(DRL)方法,在现实条件下提供卓越的能量收集和吞吐量。自适应EH策略不仅优化了吞吐量性能,而且确保了高效的无人机能源管理,特别是在动态和能源受限环境中,使其成为无人机在动态和能源受限环境中持续运行的强大解决方案。
{"title":"Optimising Energy Harvesting and Throughput for UAV-Assisted IRS Systems With Adaptive Energy Harvesting","authors":"Jeng-Shin Sheu,&nbsp;Chun-Yu Ho","doi":"10.1049/cmu2.70045","DOIUrl":"10.1049/cmu2.70045","url":null,"abstract":"<p>Integrating intelligent reflecting surfaces (IRS) with unmanned aerial vehicles (UAVs) presents a promising approach for future energy-efficient wireless communications. This paper proposes an adaptive framework that dynamically balances energy harvesting (EH) efficiency and system throughput by adjusting the required EH efficiency based on the UAV's power levels and communication needs. Utilising real-coded genetic algorithm (RCGA), the framework effectively tackles challenges posed by multi-user interference (MUI) and imperfect channel estimation (CE). Our results demonstrate that the RCGA-based approach outperforms deep reinforcement learning (DRL) methods, delivering superior energy harvesting and throughput in realistic conditions. The adaptive EH strategy not only optimises throughput performance but also ensures efficient UAV energy management, particularly in dynamic and energy-constrained environments, making it a robust solution for sustained UAV operations in dynamic and energy-constrained environments.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70045","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143914580","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
Scheme Design of SR-DCSK-WPC System With Energy Buffer in RIS-Assisted Design ris辅助设计中带能量缓冲器的SR-DCSK-WPC系统方案设计
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2025-05-05 DOI: 10.1049/cmu2.70044
Gongquan Zhang, Yu Ren, Xiaoting Chen, Xulai Zhu

To address the issue of obstacles in wireless channels, this paper proposes a time-division switching SR-DCSK-WPC scheme based on reconfigurable intelligent surface (RIS)-assisted communication. The scheme consists of an energy source (ES) transmitter, a RIS, and a terminal node D with an energy buffer. Firstly, the ES transmits an energy signal composed of multiple chaotic sequences. This energy signal powers the terminal node, and the proportion coefficient of the energy signal is adjusted by controlling the repetition count of the chaotic sequences. Secondly, the RIS adjusts the amount of transmitted energy and assists in bypassing obstacles, further enhancing the performance of the wireless power transfer (WPC) system. Finally, after collecting energy, the terminal node repeatedly transmits a short reference signal composed of multiple chaotic sequences using the short reference technique to improve energy efficiency and transmission rate. Both the ES and D sides employ a repeated transmission method to adjust the energy coefficient and short reference coefficient, respectively. Although their functions differ, their structures are consistent and simple. Simulations and numerical calculations verify that, compared to existing RIS-assisted DCSK-WPC models, the proposed model improves overall transmission efficiency and saves energy without compromising the bit error rate.

针对无线信道中的障碍物问题,提出了一种基于可重构智能表面(RIS)辅助通信的时分交换SR-DCSK-WPC方案。该方案由一个能量源(ES)发射器、一个RIS和一个带能量缓冲器的终端节点D组成。首先,ES传输由多个混沌序列组成的能量信号。该能量信号为终端节点供电,通过控制混沌序列的重复次数来调节能量信号的比例系数。其次,RIS调节传输能量的数量并协助绕过障碍物,进一步提高无线电力传输(WPC)系统的性能。最后,终端节点收集能量后,利用短参考技术重复传输由多个混沌序列组成的短参考信号,提高能量效率和传输速率。ES侧和D侧分别采用重复传输方式调整能量系数和短参考系数。虽然它们的功能不同,但它们的结构是一致和简单的。仿真和数值计算表明,与现有的ris辅助DCSK-WPC模型相比,该模型在不影响误码率的情况下提高了整体传输效率,节约了能源。
{"title":"Scheme Design of SR-DCSK-WPC System With Energy Buffer in RIS-Assisted Design","authors":"Gongquan Zhang,&nbsp;Yu Ren,&nbsp;Xiaoting Chen,&nbsp;Xulai Zhu","doi":"10.1049/cmu2.70044","DOIUrl":"10.1049/cmu2.70044","url":null,"abstract":"<p>To address the issue of obstacles in wireless channels, this paper proposes a time-division switching SR-DCSK-WPC scheme based on reconfigurable intelligent surface (RIS)-assisted communication. The scheme consists of an energy source (ES) transmitter, a RIS, and a terminal node D with an energy buffer. Firstly, the ES transmits an energy signal composed of multiple chaotic sequences. This energy signal powers the terminal node, and the proportion coefficient of the energy signal is adjusted by controlling the repetition count of the chaotic sequences. Secondly, the RIS adjusts the amount of transmitted energy and assists in bypassing obstacles, further enhancing the performance of the wireless power transfer (WPC) system. Finally, after collecting energy, the terminal node repeatedly transmits a short reference signal composed of multiple chaotic sequences using the short reference technique to improve energy efficiency and transmission rate. Both the ES and D sides employ a repeated transmission method to adjust the energy coefficient and short reference coefficient, respectively. Although their functions differ, their structures are consistent and simple. Simulations and numerical calculations verify that, compared to existing RIS-assisted DCSK-WPC models, the proposed model improves overall transmission efficiency and saves energy without compromising the bit error rate.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70044","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143905060","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
Buffer-Aided Cooperative NOMA: An Energy-Efficient Design 缓冲辅助协同NOMA:一种节能设计
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2025-04-29 DOI: 10.1049/cmu2.70042
Baoyi Xu, Li Zhao, Yunpeng Feng, Long Yang, Yuchen Zhou, Bingtao He, Lu Lv

This paper investigates a buffer-aided cooperative non-orthogonal multiple access scheme for simultaneous wireless information and power transfer systems, where the near users are equipped with data and energy buffers. To improve the overall energy efficiency, the transmission mode of the considered system adaptively chooses the base station or near-user transmission mode. Given the target quality of service and limited resources, the long-term power consumption minimization is formulated by a mixed integer non-linear programming problem, where the model selection, user scheduling, and power consumption are jointly optimized. To efficiently tackle such a challenging problem, we transform the original problem into an instantaneous non-convex problem by employing the Lyapunov optimization framework. Then, using the successive convex approximation algorithms, we approximate the instantaneous non-convex problem as a linear programming problem, where the Karush–Kuhn–Tucker solution of the power allocation can be obtained. The optimality and complexity of the proposed scheme are theoretically analyzed. The simulation results show that the proposed scheme can achieve a near-optimal performance and significantly improves the energy efficiency compared with the conventional transmission schemes.

本文研究了一种基于缓冲辅助的非正交多址协作方案,该方案适用于同时传输的无线信息和电力系统,在该系统中,附近用户配备了数据和能量缓冲器。为了提高整体能源效率,所考虑的系统的传输方式自适应地选择基站或近用户传输方式。在目标服务质量和资源有限的情况下,将模型选择、用户调度和功耗共同优化的混合整数非线性规划问题表述为长期功耗最小化问题。为了有效地解决这一具有挑战性的问题,我们采用Lyapunov优化框架将原始问题转化为瞬时非凸问题。然后,利用逐次凸逼近算法,将瞬时非凸问题近似为线性规划问题,得到功率分配的Karush-Kuhn-Tucker解。从理论上分析了该方案的最优性和复杂度。仿真结果表明,与传统的传输方案相比,该方案能达到近乎最优的传输性能,并显著提高了传输效率。
{"title":"Buffer-Aided Cooperative NOMA: An Energy-Efficient Design","authors":"Baoyi Xu,&nbsp;Li Zhao,&nbsp;Yunpeng Feng,&nbsp;Long Yang,&nbsp;Yuchen Zhou,&nbsp;Bingtao He,&nbsp;Lu Lv","doi":"10.1049/cmu2.70042","DOIUrl":"10.1049/cmu2.70042","url":null,"abstract":"<p>This paper investigates a buffer-aided cooperative non-orthogonal multiple access scheme for simultaneous wireless information and power transfer systems, where the near users are equipped with data and energy buffers. To improve the overall energy efficiency, the transmission mode of the considered system adaptively chooses the base station or near-user transmission mode. Given the target quality of service and limited resources, the long-term power consumption minimization is formulated by a mixed integer non-linear programming problem, where the model selection, user scheduling, and power consumption are jointly optimized. To efficiently tackle such a challenging problem, we transform the original problem into an instantaneous non-convex problem by employing the Lyapunov optimization framework. Then, using the successive convex approximation algorithms, we approximate the instantaneous non-convex problem as a linear programming problem, where the Karush–Kuhn–Tucker solution of the power allocation can be obtained. The optimality and complexity of the proposed scheme are theoretically analyzed. The simulation results show that the proposed scheme can achieve a near-optimal performance and significantly improves the energy efficiency compared with the conventional transmission schemes.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70042","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143884235","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
QoS Transformation in the Cloud: Advancing Service Quality Through Innovative Resource Scheduling 云中的QoS转型:创新资源调度,提升服务质量
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2025-04-28 DOI: 10.1049/cmu2.70040
P. Tamilarasu, G. Singaravel, Premkumar Manoharan, Shitharth Selvarajan

Cloud computing (CC) has emerged as a transformative technology, offering customers unprecedented access to extensive computing resources and the diverse services for hosting various applications. However, this environment comes with several challenges. While cloud users seek optimal resources to cater to their specific requirements, the prevalent scenario often involves trading more monetary resources for less computational time. Existing algorithms, mostly focused on optimizing individual variables, lack a holistic approach. Addressing these issues necessitates a new approach to combine these conflicting objectives. This research focuses on developing and improving a dynamic task-processing framework that can find and use the optimal resources in real-time. The focus extends to running applications of different types and levels of complexity on virtual machines (VMs) using the multi-objective adaptive particle swarm optimization (MAPSO) algorithm. The MAPSO handles the multi-objective problem using the weighted-sum approach. The system operates within predefined constraints to meet users' specific time limitations. Through comprehensive simulations on a wide range of datasets, the proposed methodology yields a set of non-dominated optimal solutions. This outcome is instrumental in improving critical quality of service (QoS) metrics, including processing time, execution costs, throughput, and task rejection ratios. The effectiveness of the MAPSO-based approach are evident in its capacity to improve these numerous QoS aspects, including processing time, execution cost, throughput, and task rejection ratio compared and clearly shows that it is superior to the existing algorithms, such as ant colony optimization (ACO), hybrid version of bat optimization algorithm and particle swarm optimization (BOA+PSO), and hybrid grey wolf optimization and artificial bee colony (GWO+ABC). The time complexity for completing the tasks of the MAPSO algorithm is reduced by 5%, executes each schedule's tasks faster by 5% to 13%, and calculated execution costs also get reduced when compared to ACO, BOA+PSO, and GWO+ABC. Moreover, the suggested methodology convincingly outperforms existing state-of-the-art methods in terms of computational performance. This study pioneers a unique solution in cloud service provisioning by integrating multi-objective optimization within a real-time resource allocation framework. The resulting combination of intelligent resource allocation and enhanced QoS metrics promises to change the way cloud-based application deployment is done. Ultimately, this work establishes a paradigm shift in balancing resource allocation and user-centric QoS optimization in cloud computing environments.

云计算(CC)已经成为一种变革性的技术,为客户提供了前所未有的访问广泛计算资源和托管各种应用程序的各种服务的能力。然而,这种环境也带来了一些挑战。虽然云用户寻求最优资源来满足他们的特定需求,但普遍的场景通常涉及用更多的货币资源换取更少的计算时间。现有的算法主要集中于优化单个变量,缺乏整体方法。要解决这些问题,就必须采取新的办法,把这些相互冲突的目标结合起来。本研究的重点是开发和改进一个动态任务处理框架,该框架可以实时发现和使用最优资源。重点扩展到使用多目标自适应粒子群优化(MAPSO)算法在虚拟机上运行不同类型和复杂程度的应用程序。MAPSO采用加权和方法处理多目标问题。系统在预定义的约束条件下运行,以满足用户的特定时间限制。通过对大范围数据集的综合模拟,提出的方法产生了一组非支配的最优解。这个结果有助于改进关键的服务质量(QoS)指标,包括处理时间、执行成本、吞吐量和任务拒绝率。基于mapso的方法在处理时间、执行成本、吞吐量和任务拒绝率等众多QoS方面的改进能力是显而易见的,并且清楚地表明它优于现有算法,如蚁群优化(ACO)、蝙蝠优化算法和粒子群优化(BOA+PSO)的混合版本,以及灰狼优化和人工蜂群(GWO+ABC)的混合算法。与ACO、BOA+PSO和GWO+ABC相比,MAPSO算法完成任务的时间复杂度降低了5%,每个调度任务的执行速度提高了5% ~ 13%,计算执行成本也降低了。此外,所建议的方法在计算性能方面令人信服地优于现有的最先进的方法。本研究通过在实时资源分配框架内集成多目标优化,开创了云服务提供的独特解决方案。智能资源分配和增强的QoS指标相结合的结果有望改变基于云的应用程序部署的方式。最终,这项工作建立了云计算环境中平衡资源分配和以用户为中心的QoS优化的范式转变。
{"title":"QoS Transformation in the Cloud: Advancing Service Quality Through Innovative Resource Scheduling","authors":"P. Tamilarasu,&nbsp;G. Singaravel,&nbsp;Premkumar Manoharan,&nbsp;Shitharth Selvarajan","doi":"10.1049/cmu2.70040","DOIUrl":"10.1049/cmu2.70040","url":null,"abstract":"<p>Cloud computing (CC) has emerged as a transformative technology, offering customers unprecedented access to extensive computing resources and the diverse services for hosting various applications. However, this environment comes with several challenges. While cloud users seek optimal resources to cater to their specific requirements, the prevalent scenario often involves trading more monetary resources for less computational time. Existing algorithms, mostly focused on optimizing individual variables, lack a holistic approach. Addressing these issues necessitates a new approach to combine these conflicting objectives. This research focuses on developing and improving a dynamic task-processing framework that can find and use the optimal resources in real-time. The focus extends to running applications of different types and levels of complexity on virtual machines (VMs) using the multi-objective adaptive particle swarm optimization (MAPSO) algorithm. The MAPSO handles the multi-objective problem using the weighted-sum approach. The system operates within predefined constraints to meet users' specific time limitations. Through comprehensive simulations on a wide range of datasets, the proposed methodology yields a set of non-dominated optimal solutions. This outcome is instrumental in improving critical quality of service (QoS) metrics, including processing time, execution costs, throughput, and task rejection ratios. The effectiveness of the MAPSO-based approach are evident in its capacity to improve these numerous QoS aspects, including processing time, execution cost, throughput, and task rejection ratio compared and clearly shows that it is superior to the existing algorithms, such as ant colony optimization (ACO), hybrid version of bat optimization algorithm and particle swarm optimization (BOA+PSO), and hybrid grey wolf optimization and artificial bee colony (GWO+ABC). The time complexity for completing the tasks of the MAPSO algorithm is reduced by 5%, executes each schedule's tasks faster by 5% to 13%, and calculated execution costs also get reduced when compared to ACO, BOA+PSO, and GWO+ABC. Moreover, the suggested methodology convincingly outperforms existing state-of-the-art methods in terms of computational performance. This study pioneers a unique solution in cloud service provisioning by integrating multi-objective optimization within a real-time resource allocation framework. The resulting combination of intelligent resource allocation and enhanced QoS metrics promises to change the way cloud-based application deployment is done. Ultimately, this work establishes a paradigm shift in balancing resource allocation and user-centric QoS optimization in cloud computing environments.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70040","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143884221","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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1