Pub Date : 2024-07-18DOI: 10.1109/LNET.2024.3430313
Yousef N. Shnaiwer;Megumi Kaneko
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.
{"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}
Pub Date : 2024-07-03DOI: 10.1109/LNET.2024.3422482
Shirwan Piroti;Ashima Chawla;Tahar Zanouda
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.
无线接入电信网络中有大量可配置参数。其中大量参数由无线节点或小区根据其部署设置进行配置。传统方法依赖领域知识进行单个参数配置，往往会导致次优结果。为了改善这种情况，我们提出了一个使用深度生成图神经网络（GNN）的框架。它将网络编码成图，为每个 RAN 节点提取子图，并采用连体 GNN（S-GNN）来学习嵌入。该框架为众多参数推荐配置参数，并检测错误配置，同时处理网络扩展和现有小区的重新配置。该模型在真实世界数据上进行了测试，其准确性、通用性和对概念漂移的稳健性均超过了基准。
{"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}
Pub Date : 2024-06-19DOI: 10.1109/LNET.2024.3416555
Solomon Orduen Yese;Sara Berri;Arsenia Chorti
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.
{"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}
Pub Date : 2024-04-17DOI: 10.1109/LNET.2024.3390610
Alex Piccioni;Andrea Marotta;Claudia Rinaldi;Fabio Graziosi
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.
{"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}
Pub Date : 2024-04-10DOI: 10.1109/LNET.2024.3386974
Marc Jayson Baucas;Petros Spachos
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.
{"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}
Pub Date : 2024-04-04DOI: 10.1109/LNET.2024.3385008
Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki
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.
{"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}
Pub Date : 2024-04-04DOI: 10.1109/LNET.2024.3385679
Han Zhang;Halvin Yang;Guopeng Zhang
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：