SearcharxivSearch

arXiv subjects

Nicholas Kaminski

Publications and source records attributed to Nicholas Kaminski.

7 recordsLinked to original sources

Event Detection for Parameter-to-KPI Dependency Learning for AI-RAN

Next-generation wireless networks are expected to rely on multiple concurrent AI-driven control functions that optimize different network objectives simultaneously, particularly in AI-integrated and open radio access network architectures such as AI Radio Access Network (AI-RAN) and Open Radio Access Network (O-RAN). When these functions interact, they can interfere with one another in ways that are difficult to detect from raw network data alone. A key missing piece for managing such interactions is a reliable, interpretable dependency structure that captures which control parameters are actively influencing which network performance outcomes at any given time. This paper focuses on the event-detection step needed to support such dependency learning by converting noisy continuous telemetry into binary indicators of parameter activity and KPI response. The central difficulty is that not every fluctuation in the data reflects a genuine control interaction, so the method must distinguish real parameter-outcome relationships from background variation. Because real AI-RAN traffic traces with known parameter-KPI ground truth are difficult to obtain, we introduce a synthetic closed-loop traffic generator with planted latent dependencies. We use this controlled telemetry to evaluate a machine-learning-based dependency recovery pipeline that formulates the conversion of continuous traces into binary event indicators as a significance-detection problem. Experimental evaluation shows that the proposed pipeline reliably recovers the latent dependency structure from noisy continuous traces when the signal is sufficiently separated from background variation, while highlighting threshold calibration as the key factor controlling event-detection quality. These results constitute a foundational step toward interpretable dependency learning for adaptive AI-RAN control systems.

cs.LG

Explainable Runtime Dependency Tracking for AI-RAN Conflict Monitoring

Future AI-integrated Radio Access Networks (AI-RAN) will combine open programmability with learning-enabled xApps, rApps, and control functions that act on shared parameters and key performance indicators (KPIs). For conflict monitoring, it is not enough to know which applications are deployed; the system must also know whether the parameter--KPI dependencies assumed by runtime diagnosis remain valid under the current operating regime. This paper studies a lightweight monitoring primitive for that purpose: tracking an interpretable dependency representation from streaming telemetry events. We represent active dependencies by a Boolean matrix and use Boolean matrix multiplication to check whether recent parameter-activity and KPI-response events are consistent with the current estimate. We propose a sliding-window inference procedure that reuses the estimate when it remains consistent and recomputes it when recent observations indicate structural change. The tracker is intended as an explainable signal for conflict diagnosis and slow-loop model refresh, not as an autonomous mitigation mechanism. Experiments on controlled Boolean event streams show efficient and accurate tracking under dependency changes and Boolean observation noise.

cs.LG

Agent-Based Modelling Approach for Distributed Decision Support in an IoT Network

An increasing number of emerging applications, e.g., internet of things, vehicular communications, augmented reality, and the growing complexity due to the interoperability requirements of these systems, lead to the need to change the tools used for the modeling and analysis of those networks. Agent-Based Modeling (ABM) as a bottom-up modeling approach considers a network of autonomous agents interacting with each other, and therefore represents an ideal framework to comprehend the interactions of heterogeneous nodes in a complex environment. Here, we investigate the suitability of ABM to model the communication aspects of a road traffic management system, as an example of an Internet of Things (IoT) network. We model, analyze and compare various Medium Access Control (MAC) layer protocols for two different scenarios, namely uncoordinated and coordinated. Besides, we model the scheduling mechanisms for the coordinated scenario as a high level MAC protocol by using three different approaches: Centralized Decision Maker, DESYNC and decentralized learning MAC (L-MAC). The results clearly show the importance of coordination between multiple decision makers in order to improve the accuracy of information and spectrum utilization of the system.

cs.MA

Complex Systems Science meets 5G and IoT

We propose a new paradigm for telecommunications, and develop a framework drawing on concepts from information (i.e., different metrics of complexity) and computational (i.e., agent based modeling) theory, adapted from complex system science. We proceed in a systematic fashion by dividing network complexity understanding and analysis into different layers. Modelling layer forms the foundation of the proposed framework, supporting analysis and tuning layers. The modelling layer aims at capturing the significant attributes of networks and the interactions that shape them, through the application of tools such as agent-based modelling and graph theoretical abstractions, to derive new metrics that holistically describe a network. The analysis phase completes the core functionality of the framework by linking our new metrics to the overall network performance. The tuning layer augments this core with algorithms that aim at automatically guiding networks toward desired conditions. In order to maximize the impact of our ideas, the proposed approach is rooted in relevant, near-future architectures and use cases in 5G networks, i.e., Internet of Things (IoT) and self-organizing cellular networks.

cs.NI

A Functional Complexity Framework for the Analysis of Telecommunication Networks

The rapid evolution of network services demands new paradigms for studying and designing networks. In order to understand the underlying mechanisms that provide network functions, we propose a framework which enables the functional analysis of telecommunication networks. This framework allows us to isolate and analyse a network function as a complex system. We propose functional topologies to visualise the relationships between system entities and enable the systematic study of interactions between them. We also define a complexity metric $C_F$ (functional complexity) which quantifies the variety of structural patterns and roles of nodes in the topology. This complexity metric provides a wholly new approach to study the operation of telecommunication networks. We study the relationship between $C_F$ and different graph structures by analysing graph theory metrics in order to recognize complex organisations. $C_F$ is equal to zero for both a full mesh topology and a disconnected topology. We show that complexity is very high for a dense structure that shows high integration (shorter average path length and high average clustering coefficient). We make a connection between functional complexity, robustness and response to changes that may appear in the system configuration. We also make a connection between the implementation and the outcome of a network function which correlates the characteristics of the outcome with the complex relationships that underpin the functional structure.

cs.SI

How Functional Complexity affects the Scalability-Energy Efficiency Trade-Off of HCC WSN Clustering

Even though clustering algorithms in Wireless Sensor Networks (WSN) are a well investigate subject, the increasing interest in the Internet of Things (IoT) and 5G technologies has precipitated the need of new ways to comprehend and overcome a new set of challenges. While studies mainly propose new algorithms and compare these algorithms based on a set of properties (e.g. energy efficiency, scalability), none of them focuses on the underlying mechanisms and organizational patterns that lead to these properties. We address this lack of understanding by applying a complex systems science approach to investigate the properties of WSNs arising from the communication patterns of the network nodes. We represent different implementations of clustering in WSNs with a functional topology graph. Moreover, we employ a complexity metric - functional complexity (CF) - to explain how local interactions give rise to the global behavior of the network. Our analysis shows that higher values of CF indicate higher scalability and lower energy efficiency.

cs.NI

Relation between Functional Complexity, Scalability and Energy Efficiency in WSNs

In order to understand the underlying mechanisms that lead to certain network properties (i.e. scalability, energy efficiency) we apply a complex systems science approach to analyze clustering in Wireless Sensor Networks (WSN). We represent different implementations of clustering in WSNs with a functional topology graph. Different characteristics of the functional topology provide insight into the relationships between system parts that result in certain properties of the whole system. Moreover, we employ a complexity metric - functional complexity (C_F) - to explain how local interactions give rise to the global behavior of the network. Our analysis shows that higher values of C_F indicate higher scalability and lower energy efficiency.

cs.NI