arXiv subjects

Ahmad Taha

Publications and source records attributed to Ahmad Taha.

17 recordsLinked to original sources

arXiv2026

When Time Meets Space: Entropy Integration and Dynamic Threshold for Adaptive DDoS Detection in SDN

Entropy-based Distributed Denial of Service (DDoS) detection in Software-Defined Networking (SDN) commonly relies on spatial traffic distributions and static or loosely adaptive thresholds, making it vulnerable to legitimate traffic fluctuations in Internet of Things (IoT) environments. This paper proposes a lightweight spatiotemporal entropy-based detector for DDoS attacks. Spatial entropy is computed from dynamically selected traffic attribute pairs, while temporal entropy captures the randomness of packet inter-arrival times. The two normalized entropy measures are fused into a unified indicator and evaluated using a constrained second-order Exponentially Weighted Moving Average threshold that jointly tracks entropy trend and volatility. To prevent attack-contaminated observations from biasing threshold adaptation, threshold updates are performed only for windows classified as normal. Testbed results show 99.26% recall, a 0.9737 F1-score, and a 3.2% false positive rate (41.74% below that of spatial entropy alone). On CICDDoS2019, the method achieves an FPR of 0 and remains competitive with machine-learning-based methods. It requires 3.95 ms of core processing per window and 11.65% system-wide CPU utilization, supporting resource-constrained edge and IoT deployment.

cs.CR↗

arXiv2026

Toward Real-Time Mirrors Intelligence: System-Level Latency and Computation Evaluation in Internet of Mirrors (IoM)

The Internet of Mirrors (IoM) is an emerging IoT ecosystem of interconnected smart mirrors designed to deliver personalised services across a three-tier node hierarchy spanning consumer, professional, and hub nodes. Determining where computation should reside within this hierarchy is a critical design challenge, as placement decisions directly affect end-to-end latency, resource utilisation, and user experience. This paper presents the first physical IoM testbed study, evaluating four computational placement strategies across the IoM tier hierarchy under real Wi-Fi and 5G network conditions. Results show that offloading classification to higher-tier nodes substantially reduces latency and consumer resource load, but introduces network overhead that scales with payload size and hop count. No single strategy is universally optimal: the best choice depends on available network, node proximity, and concurrent user load. These findings empirically characterise the computation-communication trade-off space of the IoM and motivate the need for intelligent, adaptive task placement responsive to application requirements and live ecosystem conditions.

cs.NI↗

arXiv2026

A Survey on Semantic Communication for Vision: Categories, Frameworks, Enabling Techniques, and Applications

Semantic communication (SemCom) emerges as a transformative paradigm for traffic-intensive visual data transmission, shifting focus from raw data to meaningful content transmission and relieving the increasing pressure on communication resources. However, to achieve SemCom, challenges are faced in accurate semantic quantization for visual data, robust semantic extraction and reconstruction under diverse tasks and goals, transceiver coordination with effective knowledge utilization, and adaptation to unpredictable wireless communication environments. In this paper, we present a systematic review of SemCom for visual data transmission (SemCom-Vision), wherein an interdisciplinary analysis integrating computer vision (CV) and communication engineering is conducted to provide comprehensive guidelines for the machine learning (ML)-empowered SemCom-Vision design. Specifically, this survey first elucidates the basics and key concepts of SemCom. Then, we introduce a novel classification perspective to categorize existing SemCom-Vision approaches as semantic preservation communication (SPC), semantic expansion communication (SEC), and semantic refinement communication (SRC) based on communication goals interpreted through semantic quantization schemes. Moreover, this survey articulates the ML-based encoder-decoder models and training algorithms for each SemCom-Vision category, followed by knowledge structure and utilization strategies. Finally, we discuss potential SemCom-Vision applications.

eess.IV↗

arXiv2025

Training-Free Out-Of-Distribution Segmentation With Foundation Models

Detecting unknown objects in semantic segmentation is crucial for safety-critical applications such as autonomous driving. Large vision foundation models, including DINOv2, InternImage, and CLIP, have advanced visual representation learning by providing rich features that generalize well across diverse tasks. While their strength in closed-set semantic tasks is established, their capability to detect out-of-distribution (OoD) regions in semantic segmentation remains underexplored. In this work, we investigate whether foundation models fine-tuned on segmentation datasets can inherently distinguish in-distribution (ID) from OoD regions without any outlier supervision. We propose a simple, training-free approach that utilizes features from the InternImage backbone and applies K-Means clustering alongside confidence thresholding on raw decoder logits to identify OoD clusters. Our method achieves 50.02 Average Precision on the RoadAnomaly benchmark and 48.77 on the benchmark of ADE-OoD with InternImage-L, surpassing several supervised and unsupervised baselines. These results suggest a promising direction for generic OoD segmentation methods that require minimal assumptions or additional data.

