Accelerating Graph Neural Networks via Edge Pruning for Power Allocation in Wireless Networks

• URL: http://arxiv.org/abs/2305.12639v2
• Date: Mon, 3 Jun 2024 13:06:52 GMT
• Title: Accelerating Graph Neural Networks via Edge Pruning for Power Allocation in Wireless Networks
• Authors: Lili Chen, Jingge Zhu, Jamie Evans,
• Abstract summary: 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.
• Score: 9.031738020845586
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph Neural Networks (GNNs) have recently emerged as a promising approach to tackling power allocation problems in wireless networks. Since unpaired transmitters and receivers are often spatially distant, the distance-based threshold is proposed to reduce the computation time by excluding or including the channel state information in GNNs. In this paper, we are the first to introduce a neighbour-based threshold approach to GNNs to reduce the time complexity. Furthermore, we conduct a comprehensive analysis of both distance-based and neighbour-based thresholds and provide recommendations for selecting the appropriate value in different communication channel scenarios. We design the corresponding neighbour-based Graph Neural Networks (N-GNN) with the aim of allocating transmit powers to maximise the network throughput. Our results show that our proposed N-GNN offer significant advantages in terms of reducing time complexity while preserving strong performance and generalisation capacity. Besides, we show that by choosing a suitable threshold, the time complexity is reduced from O(|V|^2) to O(|V|), where |V| is the total number of transceiver pairs.

Related papers

• Decentralized Optimization in Time-Varying Networks with Arbitrary Delays [22.40154714677385]
  We consider a decentralized optimization problem for networks affected by communication delays. Examples of such networks include collaborative machine learning, sensor networks, and multi-agent systems. To mimic communication delays, we add virtual non-computing nodes to the network, resulting in directed graphs.
  arXiv  Detail & Related papers  (2024-05-29T20:51:38Z)
• Deploying Graph Neural Networks in Wireless Networks: A Link Stability Viewpoint [13.686715722390149]
  Graph neural networks (GNNs) have exhibited promising performance across a wide range of graph applications. In wireless systems communication among nodes are usually due to wireless fading and receiver noise consequently in degradation of GNNs.
  arXiv  Detail & Related papers  (2024-05-09T14:37:08Z)
• Graph Neural Network-Based Bandwidth Allocation for Secure Wireless Communications [46.342827102556896]
  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)
  arXiv  Detail & Related papers  (2023-12-13T09:34:16Z)
• Graph Neural Networks for Power Allocation in Wireless Networks with Full Duplex Nodes [10.150768420975155]
  Due to mutual interference between users, power allocation problems in wireless networks are often non-trivial. Graph Graph neural networks (GNNs) have recently emerged as a promising approach tackling these problems and an approach exploits underlying topology of wireless networks.
  arXiv  Detail & Related papers  (2023-03-27T10:59:09Z)
• Flex-Net: A Graph Neural Network Approach to Resource Management in Flexible Duplex Networks [11.89735327420275]
  This work investigates the sum-rate of flexible networks without static time scheduling. Motivated by the recent success of Graph Networks Networks (GNNs) in solving NP-hard wireless resource management problems, we propose a novel GNN architecture, named Flex-Net.
  arXiv  Detail & Related papers  (2023-01-20T12:49:21Z)
• 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)
• Learning Autonomy in Management of Wireless Random Networks [102.02142856863563]
  This paper presents a machine learning strategy that tackles a distributed optimization task in a wireless network with an arbitrary number of randomly interconnected nodes. We develop a flexible deep neural network formalism termed distributed message-passing neural network (DMPNN) with forward and backward computations independent of the network topology.
  arXiv  Detail & Related papers  (2021-06-15T09:03:28Z)
• 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)
• Wireless Power Control via Counterfactual Optimization of Graph Neural Networks [124.89036526192268]
  We consider the problem of downlink power control in wireless networks, consisting of multiple transmitter-receiver pairs communicating over a single shared wireless medium. To mitigate the interference among concurrent transmissions, we leverage the network topology to create a graph neural network architecture. We then use an unsupervised primal-dual counterfactual optimization approach to learn optimal power allocation decisions.
  arXiv  Detail & Related papers  (2020-02-17T07:54:39Z)

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.