IEEE Networking Letters最新文献

筛选
英文 中文
Channel Aging-Aware LSTM-Based Channel Prediction for Satellite Communications 基于信道老化感知 LSTM 的卫星通信信道预测
IEEE Networking Letters Pub Date : 2024-08-14 DOI: 10.1109/LNET.2024.3444495
Omid Abbasi;Georges Kaddoum
{"title":"Channel Aging-Aware LSTM-Based Channel Prediction for Satellite Communications","authors":"Omid Abbasi;Georges Kaddoum","doi":"10.1109/LNET.2024.3444495","DOIUrl":"https://doi.org/10.1109/LNET.2024.3444495","url":null,"abstract":"Satellite communication systems encounter channel aging issues due to the substantial distance that separates users and satellites. In such systems, the estimated channel state at a given time slot reflects the channel state from several time slots in the past. This letter proposes a long short-term memory (LSTM)-based architecture for channel prediction to mitigate the channel aging problem. The proposed scheme predicts the next time slot’s channel based on a block of estimated channel state information (CSI) from previous time slots. We consider the effect of channel aging in the training phase so that channel prediction in the testing phase is performed based on available data. We demonstrated through simulation experiments on new radio non-terrestrial network tapped delay line (NR NTN TDL) channel models, that our proposed scheme can effectively mitigate channel aging, and that it performs better than outdated channels. The proposed scheme improves the reliability and efficiency of satellite communication systems with long propagation delays.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 3","pages":"183-187"},"PeriodicalIF":0.0,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Introducing Adaptive Continuous Adversarial Training (ACAT) to Enhance Machine Learning Robustness 引入自适应连续对抗训练 (ACAT) 增强机器学习的鲁棒性
IEEE Networking Letters Pub Date : 2024-08-13 DOI: 10.1109/LNET.2024.3442833
Mohamed elShehaby;Aditya Kotha;Ashraf Matrawy
{"title":"Introducing Adaptive Continuous Adversarial Training (ACAT) to Enhance Machine Learning Robustness","authors":"Mohamed elShehaby;Aditya Kotha;Ashraf Matrawy","doi":"10.1109/LNET.2024.3442833","DOIUrl":"https://doi.org/10.1109/LNET.2024.3442833","url":null,"abstract":"Adversarial training enhances the robustness of Machine Learning (ML) models against adversarial attacks. However, obtaining labeled training and adversarial training data in network/cybersecurity domains is challenging and costly. Therefore, this letter introduces Adaptive Continuous Adversarial Training (ACAT), a novel method that integrates adversarial training samples into the model during continuous learning sessions using real-world detected adversarial data. Experimental results with a SPAM detection dataset demonstrate that ACAT reduces the time required for adversarial sample detection compared to traditional processes (up to 4 times faster when dealing with 10,000 samples). Moreover, the accuracy of the under-attack ML-based SPAM filter increased from 69% to over 88% after just three retraining sessions.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 3","pages":"208-212"},"PeriodicalIF":0.0,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142518018","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Packet Sequence Permutation-Aware Approach to Robust Network Traffic Classification 稳健网络流量分类的数据包序列突变感知方法
IEEE Networking Letters Pub Date : 2024-07-30 DOI: 10.1109/LNET.2024.3435723
Yanzhuo Jiang;Xueman Wang;Yingxu Lai;Yipeng Wang
{"title":"A Packet Sequence Permutation-Aware Approach to Robust Network Traffic Classification","authors":"Yanzhuo Jiang;Xueman Wang;Yingxu Lai;Yipeng Wang","doi":"10.1109/LNET.2024.3435723","DOIUrl":"https://doi.org/10.1109/LNET.2024.3435723","url":null,"abstract":"Anomalies in packet length sequences caused by network topology structure and congestion greatly impact the performance of early network traffic classification. Additionally, insufficient differentiation of packet length sequences using a small number of packets also affects the performance. In this letter, we propose SePeric, a packet sequence permutation-aware approach to robust network traffic classification. By exploring the correlations within packet length sequences and adjusting them to eliminate the effects of anomalous sequence orders, as well as extracting additional features from the byte sequence of the first packet to supplement the insufficient differentiation in packet length sequences.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 3","pages":"203-207"},"PeriodicalIF":0.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142518020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Risk-Averse Outage Probability Minimization Method for RIS-Aided RSMA Systems RIS 辅助 RSMA 系统的风险规避停机概率最小化方法
IEEE Networking Letters Pub Date : 2024-07-18 DOI: 10.1109/LNET.2024.3430313
Yousef N. Shnaiwer;Megumi Kaneko
{"title":"A Risk-Averse Outage Probability Minimization Method for RIS-Aided RSMA Systems","authors":"Yousef N. Shnaiwer;Megumi Kaneko","doi":"10.1109/LNET.2024.3430313","DOIUrl":"https://doi.org/10.1109/LNET.2024.3430313","url":null,"abstract":"This letter presents a novel method for optimizing the outage performance of Reconfigurable Intelligent Surfaces (RIS)-assisted Rate-Splitting Multiple Access (RSMA) systems. The objective is to minimize the maximum outage probability for all messages to improve fairness. A new formulation based on minimizing the Entropic Value-at-Risk (EVaR) of the perceived minimum rate among all messages in the system is proposed to simplify the objective. We show that this formulation is equivalent to minimizing an upper bound on the maximum outage probability, then we transform it into a tractable smooth problem by devising a twice-differentiable approximation to it. In addition to its lower complexity, our method is shown by numerical results to outperform two benchmarks, namely, Discrete Exhaustive Search (DES) and Sequential Quadratic Programming (SQP)-based search methods.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 3","pages":"173-178"},"PeriodicalIF":0.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mobile Network Configuration Recommendation Using Deep Generative Graph Neural Network 使用深度生成图神经网络推荐移动网络配置
IEEE Networking Letters Pub Date : 2024-07-03 DOI: 10.1109/LNET.2024.3422482
Shirwan Piroti;Ashima Chawla;Tahar Zanouda
{"title":"Mobile Network Configuration Recommendation Using Deep Generative Graph Neural Network","authors":"Shirwan Piroti;Ashima Chawla;Tahar Zanouda","doi":"10.1109/LNET.2024.3422482","DOIUrl":"https://doi.org/10.1109/LNET.2024.3422482","url":null,"abstract":"There are vast number of configurable parameters in a Radio Access Telecom Network. A significant amount of these parameters is configured by Radio Node or cell based on their deployment setting. Traditional methods rely on domain knowledge for individual parameter configuration, often leading to sub-optimal results. To improve this, a framework using a Deep Generative Graph Neural Network (GNN) is proposed. It encodes the network into a graph, extracts subgraphs for each RAN node, and employs a Siamese GNN (S-GNN) to learn embeddings. The framework recommends configuration parameters for a multitude of parameters and detects misconfigurations, handling both network expansion and existing cell reconfiguration. Tested on real-world data, the model surpasses baselines, demonstrating accuracy, generalizability, and robustness against concept drift.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 3","pages":"179-182"},"PeriodicalIF":0.0,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142518017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Online Slice Admission Control Scheme in Next Generation Networks 下一代网络中的高效在线分片接入控制方案
IEEE Networking Letters Pub Date : 2024-06-19 DOI: 10.1109/LNET.2024.3416555
Solomon Orduen Yese;Sara Berri;Arsenia Chorti
{"title":"Efficient Online Slice Admission Control Scheme in Next Generation Networks","authors":"Solomon Orduen Yese;Sara Berri;Arsenia Chorti","doi":"10.1109/LNET.2024.3416555","DOIUrl":"https://doi.org/10.1109/LNET.2024.3416555","url":null,"abstract":"This letter proposes a slice admission control scheme to maximize profit and resource utilization. It considers an online scenario where the infrastructure provider (InP) does not have full knowledge of future requests and requests can renege after their waiting time is exceeded. Moreover, it employs a dynamic priority and a capacity sharing mechanism to buy back idle resources from already accepted slices. The performance evaluation demonstrates that the proposed algorithm yields about 26%, 7%, and 7.3% higher profit, acceptance rate and resource utilization gains over the state of the art schemes, respectively.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 3","pages":"163-167"},"PeriodicalIF":0.0,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IEEE COMMUNICATIONS SOCIETY IEEE 通信学会
IEEE Networking Letters Pub Date : 2024-06-06 DOI: 10.1109/LNET.2024.3401267
{"title":"IEEE COMMUNICATIONS SOCIETY","authors":"","doi":"10.1109/LNET.2024.3401267","DOIUrl":"https://doi.org/10.1109/LNET.2024.3401267","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"C2-C2"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10551662","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IEEE Communications Society 电气和电子工程师学会通信协会
IEEE Networking Letters Pub Date : 2024-06-06 DOI: 10.1109/LNET.2024.3401331
{"title":"IEEE Communications Society","authors":"","doi":"10.1109/LNET.2024.3401331","DOIUrl":"https://doi.org/10.1109/LNET.2024.3401331","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"C3-C3"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10551674","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IEEE Networking Letters Author Guidelines IEEE Networking Letters 作者指南
IEEE Networking Letters Pub Date : 2024-06-06 DOI: 10.1109/LNET.2024.3401329
{"title":"IEEE Networking Letters Author Guidelines","authors":"","doi":"10.1109/LNET.2024.3401329","DOIUrl":"https://doi.org/10.1109/LNET.2024.3401329","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"156-157"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10551677","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhancing Mobile Networks for Urban Air Mobility Connectivity 增强移动网络的城市空中交通连接性
IEEE Networking Letters Pub Date : 2024-04-17 DOI: 10.1109/LNET.2024.3390610
Alex Piccioni;Andrea Marotta;Claudia Rinaldi;Fabio Graziosi
{"title":"Enhancing Mobile Networks for Urban Air Mobility Connectivity","authors":"Alex Piccioni;Andrea Marotta;Claudia Rinaldi;Fabio Graziosi","doi":"10.1109/LNET.2024.3390610","DOIUrl":"https://doi.org/10.1109/LNET.2024.3390610","url":null,"abstract":"Aerial technologies represent a fundamental part of transport systems, and the overload of terrestrial transportation as well as the high demand in urban scenarios are forcing for new solutions. From this perspective, Urban Air Mobility (UAM) is emerging as an outperforming solution to guarantee high-speed vertical transportation taking advantage of low altitudes. Connectivity is a key factor for UAM vehicles, and mobile networks represent the best solution to provide immediate connectivity with high-performance and low expenses. This calls for the development of enhancement strategies for terrestrial radio access networks. This letter aims to investigate a strategy to provide connectivity for UAM vehicles while minimizing the number of base stations required to provide UAM connectivity. Insights on the impact of different design parameters on the number of enhanced BSs required to guarantee average and minimum throughput requirements for UAM users are provided.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"110-114"},"PeriodicalIF":0.0,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10504640","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","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学术文献互助群
群 号:604180095
Book学术官方微信