cs.CV↗

arXiv2025

Enhancing Vehicle Platooning Safety via Control Node Placement and Sizing under State and Input Bounds

Vehicle platooning with Cooperative Adaptive Cruise Control improves traffic efficiency, reduces energy consumption, and enhances safety but remains vulnerable to cyber-attacks that disrupt communication and cause unsafe actions. To address these risks, this paper investigates control node placement and input bound optimization to balance safety and defense efficiency under various conditions. We propose a two-stage actuator placement and actuator saturation approach, which focuses on identifying key actuators that maximize the system's controllability while operating under state and input constraints. By strategically placing and limiting the input bounds of critical actuators, we ensure that vehicles maintain safe distances even under attack. Simulation results show that our method effectively mitigates the impact of attacks while preserving defense efficiency, offering a robust solution to vehicle platooning safety challenges.

eess.SY↗

arXiv2025

Enhancing Network Security Management in Water Systems using FM-based Attack Attribution

Water systems are vital components of modern infrastructure, yet they are increasingly susceptible to sophisticated cyber attacks with potentially dire consequences on public health and safety. While state-of-the-art machine learning techniques effectively detect anomalies, contemporary model-agnostic attack attribution methods using LIME, SHAP, and LEMNA are deemed impractical for large-scale, interdependent water systems. This is due to the intricate interconnectivity and dynamic interactions that define these complex environments. Such methods primarily emphasize individual feature importance while falling short of addressing the crucial sensor-actuator interactions in water systems, which limits their effectiveness in identifying root cause attacks. To this end, we propose a novel model-agnostic Factorization Machines (FM)-based approach that capitalizes on water system sensor-actuator interactions to provide granular explanations and attributions for cyber attacks. For instance, an anomaly in an actuator pump activity can be attributed to a top root cause attack candidates, a list of water pressure sensors, which is derived from the underlying linear and quadratic effects captured by our approach. We validate our method using two real-world water system specific datasets, SWaT and WADI, demonstrating its superior performance over traditional attribution methods. In multi-feature cyber attack scenarios involving intricate sensor-actuator interactions, our FM-based attack attribution method effectively ranks attack root causes, achieving approximately 20% average improvement over SHAP and LEMNA.

cs.LG↗

arXiv2023

Internet of Mirrors for Connected Healthcare and Beauty: A Prospective Vision

With the shift towards smart objects and automated services in many industries, the health and beauty industries are also becoming increasingly involved in AI-driven smart systems. There is a rising market demand for personalised services and a need for unified platforms in many sectors, specifically the cosmetics and healthcare industries. Alongside this rising demand, there are two major gaps when considering the integration of autonomous systems within these sectors. Firstly, the existing smart systems in the cosmetics industry are limited to single-purpose products and the employed technologies are not widespread enough to support the growing consumer demand for personalisation. Secondly, despite the rise of smart devices in healthcare, the current state-of-the-art services do not fulfil the accessibility demands and holistic nature of healthcare. To bridge these gaps, we propose integrating autonomous systems with health and beauty services through a unified visual platform coined as the Internet-of-Mirrors (IoM), an interconnected system of smart mirrors with sensing and communication capabilities where the smart mirror functions as an immersive visual dashboard to provide personalised services for health and beauty consultations and routines. We aim to present an overview of current state-of-the-art technologies that will enable the development of the IoM as well as provide a practical vision of this system with innovative scenarios to give a forward-looking vision for assistive technologies. We also discuss the missing capabilities and challenges the development of the IoM would face and outline future research directions that will support the realisation of our proposed framework.

cs.HC↗

arXiv2023

On input-to-state stability verification of identified models obtained by Koopman operator

This paper proposes a class of basis functions for realizing the input-to-state stability verification of identified models obtained from the true system (assumed to be input-to-state stable) using the Koopman operator. The formulated input-to-state stability conditions are in the form of linear matrix inequalities. Two extensions are presented to relax the imposed restrictions on the basis functions. Several numerical examples are provided to demonstrate the efficacy of the proposed results.

