IET Communications最新文献

{"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":"https://doi.org/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.5,"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}

{"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":"https://doi.org/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.5,"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}

{"title":"A Study on New EPC-MPSI for an Inputless External Party to Compute the Intersection of Multiple Private Datasets","authors":"Ki-Hwan Kim,&nbsp;Dae-Hee Seo,&nbsp;Im-Yeong Lee,&nbsp;Su-Hyun Kim","doi":"10.1049/cmu2.70038","DOIUrl":"https://doi.org/10.1049/cmu2.70038","url":null,"abstract":"<p>Private set intersection (PSI) is a privacy-preserving scheme that computes the intersection of two datasets without leaking any other information. Additionally, there is multiparty private set intersection (MPSI) to extend the number of parties for computing the intersection of multiple private datasets. In the traditional PSI and MPSI studies, protocol parties input their private datasets, and one or all of them can compute the intersection. However, there are some scenarios where an inputless external party requires the intersection between private datasets of other parties. Thus, the external party PSI protocols have been recently studied for applications such as pandemic contact tracing, computing human genome information and evaluating policy effects. However, they are limited in applications because the external party can compute the intersection of two datasets. In this paper, we propose a new external party compute-MPSI (EPC-MPSI) protocols that allow an external party to compute the intersection of multiple datasets. We provide the extension of the number of parties and solve the limitation of prior external party PSI protocols. In addition, we analyze the correctness, security and the efficiency in terms of communication and computation costs compared to the prior traditional MPSI protocols.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70038","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143861795","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}

{"title":"Transmit Antenna Selection and Power Allocation Optimization for Non-Orthogonal Multiple Access Systems with Statistical Channel State Information","authors":"Zhuo Han,&nbsp;Wanming Hao,&nbsp;Shouyi Yang,&nbsp;Zhiqing Tang","doi":"10.1049/cmu2.70018","DOIUrl":"https://doi.org/10.1049/cmu2.70018","url":null,"abstract":"<p>This paper considers a downlink multiple input single output (MISO) non-orthogonal multiple access (NOMA) system over Nakagami-m fading channels, where a multi-antenna base station (BS) serves several single-antenna users with the statistical channel state information (CSI) of each user. We propose a novel low-complexity transmit antenna selection by head user (TAS-head) strategy for the first time to exploit the spatial diversity of multiple antennas. Based on our proposed TAS-head strategy, we derive a closed-form expression of the exact outage probability (OP). We further analyse the asymptotic OP and diversity order in high signal-to-noise ratio (SNR) regime. Finally, we formulate a power allocation optimization problem to maximize sum throughput under outage constraints. We also design an Adam algorithm in combination with numerical differentiation method to obtain a suboptimal solution. Monte Carlo (MC) simulations verify the accuracy of our derived exact OP. Results show that our proposed TAS-head strategy is more effective than its benchmarks (TAS-near/far and TAS-maj). Furthermore, we prove that PA-TDR criterion achieves better performance than PA-ACG in scenarios where the descending order of target data rate is the same with that of channel condition. Our designed Adam algorithm turns out to be more effective in comparison with genetic algorithm (GA) in multi-user case. Results indicate that our proposed TAS-head strategy is an efficient method to meet users' QoS requirements, especially in low SNR (or transmit power) regime.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70018","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143857176","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}

{"title":"Bioinspired Adaptive Resource Scheduling for QoS in Mobile Edge Deployments","authors":"Gagandeep Kaur,&nbsp;Balraj Singh,&nbsp;Muhammad Faheem","doi":"10.1049/cmu2.70017","DOIUrl":"https://doi.org/10.1049/cmu2.70017","url":null,"abstract":"<p>As mobile edge computing (MEC) expands, efficient resource allocation and job scheduling become increasingly important. Existing techniques are frequently unable to offer acceptable quality of service (QoS), owing to inflexible scheduling algorithms and insufficient consideration of complex task and resource metrics. To overcome these constraints, this work proposes a novel adaptive vector autoregressive moving average with exogenous variables (VARMAx)-based bioinspired resource scheduling model designed specifically for mobile edge deployment. The proposed approach applies the resilient concepts of flower pollination optimisation (FPO) to map tasks to virtual machines (VMs), a technique that is sensitive to a wide variety of task variables such as makespan, deadline and CPU needs. Simultaneously, VM characteristics such as million instructions per second (MIPS), amount of cores, random access memory (RAM), availability and bandwidth are all taken into account, resulting in a more nuanced and adaptive scheduling process. Furthermore, a VARMAx model is included for task pre-emption, which assists in the recalibration of future VM capabilities, hence improving overall scheduling efficiency, particularly in real-time deployments. The suggested model outperforms existing techniques. Our results show an 8.3% reduction in makespan, a 4.5% improvement in deadline hit ratio, an 8.5% increase in energy efficiency, and a 10.4% increase in throughput. The huge improvements highlight the model's adaptability and efficacy, resulting in important advances in the field of QoS-aware task scheduling for MEC. This work represents a significant advancement in the field of effective resource scheduling, with the potential to guide future research and development efforts in mobile edge deployments.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70017","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143846015","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}

{"title":"Lightweight Authentication Scheme for Resource-Constrained Devices in IIoT","authors":"Zhong Cao,&nbsp;Xudong Wen,&nbsp;Shan Ai,&nbsp;Haitao Cao,&nbsp;Wenli Shang","doi":"10.1049/cmu2.70039","DOIUrl":"https://doi.org/10.1049/cmu2.70039","url":null,"abstract":"<p>The industrial Internet of Things (IIoT) involves interconnected devices and sensors that exchange data in resource-constrained industrial environments. As the number of IIoT devices grows, ensuring secure communication becomes increasingly important. This paper proposes a lightweight authentication scheme leveraging elliptic curve cryptography (ECC) and other lightweight cryptographic techniques to facilitate secure communication among IIoT devices while minimizing computational, communication, and storage overheads. We conduct thorough security evaluations using a stochastic Oracle model and the automated validation of Internet security protocols and applications (AVISPA) tool, as well as informal security analyses based on the Dolev–Yao channel model to validate the correctness of our approach. Simulation results demonstrate that the proposed scheme offers superior security and computational efficiency compared to existing authentication methods in similar contexts.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70039","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143846014","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}

{"title":"Optimization mechanism of energy efficiency in coexisting wireless body area networks","authors":"Yuting Qian,&nbsp;Kunqi Guo","doi":"10.1049/cmu2.12712","DOIUrl":"https://doi.org/10.1049/cmu2.12712","url":null,"abstract":"<p>This paper studies the optimization of energy efficiency in coexisting wireless body area networks (WBANs). A solution based on combining a naive Bayesian classifier with the Hungarian algorithm is proposed to improve link transmission energy efficiency. The solution is implemented in the following three steps: Firstly, the interference from surrounding WBANs is identified based on a naive Bayesian classifier considering the distance among WBANs, the residual energy of the sensor nodes, and the transmission power of the sensor nodes. Secondly, the signal-to-interference plus noise ratio is determined according to the results of the naive Bayesian classifier. Thirdly, the time slots are allocated adaptively by using the Hungarian algorithm to maximize the overall energy efficiency. The simulation results show that the scheme can improve the overall energy efficiency of the WBAN significantly while ensuring quality of service. In comparison with the iterative algorithm and the PONF algorithm, the proposed scheme has obvious advantages in improving energy efficiency.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12712","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143846016","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}

{"title":"Efficient Positioning Method for Underground Pipe Gallery Inspection Based on UWB Adaptive Fusion","authors":"Haoyue Lin,&nbsp;Zehua Yin,&nbsp;Chunwu Wang,&nbsp;Yifan Lin,&nbsp;Muhammad Suhail Shaikh,&nbsp;Chang Wang,&nbsp;Xiaoqing Dong","doi":"10.1049/cmu2.70037","DOIUrl":"https://doi.org/10.1049/cmu2.70037","url":null,"abstract":"<p>To address the challenges of slow positioning speed and inaccurate localisation of underground pipeline corridors in complex environments using ultra-wideband (UWB) absolute positioning, this paper proposes a Hybrid UWB-IMU Adaptive Localisation Algorithm (HUIALA) for precise underground pipeline corridor positioning. The positioning method uses UWB as absolute positioning, IMU and odometer trajectory calculation as relative positioning (predictive positioning), and updates the observation noise by calculating the fuzzy distance to the triangle centroid to adaptively allocate weights. At the same time, dynamically adjust the intervention and exit of predicted positioning based on system operation, and filter out interference such as UWB positioning drift and absolute positioning failure. The proposed method is based on the simulation and experiment of a wheeled inspection vehicle system using UWB and inertial navigation. The experimental result shows that the proposed method maintains better response speed and high positioning accuracy during dynamic testing in simulated interference environments. The positioning speed is improved by 98.9% compared to single UWB positioning, and the positioning accuracy is improved by about 45.84% and 27.96% compared to single UWB positioning and KF fusion positioning, respectively.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70037","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143826766","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}

{"title":"Pseudo-Label Selection-Based Federated Semi-Supervised Learning Framework for Vehicular Networks","authors":"Jiachen Liu,&nbsp;Haoren Ke,&nbsp;Jianfeng Yang,&nbsp;Tianqi Yu","doi":"10.1049/cmu2.70035","DOIUrl":"https://doi.org/10.1049/cmu2.70035","url":null,"abstract":"<p>In vehicular networks, federated learning (FL) has been used for secure and distributed edge intelligence to support deep neural network (DNN) model training. In the FL, the roadside units (RSUs) and vehicles act as the parameter servers and clients, respectively. However, the raw data collected by the vehicles are normally unlabeled, which can hardly meet the requirements of the supervised learning tasks. To resolve the related issues, a federated semi-supervised learning (FSSL) framework is proposed in this paper. By leveraging semi-supervised learning (SSL), the framework can implement the model training with unlabeled data in vehicles and a small set of manually annotated data in the RSU. Furthermore, a pseudo-label selection method is developed for the vehicles to improve the local pseudo-label prediction accuracy and the convergence of global model training. Simulation experiments have been conducted to evaluate the performance of the proposed FSSL framework. The experimental results show that the proposed framework can effectively utilize unlabeled data in vehicular networks and complete the task of DNN model training.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70035","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143818411","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}

{"title":"HybridDep: An elastic hybrid resources allocation strategy for I/O-intensive applications","authors":"Pengmiao Li,&nbsp;Yuchao Zhang,&nbsp;Shaoxuan Yun,&nbsp;Fucai Yu,&nbsp;Aizhi Wu","doi":"10.1049/cmu2.70007","DOIUrl":"https://doi.org/10.1049/cmu2.70007","url":null,"abstract":"<p>Along with the rapid development of B5G/6G, the number of applications grows rapidly and the data amount explodes exponentially, putting a massive burden on the resource-limited edge servers. To fully utilize the limited resources, virtualization technology is introduced to provide elastic deployment for applications in edge servers. But for I/O-intensive applications, allocating elastic resources is not as easy as for compute-intensive ones, because the amount of required I/O resources is unknown due to the request uncertainty. Many existing researches try to solve this multi-application deployment problem by peaks clipping and valleys filling, to resource utilization. However, in fact, the times of peaks and valleys of most hybrid deployed applications are similar to each other, which invalidates those traditional solutions. To address this challenge, the actual data is analysed and complementary peak and valley periods in time and space dimensions are found. Based on this finding, an elastic hybrid deployment strategy <i>HybridDep</i> is proposed, for multiple I/O-intensive applications. Validated by simulation experiments using real datasets and traces, this algorithm can reduce about 3.2% deployment cost than the compared algorithm.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70007","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143801555","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}