IET Communications最新文献

{"title":"An Efficient Neural Network Algorithm for Physical Layer Spoofing Attack Detection","authors":"Min Zhang,&nbsp;JinTao Cai","doi":"10.1049/cmu2.70043","DOIUrl":"https://doi.org/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.5,"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}

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

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

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

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

{"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}