Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2212.01904 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912086870720512 |
|---|---|
| author | Mohsenivatani, Maryam Ali, Samad Ranasinghe, Vismika Rajatheva, Nandana Latva-Aho, Matti |
| author_facet | Mohsenivatani, Maryam Ali, Samad Ranasinghe, Vismika Rajatheva, Nandana Latva-Aho, Matti |
| contents | Wireless networks are inherently graph-structured, which can be utilized in graph representation learning to solve complex wireless network optimization problems. In graph representation learning, feature vectors for each entity in the network are calculated such that they capture spatial and temporal dependencies in their local and global neighbourhoods. Graph neural networks (GNNs) are powerful tools to solve these complex problems because of their expressive representation and reasoning power. In this paper, the potential of graph representation learning and GNNs in wireless networks is presented. An overview of graph learning is provided which covers the fundamentals and concepts such as feature design over graphs, GNNs, and their design principles. Potential of graph representation learning in wireless networks is presented via few exemplary use cases and some initial results on the GNN-based access point selection for cell-free massive MIMO systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_01904 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Graph Representation Learning for Wireless Communications Mohsenivatani, Maryam Ali, Samad Ranasinghe, Vismika Rajatheva, Nandana Latva-Aho, Matti Information Theory Wireless networks are inherently graph-structured, which can be utilized in graph representation learning to solve complex wireless network optimization problems. In graph representation learning, feature vectors for each entity in the network are calculated such that they capture spatial and temporal dependencies in their local and global neighbourhoods. Graph neural networks (GNNs) are powerful tools to solve these complex problems because of their expressive representation and reasoning power. In this paper, the potential of graph representation learning and GNNs in wireless networks is presented. An overview of graph learning is provided which covers the fundamentals and concepts such as feature design over graphs, GNNs, and their design principles. Potential of graph representation learning in wireless networks is presented via few exemplary use cases and some initial results on the GNN-based access point selection for cell-free massive MIMO systems. |
| title | Graph Representation Learning for Wireless Communications |
| topic | Information Theory |
| url | https://arxiv.org/abs/2212.01904 |