Journal of Communications and Networks最新文献

{"title":"Feature extraction for channel reciprocity based secret key generation methods","authors":"Ghazal Bagheri;Paul Walther;Max Braunig;Ali Khandan Boroujeni;Stefan Köpsell","doi":"10.23919/JCN.2025.000023","DOIUrl":"https://doi.org/10.23919/JCN.2025.000023","url":null,"abstract":"Channel Reciprocity-based Key Generation (CRKG) technique has gained significant attention among researchers in the field of Physical Layer Security (PLS). While existing methods in this area typically use raw channel information as input for secret key generation, we propose a novel approach that derives features from the raw material for key generation. Our comprehensive study explores a wide range of features derived from the reciprocal components of the Channel Impulse Response (CIR)s in both the time and frequency domains. Our findings demonstrate that the derived feature set exhibits better channel characteristics than the raw key material, even in the presence of eavesdroppers. We evaluate the efficiency of our proposed feature set using several performance metrics in a new feature-based key generation scheme to validate its efficiency. The results highlight the potential of this feature set for future key-generation applications.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 3","pages":"147-165"},"PeriodicalIF":3.2,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11106373","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144750977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2025.000043","DOIUrl":"https://doi.org/10.23919/JCN.2025.000043","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 3","pages":"214-216"},"PeriodicalIF":3.2,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11106345","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144750978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Dedicated communication for sensing: A new use case for private 5G and open RAN for mMTC","authors":"Hyun-Min Yoo;Sang-Yeon Lee;Geon Kim;Jong-Seok Rhee;Een-Kee Hong","doi":"10.23919/JCN.2025.000031","DOIUrl":"https://doi.org/10.23919/JCN.2025.000031","url":null,"abstract":"The increasing number of devices in massive machine-type communication (mMTC) and the industrial Internet of Things (IIoT) requires more reliable, flexible, and intelligent communication systems with high capacity. As machines and IIoT devices are expected to be the main users of beyond 5G (B5G) and 6G networks, we should consider candidate technologies tailored for the mMTC scenario. In this paper, we propose a new paradigm of integrated sensing and communications (ISAC) tailored for sensor networks in smart factories, representing a key use case for mMTC. The ISAC for mMTC should be differentiated from radar sensing-based conventional ISACs and be capable of collaborating with other enabling technologies to enhance the performance of mMTC systems. In this context, the proposed framework enhances capabilities by introducing a packet layer, and this paper demonstrates its seamless integration into existing ISAC frameworks. To establish a novel framework for ISAC within the mMTC scenario, we focus on two major candidate technologies for B5G and 6G: private 5G and open radio access network (Open RAN, O-RAN). We present a reliable and secure sensor network leveraging private 5G infrastructure and suggest an intelligent data-driven system enabled by O-RAN architecture. Finally, we demonstrate the feasibility of the proposed framework with our testbed by showcasing the sensor data monitoring and predictive maintenance use cases for a smart factory system.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 3","pages":"200-207"},"PeriodicalIF":3.2,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11106376","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144751120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An improved SCMA codebook design based on uniquely decomposable constellation groups","authors":"Linxuan Chen;Xuewan Zhang;Chunying Pu;Pengxue Liu","doi":"10.23919/JCN.2025.000035","DOIUrl":"https://doi.org/10.23919/JCN.2025.000035","url":null,"abstract":"In this paper, we propose an improved uniquely decomposable constellation group (I-UDCG) for codebook design of sparse code multiple access (SCMA) systems, which guarantees that the superimposed constellation of SCMA codebooks on each mapping resource satisfies the uniquely decomposable constraint. We optimize the bit error rate (BER) performance of the I-UDCG-based SCMA codebooks from two perspectives. One is to maximize the coding gain of the superimposed constellation of the I-UDCG, using the error probability bound (EPB) as the optimization criterion. The EPB is determined by a threshold distance rather than the minimum Euclidean distance (MED) among constellation points. The other approach focuses on maximizing the MED among the codebook's codewords to enlarge the coding gain of SCMA codebooks, thereby improving the BER performance of SCMA systems. Simulation results show that the two optimization methods can enhance the BER performance of SCMA. In particular, the first optimization method performs better in scenarios involving both small-size and large-size codebooks. Compared to other codebook design schemes, our proposal can exhibit strong anti-noise and antifading abilities for various codebook sizes.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 3","pages":"136-146"},"PeriodicalIF":3.2,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11106346","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144750975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Iterative IA precoding and RIS beamforming based on rank-reduced MIMO interference channel","authors":"Weihua Liu;Changyou Li;Tianpeng Li;Peixu Xing;Jin Xu;Bowen Pan","doi":"10.23919/JCN.2025.000024","DOIUrl":"https://doi.org/10.23919/JCN.2025.000024","url":null,"abstract":"As a key technology for beyond 5G and 6G, reconfigurable intelligent surfaces (RIS) have been extensively studied for their application in wireless communication to enhance system performance. However, existing RIS-assisted interference alignment (IA) strategies predominantly utilize passive RIS to align interference in communication systems, and the amplified noise in active RIS-assisted communication systems cannot be overlooked. In this paper, we investigate the problems of interference cancellation and maximizing the system sum-rate performance in an active RIS-assisted multi-user multiple-input multiple-output (MIMO) communication system. We consider the issue of amplified noise introduced by the active RIS within the system model. To mitigate interference, we propose a matrix rank-reduced method for designing RIS beamforming, which aims to minimize the rank of the MIMO interference channel. Furthermore, we introduce a novel iterative minimum interference leakage (min-IL) and Riemannian conjugate gradient (RCG) algorithm based on the rank-reduced MIMO interference channel. The proposed algorithm can completely eliminate inter-user interference and maximize the system sum-rate. Various simulation experiments yielded numerical results that demonstrate the effectiveness and applicability of the proposed algorithm.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 3","pages":"179-189"},"PeriodicalIF":3.2,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11106350","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144750976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Information for authors","authors":"","doi":"10.23919/JCN.2025.000042","DOIUrl":"https://doi.org/10.23919/JCN.2025.000042","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 3","pages":"209-213"},"PeriodicalIF":3.2,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11106374","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144751070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2025.000029","DOIUrl":"https://doi.org/10.23919/JCN.2025.000029","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 2","pages":"133-135"},"PeriodicalIF":2.9,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11011503","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"RIS-aided transmissions in energy-harvesting cognitive radio networks: A DRL approach","authors":"Hoang Thi Huong Giang;Pham Duy Thanh;Tran Nhut Khai Hoan;Haneul Ko;Sangheon Pack","doi":"10.23919/JCN.2025.000016","DOIUrl":"https://doi.org/10.23919/JCN.2025.000016","url":null,"abstract":"Direct transmissions in cognitive radio networks (CRNs) can be easily obstructed by obstacles and channel uncertainty and thus cognitive transmitters normally increase the transmission power to guarantee the quality of service; however, it can deplete limited-capacity batteries and degrade long-term performance. These issues can be solved by reflecting signals to cognitive users (CUs) using a reconfigurable intelligent surface (RIS) and setting appropriate transmission powers. This study investigates RIS-aided downlink of non-orthogonal multiple access (NOMA) CRNs, where RIS can reconstruct transmission environments and a wireless powered-cognitive base station (CBS) opportunistically uses a licensed channel allowing multi-user transmissions in the same frequency and time block. Under stochastic properties of energy harvesting, wireless channels, and primary network behavior, we aim to optimize the assigned power of CUs and RIS phase-shifts jointly to maximize the sum-rate of CRNs. To this end, we formulate an optimization problem as a Markov decision process (MDP) framework. Subsequently, a deep deterministic policy gradient (DDPG) algorithm is adopted to cope with highdimensional continuous states and action spaces in time-varying environments. Simulation results are presented to confirm the superior performance of the proposed scheme over benchmark schemes in which orthogonal multiple access (OMA), long-term, and myopic optimizations are considered.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 2","pages":"78-91"},"PeriodicalIF":2.9,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11011498","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Anomaly detection for industrial Internet of Things devices based on self-adaptive blockchain sharding and federated learning","authors":"Song Luo;Pengyi Zeng;Chao Ma;Yifei Wei","doi":"10.23919/JCN.2025.000019","DOIUrl":"https://doi.org/10.23919/JCN.2025.000019","url":null,"abstract":"With the rapid growth of the Industrial Internet of Things (IIoT), more and more devices are connecting to the network, generating vast amounts of data, including sensors, actuators, and controllers. Traditional anomaly detection methods often rely on centralized data collection, leading to concerns about privacy leakage and data centralization. To address these challenges, approaches that combine federated learning (FL) with blockchain technology offer an efficient, scalable solution. These methods enable automatic scaling based on system size, adapting to increasing devices and data traffic. However, the limitations of fixed shards and security risks associated with the aggregation of data from different shards introduce new issues. To overcome these challenges, this paper proposes a self-adaptive blockchain sharding strategy, based on IIoT device grouping, which jointly optimizes the number of shards and the security of model updates. This optimization is modeled as a Markov Decision Process (MDP), with deep reinforcement learning (DRL) used to determine the optimal device sharding parameters. Furthermore, a joint committee mechanism is introduced to ensure secure cross-shard transactions, while a federated learning filtering mechanism (Fed-Filt) is applied to enhance the accuracy and security of global model aggregation by screening out malicious nodes. In the clustering experiments, the proposed method shows significant improvements in clustering quality metrics such as Normalized Mutual Information (NMI), Adjusted Rand Index (ARI), Adjusted Mutual Information (AMI), and silhouette score, with faster convergence. Experimental results demonstrate that under 25% and 50% malicious node scenarios, the proposed algorithm can effectively resist poisoning attacks and achieve stable convergence, outperforming the traditional FedAvg algorithm. Specifically, with 50% malicious nodes, the accuracy is improved by approximately 27.8%, and the method exhibits strong resistance and recovery capabilities.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 2","pages":"92-102"},"PeriodicalIF":2.9,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11011497","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Budget-feasible truthful mechanism for resource allocation and pricing in vehicle computing","authors":"Xi Liu;Jun Liu;Changqing Du;Xiuhua Zeng;Weidong Li","doi":"10.23919/JCN.2025.000015","DOIUrl":"https://doi.org/10.23919/JCN.2025.000015","url":null,"abstract":"Vehicle computing holds great potential to provide computation, communication, sensing, and data storage. To accelerate the application of vehicle computing, we address the problem of resource allocation and pricing in vehicle computing (PAPVC), in which the vehicle, as a resource provider, provides heterogeneous resources to serve users through access points or the internet. In our model, each user has multiple tasks of different values under budget constraints, and vehicles have different costs. We formulate the RAPVC problem in a reverse auction-based setting, where a user is regarded as an auctioneer, and the vehicles are regarded as the participants in the auction. However, the vehicle providers are self-interested, and they can submit untrue declarations to maximize the utility. Thus, we aim to design a truthfulness mechanism to maximize group efficiency. We propose a greedy mechanism to solve the PAPVC problem. We then show the proposed mechanism is truthful; that is, our proposed mechanism drives the system into an equilibrium. In addition, we show the proposed mechanism achieves individual rationality, consumer sovereignty, budget feasibility, and computation efficiency. Furthermore, we analyze the approximation ratio of the proposed approximation algorithm. Simulation results indicate that the average percent gap between solutions obtained by the proposed mechanism and optimal solutions is 22%.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 2","pages":"103-118"},"PeriodicalIF":2.9,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11011505","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}