eess.SY↗

arXiv2023

Reconfigurable Intelligent Surface-Assisted Cross-Layer Authentication for Secure and Efficient Vehicular Communications

Intelligent transportation systems increasingly depend on wireless communication for broadcasting traffic messages and facilitating real-time vehicular communication. In this context, message authentication is crucial for establishing secure and reliable communication. However, security solutions must consider the dynamic nature of vehicular communication links, which fluctuate between line-of-sight (LoS) and non-line-of-sight (NLoS) due to obstructions. This paper proposes a lightweight cross-layer authentication scheme that employs public-key infrastructure (PKI)-based authentication for initial legitimacy detection/handshaking while using key-based physical-layer re-authentication for message verification. This approach reduces signature generation and signaling overheads associated with each transmission, thereby enhancing network scalability. However, the receiver operating characteristic (ROC; Pd: detection vs. PFA: false alarm probabilities) of the latter decreases with lower signal-to-noise ratio (SNR). To address this, we investigate the use of reconfigurable intelligent surfaces (RISs) to strengthen the SNR directed toward the designated vehicle in shadowed areas (i.e., NLoS scenarios), thereby improving the ROC. Theoretical analysis and practical implementation are conducted using a 1-bit RIS consisting of 64 x 64 reflective meta-surfaces. Experimental results show a significant improvement in Pd, increasing from 0.82 to 0.96 at SNR = -6 dB for an orthogonal frequency-division multiplexing (OFDM) system with 128 subcarriers. We also conducted informal and formal security analyses using Burrows-Abadi-Needham (BAN) logic to prove the scheme's ability to resist passive and active attacks.

eess.SP↗

arXiv2023

Quickest Change Detection in Statistically Periodic Processes with Unknown Post-Change Distribution

Algorithms are developed for the quickest detection of a change in statistically periodic processes. These are processes in which the statistical properties are nonstationary but repeat after a fixed time interval. It is assumed that the pre-change law is known to the decision maker but the post-change law is unknown. In this framework, three families of problems are studied: robust quickest change detection, joint quickest change detection and classification, and multislot quickest change detection. In the multislot problem, the exact slot within a period where a change may occur is unknown. Algorithms are proposed for each problem, and either exact optimality or asymptotic optimal in the low false alarm regime is proved for each of them. The developed algorithms are then used for anomaly detection in traffic data and arrhythmia detection and identification in electrocardiogram (ECG) data. The effectiveness of the algorithms is also demonstrated on simulated data.

stat.ME↗

arXiv2022

Observers for Differential Algebraic Equation Models of Power Networks: Jointly Estimating Dynamic and Algebraic States

Phasor measurement units ({PMUs}) have become instrumental in modern power systems for enabling real-time, wide-area monitoring and control. Accordingly, many studies have investigated efficient and robust dynamic state estimation (DSE) methods in order to accurately compute the dynamic states of generation units. Nonetheless, most of them forego the dynamic-algebraic nature of power networks and only consider their nonlinear dynamic representations. Motivated by the lack of DSE methods based on power network's differential-algebraic equations (DAEs), this paper develops a novel observer-based DSE framework in order to perform simultaneous estimation of the dynamic and algebraic states of multi-machine power networks. Specifically, we leverage the DAE dynamics of a power network around an operating point and combine them with a PMU-based measurement model capable of capturing bus voltages and line currents. The proposed $\mathcal{H}_{\infty}$ observer, which only requires detectability and impulse observability conditions which are satisfied for various power networks, is designed to handle various noise, unknown inputs, and input sensor failures. The results obtained from performing extensive numerical simulations on the IEEE $9$-bus and $39$-bus systems showcase the effectiveness of the proposed approach for DSE purposes.

eess.SY↗

arXiv2022

Optimal Pump Control for Water Distribution Networks via Data-based Distributional Robustness

In this paper, we propose a data-based methodology to solve a multi-period stochastic optimal water flow (OWF) problem for water distribution networks (WDNs). The framework explicitly considers the pump schedule and water network head level with limited information of demand forecast errors for an extended period simulation. The objective is to determine the optimal feedback decisions of network-connected components, such as nominal pump schedules and tank head levels and reserve policies, which specify device reactions to forecast errors for accommodation of fluctuating water demand. Instead of assuming the uncertainties across the water network are generated by a prescribed certain distribution, we consider ambiguity sets of distributions centered at an empirical distribution, which is based directly on a finite training data set. We use a distance-based ambiguity set with the Wasserstein metric to quantify the distance between the real unknown data-generating distribution and the empirical distribution. This allows our multi-period OWF framework to trade off system performance and inherent sampling errors in the training dataset. Case studies on a three-tank water distribution network systematically illustrate the tradeoff between pump operational cost, risks of constraint violation, and out-of-sample performance.

