Valentin Rakovic
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Valentin Rakovic has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Liljana Gavrilovska
Ss. Cyril and Methodius University in Skopje
11 shared publications - Daniel Denkovski
Faculty of Electrical Engineering and Information Technologies, Ss. Cyril and Methodius University, Skopje, Macedonia
9 shared publications - Aleksandar Risteski
Saints Cyril and Methodius University
4 shared publications - Hristijan Gjoreski
Ss. Cyril and Methodius University in Skopje, Skopje, Macedonia
4 shared publications Liljana Gavrilovska
Ss. Cyril and Methodius University in Skopje
4 shared publications- Marija Poposka
Faculty of Electrical Engineering and Information Technologies, Ss. Cyril and Methodius University, Skopje, North Macedonia
4 shared publications
Latest Publications
- Open Access
- 10 August 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (8) , 423
A Reproducible Blockchain-Anchored Proof-of-Charge Platform for Auditable EV Charging Receipts
Public electric vehicle (EV) charging increasingly relies on internet-connected platforms for metering, billing, roaming, and settlement. However, final billing records and charge detail records often provide limited evidence that a session result can be independently linked to the ordered metering data from which it was derived. This paper presents a reproducible blockchain-anchored Proof-of-Charge platform for generating tamper-evident and auditable EV charging receipts. The platform converts charging-session data into canonical receipts, computes cryptographic commitments over receipt content and ordered meter values, aggregates receipt hashes using a temporally ordered and domain-separated Merkle profile, and anchors compact batch commitments in a smart contract while keeping detailed records off-chain. A working prototype implements cross-language canonicalization checks, membership-proof generation, structured storage, batch anchoring, verification services, synthetic workload generation, dataset export, and local blockchain deployment. Across 50 measured runs covering 10 to 1000 receipts, all count reconciliations, batch-root checks, and on-chain comparisons passed. Mean receipt-pipeline latency ranged from 7.152 to 7.853 ms per receipt, with throughput from 127.54 to 141.23 receipts/s. A focused 1000-leaf proof sample produced a 2064-byte proof with ten sibling hashes. The results show that the platform can generate, anchor, and verify auditable EV charging receipts with reproducible performance while keeping detailed charging data off-chain. The proposed architecture provides a practical digital trust layer for internet-enabled EV charging and V2G-ready settlement workflows.
- 10 August 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (8) , 423
Open AccessA Reproducible Blockchain-Anchored Proof-of-Charge Platform for Auditable EV Charging Receipts
Public electric vehicle (EV) charging increasingly relies on internet-connected platforms for metering, billing, roaming, and settlement. However, final billing records and charge detail records often provide limited evidence that a session result can be independently linked to the ordered metering data from which it was derived. This paper presents a reproducible blockchain-anchored Proof-of-Charge platform for generating tamper-evident and auditable EV charging receipts. The platform converts charging-session data into canonical receipts, computes cryptographic commitments over receipt content and ordered meter values, aggregates receipt hashes using a temporally ordered and domain-separated Merkle profile, and anchors compact batch commitments in a smart contract while keeping detailed records off-chain. A working prototype implements cross-language canonicalization checks, membership-proof generation, structured storage, batch anchoring, verification services, synthetic workload generation, dataset export, and local blockchain deployment. Across 50 measured runs covering 10 to 1000 receipts, all count reconciliations, batch-root checks, and on-chain comparisons passed. Mean receipt-pipeline latency ranged from 7.152 to 7.853 ms per receipt, with throughput from 127.54 to 141.23 receipts/s. A focused 1000-leaf proof sample produced a 2064-byte proof with ten sibling hashes. The results show that the platform can generate, anchor, and verify auditable EV charging receipts with reproducible performance while keeping detailed charging data off-chain. The proposed architecture provides a practical digital trust layer for internet-enabled EV charging and V2G-ready settlement workflows.
- 14 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (4) , 749-753
Optimal Cut Layer Bounds for Split Learning
Split learning (SL) is a distributed learning method where a deep learning model is partitioned between the client and server, aiming to optimize the training process. A key challenge in split learning is selecting the cut layer to minimize energy consumption while considering both computational and communication overheads. In this letter, we address this challenge within the context of a wireless system with multiple clients and a central server. We introduce a pruning-based cut layer selection scheme that effectively reduces the energy consumption for each client. Our approach leverages analytical bounds for optimal cut layer location, which we derive and validate against state-of-the-art SL benchmark schemes, demonstrating the high efficiency of our proposed method.
- 14 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (4) , 749-753
Optimal Cut Layer Bounds for Split Learning
Split learning (SL) is a distributed learning method where a deep learning model is partitioned between the client and server, aiming to optimize the training process. A key challenge in split learning is selecting the cut layer to minimize energy consumption while considering both computational and communication overheads. In this letter, we address this challenge within the context of a wireless system with multiple clients and a central server. We introduce a pruning-based cut layer selection scheme that effectively reduces the energy consumption for each client. Our approach leverages analytical bounds for optimal cut layer location, which we derive and validate against state-of-the-art SL benchmark schemes, demonstrating the high efficiency of our proposed method.
- 27 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (1) , 108-112
Delay Minimization of Federated Learning Over Wireless Powered Communication Networks
In this paper, we study distributed federated learning (FL) in wireless powered communication networks (WPCNs). The proposed system model ensures data privacy and energy self-sustainability of wireless (e.g., sensory, sensing or data gathering) devices involved in collaborative machine learning regardless of the specific FL algorithm. We specifically aim to minimize the total training duration of the FL process by properly allocating the communication resources (i.e., durations of energy harvesting, local processing and transmission phases, and transmit powers), the computational parameters of the EH clients (i.e. CPU frequencies) and learning parameters of their FL models (i.e. local training error threshold). We derive analytical solutions for these parameters, resulting in low complexity in implementing the proposed scheme.
- 27 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (1) , 108-112
Delay Minimization of Federated Learning Over Wireless Powered Communication Networks
In this paper, we study distributed federated learning (FL) in wireless powered communication networks (WPCNs). The proposed system model ensures data privacy and energy self-sustainability of wireless (e.g., sensory, sensing or data gathering) devices involved in collaborative machine learning regardless of the specific FL algorithm. We specifically aim to minimize the total training duration of the FL process by properly allocating the communication resources (i.e., durations of energy harvesting, local processing and transmission phases, and transmit powers), the computational parameters of the EH clients (i.e. CPU frequencies) and learning parameters of their FL models (i.e. local training error threshold). We derive analytical solutions for these parameters, resulting in low complexity in implementing the proposed scheme.
- Open Access
- 28 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
On the Double Descent effect in Federated Learning
This paper investigates the occurrence of the double descent phenomenon within the domain of federated learning. It derives a closed-form solution to calculate the mean excess risk in the coefficients of a linear regression model, with the theoretical findings verified through simulations. The results confirm the presence of the double descent effect in the case of federated learning. This effect is especially pronounced in a heterogeneous scenario where local datasets of collaborating users have different sizes and properties. Furthermore, the results unveil unexpected and non-trivial performance behaviors. Interestingly, federated learning even outperforms centralized learning in particular scenarios when the expected excess risk of the former is lower than that of the latter. Finally, our analysis reveals that the typically used random user selection in federated learning exhibits asymptotically lower performance in contrast to the case of excluding only a single carefully chosen user from the learning process.
- 28 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessOn the Double Descent effect in Federated Learning
This paper investigates the occurrence of the double descent phenomenon within the domain of federated learning. It derives a closed-form solution to calculate the mean excess risk in the coefficients of a linear regression model, with the theoretical findings verified through simulations. The results confirm the presence of the double descent effect in the case of federated learning. This effect is especially pronounced in a heterogeneous scenario where local datasets of collaborating users have different sizes and properties. Furthermore, the results unveil unexpected and non-trivial performance behaviors. Interestingly, federated learning even outperforms centralized learning in particular scenarios when the expected excess risk of the former is lower than that of the latter. Finally, our analysis reveals that the typically used random user selection in federated learning exhibits asymptotically lower performance in contrast to the case of excluding only a single carefully chosen user from the learning process.
- Open Access
- 26 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 64442-64457
Federated Learning for Activity Recognition: A System Level Perspective
The past decade has seen substantial growth in the prevalence and capabilities of wearable devices. For instance, recent human activity recognition (HAR) research has explored using wearable devices in applications such as remote monitoring of patients, detection of gait abnormalities, and cognitive disease identification. However, data collection poses a major challenge in developing HAR systems, especially because of the need to store data at a central location. This raises privacy concerns and makes continuous data collection difficult and expensive due to the high cost of transferring data from a user’s wearable device to a central repository. Considering this, we explore the adoption of federated learning (FL) as a potential solution to address the privacy and cost issues associated with data collection in HAR. More specifically, we investigate the performance and behavioral differences between FL and deep learning (DL) HAR models, under various conditions relevant to real-world deployments. Namely, we explore the differences between the two types of models when (i) using data from different sensor placements, (ii) having access to users with data from heterogeneous sensor placements, (iii) considering bandwidth efficiency, and (iv) dealing with data with incorrect labels. Our results show that FL models suffer from a consistent performance deficit in comparison to their DL counterparts, but achieve these results with much better bandwidth efficiency. Furthermore, we observe that FL models exhibit very similar responses to those of DL models when exposed to data from heterogeneous sensor placements. Finally, we show that the FL models are more robust to data with incorrect labels than their centralized DL counterparts.
- 26 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 64442-64457
Open AccessFederated Learning for Activity Recognition: A System Level Perspective
The past decade has seen substantial growth in the prevalence and capabilities of wearable devices. For instance, recent human activity recognition (HAR) research has explored using wearable devices in applications such as remote monitoring of patients, detection of gait abnormalities, and cognitive disease identification. However, data collection poses a major challenge in developing HAR systems, especially because of the need to store data at a central location. This raises privacy concerns and makes continuous data collection difficult and expensive due to the high cost of transferring data from a user’s wearable device to a central repository. Considering this, we explore the adoption of federated learning (FL) as a potential solution to address the privacy and cost issues associated with data collection in HAR. More specifically, we investigate the performance and behavioral differences between FL and deep learning (DL) HAR models, under various conditions relevant to real-world deployments. Namely, we explore the differences between the two types of models when (i) using data from different sensor placements, (ii) having access to users with data from heterogeneous sensor placements, (iii) considering bandwidth efficiency, and (iv) dealing with data with incorrect labels. Our results show that FL models suffer from a consistent performance deficit in comparison to their DL counterparts, but achieve these results with much better bandwidth efficiency. Furthermore, we observe that FL models exhibit very similar responses to those of DL models when exposed to data from heterogeneous sensor placements. Finally, we show that the FL models are more robust to data with incorrect labels than their centralized DL counterparts.
- 16 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (8) , 2108-2112
Resource Allocation of NOMA Communication Systems for Federated Learning
Federated learning is a new communication and computing concept that allows naturally distributed data sets (e.g., as in data acquisition sensors) to be used to train global models, and therefore successfully addresses privacy, power and bandwidth limitations in wireless networks. In this paper, we study the communications problem of latency minimization of a multi-user wireless network used to train a decentralized machine learning model. To facilitate low latency, the wireless stations (WSs) employ non-orthogonal multiple access (NOMA) for simultaneous transmission of local model parameters to the base station, subject to the users’ maximum CPU frequency, maximum transmit power, and maximum available energy. The proposed resource allocation scheme guarantees fair resource sharing among WSs by enforcing only a single WS to spend the maximum allowable energy or transmit at maximum power, whereas the rest of the WSs transmit at lower power and spend less energy. The closed-form analytical solution for the optimal values of resource allocation parameters is used for efficient online implementation of the proposed scheme with low computational complexity.
- 16 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (8) , 2108-2112
Resource Allocation of NOMA Communication Systems for Federated Learning
Federated learning is a new communication and computing concept that allows naturally distributed data sets (e.g., as in data acquisition sensors) to be used to train global models, and therefore successfully addresses privacy, power and bandwidth limitations in wireless networks. In this paper, we study the communications problem of latency minimization of a multi-user wireless network used to train a decentralized machine learning model. To facilitate low latency, the wireless stations (WSs) employ non-orthogonal multiple access (NOMA) for simultaneous transmission of local model parameters to the base station, subject to the users’ maximum CPU frequency, maximum transmit power, and maximum available energy. The proposed resource allocation scheme guarantees fair resource sharing among WSs by enforcing only a single WS to spend the maximum allowable energy or transmit at maximum power, whereas the rest of the WSs transmit at lower power and spend less energy. The closed-form analytical solution for the optimal values of resource allocation parameters is used for efficient online implementation of the proposed scheme with low computational complexity.
- 5 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet Computing
- Vol. 27 (4) , 15-22
Federated Learning for Network Intrusion Detection in Ambient Assisted Living Environments
Given the Internet of Things rapid expansion and widespread adoption, it is of great concern to establish secure interaction between devices without worsening the quality of their performance. Using machine learning techniques has been shown to improve detecting anomalous behavior in these types of networks, but their implementation leads to poor performance and compromised privacy. To better address these shortcomings, federated learning is being introduced. It enables devices to collaboratively train and evaluate a shared model while keeping personal data on-site (e.g., smart homes, intensive care units, hospitals, etc.), thus minimizing the possibility of an attack and fostering real-time distribution of models and learning. The paper investigates the performance of federated learning in comparison to deep learning, with respect to network intrusion detection in ambient assisted living environments. The results demonstrate comparable performances of federated learning with deep learning, while achieving improved data privacy and security.
- 5 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet Computing
- Vol. 27 (4) , 15-22
Federated Learning for Network Intrusion Detection in Ambient Assisted Living Environments
Given the Internet of Things rapid expansion and widespread adoption, it is of great concern to establish secure interaction between devices without worsening the quality of their performance. Using machine learning techniques has been shown to improve detecting anomalous behavior in these types of networks, but their implementation leads to poor performance and compromised privacy. To better address these shortcomings, federated learning is being introduced. It enables devices to collaboratively train and evaluate a shared model while keeping personal data on-site (e.g., smart homes, intensive care units, hospitals, etc.), thus minimizing the possibility of an attack and fostering real-time distribution of models and learning. The paper investigates the performance of federated learning in comparison to deep learning, with respect to network intrusion detection in ambient assisted living environments. The results demonstrate comparable performances of federated learning with deep learning, while achieving improved data privacy and security.
- 19 September 2022
- Published by Springer Nature
- p. 503-519
Manipulation of URL Addresses Using Machine Learning to Provide Better Cyber Security
- 19 September 2022
- Published by Springer Nature
- p. 503-519
Manipulation of URL Addresses Using Machine Learning to Provide Better Cyber Security
- 19 September 2022
- Published by Springer Nature
- p. 413-432
Control of Power Consumption with Integrated System of Technology, Regulation and Consumer Behavior Management
- 19 September 2022
- Published by Springer Nature
- p. 413-432
Control of Power Consumption with Integrated System of Technology, Regulation and Consumer Behavior Management
- 16 July 2021
- Published by Springer Nature
- p. C1
Correction to: Flash Crowd Management in Beyond 5G Systems
- 16 July 2021
- Published by Springer Nature
- p. C1
Correction to: Flash Crowd Management in Beyond 5G Systems