用图神经网络预测移动网络节点连接关系,提升建网效率与精度。
Deep Learning on Graphs for Mobile Network Topology Generation
- 基于节点配置和真实邻区关系训练图神经网络,自动推断连接关系。
- 在真实电信数据集上,图结构模型比传统方法精度提升显著。
- 结合距离启发式规则可大幅减少无效计算,加速训练并提高准确率。
移动网络由分布在各地的无线节点互联构成,其节点间关系(即移动网络拓扑)对网络建设至关重要。传统方法依赖软件预设的启发式规则建立节点间的移动性连接(本文称作“边”),但受限于物理硬件部署前无法动态调整。本文采用基于图的深度学习方法,利用实际网络中由自动邻区关系(ANR)确定的可靠连接数据,训练模型预测新的连接关系。在来自运营电信网络的真实数据集上,我们评估了图神经网络(GNN)与多层感知机(MLP)的表现。实验表明,引入图结构信息显著提升了预测精度;进一步引入基于节点间距离的启发式筛选机制,有效剔除无关样本,使精度与准确率均有明显改善。
原文摘要 · Abstract (English)
Mobile networks consist of interconnected radio nodes strategically positioned across various geographical regions to provide connectivity services. The set of relations between these radio nodes, referred to as the \emph{mobile network topology}, is vital in the construction of the networking infrastructure. Typically, the connections between radio nodes and their associated cells are defined by software features that establish mobility relations (referred to as \emph{edges} in this paper) within the mobile network graph through heuristic methods. Although these approaches are efficient, they encounter significant limitations, particularly since edges can only be established prior to the installation of physical hardware. In this work, we use graph-based deep learning methods to determine mobility relations (edges), trained on radio node configuration data and reliable mobility relations set by Automatic Neighbor Relations (ANR) in stable networks. This paper focuses on measuring the accuracy and precision of different graph-based deep learning approaches applied to real-world mobile networks. We evaluated two deep learning models. Our comprehensive experiments on Telecom datasets obtained from operational Telecom Networks demonstrate the effectiveness of the graph neural network (GNN) model and multilayer perceptron. Our evaluation showed that considering graph structure improves results, which motivates the use of GNNs. Additionally, we investigated the use of heuristics to reduce the training time based on the distance between radio nodes to eliminate irrelevant cases. Our investigation showed that the use of these heuristics improved precision and accuracy considerably.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。