Wojciech Ciezobka

Wojciech Ciezobka

Auto-generated profile, based on publicly available information

Wojciech Ciezobka

Institute of Telecommunications, AGH University of Krakow, Krakow, Poland

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 December 2024 in IEEE Communications Letters
Verified
Journal Article
Closed access
MWMaksymilian Wojnar
Maksymilian Wojnar
WCWojciech Ciezobka
Wojciech Ciezobka
KKKatarzyna Kosek-Szott
Katarzyna Kosek-Szott
KRKrzysztof Rusek
Krzysztof Rusek
SSSzymon Szott
Szymon Szott
Boris BellaltaBoris Bellalta
Boris Bellalta
Coordination among multiple access points (APs) is integral to IEEE 802.11bn (Wi-Fi 8) for managing contention in dense networks. This letter explores the benefits of Coordinated Spatial Reuse (C-SR) and proposes the use of reinforcement learning to optimize C-SR group selection. We develop a hierarchical multi-armed bandit (MAB) framework that efficiently selects APs for simultaneous transmissions across various network topologies, demonstrating reinforcement learning’s promise in Wi-Fi settings. Among several MAB algorithms studied, we identify the upper confidence bound (UCB) as particularly effective, offering rapid convergence, adaptability to changes, and sustained performance.

2 July 2025 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
MWMaksymilian Wojnar
Maksymilian Wojnar
WCWojciech Ciȩżobka
Wojciech Ciȩżobka
ATArtur Tomaszewski
Artur Tomaszewski
Piotr ChołdaPiotr Chołda
Piotr Chołda
KRKrzysztof Rusek
Krzysztof Rusek
SSSzymon Szott
Szymon Szott
The densification of Wi-Fi deployments means that fully distributed random channel access is no longer sufficient for high and predictable performance. Therefore, the upcoming IEEE 802.11bn amendment introduces multi-access point coordination (MAPC) methods. This paper addresses a variant of MAPC called coordinated spatial reuse (C-SR), where devices transmit simultaneously on the same channel, with the power adjusted to minimize interference. The C-SR scheduling problem is selecting which devices transmit concurrently and with what settings. We provide a theoretical upper bound model, optimized for either throughput or fairness, which finds the best possible transmission schedule using mixed-integer linear programming. Then, a practical, probing-based approach is proposed which uses multi-armed bandits (MABs), a type of reinforcement learning, to solve the C-SR scheduling problem. We validate both classical (flat) MAB and hierarchical MAB (H-MAB) schemes with simulations and in a testbed. Using H-MABs for C-SR improves aggregate throughput over legacy IEEE 802.11 (on average by 80% in random scenarios), without reducing the number of transmission opportunities per station. Finally, our framework is lightweight and ready for implementation in Wi-Fi devices.

8 April 2024 in SoftwareX
Verified
Journal Article
Open access
MWMaksymilian Wojnar
Maksymilian Wojnar
SSSzymon Szott
Szymon Szott
KRKrzysztof Rusek
Krzysztof Rusek
WCWojciech Ciezobka
Wojciech Ciezobka

4 July 2024 in Computer Communications
Verified
Journal Article
Open access
WCWojciech Ciezobka
Wojciech Ciezobka
MWMaksymilian Wojnar
Maksymilian Wojnar
KRKrzysztof Rusek
Krzysztof Rusek
KKKatarzyna Kosek-Szott
Katarzyna Kosek-Szott
SSSzymon Szott
Szymon Szott
FDFalko Dressler
Falko Dressler
Appropriate data rate selection at the physical layer is crucial for Wi-Fi network performance: too high rates lead to loss of data frames, while too low rates cause increased latency and inefficient channel use. Most existing methods adopt a probing approach and empirically assess the transmission success probability for each available rate. However, a transmission failure can also be caused by frame collisions. Thus, each collision leads to an unnecessary decrease in the data rate. We avoid this issue by resorting to the fine timing measurement (FTM) procedure, part of IEEE 802.11, which allows stations to perform ranging, i.e., measure their spatial distance to the AP. Since distance is not affected by sporadic distortions such as internal and external channel interference, we use this knowledge for data rate selection. Specifically, we propose FTMRate, which applies statistical learning (a form of machine learning) to estimate the distance based on measurements, predicts channel quality from the distance, and selects data rates based on channel quality. We define three distinct estimation approaches: exponential smoothing , Kalman filter , and particle filter. Then, with a thorough performance evaluation using simulations and an experimental validation with real-world devices, we show that our approach has several positive features: it is resilient to collisions, provides near-instantaneous convergence, is compatible with commercial-off-the-shelf devices, and supports pedestrian mobility. Thanks to these features, FTMRate outperforms existing solutions in a variety of line-of-sight scenarios, providing close to optimal results. Additionally, we introduce Hybrid FTMRate, which can intelligently fall back to a probing-based approach to cover non-line-of-sight cases. Finally, we discuss the applicability of the method and its usefulness in various scenarios.

