Qing Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Qing Wang has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Jason Moss
Department of Computer Science, University of Tennessee at Martin, Martin, TN 38238, USA
2 shared publications - Jian Wang
Department of Computer Science, The University of Tennessee at Martin, Martin, TN 38238, USA
2 shared publications - Yongxin Liu
Department of Mathematics, College of Arts and Sciences, Embry-Riddle Aeronautical University, Daytona Beach, FL 32114, USA
2 shared publications - Blanca Negrete
Department of Computer Science, University of Tennessee at Martin, Martin, TN 38238, USA
1 shared publication - Changrui Liu
Department of Mathematics, University of Tennessee at Martin, Martin, TN 38238, USA
1 shared publication - Connor Gladish
Department of Computer Science, University of Tennessee at Martin, Martin, TN 38238, USA
1 shared publication
Latest Publications
- Open Access
- 1 September 2026
- Published by MDPI AG in Electronics
- Vol. 15 (17) , 3921
Machine Learning-Based Anomaly Detection for Traffic in IoT-Enabled Transportation Networks
The rapid proliferation of Internet of Things (IoT) devices and their integration into increasingly interconnected applications have substantially expanded the attack surface of modern networked systems. The heterogeneous nature and high volume of IoT traffic make timely and reliable identification of malicious activities increasingly important for maintaining the security and resilience of IoT-enabled environments. This study investigates the effectiveness of maching learning approaches for supervised malicious traffic classification in IoT networks using the ACI-IoT-2023 dataset. A comparative experimental study is conducted across binary and eleven-class classification tasks to examine the capability of different learning approaches to distinguish benign and malicious traffic and identify diverse attack categories. The results demonstrate strong classification performance across the evaluated approaches, with XGBoost achieving the highest ROC-AUC in binary classification and the Decision Tree delivering the best overall performance in eleven-class classification. Further analysis of feature importance identifies several flow-level features that contribute substantially to classification performance. Overall, the findings demonstrate the effectiveness of machine learning-based approaches for accurate and efficient malicious traffic classification in IoT networks.
- 1 September 2026
- Published by MDPI AG in Electronics
- Vol. 15 (17) , 3921
Open AccessMachine Learning-Based Anomaly Detection for Traffic in IoT-Enabled Transportation Networks
The rapid proliferation of Internet of Things (IoT) devices and their integration into increasingly interconnected applications have substantially expanded the attack surface of modern networked systems. The heterogeneous nature and high volume of IoT traffic make timely and reliable identification of malicious activities increasingly important for maintaining the security and resilience of IoT-enabled environments. This study investigates the effectiveness of maching learning approaches for supervised malicious traffic classification in IoT networks using the ACI-IoT-2023 dataset. A comparative experimental study is conducted across binary and eleven-class classification tasks to examine the capability of different learning approaches to distinguish benign and malicious traffic and identify diverse attack categories. The results demonstrate strong classification performance across the evaluated approaches, with XGBoost achieving the highest ROC-AUC in binary classification and the Decision Tree delivering the best overall performance in eleven-class classification. Further analysis of feature importance identifies several flow-level features that contribute substantially to classification performance. Overall, the findings demonstrate the effectiveness of machine learning-based approaches for accurate and efficient malicious traffic classification in IoT networks.
- Open Access
- 25 November 2025
- Published by MDPI AG in Electronics
- Vol. 14 (23) , 4622
Explainable AI in IoT: A Survey of Challenges, Advancements, and Pathways to Trustworthy Automation
The integration of artificial intelligence (AI) into the Internet of Things (IoT) has revolutionized industries, enabling smarter decision-making through real-time data analysis. However, the inherent complexity and opacity of many AI models pose significant challenges to trust, accountability, and safety in critical applications such as healthcare, industrial automation, and cybersecurity. Explainable AI (XAI) addresses these challenges by making AI-driven decisions transparent and interpretable, empowering users to understand, validate, and act on algorithmic outputs. This paper examines the pivotal role of XAI in IoT development, synthesizing advancements, challenges, and opportunities across domains. Key issues include the computational demands of XAI methods on resource-constrained IoT devices, the diversity of data types requiring adaptable explanation frameworks, and vulnerabilities to adversarial attacks that exploit transparency. By looking at healthcare IoT, predictive maintenance, and smart homes, we can see how XAI bridges the gap between complex algorithms and human-centric usability—for instance, clarifying medical diagnoses or justifying equipment failure alerts. We discuss multiple XAI implementations with IOT, such as lightweight XAI for edge devices and hybrid models combining rule-based logic with deep learning. This paper advocates for XAI as a cornerstone of trustworthy IoT ecosystems, ensuring transparency without compromising efficiency. As IoT continues to shape industries and daily life, XAI will remain essential to fostering accountability, safety, and public confidence in automated systems.
- 25 November 2025
- Published by MDPI AG in Electronics
- Vol. 14 (23) , 4622
Open AccessExplainable AI in IoT: A Survey of Challenges, Advancements, and Pathways to Trustworthy Automation
The integration of artificial intelligence (AI) into the Internet of Things (IoT) has revolutionized industries, enabling smarter decision-making through real-time data analysis. However, the inherent complexity and opacity of many AI models pose significant challenges to trust, accountability, and safety in critical applications such as healthcare, industrial automation, and cybersecurity. Explainable AI (XAI) addresses these challenges by making AI-driven decisions transparent and interpretable, empowering users to understand, validate, and act on algorithmic outputs. This paper examines the pivotal role of XAI in IoT development, synthesizing advancements, challenges, and opportunities across domains. Key issues include the computational demands of XAI methods on resource-constrained IoT devices, the diversity of data types requiring adaptable explanation frameworks, and vulnerabilities to adversarial attacks that exploit transparency. By looking at healthcare IoT, predictive maintenance, and smart homes, we can see how XAI bridges the gap between complex algorithms and human-centric usability—for instance, clarifying medical diagnoses or justifying equipment failure alerts. We discuss multiple XAI implementations with IOT, such as lightweight XAI for edge devices and hybrid models combining rule-based logic with deep learning. This paper advocates for XAI as a cornerstone of trustworthy IoT ecosystems, ensuring transparency without compromising efficiency. As IoT continues to shape industries and daily life, XAI will remain essential to fostering accountability, safety, and public confidence in automated systems.
- Open Access
Terrain Visibility Graphs: Persistence is Not Enough
In this paper, we consider the Visibility Graph Recognition and Reconstruction problems in the context of terrains. Here, we are given a graph $G$ with labeled vertices $v_0, v_1, \ldots, v_{n-1}$ such that the labeling corresponds with a Hamiltonian path $H$. $G$ also may contain other edges. We are interested in determining if there is a terrain $T$ with vertices $p_0, p_1, \ldots, p_{n-1}$ such that $G$ is the visibility graph of $T$ and the boundary of $T$ corresponds with $H$. $G$ is said to be persistent if and only if it satisfies the so-called X-property and Bar-property. It is known that every "pseudo-terrain" has a persistent visibility graph and that every persistent graph is the visibility graph for some pseudo-terrain. The connection is not as clear for (geometric) terrains. It is known that the visibility graph of any terrain $T$ is persistent, but it has been unclear whether every persistent graph $G$ has a terrain $T$ such that $G$ is the visibility graph of $T$. There actually have been several papers that claim this to be the case (although no formal proof has ever been published), and recent works made steps towards building a terrain reconstruction algorithm for any persistent graph. In this paper, we show that there exists a persistent graph $G$ that is not the visibility graph for any terrain $T$. This means persistence is not enough by itself to characterize the visibility graphs of terrains, and implies that pseudo-terrains are not stretchable.Open AccessTerrain Visibility Graphs: Persistence is Not Enough
In this paper, we consider the Visibility Graph Recognition and Reconstruction problems in the context of terrains. Here, we are given a graph $G$ with labeled vertices $v_0, v_1, \ldots, v_{n-1}$ such that the labeling corresponds with a Hamiltonian path $H$. $G$ also may contain other edges. We are interested in determining if there is a terrain $T$ with vertices $p_0, p_1, \ldots, p_{n-1}$ such that $G$ is the visibility graph of $T$ and the boundary of $T$ corresponds with $H$. $G$ is said to be persistent if and only if it satisfies the so-called X-property and Bar-property. It is known that every "pseudo-terrain" has a persistent visibility graph and that every persistent graph is the visibility graph for some pseudo-terrain. The connection is not as clear for (geometric) terrains. It is known that the visibility graph of any terrain $T$ is persistent, but it has been unclear whether every persistent graph $G$ has a terrain $T$ such that $G$ is the visibility graph of $T$. There actually have been several papers that claim this to be the case (although no formal proof has ever been published), and recent works made steps towards building a terrain reconstruction algorithm for any persistent graph. In this paper, we show that there exists a persistent graph $G$ that is not the visibility graph for any terrain $T$. This means persistence is not enough by itself to characterize the visibility graphs of terrains, and implies that pseudo-terrains are not stretchable.