发布求助
文献互助 智能选刊 最新文献

IEEE Communications Letters最新文献

筛选
英文 中文
Data Service Maximization in Space-Air-Ground Integrated 6G Networks 空地一体化 6G 网络中的数据服务最大化
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-23 DOI: 10.1109/LCOMM.2024.3465500
Nway Nway Ei;Kitae Kim;Yan Kyaw Tun;Zhu Han;Choong Seon Hong
{"title":"Data Service Maximization in Space-Air-Ground Integrated 6G Networks","authors":"Nway Nway Ei;Kitae Kim;Yan Kyaw Tun;Zhu Han;Choong Seon Hong","doi":"10.1109/LCOMM.2024.3465500","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3465500","url":null,"abstract":"Integrating terrestrial and non-terrestrial networks has emerged as a promising paradigm to fulfill the constantly growing demand for connectivity, low transmission delay, and quality of services (QoS). This integration brings together the strengths of the reliability of terrestrial networks, broad coverage and service continuity of non-terrestrial networks like low earth orbit satellites (LEOSats), etc. In this work, we study a data service maximization problem in space-air-ground integrated network (SAGIN) where the ground base stations (GBSs) and LEOSats cooperatively serve the coexisting aerial users (AUs) and ground users (GUs). Then, by considering the spectrum scarcity, interference, and QoS requirements of the users, we jointly optimize the user association, AU’s trajectory, and power allocation. To address the formulated mixed-integer non-convex problem, we decompose it into two subproblems: 1) user association problem and 2) trajectory and power allocation problem. We formulate the user association problem as a binary integer programming problem and solve it by using the Gurobi optimizer. Meanwhile, the trajectory and power allocation problem is solved by the deep deterministic policy gradient (DDPG) method to cope with the problem’s non-convexity and dynamic network environments. Then, the two subproblems are alternately solved by the proposed block coordinate descent algorithm. By comparing with the baselines in the existing literature, extensive simulations are conducted to evaluate the performance of the proposed framework.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2598-2602"},"PeriodicalIF":3.7,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600109","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}
引用次数: 0
Doppler Shift Compensation Assisted by RIS Systems in High-Mobility Communications 高移动性通信中的 RIS 系统辅助多普勒频移补偿
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-23 DOI: 10.1109/LCOMM.2024.3466562
Pedro H. C. de Souza;Luciano Mendes
{"title":"Doppler Shift Compensation Assisted by RIS Systems in High-Mobility Communications","authors":"Pedro H. C. de Souza;Luciano Mendes","doi":"10.1109/LCOMM.2024.3466562","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3466562","url":null,"abstract":"The Doppler shift in the signal frequency caused by the relative movement of the receiver is considered to be detrimental for communication systems. Although this problem has been studied extensively, it is still relevant given the renewed interest on high-mobility communications. On the other hand, novel solutions such as the reconfigurable intelligent surface (RIS) can be repurposed for tackling the Doppler shift in high-mobility communication systems. Despite not being its usual primary goal, we show in this work that the RIS can compensate the Doppler shift at a small cost in performance.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2658-2662"},"PeriodicalIF":3.7,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600257","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}
引用次数: 0
Molecular Communications Based on Probabilistic Constellation Shaping: Optimal Detection and Performance Analysis 基于概率星座整形的分子通信：最佳检测和性能分析
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-20 DOI: 10.1109/LCOMM.2024.3464695
Jingcan Chen;Yuankun Tang;Miaowen Wen;Liping Li
{"title":"Molecular Communications Based on Probabilistic Constellation Shaping: Optimal Detection and Performance Analysis","authors":"Jingcan Chen;Yuankun Tang;Miaowen Wen;Liping Li","doi":"10.1109/LCOMM.2024.3464695","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3464695","url":null,"abstract":"Probabilistic constellation shaping (PCS) has been shown to be effective for molecular communications. Reed-Solomon coded PCS (RS-PCS) is one of the promising realizations proposed recently that combines PCS and channel coding through a parallel transmitter structure. However, the current receiver designed for RS-PCS often misdetects the intra-sequence interference (IEI), resulting in a performance gap. To address this shortcoming, we propose two performance-enhanced detectors. The first one combines increase detection algorithm (IDA) and RS-PCS to enhance the accuracy of IEI detection. The second one is the joint maximum-likelihood detection (joint ML) that has the optimal performance in terms of bit error rate (BER), which is derived theoretically. Simulation results verify their better performance than existing RS-PCS schemes.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2508-2512"},"PeriodicalIF":3.7,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636279","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}
引用次数: 0
Optimization of Delayed Bit-Interleaved Coded Modulation in the High-SNR Regime 高 SNR 状态下的延迟比特交织编码调制优化
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-20 DOI: 10.1109/LCOMM.2024.3464873
Harindu Jayarathne;Dileepa Marasinghe;Nandana Rajatheva;Matti Latva-Aho
{"title":"Optimization of Delayed Bit-Interleaved Coded Modulation in the High-SNR Regime","authors":"Harindu Jayarathne;Dileepa Marasinghe;Nandana Rajatheva;Matti Latva-Aho","doi":"10.1109/LCOMM.2024.3464873","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3464873","url":null,"abstract":"In this letter, we investigate the capacity of delay schemes in delayed bit-interleaved coded modulation (DBICM) at high signal-to-noise ratios (SNR) using alternative methods to numerical integration. A closed-form formula is derived to approximate the DBICM capacity at high SNR. For Gray codes, DBICM capacity is proven as asymptotically optimal irrespective of the delay scheme and we further characterize the minute variations in finite SNR values. Compared to BICM using the binary reflected Gray Code, an improvement of 0.1 dB in the BER performance is achieved using a non-Gray bit-labeling combined with its optimized DBICM delay scheme.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2588-2592"},"PeriodicalIF":3.7,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10684762","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600287","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}
引用次数: 0
Adversarial Samples Detection Based on Feature Attribution and Contrast in Modulation Recognition 调制识别中基于特征归属和对比度的对抗样本检测
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-19 DOI: 10.1109/LCOMM.2024.3463949
Wenyu Wang;Lei Zhu;Yuantao Gu;Yufan Chen;Xingyu Zhou;Lu Yu
{"title":"Adversarial Samples Detection Based on Feature Attribution and Contrast in Modulation Recognition","authors":"Wenyu Wang;Lei Zhu;Yuantao Gu;Yufan Chen;Xingyu Zhou;Lu Yu","doi":"10.1109/LCOMM.2024.3463949","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3463949","url":null,"abstract":"Detecting adversarial samples is crucial for maintaining the security of automatic modulation recognition (AMR) systems, as adversarial attacks could severely compromise wireless communication. To address this threat, we propose a novel adversarial samples detection method named Null Feature Attribution Abnormality (NFAA), which leverages the target model’s interpretation of feature importance to distinguish between benign and adversarial signal samples. Furthermore, we propose the NFAA-TC method, incorporating a Triple Contrast (TC) approach to mitigate noise in signal data and enhance the performance of adversarial samples detection. Experimental results validate the effectiveness of the proposed method across various adversarial attacks and under different signal-to-noise ratio (SNR) conditions.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2483-2487"},"PeriodicalIF":3.7,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636334","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}
引用次数: 0
Coupled Phase-Shift STAR-RIS for Secure MIMO Communication: A DRL-Based Beamforming Design 用于安全 MIMO 通信的耦合相移 STAR-RIS：基于 DRL 的波束成形设计
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-18 DOI: 10.1109/LCOMM.2024.3462798
Zhengyu Zhu;Hongxu Wang;Gangcan Sun;Xingwang Li;Zhengyang Shen;Yuanwei Liu;Jianhua Zhang
{"title":"Coupled Phase-Shift STAR-RIS for Secure MIMO Communication: A DRL-Based Beamforming Design","authors":"Zhengyu Zhu;Hongxu Wang;Gangcan Sun;Xingwang Li;Zhengyang Shen;Yuanwei Liu;Jianhua Zhang","doi":"10.1109/LCOMM.2024.3462798","DOIUrl":"10.1109/LCOMM.2024.3462798","url":null,"abstract":"A simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) aided multiple-input multiple-output (MIMO) secure communication system is explored. A practical coupled phase-shift model of STAR-RIS is taken into account for beamforming design. Based on this model, a joint active and passive beamforming optimization problem is formulate to maximize the long-term sum secrecy rate of transmission and reflection users. An efficient deep reinforcement learning (DRL)-based algorithm is proposed to address the multivariate coupling issue in the joint beamforming design problem. Simulation results show that: 1) All STAR-RIS schemes can achieve better secrecy performance gain than the conventional RIS; 2) Compared to the optimal independent phase shifts, couple phase shifts of STAR-RIS only lead to a slight performance loss.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2488-2492"},"PeriodicalIF":3.7,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142249427","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}
引用次数: 0
An Effective Network With Discrete Latent Representation Designed for Massive MIMO CSI Feedback 为大规模多输入多输出 CSI 反馈设计的具有离散潜伏表示的有效网络
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-18 DOI: 10.1109/LCOMM.2024.3462977
Xinran Sun;Zhengming Zhang;Chunguo Li;Yongming Huang;Luxi Yang
{"title":"An Effective Network With Discrete Latent Representation Designed for Massive MIMO CSI Feedback","authors":"Xinran Sun;Zhengming Zhang;Chunguo Li;Yongming Huang;Luxi Yang","doi":"10.1109/LCOMM.2024.3462977","DOIUrl":"10.1109/LCOMM.2024.3462977","url":null,"abstract":"The efficacy of massive multiple-input multiple-output techniques heavily relies on the accuracy of the downlink channel state information (CSI) in frequency division duplexing systems. Many works focus on CSI compression and quantization to enhance the CSI reconstruction accuracy with lower overhead of downlink pilots and uplink feedback. In this letter, an advanced network named Conformer is first introduced for CSI compression, which combines self-attention mechanisms and convolution to efficiently extract both global and detailed CSI features. In order to further reduce the feedback overhead, we also propose a vector quantization scheme based on the discrete latent representation of the vector quantised-variational autoencoder (VQ-VAE), namely VQCFB. Integrating Conformer blocks with VQCFB, the proposed encoder-quantizer-decoder framework achieves high-quality CSI reconstruction with low feedback overhead, outperforming previous state-of-the-art networks.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2648-2652"},"PeriodicalIF":3.7,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142249429","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}
引用次数: 0
Power Allocation for Finite-Blocklength IR-HARQ 有限块长 IR-HARQ 的功率分配
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-17 DOI: 10.1109/LCOMM.2024.3462828
Wenyu Wang;Minhao Zhu;Kaiming Shen;Zhaorui Wang;Shuguang Cui
{"title":"Power Allocation for Finite-Blocklength IR-HARQ","authors":"Wenyu Wang;Minhao Zhu;Kaiming Shen;Zhaorui Wang;Shuguang Cui","doi":"10.1109/LCOMM.2024.3462828","DOIUrl":"10.1109/LCOMM.2024.3462828","url":null,"abstract":"This letter concerns the power allocation across the multiple transmission rounds under the Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ) policy, in pursuit of an energy-efficient way of fulfilling the outage probability target in the finite-blocklength regime. We start by showing that the optimization objective and the constraints of the above power allocation problem all depend upon the outage probability. The main challenge then lies in the fact that the outage probability cannot be written analytically in terms of the power variables. To sidestep this difficulty, we propose a novel upper bound on the outage probability in the finite-blocklength regime, which is much tighter than the existing ones from the literature. Most importantly, by using this upper bound to approximate the outage probability, we can recast the original intractable power allocation problem into a geometric programming (GP) form—which can be efficiently solved by the standard method.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2673-2677"},"PeriodicalIF":3.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142249428","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}
引用次数: 0
Secure Over-the-Air Computation for Wireless Sensor Network 无线传感器网络的空中安全计算
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-16 DOI: 10.1109/LCOMM.2024.3461793
Boxiang He;Fanggang Wang;Zihan Chen;Guangyang Zhang;Tony Q. S. Quek
{"title":"Secure Over-the-Air Computation for Wireless Sensor Network","authors":"Boxiang He;Fanggang Wang;Zihan Chen;Guangyang Zhang;Tony Q. S. Quek","doi":"10.1109/LCOMM.2024.3461793","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3461793","url":null,"abstract":"Over-the-air computation (AirComp) has been shown to provide a significantly higher efficiency than the traditional separating communication and computation tasks in the large-scale wireless sensor network. However, the presence of the malicious active eavesdropper in the network poses a severe security threat, as the eavesdropper can not only intercept aggregated information but also interfere with legitimate transmissions. To address the issue, we first derive the closed-form expressions that characterize both the approximation level and the security level of AirComp in the presence of active eavesdropping. Then, we jointly design the power allocation, the sensor selection, the artificial noise, and the receiver filter to minimize the approximation level subject to the required security level and the power budget constraint. Finally, the penalty dual decomposition scheme is proposed to solve the approximation level minimization problem, which is NP-hard due to the integer-programming nature and coupling properties of the optimization variables. Numerical results show that our scheme significantly outperforms the existing method.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2503-2507"},"PeriodicalIF":3.7,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636375","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}
引用次数: 0
Dynamic Graph Temporal-Frequency Dual-Channel Network for Multi-band Spectrum Prediction 用于多频段频谱预测的动态图时频双通道网络
IF 4.1 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-12 DOI: 10.1109/lcomm.2024.3451536
Xing Guo, Yitao Xu, Jiachen Sun, Guoru Ding, Fandi Lin, Yehui Song
{"title":"Dynamic Graph Temporal-Frequency Dual-Channel Network for Multi-band Spectrum Prediction","authors":"Xing Guo, Yitao Xu, Jiachen Sun, Guoru Ding, Fandi Lin, Yehui Song","doi":"10.1109/lcomm.2024.3451536","DOIUrl":"https://doi.org/10.1109/lcomm.2024.3451536","url":null,"abstract":"","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"394 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142190001","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信