kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Edge Generation in Mobile Networks Using Graph Deep Learning
KTH, School of Engineering Sciences (SCI).
KTH, School of Engineering Sciences (SCI).
2024 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Mobile cellular networks are widely integrated in today’s infrastructure. These networks are constantly evolving and continuously expanding, especially with the introduction of fifth-generation (5G). It is important to ensure the effectiveness of these expansions.Mobile networks consist of a set of radio nodes that are distributed in a geographicalregion to provide connectivity services. Each radio node is served by a set of cells. Thehandover relations between cells is determined by Software features such as AutomaticNeighbor Relations (ANR). The handover relations, also refereed as edges, betweenradio nodes in the mobile network graph are created through historical interactions between User Equipment (UE) and radio nodes. The method has the limitation of not being able to set the edges before the physical hardware is integrated. In this work, we usegraph-based deep learning methods to determine mobility relations (edges), trained onradio node configuration data and a set of reliable relations of ANR in stable networks.The report focuses on measuring the accuracy and precision of different graph baseddeep learning approaches applied to real-world mobile networks. The report considers four models. Our comprehensive experiments on Telecom datasets obtained fromoperational Telecom Networks demonstrate that graph neural network model and multilayer perceptron trained with Binary Cross Entropy (BCE) loss outperform all othermodels. The four models evaluation showed that considering graph structure improveresults. Additionally, the model investigates the use of heuristics to reduce the trainingtime based on distance between radio node to eliminate irrelevant cases. The use ofthese heuristics improved precision and accuracy.

 

Place, publisher, year, edition, pages
2024.
Series
TRITA-SCI-GRU ; 2024:249
Keywords [en]
TelcoAI, Graph Representation Learning, Link Prediction, Machine Learning, Deep Learning, Self-organizing Networks, Automatic Neighbor Relations
National Category
Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-348644OAI: oai:DiVA.org:kth-348644DiVA, id: diva2:1877759
External cooperation
Ericsson
Educational program
Master of Science in Engineering - Engineering Mathematics
Supervisors
Examiners
Available from: 2024-06-26 Created: 2024-06-26 Last updated: 2024-06-26Bibliographically approved

Open Access in DiVA

fulltext(1625 kB)139 downloads
File information
File name FULLTEXT01.pdfFile size 1625 kBChecksum SHA-512
121f279b81d2fe95dfffbb767a4b3658466efe7415d26ca8c5d064c4f087da2c1f483017b153f2ac499fa503f562ec4f985eb27a90ac13ec60c1090526703067
Type fulltextMimetype application/pdf

By organisation
School of Engineering Sciences (SCI)
Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 139 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 427 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf