A Concept for Network Slicing in Wireless Mesh Networks

Network slicing is a key technology for 5G and future mobile networks. It enables the creation of different virtual networks on the same physical infrastructure. By applying network slicing to Wireless Mesh Networks (WMNs), it’s possible to provide communication infrastructure in a quick and less complicated way. This article shows an approach based on an evolutionary algorithm connecting multiple WMNnodes to a slice. TheWMNis modeled as an undirected graph to get a data structure for the algorithm. A set of simulations with the NS3 Simulator was done to verify the model’s assumptions. The paper then introduces our concept for network slicing in wireless mesh networks. It then explains how evolutionary algorithms are used in this approach. The proposed algorithm was tested based on a modeled network. It shows which number of nodes to connect the algorithm outperforms a brute force approach and how the algorithm works with more significant network instances. The evolutionary algorithm is then compared to two other optimization approaches for this problem. These are the Simulated Annealing and Ant Colonization Optimization algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3569077
Citations
1
Primary Topic
Mobile Ad Hoc Networks
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Concept for Network Slicing in Wireless Mesh Networks

Ulrich Trick, Bogdan Ghita, Armin Lehmann, Alexander Seng
1 citations
IEEE Access
Mobile Ad Hoc Networks
1.49
article

A Concept for Network Slicing in Wireless Mesh Networks

Ulrich Trick, Bogdan Ghita, Armin Lehmann, Alexander Seng
article en
1 citations

Abstract

Network slicing is a key technology for 5G and future mobile networks. It enables the creation of different virtual networks on the same physical infrastructure. By applying network slicing to Wireless Mesh Networks (WMNs), it’s possible to provide communication infrastructure in a quick and less complicated way. This article shows an approach based on an evolutionary algorithm connecting multiple WMNnodes to a slice. TheWMNis modeled as an undirected graph to get a data structure for the algorithm. A set of simulations with the NS3 Simulator was done to verify the model’s assumptions. The paper then introduces our concept for network slicing in wireless mesh networks. It then explains how evolutionary algorithms are used in this approach. The proposed algorithm was tested based on a modeled network. It shows which number of nodes to connect the algorithm outperforms a brute force approach and how the algorithm works with more significant network instances. The evolutionary algorithm is then compared to two other optimization approaches for this problem. These are the Simulated Annealing and Ant Colonization Optimization algorithms.

IEEE AccessVol. 13
Goethe University Frankfurt (DE), Frankfurt University of Applied Sciences (DE), University of Plymouth (GB)
Affordable and clean energy
Openalex Percentile: Top 17%
Mobile Ad Hoc Networks
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.