IET Communications最新文献

{"title":"Dynamic Context-Weighted Embeddings: A Novel Approach to Predictive Modelling","authors":"Zhai Yue,&nbsp;Mohd Ridwan Abd Razak,&nbsp;Lufeng Li","doi":"10.1049/cmu2.70036","DOIUrl":"https://doi.org/10.1049/cmu2.70036","url":null,"abstract":"<p>Employee satisfaction prediction models often struggle to capture the complex, non-linear relationships between compensation and job satisfaction, particularly in heterogeneous organisational contexts. This paper introduces a novel deep learning framework incorporating multiple technical innovations to address these challenges. The proposed approach employs a dual-pathway neural architecture with compensation-specific processing modules to explicitly model the non-linear interactions between compensation factors and other job attributes across diverse organisational settings. A differentiated embedding strategy transforms raw features into rich, context-aware representations, enabling the capture of subtle patterns in employee satisfaction dynamics. The framework integrates a context-sensitive attention mechanism that automatically identifies and weighs relevant features based on organisational characteristics and temporal patterns, alongside a specialised loss function that adaptively emphasises difficult-to-predict cases, improving performance on complex satisfaction patterns. This model demonstrates robust performance across diverse industry settings, handling missing data and class imbalance effectively. Extensive comparative experiments against state-of-the-art methods (LSTM-Attention, GNN-based approaches and traditional ML models) across multiple datasets show significant improvements, with prediction accuracy increasing by 5.2%–8.5%, mean squared error decreasing by 10.3%–15.2% and AUC-ROC metrics improving by 7.8%. Further analysis reveals superior performance in handling temporal dependencies and organisational context variations, with particular strength in predicting satisfaction levels during significant organisational changes.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70036","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143801409","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":"Joint Active User Detection, Timing Offset and Channel Estimation for FBMC-Based Uplink Massive Access Systems","authors":"Yuhao Qi,&nbsp;Jian Dang,&nbsp;Zaichen Zhang,&nbsp;Liang Wu,&nbsp;Bingcheng Zhu","doi":"10.1049/cmu2.70034","DOIUrl":"https://doi.org/10.1049/cmu2.70034","url":null,"abstract":"<p>The robustness against timing offsets of filter bank multi-carrier (FBMC) is appealing for grant-free massive access scenarios that mainly adopt asynchronous transmissions. In this work, we propose a compressed sensing based algorithm for joint active user detection as well as timing offset and channel estimation in uplink communication under the combination of FBMC and grant-free massive access systems, which is critical for subsequent decoding or other processes at receiver. The channel estimation part is based on generalized approximate massage passing (GAMP). The active user detection and timing offset estimation are based on loopy belief propagation (LBP) rules, where the expressions of message passing and belief distributions are derived. Besides, since the receiver may have no prior knowledge about some parameters such as noise variance and activity probability, we introduce the expectation maximization (EM) approach into the proposed algorithm. Moreover, we develop a preamble design method to improve the detection and estimation performance. Simulation results show that the proposed EM-LBP-GAMP algorithm can achieve satisfying performance in terms of missed activity detection probability, timing offset estimation error and normalized mean square error of channel estimation.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70034","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143801293","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":"An Efficient Deadline Based Priority Job Scheduling in Mobile Cloud Computing","authors":"Muhammad Makama Mahmudur Rahman Ohee,&nbsp;Fernaz Narin Nur,&nbsp;Asif Karim,&nbsp;Shaheena Sultana,&nbsp;Sami Azam,&nbsp;Nazmun Nessa Moon","doi":"10.1049/cmu2.70031","DOIUrl":"https://doi.org/10.1049/cmu2.70031","url":null,"abstract":"<p>Mobile cloud computing (MCC) combines the portability of mobile devices with cloud data centers to provide advanced services. MCC serves us in various ways in our daily lives, including multimedia streaming, mobile gaming, mobile corporate apps, and data-intensive mobile applications such as augmented reality and virtual reality. Among the several challenges involved in achieving the best performance for this service, job scheduling emerges as a particularly critical one. User satisfaction, cloud service provider requirements, user priority, cloud provider's resource limitation, user deadline, cloud provider's energy consumption, etc., are the main constraints while maintaining job scheduling in mobile cloud computing. To improve the quality of service (QoS) and achieve the effectiveness of job scheduling, we have proposed a multi-objective model to balance the situation between user gratification and the cloud service provider's demand. To optimize the cost efficiency of the virtual machine, two types of jobs represent unconstrained and constrained jobs in the cloud data center. The shortest execution first scheduling (SEFS) algorithm is applied for the unconstrained job, and efficient deadline and priority job scheduling (EDPS) algorithm is applied for the constrained job. Our proposed algorithm improves the performance of the existing state-of-the-art algorithms. Reducing the execution time of jobs and minimizing the resource consumption of cloud providers are the improvements of our proposed algorithm.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70031","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143793326","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":"Parallel Double-Loop Particle Swarm Optimisation for Offloading Strategy in Blockchain Based Cloud-Edge-End Collaborative Computation","authors":"Junjie Cao,&nbsp;Zhiyong Yu,&nbsp;Jian Yang,&nbsp;Jinjin Chai,&nbsp;Zheng Liang,&nbsp;Yuanfeng Yang","doi":"10.1049/cmu2.70033","DOIUrl":"https://doi.org/10.1049/cmu2.70033","url":null,"abstract":"<p>Computing offloading strategies have emerged as a pivotal topic in IoT research, serving as a strategic approach to minimising latency and energy consumption in edge computing. Nevertheless, these advancements have also introduced new challenges, especially in the context of computationally intensive tasks and increasing data privacy requirements in IoT applications. Addressing these challenges requires innovative solutions, with blockchain technology emerging as a highly promising tool. Our work explores the integration of blockchain into IoT edge computing, specifically focusing on computing offloading. We have devised a system architecture that seamlessly integrates edge computing with blockchain technologies, aiming to tackle both optimisation and security concerns. By framing the offloading problem as a multi-objective optimisation issue, we developed a Parallel Double-Loop Particle Swarm Optimisation algorithm. This algorithm introduces a dual-loop subpopulation structure based on broadcast feedback, which enhances information exchange between subpopulations and increases population diversity, thereby mitigating the risk of premature convergence to local optima. Moreover, an innovative collaborative mechanism is introduced, allowing multiple generations of updated particles to iterate simultaneously, significantly boosting the search efficiency of the population. Simulation results demonstrate that the PDPSO algorithm not only achieves significantly faster update speeds but also excels at identifying optimal solutions for the objective function. When compared to other existing algorithms, it offers superior overall performance and holds significant potential for addressing multidimensional constraints such as system delay and local energy consumption. Our findings suggest that this approach could be transformative for future IoT edge computing systems, providing a robust framework for efficient and secure task offloading.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70033","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143793643","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":"Separating Noisy TCP/IP Session Flows Based on Natural Redundancy Decoding","authors":"Guoxian Yu,&nbsp;Xiaomin Ran,&nbsp;Hongyi Yu,&nbsp;Zhixiang Shen","doi":"10.1049/cmu2.70027","DOIUrl":"https://doi.org/10.1049/cmu2.70027","url":null,"abstract":"<p>Aiming at the technical challenges of low latency and high reliability in the complex communication environment of the intelligent industrial network, and the trend of the current Internet of Things architecture is increasingly IP-based, this paper proposes a fast and accurate IP packet forwarding method applied to the routing node, aiming at dealing with the header control packet error problem under high bit error conditions. This method breaks through the limitations of traditional retransmission mechanism and artificially adding redundant information, and only uses the natural redundant characteristics of the protocol itself to realize the correct separation of the session flow in high error environment. The test results on the public data set show that the proposed method can complete the separation of the session stream with a probability of not less than 99% at the bit error rate of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>1</mi>\u0000 <msup>\u0000 <mi>0</mi>\u0000 <mtext>-1</mtext>\u0000 </msup>\u0000 </mrow>\u0000 <annotation>$text{1}{{text{0}}^{text{-1}}}$</annotation>\u0000 </semantics></math> by sacrificing part of the complexity, which provides a new idea and technical means for the fault-tolerant receiving processing of the header five-tuple field in complex communication environments.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70027","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143770407","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":"Generalized Symbol Sequence Modulation","authors":"Abdulrahman Faris,&nbsp;Peter Akuon,&nbsp;Vitalice Oduol Kalecha","doi":"10.1049/cmu2.70032","DOIUrl":"https://doi.org/10.1049/cmu2.70032","url":null,"abstract":"<p>In this paper, we present a modulation scheme called generalized symbol sequence modulation (GSSM), which incorporates multiple symbol sequence modulation mappers. In GSSM, additional information is conveyed through symbol sequences from different symbol constellations to increase data rates. In order to convey information, the sequence of symbols is used in three time slots; therefore, a single antenna can convey at least four bits. Unlike spatial modulation (SM), GSSM conveys information over fading and non-fading channels. The performance of the GSSM system has been validated through bit error rate (BER) simulations and theoretical framework based on various receiving antennas and fading channels. Furthermore, in terms of secrecy rate, it is superior to conventional single input, multiple output systems (SIMO), space shift keying (SSK), and symbol sequence modulation (SSM). Also, GSSM has shown a reduction in receiver computational complexity when compared to SM at the same bit rate. BER results are presented for non-fading, fading, correlated, and non-correlated scenarios, under GSSM.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70032","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143762087","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":"Network Performance Assessment via Length-Bounded Paths in Continuous Domain","authors":"Raed Alharbi,&nbsp;Lan N. Nguyen,&nbsp;My T. Thai","doi":"10.1049/cmu2.70028","DOIUrl":"https://doi.org/10.1049/cmu2.70028","url":null,"abstract":"<p>Studying on networked systems, in which a communication between nodes is functional if their distance under a given metric is lower than a pre-defined threshold, has received significant attention recently. In this work, we propose a metric to measure network resilience on guaranteeing the pre-defined performance constraint. This metric is investigated under an optimization problem, namely length-bounded paths interdiction in continuous domain (<span>cLPI</span>), which aims to identify a minimum set of nodes whose changes cause routing paths between nodes become undesirable for the network service. We show the problem is NP-hard and propose a framework by designing two oracles, <i>threshold blocking</i> (<span>TB</span>) and <i>critical path listing</i> (<span>CPL</span>), which communicate back and forth to construct a feasible solution to <span>cLPI</span> with theoretical bicriteria approximation guarantees. Based on this framework, we propose two solutions for each oracle. Each combination of one solution to <span>TB</span> and one solution to <span>CPL</span> gives us a solution to <span>cLPI</span> . The bicriteria guarantee of our algorithms allows us to control the solutions' trade-off between the returned size and the performance accuracy. New insights into the advantages of each solution are further discussed via experimental analysis.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70028","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143717140","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":"Optimizing Intrusion Detection in Wireless Sensor Networks via the Improved Chameleon Swarm Algorithm for Feature Selection","authors":"Laith Abualigah,&nbsp;Mohammad H. Almomani,&nbsp;Saleh Ali Alomari,&nbsp;Raed Abu Zitar,&nbsp;Hazem Migdady,&nbsp;Kashif Saleem,&nbsp;Vaclav Snasel,&nbsp;Aseel Smerat,&nbsp;Absalom E. Ezugwu","doi":"10.1049/cmu2.70029","DOIUrl":"https://doi.org/10.1049/cmu2.70029","url":null,"abstract":"<p>In this paper, the improved chameleon swarm algorithm (ICSA) enhances the exploration–exploitation balance while optimizing feature subset selection. The integration of Lévy flight-based exploration refines ICSA's search strategy, complemented by rotation-type refinement and adaptive parameter-setting mechanisms. These modifications ensure that exploration aligns effectively with the feature selection process, leading to a more adaptive and efficient approach. To evaluate ICSA's effectiveness, it is tested on the NSL-KDD benchmark, a well-established dataset in intrusion detection systems. Performance is assessed based on key metrics, including accuracy, detection rate, false alarm rate, execution time, and the number of selected features. Comparative analysis against six advanced classifiers demonstrates that ICSA achieves superior results with minimal computational overhead. The algorithm attains the highest accuracy (97.91%) and detection rate (98.75%), the fastest execution time, and the lowest false alarm rate (0.0021), eliminating the need for excessive feature selection. These results confirm that modifying feature selection mechanisms within ICSA significantly enhances computational efficiency and detection performance, as validated through rigorous experimental testing at the classifier level.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70029","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143717141","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":"Shot Noise Optimal Receiver Filters for Coherent and Non-Coherent Fibre Optic Communications","authors":"Amir R. Forouzan,&nbsp;Mohammad Sheikhbahaei","doi":"10.1049/cmu2.70026","DOIUrl":"https://doi.org/10.1049/cmu2.70026","url":null,"abstract":"<p>In this paper, we investigate optimal receiver filter design with respect to shot noise in both non-coherent and coherent fibre optic communication systems. We derive analytical expressions for the moment-generating function of filter output and the signal-to-shot noise power ratio (SSNR) for intensity modulation direct detection (IM/DD) and phase diversity homodyne (PDH) optical fibre communication systems, with arbitrary waveform and receiver filter considerations in the presence of shot noise. Closed-form formulas are provided for the receiver filter structures that maximise the SSNR. The performance of SSNR is evaluated using return-to-zero (RZ) coding with rectangular and Gaussian pulse shapes across various receiver filter structures, including the ideal integrator, the RC model, and the matched filter. Our results indicate that the integrator, or its variations, is either optimal or near-optimal for diverse IM/DD systems. However, matched filtering to the received pulse power becomes superior when dark current or d.c. bias power is prominent. For coherent PDH systems, matched filtering to the complex received pulse amplitude approaches near-optimal performance provided the local oscillator (LO) power significantly exceeds the received signal power. When the LO power is much greater than the signal power, such systems can achieve double the SSNR of IM/DD systems, equivalent to twice the number of converted photoelectrons per symbol, thus nearing the quantum-limit performance considering the photodetector quantum efficiency.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70026","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143689257","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":"Cooperative Beamforming Design for Multi-BS Integrated Sensing and Communication Systems","authors":"Peng Wang,&nbsp;Dongsheng Han,&nbsp;Xi Song","doi":"10.1049/cmu2.70015","DOIUrl":"https://doi.org/10.1049/cmu2.70015","url":null,"abstract":"<p>Integrated sensing and communication (ISAC) is regarded as a promising paradigm for future sixth-generation (6G) networks, which effectively improves spectral efficiency and reduces hardware costs by simultaneously performing communication and sensing. Due to the limited coverage of a single base station (BS), the single-BS ISAC system struggles to meet the demands of various emerging intelligent applications for high-quality communication and high-precision sensing. In this paper, we investigate a cooperative multi-BS ISAC system with multi-target and multi-user. In particular, communication and sensing are performed by multiple BSs with a cooperative manner. We formulate a problem for the purpose of maximizing the sensing mutual information (MI) via jointly designing the transmit beamforming of multiple BSs for communication and sensing, while guaranteeing the achievable communication rate requirements. To address this non-convex problem, an iterative optimization algorithm is developed based on the Lagrangian transform and the quadratic fractional transform. Simulation results validate the advancement of the proposed cooperative beamforming scheme in enhancing the sensing performance of multi-BS ISAC system.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70015","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143646170","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}