Graph Neural Networks for Power Allocation in Wireless Networks with Full Duplex Nodes

• URL: http://arxiv.org/abs/2303.16113v2
• Date: Mon, 8 Jan 2024 03:07:28 GMT
• Title: Graph Neural Networks for Power Allocation in Wireless Networks with Full Duplex Nodes
• Authors: Lili Chen, Jingge Zhu, Jamie Evans
• Abstract summary: 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.
• Score: 10.150768420975155
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Due to mutual interference between users, power allocation problems in wireless networks are often non-convex and computationally challenging. Graph neural networks (GNNs) have recently emerged as a promising approach to tackling these problems and an approach that exploits the underlying topology of wireless networks. In this paper, we propose a novel graph representation method for wireless networks that include full-duplex (FD) nodes. We then design a corresponding FD Graph Neural Network (F-GNN) with the aim of allocating transmit powers to maximise the network throughput. Our results show that our F-GNN achieves state-of-art performance with significantly less computation time. Besides, F-GNN offers an excellent trade-off between performance and complexity compared to classical approaches. We further refine this trade-off by introducing a distance-based threshold for inclusion or exclusion of edges in the network. We show that an appropriately chosen threshold reduces required training time by roughly 20% with a relatively minor loss in performance.

Related papers

• 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)
• CNN2GNN: How to Bridge CNN with GNN [59.42117676779735]
  We propose a novel CNN2GNN framework to unify CNN and GNN together via distillation. The performance of distilled boosted'' two-layer GNN on Mini-ImageNet is much higher than CNN containing dozens of layers such as ResNet152.
  arXiv  Detail & Related papers  (2024-04-23T08:19:08Z)
• T-GAE: Transferable Graph Autoencoder for Network Alignment [79.89704126746204]
  T-GAE is a graph autoencoder framework that leverages transferability and stability of GNNs to achieve efficient network alignment without retraining. Our experiments demonstrate that T-GAE outperforms the state-of-the-art optimization method and the best GNN approach by up to 38.7% and 50.8%, respectively.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• Optimization Guarantees of Unfolded ISTA and ADMM Networks With Smooth Soft-Thresholding [57.71603937699949]
  We study optimization guarantees, i.e., achieving near-zero training loss with the increase in the number of learning epochs. We show that the threshold on the number of training samples increases with the increase in the network width.
  arXiv  Detail & Related papers  (2023-09-12T13:03:47Z)
• 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)
• Graph Neural Networks-Based User Pairing in Wireless Communication Systems [0.34410212782758043]
  We propose an unsupervised graph neural network (GNN) approach to efficiently solve the user pairing problem. At 20 dB SNR, our proposed approach achieves a 49% better sum rate than k-means and a staggering 95% better sum rate than SUS.
  arXiv  Detail & Related papers  (2023-05-14T11:57:42Z)
• 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)
• 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)
• Scalable Power Control/Beamforming in Heterogeneous Wireless Networks with Graph Neural Networks [6.631773993784724]
  We propose a novel unsupervised learning-based framework named heterogeneous interference graph neural network (HIGNN) to handle these challenges. HIGNN is scalable to wireless networks of growing sizes with robust performance after trained on small-sized networks.
  arXiv  Detail & Related papers  (2021-04-12T13:36:32Z)
• Binarized Graph Neural Network [65.20589262811677]
  We develop a binarized graph neural network to learn the binary representations of the nodes with binary network parameters. Our proposed method can be seamlessly integrated into the existing GNN-based embedding approaches. Experiments indicate that the proposed binarized graph neural network, namely BGN, is orders of magnitude more efficient in terms of both time and space.
  arXiv  Detail & Related papers  (2020-04-19T09:43:14Z)
• 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.