Graph Neural Network-Based Bandwidth Allocation for Secure Wireless Communications

• URL: http://arxiv.org/abs/2312.14958v1
• Date: Wed, 13 Dec 2023 09:34:16 GMT
• Title: Graph Neural Network-Based Bandwidth Allocation for Secure Wireless Communications
• Authors: Xin Hao, Phee Lep Yeoh, Yuhong Liu, Changyang She, Branka Vucetic, and Yonghui Li
• Abstract summary: We propose a user scheduling algorithm to schedule users satisfying an instantaneous minimum secrecy rate constraint. We optimize the bandwidth allocations with three algorithms namely iterative search (IvS), GNN-based supervised learning (GNN-SL), and GNN-based unsupervised learning (GNN-USL)
• Score: 46.342827102556896
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper designs a graph neural network (GNN) to improve bandwidth allocations for multiple legitimate wireless users transmitting to a base station in the presence of an eavesdropper. To improve the privacy and prevent eavesdropping attacks, we propose a user scheduling algorithm to schedule users satisfying an instantaneous minimum secrecy rate constraint. Based on this, we optimize the bandwidth allocations with three algorithms namely iterative search (IvS), GNN-based supervised learning (GNN-SL), and GNN-based unsupervised learning (GNN-USL). We present a computational complexity analysis which shows that GNN-SL and GNN-USL can be more efficient compared to IvS which is limited by the bandwidth block size. Numerical simulation results highlight that our proposed GNN-based resource allocations can achieve a comparable sum secrecy rate compared to IvS with significantly lower computational complexity. Furthermore, we observe that the GNN approach is more robust to uncertainties in the eavesdropper's channel state information, especially compared with the best channel allocation scheme.

Related papers

• Spatio-Spectral Graph Neural Networks [50.277959544420455]
  We propose Spatio-Spectral Graph Networks (S$2$GNNs) S$2$GNNs combine spatially and spectrally parametrized graph filters. We show that S$2$GNNs vanquish over-squashing and yield strictly tighter approximation-theoretic error bounds than MPGNNs.
  arXiv  Detail & Related papers  (2024-05-29T14:28:08Z)
• Graph Neural Networks for Physical-Layer Security in Multi-User Flexible-Duplex Networks [8.494679909584834]
  We investigate the intricacies of the sum secrecy problem, particularly when faced with coordinated and distributed eavesdroppers. Our contributions include an iterative solution optimization and an unsupervised learning strategy based on Graph Neural Networks (GNNs) We extend the GNN approach to address the absence of eavesdroppers' channel knowledge.
  arXiv  Detail & Related papers  (2024-02-08T03:22:12Z)
• Scalable Resource Management for Dynamic MEC: An Unsupervised Link-Output Graph Neural Network Approach [36.32772317151467]
  Deep learning has been successfully adopted in mobile edge computing (MEC) to optimize task offloading and resource allocation. The dynamics of edge networks raise two challenges in neural network (NN)-based optimization methods: low scalability and high training costs. In this paper, a novel link-output GNN (LOGNN)-based resource management approach is proposed to flexibly optimize the resource allocation in MEC.
  arXiv  Detail & Related papers  (2023-06-15T08:21:41Z)
• Accelerating Graph Neural Networks via Edge Pruning for Power Allocation in Wireless Networks [9.031738020845586]
  Graph Neural Networks (GNNs) have emerged as a promising approach to tackling power allocation problems in wireless networks. We introduce a neighbour-based threshold approach to GNNs to reduce the time complexity. Our results show that our proposed N-GNN offer significant advantages in terms of reducing time complexity while preserving strong performance and generalisation capacity.
  arXiv  Detail & Related papers  (2023-05-22T02:22:14Z)
• Privacy-Preserving Decentralized Inference with Graph Neural Networks in Wireless Networks [39.99126905067949]
  We analyze and enhance the privacy of decentralized inference with graph neural networks in wireless networks. Specifically, we adopt local differential privacy as the metric, and design novel privacy-preserving signals. We also adopt the over-the-air technique and theoretically demonstrate its advantage in privacy preservation.
  arXiv  Detail & Related papers  (2022-08-15T01:33:07Z)
• Deep Learning-Based Synchronization for Uplink NB-IoT [72.86843435313048]
  We propose a neural network (NN)-based algorithm for device detection and time of arrival (ToA) estimation for the narrowband physical random-access channel (NPRACH) of narrowband internet of things (NB-IoT) The introduced NN architecture leverages residual convolutional networks as well as knowledge of the preamble structure of the 5G New Radio (5G NR) specifications.
  arXiv  Detail & Related papers  (2022-05-22T12:16:43Z)
• Comparative Analysis of Interval Reachability for Robust Implicit and Feedforward Neural Networks [64.23331120621118]
  We use interval reachability analysis to obtain robustness guarantees for implicit neural networks (INNs) INNs are a class of implicit learning models that use implicit equations as layers. We show that our approach performs at least as well as, and generally better than, applying state-of-the-art interval bound propagation methods to INNs.
  arXiv  Detail & Related papers  (2022-04-01T03:31:27Z)
• Robust Graph Neural Networks via Probabilistic Lipschitz Constraints [7.359962178534361]
  Graph neural networks (GNNs) have recently been demonstrated to perform well on a variety of network-based tasks. GNNs are susceptible to shifts and perturbations on their inputs, which can include both node attributes and graph structure.
  arXiv  Detail & Related papers  (2021-12-14T17:33:32Z)
• Resource Allocation via Graph Neural Networks in Free Space Optical Fronthaul Networks [119.81868223344173]
  This paper investigates the optimal resource allocation in free space optical (FSO) fronthaul networks. We consider the graph neural network (GNN) for the policy parameterization to exploit the FSO network structure. The primal-dual learning algorithm is developed to train the GNN in a model-free manner, where the knowledge of system models is not required.
  arXiv  Detail & Related papers  (2020-06-26T14:20:48Z)
• Graph Neural Networks for Motion Planning [108.51253840181677]
  We present two techniques, GNNs over dense fixed graphs for low-dimensional problems and sampling-based GNNs for high-dimensional problems. We examine the ability of a GNN to tackle planning problems such as identifying critical nodes or learning the sampling distribution in Rapidly-exploring Random Trees (RRT) Experiments with critical sampling, a pendulum and a six DoF robot arm show GNNs improve on traditional analytic methods as well as learning approaches using fully-connected or convolutional neural networks.
  arXiv  Detail & Related papers  (2020-06-11T08:19:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.