13 January 2025 in IEEE Access
Verified
Journal Article
Open access
WCWojciech Ciezobka
Wojciech Ciezobka
JFJoan Falcó-Roget
Joan Falcó-Roget
CKCemal Koba
Cemal Koba
ACAlessandro Crimi
Alessandro Crimi
In this paper, we propose a reservoir computing-based and directed graph analysis pipeline. The goal of this pipeline is to define an efficient brain representation for connectivity in stroke data derived from magnetic resonance imaging. Ultimately, this representation is used within a directed graph convolutional architecture and investigated with explainable artificial intelligence (AI) tools, offering a more detailed understanding of how stroke alters communication within the brain. Stroke is one of the leading causes of mortality and morbidity worldwide, and it demands precise diagnostic tools for timely intervention and improved patient outcomes. Neuroimaging data, with their rich structural and functional information, provide a fertile ground for biomarker discovery. However, the complexity and variability of information flow in the brain require advanced analysis, especially if we consider the case of disrupted networks as those given by the brain connectome of stroke patients. To address the needs given by this complex scenario we proposed an end-to-end pipeline. This pipeline begins with defining the effective connectivity of the brain. This allows directed graph network representations that have not been fully investigated so far by graph convolutional network classifiers. To have a complete overview, the analysis with reservoir computing-based causality is compared to other two effective connectivity approaches: one linear (Granger causality) and one non-linear method (transfer entropy). Then, the pipeline subsequently incorporates a classification module to categorize the effective connectivity (directed graphs) of brain networks of patients versus matched healthy control. The graph convolutional architecture is also compared to legacy methods such as random forest and support vector machine providing a complete benchmark. While the pipeline includes a classification module for distinguishing between stroke patients and healthy controls, the focus is on the interpretation of these directed graphs, which reveal critical disruptions in connectivity. Indeed, the classification led to an area under the curve of 0.69 by using graph convolutional networks, 0.72 by using local topological profiling random forest, and 0.71 by using support vector machine with the given heterogeneous dataset. More importantly, thanks to explainable tools, an interpretation of disrupted networks across the brain networks was possible. This elucidates the effective connectivity biomarker’s contribution to stroke classification, fostering insights into disease mechanisms and treatment responses. This transparent analytical framework not only enhances clinical interpretability but also instills confidence in decision-making processes, crucial for translating research findings into clinical practice. Our proposed machine learning pipeline showcases the potential of reservoir computing to define causality and therefore directed graph networks, which can in turn be used in a directed graph classifier and explainable analysis of neuroimaging data. This method prioritizes uncovering miscommunication in brain networks, with the potential to improve our understanding of stroke and other brain diseases.

17 July 2024 in medRxiv
Verified
Preprint
Open access
PDF file
WCWojciech Ciezobka
Wojciech Ciezobka
JFJoan Falco-Roget
Joan Falco-Roget
CKCemal Koba
Cemal Koba
ACAlessandro Crimi
Alessandro Crimi
In this paper, we propose a reservoir computing-based and directed graph analysis pipeline. The goal of this pipeline is to define an efficient brain representation for connectivity in stroke data derived from magnetic resonance imaging. Ultimately, this representation is used within a directed graph convolutional architecture and investigated with explainable artificial intelligence (AI) tools. Stroke is one of the leading causes of mortality and morbidity worldwide, and it demands precise diagnostic tools for timely intervention and improved patient outcomes. Neuroimaging data, with their rich structural and functional information, provide a fertile ground for biomarker discovery. However, the complexity and variability of information flow in the brain requires advanced analysis, especially if we consider the case of disrupted networks as those given by the brain connectome of stroke patients. To address the needs given by this complex scenario we proposed an end-to-end pipeline. This pipeline begins with reservoir computing causality, to define effective connectivity of the brain. This allows directed graph network representations which have not been fully investigated so far by graph convolutional network classifiers. Indeed, the pipeline subsequently incorporates a classification module to categorize the effective connectivity (directed graphs) of brain networks of patients versus matched healthy control. The classification led to an area under the curve of 0.69 with the given heterogeneous dataset. Thanks to explainable tools, an interpretation of disrupted networks across the brain networks was possible. This elucidates the effective connectivity biomarker's contribution to stroke classification, fostering insights into disease mechanisms and treatment responses. This transparent analytical framework not only enhances clinical interpretability but also instills confidence in decision-making processes, crucial for translating research findings into clinical practice. Our proposed machine learning pipeline showcases the potential of reservoir computing to define causality and therefore directed graph networks, which can in turn be used in a directed graph classifier and explainable analysis of neuroimaging data. This complex analysis aims at improving stroke patient stratification, and can potentially be used with other brain diseases.