Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.12671

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

Andrey Samuylov·Dmitri Moltchanov·Roman Glazkov·Juho Pirskanen·Jussi Numminen·Mikko Valkama
View original source ↗Read source document ↗Export metadata ↓

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

cs.NI

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://arxiv.org/abs/2610.12671

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How Feasible are Passive Network Attacks on 5G Networks and Beyond? A Survey

Privacy concerns around 5G, the latest generation of mobile networks, are growing, with fears that its deployment may increase exposure to privacy risks. This perception is largely driven by the use of denser deployments of small antenna systems, which enable highly accurate data collection at higher speeds and closer proximity to mobile users. At the same time, 5G's unique radio communication features can make the reproduction of known network attacks more challenging. In particular, passive network attacks, which do not involve direct interaction with the target network and are therefore nearly impossible to detect, remain a pressing concern. Such attacks can reveal sensitive information about users, their devices, and active applications, which may then be exploited through known vulnerabilities or spear-phishing schemes. This survey examines the feasibility of passive network attacks in 5G and beyond (B5G/6G) networks, with emphasis on two major categories: information extraction (system identification, website and application fingerprinting) and geolocation (user identification and position tracking). These attacks are well documented and reproducible in existing wireless and mobile systems, including short-range networks (IEEE 802.11) and, to a lesser extent, LTE. Current evidence suggests that while such attacks remain theoretically possible in 5G, their practical execution is significantly constrained by directional beamforming, high-frequency propagation characteristics, and encryption mechanisms. For B5G and early 6G networks, the lack of public tools and high hardware cost currently renders these attacks infeasible in practice, which highlights a critical gap in our understanding of future network threat models.

cs.NI↗
arXiv2026

Orientation-Aware Deep Learning Framework for RSSI-Based Indoor Localization in RIS-Aided mmWave Systems

Reconfigurable intelligent surface (RIS)-aided millimeter wave (mmWave) systems provide directional measurements of received power for indoor localization, but device orientation changes the fingerprints. This work proposes an orientation-aware dual-stream gated (O-DSG) deep learning framework for received signal strength indicator (RSSI)-based indoor localization. An orientation classifier estimates device orientation from RSSI, so inference needs only received power. An embedding of the predicted angle and posterior entropy controls feature modulation and soft expert gating. Parallel convolutional and statistical streams are fused through bidirectional long short-term memory (BiLSTM) processing and temporal attention. Single-user measurements in an indoor laboratory at 28 GHz under non-line-of-sight (NLoS) conditions yield a median localization error of 0.141 m, a 25.8% improvement over the closest evaluated baseline (supplied with the measured orientation), and 92.3% orientation classification accuracy across four discrete classes. In spatial regions withheld from training, O-DSG has an average median error of 0.247 m, against 0.392 m for a validation-selected sequence model. A separate offline evaluation constructs non-orthogonal multiple access (NOMA)-style power mixtures from the single-user measurements and measures localization accuracy and computational scaling with up to eight emulated users whose power contributions overlap, under the specified mixture model.

cs.NI↗
arXiv2026

PriorityFEC: Deadline-Aware Streaming FEC for KV-Cache Handoff in Edge Multi-Agent Systems

Multi-agent large language model (LLM) systems are increasingly deployed at the edge to support complex tasks that require collaboration and information exchange among multiple agents. However, when task contexts are passed across agents, shared context that has already been processed by upstream agents often needs to be prefilled again, resulting in substantial redundant computation. Reusing an already prefilled key--value (KV) cache can avoid this recomputation, but requires the reusable KV state to be transferred across the network before the receiving agent can begin generation. Under strict time-to-first-token (TTFT) deadlines and unreliable edge links, delivering the complete KV cache may be infeasible, making it necessary to prioritize and protect the most valuable KV information within a limited transmission budget. This paper proposes PriorityFEC, a utility-aware KV-cache handoff scheme that jointly exploits model-side KV importance and transport-side reliability. PriorityFEC first constructs a utility-aware source stream by placing high-utility KV blocks at earlier transmission positions. It then protects the ordered stream using a feedback-adaptive Streaming Forward Erasure Correction (FEC) mechanism, which schedules repair packets according to receiver feedback before the TTFT deadline. We implement PriorityFEC on a distributed edge LLM serving prototype and evaluate it with Qwen2.5-7B-Instruct and Llama-3.1-8B-Instruct across multiple datasets. Results show that PriorityFEC achieves superior task quality over the compared transport schemes, with its advantages becoming particularly pronounced under stringent deadline constraints. These results demonstrate the importance of jointly optimizing KV-cache utility and deadline-aware transport reliability when reusable LLM state must be handed off across unreliable edge networks.

cs.NI↗