SVStefanos Voikos

Stefanos Voikos

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Stefanos Voikos has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Latency and Energy Minimization in RIS-enabled AirComp Federated Learning Networks

    by Panagiotis Charatsaris, Stefanos Voikos, Maria Diamanti, Symeon Papavassiliou

    Over-the-Air Computation (AirComp) in Federated Learning (FL) has captivated research interest for fast and spectrally efficient model aggregation across distributed clients. To mitigate the adverse effects of channel fading on the aggregated global model, Reconfigurable Intelligent Surfaces (RIS) have been further integrated into the AirComp FL network architecture. In this context, the overwhelming majority of the literature focuses on active and passive beamforming design toward minimizing the superimposed signal's Mean Squared Error (MSE). In this paper, we take a step further by investigating the relationship between the MSE, overall latency, and energy consumption in RIS-enabled AirComp FL networks while explicitly incorporating the computing aspects of FL, which are often overlooked. To this end, we formulate and solve the weighted overall latency and energy consumption minimization problem due to both clients' transmissions and local computations. The optimization targets the design of the RIS phase shifts, the receive beamformer, and allocating local computing frequencies at the client devices. The original non-convex problem is decomposed into subproblems, each of which can be reformulated into a convex form and solved either directly or via an iterative alternating optimization approach. The paper concludes with the overall optimization algorithm and extensive numerical results, comparing the proposed analytical solution with general-purpose optimization toolboxes. The performance gains of RIS and the benefits of joint communication-computing resource allocation are also demonstrated.


  • Radio and Compute Resource Allocation for SWIPT and RIS-Assisted AirComp Federated Learning

    by Stefanos Voikos, Panagiotis Charatsaris, Maria Diamanti, Eirini Eleni Tsiropoulou, Symeon Papavassiliou

  • Resilient RAN Selection and SFC Deployment in Dependable Wireless Edge Cloud Networks

    by Ioannis Dimolitsas, Maria Diamanti, Stefanos Voikos, Symeon Papavassiliou

    The evolution toward sixth-generation (6G) networks necessitates integrated resource management solutions to address the interdependencies between network segments, such as Radio Access Network (RAN) and Edge Cloud (EC) infrastructures. Unified management of network and compute fabrics is crucial for achieving seamless service delivery, end-to-end power efficiency, and delay guarantees, while resiliency becomes a key enabler for adapting to various application demands and diverse network segment conditions. In this context, this paper proposes a unified framework for dependable wireless EC networks that jointly addresses the problems of RAN selection and Service Function Chain (SFC) embedding to minimize the total power consumption across network segments under end-to-end delay SFC deployment constraints. The framework iteratively solves these problems, considering the interdependencies between RAN ingress points and the EC network resource constraints. To deal with the high dimensionality of the considered parameters and achieve timely and scalable decision-making, a coalition formation game optimizes RAN selection, while a delay-aware heuristic approach undertakes the power-efficient embedding of multiple SFCs within the EC network. Simulation results demonstrate the framework’s efficiency in reducing power consumption compared to segment-specific approaches, highlighting the importance of cross-segment dependencies. Also, the adaptability of the proposed unified modeling and the framework’s scalability are demonstrated, ensuring resilient performance under varying network parameter settings.


  • Open Access

    Coordinated Jamming and Poisoning Attack Detection and Mitigation in Wireless Federated Learning Networks

    by Sofia Barkatsa, Maria Diamanti, Panagiotis Charatsaris, Stefanos Voikos, Eirini Eleni Tsiropoulou, Symeon Papavassiliou

    Wireless Federated Learning (FL) is a distributed Artificial Intelligence (AI) framework, enabling decision-making at the network edge where data are generated. However, wireless transmissions of model updates from edge nodes to the coordinating server are vulnerable to jamming, alongside the inherent risk of poisoning the learning process. In this paper, we tackle the problem of coordinated jamming and poisoning attacks in wireless FL networks, where malicious edge nodes disrupt transmissions of legitimate local model updates to the cloud server while injecting poisoned model updates to manipulate the global model. To this end, we introduce two complementary mechanisms operating alternately. First, a robust global model aggregation algorithm is developed to address poisoning attacks by weighting edge nodes’ local model updates using a novel contribution index. The calculation of the index is inspired by the Shapley value, but it offers polynomial complexity compared to existing methods. Subsequently, a distributed power control solution for jamming attack mitigation in the uplink of the FL network is introduced based on Bayesian games with incomplete information. Both legitimate and malicious nodes aim to successfully transmit their model parameters, minimizing transmission power and time to the server, while having probabilistic knowledge about the malicious behavior of the other nodes in the game. The proposed unified approach and each individual mechanism are assessed via modeling and simulation, verifying their effectiveness in mitigating both attacks while achieving a good tradeoff between global model accuracy and consumed time and energy compared to state-of-the-art approaches.