Search arXivSearch

arXiv · 2609.05793

HalifaxDT: A Wireless Digital Twin from Open Geospatial Data

Abstract

Wireless digital twins can support site-specific analysis, planning, and experimentation for future wireless networks. However, constructing them at city scale remains challenging when accurate 3D city models are unavailable. This paper presents HalifaxDT, a wireless digital twin of the Halifax Peninsula in Nova Scotia, Canada, constructed from heterogeneous open geospatial and spectrum data. HalifaxDT combines building footprints, LiDAR elevation products, building metadata, and spectrum licensing records through a workflow that reconciles multiple sources of building-height information while preserving the provenance of geometry decisions. The resulting terrain, buildings, and gateway metadata are integrated into Sionna RT for wireless simulation. We evaluate HalifaxDT through two use cases. The first compares its coverage predictions with a reference derived from field measurements and with an analytical baseline. The second uses the digital twin to predict the received signal under normal operating conditions and detect interference. The coverage results show that HalifaxDT better preserves the spatial structure of the measured radio map than the analytical baseline. The interference study shows that deviations from the predicted reference can reveal interference that is difficult to detect from received power alone. We also identify current fidelity limitations, including simplified material representation, missing vegetation, and the need for broader RF calibration and synchronization with live measurements.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexis Delplace, Xinyi Li, Samer Lahoud, Nur Zincir-Heywood. 2026-09-05. HalifaxDT: A Wireless Digital Twin from Open Geospatial Data. https://arxiv.org/abs/2609.05793

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

AEGIS: Risk-Budgeted Online Scheduling for Resilient Continuous Edge Inference

Continuous edge inference requires sustained wireless and computing support across successive service instances. Under recurring channel degradation, transient edge overload, and multi-user contention, isolated deadline misses may accumulate into persistent service degradation. Existing schedulers mainly optimize instantaneous latency or per-timeslot utility and provide limited control over such cross-time effects. To address this issue, we propose AEGIS (Adaptive Exposure-Governed Inference Scheduling), a risk-budgeted online framework for service-level operational resilience. AEGIS regulates predicted deadline-risk exposure through dynamically replenished per-user risk budgets and establishes an explicit finite-horizon bound on cumulative admitted-risk exposure. One-step state estimation supports anticipatory delay and risk assessment, while the centralized bandwidth--computing allocation is transformed into an exact-potential formulation and solved through asynchronous coordinate updates. Simulation results demonstrate that AEGIS enhances timely-service continuity, contains persistent deadline violations, and improves post-stress recovery through adaptive cross-time risk regulation. Meanwhile, it effectively controls predicted-risk exposure while preserving competitive service performance, achieving a favorable balance between service resilience and risk control.

cs.NI

Enhancing Network Resilience via Graph-Based Anomaly Detection in Sovereign Functions

Sovereign network functions, e.g., routing protocols, are becoming increasingly complex and susceptible to failures arising from protocol configuration anomalies and anomalous configurations. This paper interprets the protocol configuration anomaly detection problem as detection of structural inconsistencies of connected nodes and edges in a bipartite graph that captures both physical network entities and logical protocol states. This graph structural inconsistency detector (GSID) model is proposed to solve the problem efficiently. To handle the heterogeneous nature of protocol configuration parameters, GSID employs an adaptive configuration encoder (ACE) that dynamically selects encoding strategies per parameter to preserve fine-grained numerical discrepancies. To expose the subtle inconsistencies of connected nodes and edges in the bipartite graph, GSID uses an inconsistency dynamic attention (IDA) mechanism that scores edges by drawing asymmetric attentions from both ends, rule compliance from one end and route connectivity from the other. It is demonstrated experimentally that GSID outperforms state-of-the-art baselines by threefold in F1 score and by 23.2% in accuracy. Ablation studies validate the effectiveness of both the ACE and IDA modules. Tests on unseen network scales and real-world network topologies show the superior adaptability of our GSID, compared to the baselines.

cs.NI