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

IEEE Networking Letters最新文献

筛选
英文 中文
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
Secure Private Blockchain-Based Instant Messaging Platform for Social Media Services 基于安全私有区块链的社交媒体服务即时通讯平台
IEEE Networking Letters Pub Date : 2024-04-10 DOI: 10.1109/LNET.2024.3386974
Marc Jayson Baucas;Petros Spachos
{"title":"Secure Private Blockchain-Based Instant Messaging Platform for Social Media Services","authors":"Marc Jayson Baucas;Petros Spachos","doi":"10.1109/LNET.2024.3386974","DOIUrl":"https://doi.org/10.1109/LNET.2024.3386974","url":null,"abstract":"Social media services enable global communication via instant messaging (IM) platforms. However, their widespread usage has resulted in server regulation issues because most are centralized, while they also pose privacy concerns due to endpoint-based security vulnerabilities. In response, we present a private blockchain-based IM platform that utilizes blockchains to secure data through immutability. We implement it in a RESTful Application Programming Interface (REST API) Web server for better load balancing compared to the centralized IM architectures via decentralization. We further implement end-to-end encryption (E2EE) using public-private key pairs to improve data privacy. We evaluated the proposed design by highlighting its advantages over centralized IM platforms.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"106-109"},"PeriodicalIF":0.0,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286738","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
DSND: Delay-Sensitive Network Design Scheme for Multi-Service Slice Networks DSND：多服务切片网络的延迟敏感型网络设计方案
IEEE Networking Letters Pub Date : 2024-04-04 DOI: 10.1109/LNET.2024.3385008
Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki
{"title":"DSND: Delay-Sensitive Network Design Scheme for Multi-Service Slice Networks","authors":"Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki","doi":"10.1109/LNET.2024.3385008","DOIUrl":"https://doi.org/10.1109/LNET.2024.3385008","url":null,"abstract":"This letter proposes a delay-sensitive network design scheme, DSND, for multi-service slice networks. DSND contributes to a virtual processing system where users can share the same application space regardless of distance-related delays. DSND introduces the service slice and service virtual time concepts. A service slice is a virtual network comprising user and server nodes. A service virtual time is a time for eliminating the difference in delay caused by distance, and the user’s events are reordered in occurrence order. The difference between the current time and the service virtual time is the end-to-end delay shared by all users within the same service slice. We formulate DSND as an integer linear programming problem and compare the delays between DSND to a benchmark scheme where each user selects the closest server. Numerical results indicate that DSND can reduce the delay by 4–38 percent compared to the benchmark scheme.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"143-147"},"PeriodicalIF":0.0,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286635","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
Price-Discrimination Game for Distributed Resource Management in Federated Learning 联合学习中分布式资源管理的价格歧视博弈
IEEE Networking Letters Pub Date : 2024-04-04 DOI: 10.1109/LNET.2024.3385679
Han Zhang;Halvin Yang;Guopeng Zhang
{"title":"Price-Discrimination Game for Distributed Resource Management in Federated Learning","authors":"Han Zhang;Halvin Yang;Guopeng Zhang","doi":"10.1109/LNET.2024.3385679","DOIUrl":"https://doi.org/10.1109/LNET.2024.3385679","url":null,"abstract":"In federated learning (FL) systems, the parameter server (PS) and clients form a monopolistic market, where the number of PS is far less than the number of clients. To improve the performance of FL and reduce the cost to incentive clients, this letter suggests distinguishing the pricing of FL services provided by different clients, rather than applying the same pricing to them. The price is differentiated based on the performance improvements brought to FL by clients and their heterogeneity in computing and communication capabilities. To this end, a price-discrimination game (PDG) is formulated to comprehensively address the distributed resource management problems in FL, including multi-objective trade-off, client selection, and incentive mechanism. As the PDG includes a mixed-integer nonlinear programming problem, a distributed semi-heuristic algorithm with low computational complexity and low communication overhead is designed to solve the Nash equilibrium (NE) of the PDG. The simulation result verifies that the NE achieves a good tradeoff between the training loss, training time, and the cost of motivating clients to participate in FL.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 2","pages":"124-128"},"PeriodicalIF":0.0,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141286613","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
首页 上一页 下一页 尾页
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学术官方微信