{"title":"Improved Analysis and Design of ADR Algorithm for Energy-Efficient LoRaWAN System","authors":"Chanki Kim;Jaeyoung Yoon;Jiho Jeon","doi":"10.1109/LCOMM.2025.3550512","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3550512","url":null,"abstract":"For an energy-efficient adaptive data rate (ADR) algorithm in a long-range wide-area network (LoRaWAN) system, an asymptotic analysis on the spreading factor (SF) by the ADR-MIN algorithm considering a probabilistic packet collision is presented. In addition, we propose a new ADR truncated MIN algorithm that selectively exploits signal-to-interference noise ratio (SINR) values for the accurate SINR estimation. From computer simulations, the proposed ADR design was observed to have a SF configuration near the asymptotic estimate and to be more energy efficient compared to existing ADR algorithms.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"1018-1022"},"PeriodicalIF":3.7,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143937984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secure MIMO Communication via Pilot-Based Codebook Artificial Noise: Unknown Eavesdropper Channel","authors":"Yebo Gu;Tao Zhao;Tao Shen;Bo Wang","doi":"10.1109/LCOMM.2025.3550316","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3550316","url":null,"abstract":"Pilot-Based Codebook Artificial Noise (PCAN), which plays a crucial role in ensuring secure communication, is an emerging physical layer security technique. PCAN faces a significant challenge due to the unknown eavesdropper channel. To address this issue, this letter re-models the eavesdropper channel using random matrix theory. By applying the <inline-formula> <tex-math>$eta $ </tex-math></inline-formula>-transform and Shannon-transform, the asymptotic expression for the eavesdropper channel capacity is derived under the condition of an unknown eavesdropper channel. The simulation result shows that when the number of transmitter antennas equals the number of eavesdropper antennas and the system dimension is large, the model can effectively characterize the eavesdropper channel capacity. Within this framework, the secrecy capacity is optimized using the Difference of Convex functions - Successive Convex Approximation (DC-SCA) algorithm, providing a new approach to improve the performance of PCAN.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"1013-1017"},"PeriodicalIF":3.7,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143937944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Joint Distributed Estimation and Random Gain Channel Estimation With Beta Prior","authors":"Hadi Zayyani;Mehdi Korki;Razieh Torkamani","doi":"10.1109/LCOMM.2025.3550286","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3550286","url":null,"abstract":"In this letter, we propose a joint distributed estimation and channel estimation algorithm for wireless sensor networks (WSNs). We assume a random gain channel model with a Beta prior, where the channel gain is an attenuation factor ranging between zero and one. To estimate the augmented unknown vector, which includes both the unknown vector and the channel gain vector, we employ Maximum A Posteriori (MAP) estimation. This is achieved through an iterative steepest-descent method to find the MAP estimators for both the unknown vector and the channel gain vector. We mathematically derive the optimum combination coefficients that minimize disturbance. Additionally, we propose a separate approach for channel gain estimation using Least Squares (LS) and provide the convexity analysis of the cost function along with the sufficient conditions for the convergence of the iterative channel gain estimator. Simulation results demonstrate the effectiveness of the proposed algorithm compared to some other algorithms in the literature, specially when channel gains are modeled with a Beta prior.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"1008-1012"},"PeriodicalIF":3.7,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143938026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Topocode: Topologically Informed Error Detection and Correction in Image Communication Systems","authors":"Hongzhi Guo","doi":"10.1109/LCOMM.2025.3550131","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3550131","url":null,"abstract":"Immersive communication technologies such as eXtended Reality (XR) and holographic-type communications require high-data-rate low-latency services. Due to the massive amount of transmitted data, bit-level metrics cannot comprehensively evaluate the Quality-of-Experience (QoE) in these scenarios. This letter proposes Topocode which leverages Topological Data Analysis (TDA) and persistent homology to encode topological information for message-level error detection and correction in image communication systems. It introduces minimal redundancy while enabling effective data reconstruction, especially in low Signal-to-Noise Ratio (SNR) scenarios. Topocode offers a promising approach to meet the demands of next-generation communication systems prioritizing message-level integrity.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"1003-1007"},"PeriodicalIF":3.7,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143938000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Feasibility Study on Modulation-Domain Waveform Design for Physical Layer Security","authors":"Tianyu Yang;Yanshi Sun;Yunfei Chen;Li Chen","doi":"10.1109/LCOMM.2025.3549490","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3549490","url":null,"abstract":"Information security in wireless communication is imperative for emerging applications. In the field of physical layer security, power-domain and coding-domain schemes are implemented to ensure the confidentiality. However, existing methods enhance system security based on information theory, neglecting the potential in modulation process. To this end, this letter proposes a modulation-domain waveform design to capture the impact of channel fading, realizing a new dimension of security in the physical layer. Moreover, Security Symbol Ratio (SSR) is defined from a probabilistic perspective, which is more appropriate for measuring the security contribution of transmission waveform to original messages. Simulation results demonstrate the feasibility of the proposed design and the effectiveness of the SSR, especially in scenarios where the energy of received signal is inferior at the legitimate user.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"988-992"},"PeriodicalIF":3.7,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143937966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Triple Attention-Aided Vision Transformer Based AMC for RIS-Assisted MIMO-OFDM Systems Under System Impairment","authors":"Anand Kumar;Sudhan Majhi","doi":"10.1109/LCOMM.2025.3549834","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3549834","url":null,"abstract":"In this letter, we present automated modulation classification (AMC) for reconfigurable intelligent surface (RIS)-assisted multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) systems under imperfect channel state information (CSI), residual carrier frequency offset (CFO) and symbol time offset (STO) errors. We leverage a triple attention-aided vision transformer (TrpViT) architecture, which uses a vision-centric approach within the transformer network to enhance global information acquisition. The TrpViT is implemented by utilizing three complementary attention mechanisms spatial, dilated, and channel attention in a unique attention block. This unique attention block extracts spatially local features while expanding the scope to capture more comprehensive signal features. The adopted attention mechanisms effectively capture long-range spatial dependencies and channel interactions within input signals by optimizing the model complexity. The performance of the proposed method is compared against existing models and it has been demonstrated that the proposed method accurately classifies higher modulation schemes for RIS-assisted MIMO-OFDM systems. The computational complexity of the proposed model is also compared with the existing state-of-the-art.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"998-1002"},"PeriodicalIF":3.7,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143938012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Iterative Detection for Orthogonal Time Frequency Space Modulation With ADMM","authors":"Xuefeng Li;Chengzhao Shan;Honglin Zhao;Weijie Yuan;Ruoyu Zhang","doi":"10.1109/LCOMM.2025.3549525","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3549525","url":null,"abstract":"Orthogonal time frequency space (OTFS) modulation, because of its excellent performance in fast time-varying channels, has been proposed as an alternative to orthogonal frequency-division multiplexing modulation in high-mobility scenarios. Time and frequency diversity can be fully exploited in OTFS systems with proper signal detection. However, most existing signal detection algorithms are based on message passing (MP) algorithms, and their signal detection performance rapidly deteriorates when the channel has low sparsity. In this letter, we first model the OTFS signal detection problem as an optimization problem and propose an alternating direction method of multipliers (ADMM)-based algorithm to solve the problem. On this basis, we further propose a modified ADMM-based algorithm by replacing the penalty term to address the performance loss caused by constraint relaxation. The numerical results show that the proposed algorithms are effective in terms of convergence and detection performance.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"993-997"},"PeriodicalIF":3.7,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143938027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Recursive Puncturing Method for PAC Codes Based on the Partial Order","authors":"Xiaoyuan Li;Dengsheng Lin;Yue Xiao;Ming Xiao","doi":"10.1109/LCOMM.2025.3549092","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3549092","url":null,"abstract":"The development of polarization-adjusted convolutional (PAC) codes has introduced a class of efficient designs for short packet transmission. In this contribution, aiming at more flexible code length and rate matching for time-varying channel scenarios, a low-complexity puncturing algorithm for PAC codes is proposed. Specifically, we introduce a Gaussian approximation (GA) algorithm for PAC codes and propose a GA-based optimization method for punctured patterns. Building on this, we present a Gaussian inverse mapping method based on partial order, utilizing a recursive approach to construct the initial set, which significantly reduces the search complexity. Subsequently, we develop a recursive puncturing algorithm based on partial order. Finally, we integrate this method with Reed-Muller (RM) rules, further reducing the complexity.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"978-982"},"PeriodicalIF":3.7,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}