Fjolla Ademaj-Berisha

dblp:178/8841 · also Fjolla Ademaj · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
7since 2021 · last 2026
0000-0002-3710-7026ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 2 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Enhancing the Trustworthiness of Multi-Slice 6G Networks Through Hierarchical, Environment-Aware Resource Allocation
Roya Khanzadeh, Fjolla Ademaj-Berisha, Sara Berri, Linda Senigagliesi, Arsenia Chorti, Andreas Springer, Hans-Peter Bernhard
WCNC2
2024 Environmental-aware Reinforcement Learning-based Scheduler for Trustworthy 6G in the Factory Floor
abstract
6G networks will play a crucial role in Industry 4.0 advancing further smart manufacturing and trustworthy communication. This paper introduces a reinforcement learning scheduler that considers environmental knowledge designed to improve reliability and security aspects of trustworthiness by favoring to serve nodes when in line-of-sight. We evaluate the performance in a factory floor scenario for two different heights of remote-radio heads and various blockage densities. The results show that the proposed method outperforms traditional schedulers such as round robin and proportional fair in terms of reliability, availability and fairness enhancing thus reliability and security aspects of trustworthiness when the environment is prone to a mixture of line-of-sight and non-line-of-sight.
Fjolla Ademaj-Berisha, Roya Khanzadeh, Andreas Springer, Hans-Peter Bernhard
MobiCom1
2024 Analyzing Multi-Hop WSN Connectivity using Poisson Point Processes: A Layered Model for Quality of Service Assurance
abstract
Wireless Sensor Networks (WSNs) play a pivotal role in diverse domains such as environmental sensing, industrial monitoring, and entertainment. This paper focuses on modeling the connectivity of the link considering the quality of service (QoS) criterion. This is a baseline for considering the probability density function (PDF) of the node’s distance from the base station (BS) to form a multi-hop wireless sensor networks (WSNs) structure. We delve into modeling the connectivity behavior in multi-hop networks, addressing scenarios involving non-homogeneous Poison Point Process (NHPPP) and homogeneous Poison Point Process (HPPP). Furthermore, we introduce closed-form expressions with reduced computational complexity. This contribution establishes a comprehensive framework for understanding and enhancing the performance of multi-hop wireless sensor networks.
Arash Sahbafard, Fjolla Ademaj-Berisha, Davide Dardari, Andreas Springer, Martin Voigt Vejling, Hans-Peter Bernhard
PIMRC2
2023 Time Slotted Multiple-Hypothesis Interference Tracking in Wireless Networks
abstract
Nowadays Internet of Things and Industry 4.0 devices are often connected wirelessly. Current wireless sensor network (WSN) deployments are relying in most cases on the industrial, scientific, and medical (ISM) bands without centralized resource scheduling. Thus, each device is a potential source of interference to other devices, both within its own WSN but also to devices in other collocated WSNs. If the transmission behavior of devices from other WSNs is not random, we are able to find patterns in the time domain in their channel access. This is, for example, possible for periodic channel access, which is quite common for WSNs with demanding low-power and reliability requirements. The main goal of this work is to detect multiple sources of periodic interference in time slotted signal-level measurements and estimate the time windows of future transmissions. This gives a WSN a certain understanding of the radio surrounding and can be used to adapt the transmission behavior to thus avoid collisions. For this, the multihypothesis tracking algorithm is adapted and used together with timeslot-based interference measurements on low-cost sensor nodes. The applicability of the algorithm is shown with extensive simulations and the performance is demonstrated with measurements on a time-division multiple access-based WSN built upon the Bluetooth low-energy physical layer.
Julian Karoliny, Thomas Blazek, Fjolla Ademaj-Berisha, Andreas Springer, Hans-Peter Bernhard
IEEE Internet Things J.3
2022 Quality-of-Service-Based Minimal Latency Routing for Wireless Networks
abstract
Minimized and nearly deterministic end-to-end latency facilitates real-time data acquisition and actuator control. In addition, defined latency is an integral part of quality-oriented service in order to get closer to the reliability of wired networks and at the same time takes advantage of wireless networking. This article introduces a QoS routing protocol capable of balancing power consumption between wireless sensor and actuator nodes while minimizing end-to-end latency. We introduce a time-division multiple access scheme in the routed wireless network to enable defined latency, and in addition, it improves the energy efficiency by avoiding collisions, which eliminates time and energy consuming retries. Our novel routing method allows latency and round-trip times to be calculated in advance. We implement a demonstrator and show experimental results of a wireless sensor network with our proposed routing scheme.
Fjolla Ademaj-Berisha, Hans-Peter Bernhard
IEEE Trans. Ind. Informatics1
2021 RSSI-Based Location Classification Using a Particle Filter to Fuse Sensor Estimates
abstract
For Cyper-Physical Production Systems (CPPS), localization is becoming increasingly important as wireless and mobile devices are considered an integral part. While localizing targets in a wireless communication system based on the Received Signal Strength Indicators (RSSIs) is a usual solution, it is limited by sensor quality. We consider the scenario of a car moving in and out of a chamber and propose to use a particle filter for sensor fusion, allowing us to incorporate non-idealities in our model and achieve a high-quality position estimate. Then, we use Machine Learning (ML) to classify the vehicle position. Our results show that the location output of the particle filter is a better input to the classifiers than the raw RSSI data, and we achieve improved accuracy while simultaneously reducing the number of features that the ML has to consider. We also compare the performance of multiple ML algorithms and show that SVMs provide the overall best performance for the given task.
Thomas Blazek, Julian Karoliny, Fjolla Ademaj-Berisha, Hans-Peter Bernhard
WFCS3
2021 Relay-Aided Wireless Sensor Network Discovery Algorithm for Dense Industrial IoT Utilizing ESPAR Antennas
abstract
Industrial Internet-of-Things (IIoT) applications require reliable and efficient wireless communication. Assuming dense wireless sensor networks (WSNs) operating in a harsh environment, a concept of a time-division multiple access (TDMA)-based WSN enriched with electronically steerable parasitic array radiator (ESPAR) antennas is proposed and examined in this work. The utilized antenna provides one omnidirectional and 12 directional radiation patterns that can be electronically switched by the sensor node. We introduce a relay discovery algorithm, which selects those sensor nodes with an ESPAR antenna capable to act as relay. The selection of the relay nodes is based on a certain link quality threshold that algorithm uses as input. The outcome is a reduction in the number of layers or hops with a guaranteed Quality of Service (QoS). To emphasize the physical aspect of the wireless propagation, we introduce the measured antenna radiation patterns and consider two different path-loss propagation models representing blockage-free and blockage-prone industrial environments. A number of network simulations were performed and signal-to-noise ratio (SNR) as a link quality measure was examined with respect to the network density and different measured radiation pattern settings. The main outcomes show a tradeoff between SNR per link and the percentage of nodes that can serve as relays. As a result, we propose network design guidelines that take under consideration the QoS range with respect to SNR together with an optimal number of antenna radiation patterns that should be selected as a tradeoff between latency, energy consumption, and reliability in a network.
Fjolla Ademaj-Berisha, Mateusz Rzymowski, Hans-Peter Bernhard, Krzysztof Nyka, Lukasz Kulas
IEEE Internet Things J.1
2019 Verification of the Vienna 5G Link and System Level Simulators and Their Interaction
abstract
Numerical simulation of wireless communications systems is an important means within the process of development and evolution of mobile communications specifications. We offer a software suite to the academic society for free under an academic use license that enables the community to perform simulations of relevant scenarios for 5G and beyond in a reproducible manner. To cover a variety of potential scenarios for future mobile communications systems, we offer the Vienna 5G Link Level (LL) Simulator and the Vienna 5G System Level (SL) Simulator. In this contribution, we perform a verification of our LL and SL simulators which allows us to claim simulation results to be valid. As the Vienna 5G SL Simulator relies on link performance simulation results carried out with the Vienna 5G LL Simulator, we further consider their interaction in the context of verification.
Stefan Pratschner, Martin Klaus Müller, Fjolla Ademaj-Berisha, Armand Nabavi, Bashar Tahir, Stefan Schwarz, Markus Rupp
CCNC3
2018 Ray-Tracing Based Validation of Spatial Consistency for Geometry-Based Stochastic Channels
abstract
For real-world performance evaluation, channel models should be accurate in reflecting a realistic behavior between transmitter and receiver. A major concern with the actual standardized channel models, is that they do not consider the time evolution and are relevant only for drop based simulations. The need for spatial consistency of these channel models has been also acknowledged by standardization bodies, e.g., 3GPP, and alternative models are under discussion. In this paper, we compare the statistics generated with the 3GPP 3D channel model to those of ray tracing simulations and validate our method to achieve spatial consistency. Moreover, we estimate the correlation parameters such that the results obtained with our method match the ray-tracing results.
Fjolla Ademaj-Berisha, Stefan Schwarz, Ke Guan, Markus Rupp
VTC Fall1
2018 Doubly-Selective Channel Estimation in FBMC-OQAM and OFDM Systems
abstract
We propose a method to estimate doubly-selective channels based on the time and frequency correlation of scattered pilots. To reduce the interference at the pilot and data positions, we apply an iterative interference cancellation scheme. Our method is applicable to arbitrary linear modulation techniques, with Orthogonal Frequency Division Multiplexing (OFDM) and Filter Bank Multicarrier Modulation (FBMC), being special cases. Simulations over doubly-selective channels show that our channel estimation method comes close to having perfect channel knowledge available. A downloadable Matlab code supports reproducibility.
Ronald Nissel, Fjolla Ademaj-Berisha, Markus Rupp
VTC Fall2
2017 Modeling of Spatially Correlated Geometry-Based Stochastic Channels
abstract
Massive MIMO, 3D beamforming and beam tracking strategies for mobile users are among the key strategies for the 5th generation of mobile cellular networks. Their investigation requires channel models that are spatially consistent and evolve smoothly over time. State-of-the-art channel models, such as, 3GPP SCM, WINNER and the 3GPP 3D channel model, do not consider the time evolution and are relevant only for drop based simulations. In this paper we propose two methods to model spatially correlated channels; first, by introducing spatial correlation to LOS/NLOS propagation and indoor/outdoor state of a user, and second, by introducing spatial correlation to the small scale parameters that represent short-term fading characteristics. Our results exhibit realistic behavior of users that move through the network, in terms of LOS/NLOS and indoor/outdoor states and preserve the statistics of the channel model.
Fjolla Ademaj-Berisha, Martin Klaus Müller, Stefan Schwarz, Markus Rupp
VTC Fall1