Marios Kountouris
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Marios Kountouris has a total of 146 co-authors. Here are the top co-authors by number of shared publications:
- Nikolaos Pappas
Linköping University, Linköping, Sweden
29 shared publications - Photios A. Stavrou
EURECOM
12 shared publications - Italo Atzeni
Mathematical and Algorithmic Sciences Lab France Research Center Huawei Technologies France SASU
8 shared publications - Anthony Ephremides
Electrical and Computer Engineering Department, University of Maryland, College Park, MD, USA
7 shared publications - Pouya Agheli
Communication Systems Department, EURECOM, Biot, France
7 shared publications - Mehrdad Salimnejad
Department of Computer and Information Science, Linkping University, Linkping, Sweden
5 shared publications
Latest Publications
- Open Access
- 25 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 7127-7143
Beyond Base Metric: The Critical and Overlooked Role of Meta-Metrics in Intersectional Fairness
- 25 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 7127-7143
Open AccessBeyond Base Metric: The Critical and Overlooked Role of Meta-Metrics in Intersectional Fairness
- 8 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (15) , 1
Optimizing Energy and Data Collection in UAV-aided IoT Networks using Attention-based Multi-Objective Reinforcement Learning
Due to their adaptability and mobility, Unmanned Aerial Vehicles (UAVs) are becoming increasingly essential for wireless network services, particularly for data harvesting tasks. In this context, Artificial Intelligence (AI)-based approaches have gained significant attention for addressing UAV path planning tasks in large and complex environments, bridging the gap with real-world deployments. However, many existing algorithms suffer from limited training diversity and limited generalization beyond the training distribution, which hampers their performance in highly dynamic environments. Moreover, they often overlook the inherently multi-objective nature of the task, treating it in an overly simplistic manner. To address these limitations, we propose an attention-based Multi-Objective Reinforcement Learning (MORL) architecture that explicitly handles the trade-off between data collection and energy consumption in urban environments, even without prior knowledge of wireless channel conditions. Our method learns a single model capable of adapting to varying trade-off preferences and dynamic scenario parameters without the need for fine-tuning or retraining. Extensive simulations show that our approach achieves substantial improvements in performance, model compactness, sample efficiency, and most importantly, generalization to previously unseen scenarios, outperforming existing RL solutions.
- 8 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (15) , 1
Optimizing Energy and Data Collection in UAV-aided IoT Networks using Attention-based Multi-Objective Reinforcement Learning
Due to their adaptability and mobility, Unmanned Aerial Vehicles (UAVs) are becoming increasingly essential for wireless network services, particularly for data harvesting tasks. In this context, Artificial Intelligence (AI)-based approaches have gained significant attention for addressing UAV path planning tasks in large and complex environments, bridging the gap with real-world deployments. However, many existing algorithms suffer from limited training diversity and limited generalization beyond the training distribution, which hampers their performance in highly dynamic environments. Moreover, they often overlook the inherently multi-objective nature of the task, treating it in an overly simplistic manner. To address these limitations, we propose an attention-based Multi-Objective Reinforcement Learning (MORL) architecture that explicitly handles the trade-off between data collection and energy consumption in urban environments, even without prior knowledge of wireless channel conditions. Our method learns a single model capable of adapting to varying trade-off preferences and dynamic scenario parameters without the need for fine-tuning or retraining. Extensive simulations show that our approach achieves substantial improvements in performance, model compactness, sample efficiency, and most importantly, generalization to previously unseen scenarios, outperforming existing RL solutions.
- Open Access
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 2777-2793
Real-Time Remote Monitoring of Correlated Markovian Sources
We investigate real-time tracking of two correlated stochastic processes over a shared wireless channel. The joint evolution of the processes is modeled as a two-dimensional discrete-time Markov chain. Each process is observed by a dedicated sampler and independently reconstructed at a remote monitor according to a task-specific objective. Although both processes originate from a common underlying phenomenon (e.g., distinct features of the same source), each monitor is interested only in its corresponding feature. A reconstruction error is incurred when the true and reconstructed states mismatch at one or both monitors. To address this problem, we propose an error-aware joint sampling and transmission policy, under which each sampler probabilistically generates samples only when the current process state differs from the most recently reconstructed state at its corresponding monitor. We adopt the time-averaged reconstruction error and the average cost of actuation error as the primary performance metrics and benchmark the proposed policy against state-of-the-art joint sampling and transmission schemes. For each policy, we derive closed-form expressions for the corresponding time-averaged reconstruction error and average cost of actuation error. We further formulate and solve an optimization problem that minimizes the time-averaged reconstruction error subject to an average sampling cost constraint. Analytical and numerical results demonstrate that the proposed error-aware policy achieves the minimum time-averaged reconstruction error among the considered schemes while efficiently utilizing the sampling budget. The performance gains are particularly pronounced in regimes with strong inter-process correlation and stringent tracking requirements, where frequent sampling by both samplers is necessary.
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 2777-2793
Open AccessReal-Time Remote Monitoring of Correlated Markovian Sources
We investigate real-time tracking of two correlated stochastic processes over a shared wireless channel. The joint evolution of the processes is modeled as a two-dimensional discrete-time Markov chain. Each process is observed by a dedicated sampler and independently reconstructed at a remote monitor according to a task-specific objective. Although both processes originate from a common underlying phenomenon (e.g., distinct features of the same source), each monitor is interested only in its corresponding feature. A reconstruction error is incurred when the true and reconstructed states mismatch at one or both monitors. To address this problem, we propose an error-aware joint sampling and transmission policy, under which each sampler probabilistically generates samples only when the current process state differs from the most recently reconstructed state at its corresponding monitor. We adopt the time-averaged reconstruction error and the average cost of actuation error as the primary performance metrics and benchmark the proposed policy against state-of-the-art joint sampling and transmission schemes. For each policy, we derive closed-form expressions for the corresponding time-averaged reconstruction error and average cost of actuation error. We further formulate and solve an optimization problem that minimizes the time-averaged reconstruction error subject to an average sampling cost constraint. Analytical and numerical results demonstrate that the proposed error-aware policy achieves the minimum time-averaged reconstruction error among the considered schemes while efficiently utilizing the sampling budget. The performance gains are particularly pronounced in regimes with strong inter-process correlation and stringent tracking requirements, where frequent sampling by both samplers is necessary.
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 3845-3857
Pull-Based Query Scheduling for Goal-Oriented Semantic Communication
This paper addresses query scheduling for goaloriented semantic communication in pull-based status update systems. We consider a system where multiple sensing agents (SAs) observe a source characterized by various attributes and provide updates to multiple actuation agents (AAs), which act upon the received information to fulfill their heterogeneous goals at the endpoint. A hub serves as an intermediary, querying the SAs for updates on observed attributes and maintaining a knowledge base, which is then broadcast to the AAs. The AAs leverage the knowledge to perform their actions effectively. To quantify the semantic value of updates, we introduce a grade of effectiveness (GoE) metric. Furthermore, we integrate cumulative perspective theory (CPT) into the long-term effectiveness analysis to account for risk awareness and loss aversion in the system. Leveraging this framework, we compute effect-aware scheduling policies aimed at maximizing the expected discounted sum of CPT-based total GoE provided by the transmitted updates while complying with a given query cost constraint. To achieve this, we propose a model-based solution based on dynamic programming and model-free solutions employing state-of-the-art deep reinforcement learning (DRL) algorithms. Our findings demonstrate that effect-aware scheduling significantly enhances the effectiveness of communicated updates compared to benchmark scheduling methods, particularly in settings with stringent cost constraints where optimal query scheduling is vital for system performance and overall effectiveness.
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 3845-3857
Pull-Based Query Scheduling for Goal-Oriented Semantic Communication
This paper addresses query scheduling for goaloriented semantic communication in pull-based status update systems. We consider a system where multiple sensing agents (SAs) observe a source characterized by various attributes and provide updates to multiple actuation agents (AAs), which act upon the received information to fulfill their heterogeneous goals at the endpoint. A hub serves as an intermediary, querying the SAs for updates on observed attributes and maintaining a knowledge base, which is then broadcast to the AAs. The AAs leverage the knowledge to perform their actions effectively. To quantify the semantic value of updates, we introduce a grade of effectiveness (GoE) metric. Furthermore, we integrate cumulative perspective theory (CPT) into the long-term effectiveness analysis to account for risk awareness and loss aversion in the system. Leveraging this framework, we compute effect-aware scheduling policies aimed at maximizing the expected discounted sum of CPT-based total GoE provided by the transmitted updates while complying with a given query cost constraint. To achieve this, we propose a model-based solution based on dynamic programming and model-free solutions employing state-of-the-art deep reinforcement learning (DRL) algorithms. Our findings demonstrate that effect-aware scheduling significantly enhances the effectiveness of communicated updates compared to benchmark scheduling methods, particularly in settings with stringent cost constraints where optimal query scheduling is vital for system performance and overall effectiveness.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (3) , 1
Proof-Based Secure Semantic Communication for Privacy-Critical Consumer Internet of Things
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (3) , 1
Proof-Based Secure Semantic Communication for Privacy-Critical Consumer Internet of Things
- 11 December 2025
- Published by Elsevier in Computer Networks
- Vol. 275
AGORAN: An agentic open marketplace for 6G RAN automation
- 11 December 2025
- Published by Elsevier in Computer Networks
- Vol. 275
AGORAN: An agentic open marketplace for 6G RAN automation
- Top Cited Papers
- 15 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications
- Vol. 32 (6) , 200-208
Affine Frequency Division Multiplexing: Extending OFDM for Scenario-Flexibility and Resilience
Next-generation wireless networks are designed to provide reliable, high-data-rate communication services for diverse scenarios such as vehicle-to-vehicle, unmanned-aerial-vehicle, and satellite networks. Large Doppler spreads in the underlying time-varying channels induce destructive inter-carrier interference (ICI) in the widely adopted orthogonal frequency-division multiplexing (OFDM) waveform, leading to severe performance degradation. This calls for a new air-interface design that can accommodate the severe delay–Doppler spreads of highly dynamic channels while offering sufficient flexibility to cater to various applications. This article provides a comprehensive overview of a promising chirp-based waveform, Affine Frequency Division Multiplexing (AFDM). Featuring two tunable parameters, AFDM achieves the optimal diversity order in doubly dispersive channels (DDC). We examine the fundamental principles of AFDM, illustrating its intrinsic suitability for DDC; on this basis, several potential applications are explored. Furthermore, the main challenges of AFDM and their corresponding solutions are presented, followed by key directions for future research. Finally, we draw instructive conclusions about AFDM to provide useful insights for its continued development.
- 15 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications
- Vol. 32 (6) , 200-208
Top Cited PapersAffine Frequency Division Multiplexing: Extending OFDM for Scenario-Flexibility and Resilience
Next-generation wireless networks are designed to provide reliable, high-data-rate communication services for diverse scenarios such as vehicle-to-vehicle, unmanned-aerial-vehicle, and satellite networks. Large Doppler spreads in the underlying time-varying channels induce destructive inter-carrier interference (ICI) in the widely adopted orthogonal frequency-division multiplexing (OFDM) waveform, leading to severe performance degradation. This calls for a new air-interface design that can accommodate the severe delay–Doppler spreads of highly dynamic channels while offering sufficient flexibility to cater to various applications. This article provides a comprehensive overview of a promising chirp-based waveform, Affine Frequency Division Multiplexing (AFDM). Featuring two tunable parameters, AFDM achieves the optimal diversity order in doubly dispersive channels (DDC). We examine the fundamental principles of AFDM, illustrating its intrinsic suitability for DDC; on this basis, several potential applications are explored. Furthermore, the main challenges of AFDM and their corresponding solutions are presented, followed by key directions for future research. Finally, we draw instructive conclusions about AFDM to provide useful insights for its continued development.