Searcharxiv⌕ Search

arXiv · 2610.12671

Topology Construction Algorithms for DECT NR+ in Normal and Ultra-Dense Deployments

Abstract

The 5G-grade DECT NR+ technology designed to support massive machine-type communications (mMTC) relies on the decentralized mesh connectivity concept. The currently utilized topology construction algorithms are very sensitive to the node density, which causes interference at the node association phase and may lead to instable topologies. In this study, we propose several algorithms that need to be utilized at relay and leaf nodes to allow stabilization of the topology: (i) load-dependent relay allocation, (ii) hysteresis-based association control, (iii) blacklist-based association control, and (iv) smart beacon placement. Due to the complex interference structure in DECT NR+ mesh systems, we utilize system-level simulations to assess the performance in both normal and ultra-dense conditions in terms of the efficiency of topology construction and the performance characteristics of the resulting topology. Our results show that dense DECT NR+ networks do suffer from topology instability, with reassociation rates exceeding 10 per second and recovery times lasting over 10 minutes. By implementing the proposed mechanisms, the network dynamically scales, reducing the number of required relays by more than half, from 34% to 15%. They also stabilize the topology by reducing the reassociation rates to just 2-3 per second allowing large-scale networks of several hundred nodes to operate efficiently.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrey Samuylov, Dmitri Moltchanov, Roman Glazkov, Juho Pirskanen, Jussi Numminen, Mikko Valkama. 2026-10-08. Topology Construction Algorithms for DECT NR+ in Normal and Ultra-Dense Deployments. https://searcharxiv.com/abs/2610.12671

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Flux: Optimal Scheduling of Optical Circuit Switches for LLM Training

Optical Circuit Switching (OCS) offers high bandwidth density and energy efficiency for LLM training, but incurs a non-negligible reconfiguration delay. Prior work typically schedules optical circuit switches independently of compute, using aggregate traffic demand to determine which circuits to provision and when. We argue that this separation creates a fundamental inefficiency: reconfigurations that ignore the compute timeline can stall communication, resulting in low circuit utilization and large buffer requirements. In this paper, we present Flux, a scheduler that optimally schedules optical circuit switches based on the structure of the entire workload. Flux remains effective across a wide range of switching speeds by reusing circuits and amortizing reconfiguration delay behind compute and communication. We show that Flux reduces training iteration time by up to $10\times$ and peak NIC buffer requirements by more than three orders of magnitude compared to traditional periodic schedulers.

cs.NI↗

HiGAI-Net: Hierarchical Encrypted Traffic Classification for Generative AI Services

The Radio Access Network (RAN) today does not have a reliable way to identify GenAI traffic (ChatGPT, Microsoft Copilot, or Google Gemini traffic) at the bearer level. TLS~1.3 moves SNI into the encrypted handshake record, and Encrypted ClientHello (ECH) removes it entirely from passive inspection; Gemini has partly shifted to QUIC where SNI visibility also depends on whether ECH is deployed. Without per-flow application identity, differentiated QoS for GenAI services is not possible. HiGAI-Net tackles this using only packet-header metadata, stacking three independently trained classifiers: a binary AI/Non-AI gate (98.5 % weighted F1), a per-service resolver across ChatGPT, Copilot, and Gemini (86.4 %), and a text-vs-voice/video mode classifier (61.0 %). The core innovation is a suite of sliding-window temporal features that track how DL/UL byte-ratios evolve within a session -- the per-quarter and per-half ratio trends, a trend differential $ΔR$, and a streaming regularity index. Tested on 44,492 labeled flows, gradient-boosted tree models consistently outperformed all deep-learning variants; a per-flow label cache brings amortised inference below 1~$μ$s per packet.

cs.NI↗

Do LLMs Understand Network Traces? A Comparative Study of Reasoning over Raw and Filtered Traffic Data

The effective delivery and monitoring of ICT services rely heavily on network traffic analysis. However, interpreting complex packet captures remains a challenging task that requires substantial technical expertise. Large language models (LLMs) offer promising opportunities to automate network traffic in- vestigation, yet their reliability in packet-level field extraction and flow-level sequence reconstruction remains an open research question. This study proposes a reproducible, question-answering- based evaluation methodology to assess the capabilities of LLMs in network trace analysis. Using real-world benign traffic from the CICIDS2017 dataset, we evaluate multiple models against a human-generated ground truth, comparing their performance on raw textual traffic dumps and protocol-filtered representations. Model responses are assessed through an automated LLM- as-a-judge pipeline, validated against human evaluations. The results demonstrate that protocol filtering significantly reduces prompt overhead while improving answer accuracy by reducing incorrect responses. These findings highlight the importance of protocol-aware traffic filtering as an effective optimization for improving the efficiency and reliability of LLM-assisted network management.

cs.NI↗