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

IEEE Communications Letters最新文献

筛选
英文 中文
STAR-RIS-Assisted Multicast Communications in DFRC-UAV-Enabled ISAC Systems 星- ris辅助多播通信在dfrc - uav支持的ISAC系统中
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-25 DOI: 10.1109/LCOMM.2024.3505896
Longshen Chen;Jia Zhu;Yulong Zou;Yulei Lou;Yizhi Li
{"title":"STAR-RIS-Assisted Multicast Communications in DFRC-UAV-Enabled ISAC Systems","authors":"Longshen Chen;Jia Zhu;Yulong Zou;Yulei Lou;Yizhi Li","doi":"10.1109/LCOMM.2024.3505896","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3505896","url":null,"abstract":"In this letter, we study a dual-function radar-communication unmanned aerial vehicle (DFRC-UAV)- enabled integrated sensing and communications (ISAC) system, and propose a simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) assisted DFRC-UAV-enabled ISAC scheme called SRaDUI, where a DFRC-UAV simultaneously senses ground targets and multicasts information to users assisted by a STAR-RIS. To improve the multicast capacity, we formulate an achievable rate maximization problem by jointly designing the scheduling of targets, the covariance matrices of the transmitted symbol vectors, the STAR-RIS coefficients, and the DFRC-UAV trajectory. To address this non-convex problem, we propose an alternating optimization (AO) based iterative algorithm, decomposing the original problem into a series of subproblems, which can be solved alternately to obtain suboptimal solutions based on the semidefinite relaxation (SDR) and successive convex approximation (SCA). Numerical results demonstrate the superiority of the proposed SRaDUI scheme and the effectiveness of the designed iterative algorithm.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 1","pages":"170-174"},"PeriodicalIF":3.7,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938384","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
RIS-Aided Dual-Polarized MIMO: How Large a Surface Is Needed to Beat Single Polarization? ris辅助双极化MIMO：需要多大的表面才能战胜单极化？
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-22 DOI: 10.1109/LCOMM.2024.3504725
Zizhou Zheng;Huan Huang;Hongliang Zhang;A. Lee Swindlehurst
{"title":"RIS-Aided Dual-Polarized MIMO: How Large a Surface Is Needed to Beat Single Polarization?","authors":"Zizhou Zheng;Huan Huang;Hongliang Zhang;A. Lee Swindlehurst","doi":"10.1109/LCOMM.2024.3504725","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3504725","url":null,"abstract":"Dual-polarized (DP) multiple-input-multiple-output (MIMO) systems have been widely adopted in commercial mobile wireless communications. Such systems achieve multiplexing and diversity gain by exploiting the polarization dimension. However, existing studies have shown that the capacity of DP MIMO may not surpass that of single-polarized (SP) MIMO systems due to the cross-polarization coupling induced by the propagation environment. In this letter, we employ reconfigurable intelligent surfaces (RISs) to address this issue and investigate how large the surface should be to ensure a better performance for DP MIMO. Specifically, we first derive the capacities of DP and SP MIMO systems with an RIS, and then study the influence of the RIS size on the system capacity. Our analyses reveal how to deploy the RIS in a DP MIMO scenario.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 1","pages":"150-154"},"PeriodicalIF":3.7,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938513","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
Weighted Sum Power Minimization for Cooperative Spectrum Sharing in Cognitive Radio Networks 认知无线电网络中协同频谱共享的加权和功率最小化算法
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-22 DOI: 10.1109/LCOMM.2024.3504957
Yang Yu;Xiaoqing Tang
{"title":"Weighted Sum Power Minimization for Cooperative Spectrum Sharing in Cognitive Radio Networks","authors":"Yang Yu;Xiaoqing Tang","doi":"10.1109/LCOMM.2024.3504957","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3504957","url":null,"abstract":"This letter introduces weighted sum power (WSP), a new performance metric for wireless resource allocation during cooperative spectrum sharing in cognitive radio networks, where the primary and secondary nodes have different priorities and quality of service (QoS) requirements. Compared to using energy efficiency (EE) and weighted sum energy efficiency (WSEE) as performance metrics and optimization objectives of wireless resource allocation towards green communication, the linear character of WSP can reduce the complexity of optimization problems. Meanwhile, the weights assigned to different nodes are beneficial for managing their power budget. Using WSP as the optimization objective, a suboptimal resource allocation scheme is proposed, leveraging linear programming and Newton’s method. Simulations verify that the proposed scheme provides near-optimal performance with low computation time. Furthermore, the initial approximate value selection in Newton’s method is also optimized to accelerate the proposed scheme.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 1","pages":"160-164"},"PeriodicalIF":3.7,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938516","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
Image-Based VLC Signal Demodulation Using Machine Learning 基于图像的VLC信号解调利用机器学习
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-22 DOI: 10.1109/LCOMM.2024.3504524
Kaleem Ullah;Maaz Salman;Javad Bolboli;Wan-Young Chung
{"title":"Image-Based VLC Signal Demodulation Using Machine Learning","authors":"Kaleem Ullah;Maaz Salman;Javad Bolboli;Wan-Young Chung","doi":"10.1109/LCOMM.2024.3504524","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3504524","url":null,"abstract":"Demodulation of visible light communication (VLC) signals using intensity modulation direct detection is limited by the noise inherent in the signal. To address this issue, we propose an enhanced machine learning (ML) image-based demodulator for on-off keying (OOK) modulated VLC signals. We designed and implemented a transmitter and receiver equipped with sensors to collect real-time environmental data. The transmission distance is varied, and the received waveform is converted into images. To minimize the computational load of the demodulator, we apply bicubic interpolation and image thresholding techniques to these images. Subsequently, we developed an ML-based demodulator using MobileNetV2 and trained the model with the collected dataset. To enhance the model’s versatility and accuracy, we used data augmentation techniques. Experimental results indicate that the proposed ML-driven demodulator significantly extends the communication range and increases noise tolerance, achieving a demodulation accuracy of 97.58%.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 1","pages":"145-149"},"PeriodicalIF":3.7,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938512","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
Strategic Backoff of Slotted ALOHA for Minimal Age of Information 最小信息时代开槽式ALOHA的战略撤退
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-22 DOI: 10.1109/LCOMM.2024.3504745
Alessandro Buratto;Andrea Munari;Leonardo Badia
{"title":"Strategic Backoff of Slotted ALOHA for Minimal Age of Information","authors":"Alessandro Buratto;Andrea Munari;Leonardo Badia","doi":"10.1109/LCOMM.2024.3504745","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3504745","url":null,"abstract":"Random access protocols are usually adopted in the Internet of Things to enable uncoordinated medium sharing. Tackling this setting, we explore the statistics of the packet inter-delivery times under slotted ALOHA contention, considering two backoff schemes (reactive vs. proactive). We further discuss the efficiency of these schemes in minimizing the average age of information. Finally, we investigate age minimization both as a centralized optimization and via game theory, obtaining numerical solutions for both cases. A reactive scheme applied in a centralized manner is found to be the most suitable to systems that require a bounded age, whereas a proactive solution applied distributedly is best used to minimize the average age.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 1","pages":"155-159"},"PeriodicalIF":3.7,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10764733","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938514","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
Full-Duplex Beyond Self-Interference: The Unlimited Sensing Way 超越自干扰的全双工：无限传感方式
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-22 DOI: 10.1109/LCOMM.2024.3505054
Ziang Liu;Ayush Bhandari;Bruno Clerckx
{"title":"Full-Duplex Beyond Self-Interference: The Unlimited Sensing Way","authors":"Ziang Liu;Ayush Bhandari;Bruno Clerckx","doi":"10.1109/LCOMM.2024.3505054","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3505054","url":null,"abstract":"The success of full-stack full-duplex communication systems depends on how effectively one can achieve digital self-interference cancellation (SIC). Towards this end, in this letter, we consider unlimited sensing framework (USF) enabled full-duplex system. We show that by injecting folding non-linearities in the sensing pipeline, one can not only suppress self-interference but also recover the signal of interest (SoI). This approach leads to novel design of the receiver architecture that is complemented by a modulo-domain channel estimation method. We then demonstrate the advantages of \u0000<inline-formula> <tex-math>$mathscr {M}_{lambda } $ </tex-math></inline-formula>\u0000-ADC by analyzing the relationship between quantization noise, quantization bits, and dynamic range. Numerical experiments show that the USF enabled receiver structure can achieve up to 40 dB digital SIC by using as few as 4-bits per sample. Our method outperforms the previous approach based on adaptive filters when it comes to digital SIC performance, SoI reconstruction, and detection.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 1","pages":"165-169"},"PeriodicalIF":3.7,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938515","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
Information Rates of Channels With Additive White Cauchy Noise 加性柯西白噪声信道的信息率
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-20 DOI: 10.1109/LCOMM.2024.3502753
Shuqin Pang;Wenyi Zhang
{"title":"Information Rates of Channels With Additive White Cauchy Noise","authors":"Shuqin Pang;Wenyi Zhang","doi":"10.1109/LCOMM.2024.3502753","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3502753","url":null,"abstract":"Information transmission over discrete-time channels with memoryless additive noise obeying a Cauchy, rather than Gaussian, distribution, are studied. The channel input satisfies an average power constraint. Upper and lower bounds to such additive white Cauchy noise (AWCN) channel capacity are established. In the high input power regime, the gap between upper and lower bounds is within 0.5 nats per channel use, and the lower bound can be achieved with Gaussian input. In the lower input power regime, the capacity can be asymptotically approached by employing antipodal input. It is shown that the AWCN decoder can be applied to additive white Gaussian noise (AWGN) channels with negligible rate loss, while the AWGN decoder when applied to AWCN channels cannot ensure reliable decoding. For the vector receiver case, it is shown that a linear combining receiver front end loses the channel combining gain, a phenomenon drastically different from AWGN vector channels.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 1","pages":"115-119"},"PeriodicalIF":3.7,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142940872","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 Indoor Localization Against Adversarial Attacks Using DCGAN 利用DCGAN对抗对抗性攻击的安全室内定位
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-20 DOI: 10.1109/LCOMM.2024.3503721
Qingli Yan;Wang Xiong;Hui-Ming Wang
{"title":"Secure Indoor Localization Against Adversarial Attacks Using DCGAN","authors":"Qingli Yan;Wang Xiong;Hui-Ming Wang","doi":"10.1109/LCOMM.2024.3503721","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3503721","url":null,"abstract":"The vulnerability of deep learning-based indoor Wi-Fi fingerprint localization methods to adversarial attacks significantly reduces localization performance. To overcome this challenge, we propose a defense strategy employing a deep convolutional generative adversarial network (DCGAN) to enhance the security of channel state information (CSI)-based localization methods while maintaining accuracy. Our approach eliminates adversarial perturbations before the adversarial samples are fed into the deep learning model for localization. The localization performance of the proposed DCGAN is evaluated through experiments conducted with commodity Wi-Fi devices in representative indoor environments. Experimental results demonstrate that the DCGAN model effectively mitigates adversarial interference while maintaining excellent localization accuracy under two white-box attacks and one black-box attack.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 1","pages":"130-134"},"PeriodicalIF":3.7,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938365","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
Constellation Constraint-Based Superposed 32QAM Scheme for NOMA System 基于星座约束的NOMA系统32QAM叠加方案
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-20 DOI: 10.1109/LCOMM.2024.3503285
Chuxian Wang;Honghao Shi;Zhiyong Luo
{"title":"Constellation Constraint-Based Superposed 32QAM Scheme for NOMA System","authors":"Chuxian Wang;Honghao Shi;Zhiyong Luo","doi":"10.1109/LCOMM.2024.3503285","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3503285","url":null,"abstract":"In this letter, an odd-order superposed modulation scheme is studied in non-orthogonal multiple access (NOMA) system. Firstly, we design a novel superposed 32-quadrature amplitude modulation (QAM) constellation superposed by a novel 8QAM and quadrature phase shift keying (QPSK), where joint coding between QPSK and 8QAM is performed for 8QAM signal rotation. Then, a simplified optimal power allocation algorithm is given by maximizing the constellation constrained (CC) capacity at high SNR for obtaining optimal superposed constellation. Comparing with the superposed 32-phase-shift keying (PSK) scheme, our proposed scheme employing successive interference cancellation (SIC) for detection has a lower decoding complexity. Moreover, a wider power coefficient ratio range at the threshold of mutual information (MI) greater than 4.98 is achieved by our proposed scheme. It also demonstrates that the MI and BER performances of proposed scheme outperform than those of the other three schemes when the power coefficient ratio is optimal at high signal-to-noise ratio (SNR).","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 1","pages":"120-124"},"PeriodicalIF":3.7,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938507","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
Enhancing Sum-Rate Performance in Constrained Multicell Networks: A Low-Information Exchange Approach 增强约束多小区网络的和速率性能：一种低信息交换方法
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-20 DOI: 10.1109/LCOMM.2024.3503656
Youjin Kim;Jonggyu Jang;Hyun Jong Yang
{"title":"Enhancing Sum-Rate Performance in Constrained Multicell Networks: A Low-Information Exchange Approach","authors":"Youjin Kim;Jonggyu Jang;Hyun Jong Yang","doi":"10.1109/LCOMM.2024.3503656","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3503656","url":null,"abstract":"Despite the extensive research on massive multi-input multi-output (MIMO) systems for 5G telecommunications and beyond, the reality is that many deployed base stations are equipped with a limited number of antennas rather than supporting massive MIMO configurations. Furthermore, while the cell-less network concept, which eliminates cell boundaries, is under investigation, practical deployments often grapple with significantly limited backhaul connection capacities between base stations. This letter explores techniques to maximize the sum-rate performance within the constraints of these more realistically equipped multicell networks. We propose an innovative approach that dramatically reduces the need for information exchange between base stations to a mere few bits, in stark contrast to conventional methods that require the exchange of hundreds of bits. Our proposed method not only addresses the limitations imposed by current network infrastructure but also showcases significantly improved performance under these constrained conditions.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 1","pages":"125-129"},"PeriodicalIF":3.7,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938508","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学术官方微信