Searcharxiv⌕ Search

arXiv · 2610.12038

Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks

Abstract

Access control in Internet of Things (IoT) sensor networks usually acts above the physical layer: the fusion centre decides which reports to accept, while the radio of a compromised node keeps occupying the shared channel. This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor's reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time. We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level. The locally optimum detector of out-of-subtree transmission in impulsive Class-A noise weights each leaf in proportion to this predicted leakage. We bound the time needed to confine a compromised node and derive the optimal tree depth. In simulation, with demoted nodes radiating within their allocation, the scheme lowers the probability of a false global decision by 68% relative to fixed-allocation WPDM and to OFDM with the same reputation tiers, and by 44% relative to cryptographic re-attestation, which leads once more than 24% of the sensors are compromised.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Surya Jayakumar, Arun Narayanan, Indrakshi Dey. 2026-10-08. Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks. https://searcharxiv.com/abs/2610.12038

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

Joint BS Deployment and Power Optimization for Minimum EMF Exposure with RL in Real-World Based Urban Scenario

Base station (BS) deployment remains a critical task with successive wireless communication generations and increasing data rates demands, while the electromagnetic field (EMF) exposure is often underrated. Therefore, this paper proposes a workflow that adjusts BS deployment and radiated power in a 3D urban scenario to jointly consider EMF exposure and coverage. To achieve this ambition, firstly, a novel least-time shoot-and-bounce ray (SBR) ray-launching (RL) tool is developed to improve computational efficiency, and simultaneously enhance diffraction modeling for accurate EMF exposure calculation, validated with real-world measurements. To efficiently extend the computation across the target urban area, the adaptive grid refinement (AGR) algorithm is designed based on the spatial stability of the effective channel while accounting for BS beamforming. Subsequently, to provide a more comprehensive evaluation of EMF exposure under practical network operations, a system-level abstraction further accounts for the actual maximum transmit power, intercell interference, and channel state information imperfection on the BS side, while capturing mobility over the EMF exposure averaging interval on the user equipment side. Upon the aforementioned aspects, the coverage-guaranteed EMF exposure minimization problem is formulated in a realistic and accurate manner, and solved by a geometry-aware algorithm that enables joint BS deployment and power optimization based on deterministic channel simulations under practical deployment constraints, completing the proposed workflow. Simulation results illustrate the application of the workflow in the considered urban scenario, while comparison with an empirical baseline highlights that the workflow mitigates EMF exposure underestimation and yields BS deployment configurations better aligned with real-world conditions.

eess.SP↗

From High-Level Communication Requirements to KPIs via Conformal Signal Temporal Logic Learning

Softwarized radio access networks (RANs), such as those based on the Open RAN (O-RAN) architecture, generate rich streams of key performance indicators (KPIs) that can be leveraged to extract actionable intelligence for network optimization. However, bridging the gap between low-level KPI measurements and high-level requirements, such as quality of experience (QoE), requires methods that are both relevant, capturing temporal patterns predictive of user-level outcomes, and interpretable, providing human-readable insights that operators can validate and act upon. This paper introduces conformal signal temporal logic learning (C-STLL), a framework that addresses both requirements. C-STLL leverages signal temporal logic (STL), a formal language for specifying temporal properties of time series, to learn from data interpretable formulas that characterize key properties of KPI traces satisfying high-level requirements. We first formulate the problem of reliably identifying an accurate STL formula as a risk-averse inference problem. We show that the optimal solution requires the construction of a set of STL formulas with formal coverage guarantees. Based on this theoretical insight, the proposed C-STLL extracts from calibration data a set of STL formulas with such guarantees via Learn Then Test, while also filtering for formula complexity and diversity. Experiments on a mobile gaming scenario in ns-3 and on KPI traces measured on a softwarized RAN testbed demonstrate that C-STLL effectively controls risk below target levels, while returning interpretable temporal specifications that relate KPI behavior to QoE outcomes.

eess.SP↗

Joint Synchronization and Radar Parameter Estimation for OFDM-based DISAC Systems

We propose a novel approach to the synchronization paradigm in distributed ISAC (DISAC) systems in doubly-dispersive (DD) channel environments via a joint synchronization and radar parameter estimation framework. The proposed method exploits the structure of the system model, which can be linearized in order to apply a bivariate Gaussian belief propagation (GaBP) algorithm that jointly estimates the time offset (TO) and carrier frequency offset (CFO) of each base station (BS), as well as the delay and Doppler parameters of the DD channel in conventional orthogonal frequency division multiplexing (OFDM) systems. Simulation results demonstrate the effectiveness of the proposed algorithm, showing that the radar parameter estimates (i.e., range and velocity) and synchronization parameter estimates (i.e., TO and CFO) approach the Cramér Rao lower bound (CRLB) even at moderate-to-high signal-to-noise ratio (SNR) regimes.

eess.SP↗