math.OC↗

arXiv2020

Dynamic State Estimation for Power System Control and Protection

Dynamic state estimation (DSE) accurately tracks the dynamics of a power system and provides the evolution of the system state in real-time. This paper focuses on the control and protection applications of DSE, comprehensively presenting different facets of control and protection challenges arising in modern power systems. It is demonstrated how these challenges are effectively addressed with DSE-enabled solutions. As precursors to these solutions, reformulation of DSE considering both synchrophasor and sampled value measurements and comprehensive comparisons of DSE and observers have been presented. The usefulness and necessity of DSE based solutions in ensuring system stability, reliable protection and security, and resilience by revamping of control and protection methods are shown through examples, practical applications, and suggestions for further development.

eess.SY↗

arXiv2018

A Fixed-Point Iteration for Steady-State Analysis of Water Distribution Networks

This paper develops a fixed-point iteration to solve the steady-state water flow equations in an urban water distribution network. The fixed-point iteration is derived upon the assumption of turbulent flow solutions and the validity of the Hazen-Williams head loss formula for water flow. Local convergence is ensured if the spectral radius of the Jacobian at the solution is smaller than one. The implication is that the solution is at least locally unique and that the spectral radius of the Jacobian provides an estimate of the convergence speed. A sample water network is provided to assert the application of the proposed method.

eess.SY↗

arXiv2018

Vulnerability Analysis of Smart Grids to GPS Spoofing

Sensors such as phasor measurement units (PMUs) endowed with GPS receivers are ubiquitously installed providing real-time grid visibility. A number of PMUs can cooperatively enable state estimation routines. However, GPS spoofing attacks can notably alter the PMU measurements, mislead the network operator, and drastically impact subsequent corrective control actions. Leveraging a novel measurement model that explicitly accounts for the GPS spoofing attacks, this paper formulates an optimization problem to identify the most vulnerable PMUs in the network. A greedy algorithm is developed to solve the aforementioned problem. Furthermore, the paper develops a computationally efficient alternating minimization algorithm for joint state estimation and attack reconstruction. Numerical tests on IEEE benchmark networks validate the developed methods.

eess.SY↗

arXiv2018

Blockchain-Assisted Crowdsourced Energy Systems

Crowdsourcing relies on people's contributions to meet product- or system-level objectives. Crowdsourcing-based methods have been implemented in various cyber-physical systems and realtime markets. This paper explores a framework for Crowdsourced Energy Systems (CES), where small-scale energy generation or energy trading is crowdsourced from distributed energy resources, electric vehicles, and shapable loads. The merits/pillars of energy crowdsourcing are discussed. Then, an operational model for CESs in distribution networks with different types of crowdsourcees is proposed. The model yields a market equilibrium depicting traditional and distributed generator and load setpoints. Given these setpoints, crowdsourcing incentives are designed to steer crowdsourcees to the equilibrium. As the number of crowdsourcees and energy trading transactions scales up, a secure energy trading platform is required. To that end, the presented framework is integrated with a lightweight Blockchain implementation and smart contracts. Numerical tests are provided to showcase the overall implementation.

eess.SY↗

arXiv2017

Coupling Load-Following Control with OPF

In this paper, the optimal power flow (OPF) problem is augmented to account for the costs associated with the load-following control of a power network. Load-following control costs are expressed through the linear quadratic regulator (LQR). The power network is described by a set of nonlinear differential algebraic equations (DAEs). By linearizing the DAEs around a known equilibrium, a linearized OPF that accounts for steady-state operational constraints is formulated first. This linearized OPF is then augmented by a set of linear matrix inequalities that are algebraically equivalent to the implementation of an LQR controller. The resulting formulation, termed LQR-OPF, is a semidefinite program which furnishes optimal steady-state setpoints and an optimal feedback law to steer the system to the new steady state with minimum load-following control costs. Numerical tests demonstrate that the setpoints computed by LQR-OPF result in lower overall costs and frequency deviations compared to the setpoints of a scheme where OPF and load-following control are considered separately.

math.OC↗