Haotian 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
Research Subjects
Haotian Wang has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Jun Tao
Southeast University
12 shared publications - Yifan Xu
School of Cyber Science and Engineering, Southeast University, Nanjing, China
7 shared publications - Yu Gao
School of Cyber Science and Engineering, Southeast University, Nanjing, China
5 shared publications - Zuyan Wang
School of Cyber Science and Engineering, Southeast University, Nanjing, China
5 shared publications - Dingwen Chi
Southeast University
4 shared publications - Weice Sun
School of Cyber Science and Engineering, Southeast University, Nanjing, China
3 shared publications
Latest Publications
- 8 October 2026
- Published by Springer Nature
- p. 535-549
M-DPTD: A Differential Privacy Framework for Trajectory Data in Mobile Crowdsensing
- 8 October 2026
- Published by Springer Nature
- p. 535-549
M-DPTD: A Differential Privacy Framework for Trajectory Data in Mobile Crowdsensing
- 22 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (15) , 1
IR-LDP: Threshold-Driven Quality-Aware Incentives from a Public Bid-Bounding Perspective
Mobile crowdsensing (MCS), a human-in-the-loop IoT sensing paradigm, relies on active user participation. However, in untrusted environments, incentive design faces a fundamental trilemma among strict local differential privacy (LDP), individual rationality (IR), and system efficiency under limited budgets. LDP perturbation can obscure cost–quality correlations and undermine quality-aware selection, and it may even push selected users into negative utility. Meanwhile, most existing mechanisms either overlook privacy concerns or depend on heavyweight cryptographic frameworks, which are often impractical for resource-constrained mobile devices. To address these challenges, we propose IR-LDP, a lightweight LDP auction mechanism that explicitly manages the economic risk introduced by LDP noise under fixed budgets while guaranteeing deterministic IR. Specifically, IR-LDP introduces two design notions for LDP auctions: a public safety threshold that ensures ex-post IR for selected low-cost users, and a publicly bounded loss guarantee that caps each winner’s worst-case utility loss using only public system parameters. To realize these guarantees, IR-LDP employs a public projection strategy that projects noisy bids onto the safety threshold to bound downside utility risk, together with a nonlinear quality-aware ranking rule that prioritizes high-ROI users and mitigates the “lemon market” effect induced by LDP noise. We prove that IR-LDP satisfies ϵ-LDP for reported bids, maintains strict budget feasibility, and runs in O(N logN) time. Extensive simulations across diverse budget regimes and user populations further demonstrate that IR-LDP outperforms representative baselines in social welfare, sensing quality, and budget efficiency, while providing ex-post IR for users with costs below the public threshold and a publicly known bound on utility loss for all participants.
- 22 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (15) , 1
IR-LDP: Threshold-Driven Quality-Aware Incentives from a Public Bid-Bounding Perspective
Mobile crowdsensing (MCS), a human-in-the-loop IoT sensing paradigm, relies on active user participation. However, in untrusted environments, incentive design faces a fundamental trilemma among strict local differential privacy (LDP), individual rationality (IR), and system efficiency under limited budgets. LDP perturbation can obscure cost–quality correlations and undermine quality-aware selection, and it may even push selected users into negative utility. Meanwhile, most existing mechanisms either overlook privacy concerns or depend on heavyweight cryptographic frameworks, which are often impractical for resource-constrained mobile devices. To address these challenges, we propose IR-LDP, a lightweight LDP auction mechanism that explicitly manages the economic risk introduced by LDP noise under fixed budgets while guaranteeing deterministic IR. Specifically, IR-LDP introduces two design notions for LDP auctions: a public safety threshold that ensures ex-post IR for selected low-cost users, and a publicly bounded loss guarantee that caps each winner’s worst-case utility loss using only public system parameters. To realize these guarantees, IR-LDP employs a public projection strategy that projects noisy bids onto the safety threshold to bound downside utility risk, together with a nonlinear quality-aware ranking rule that prioritizes high-ROI users and mitigates the “lemon market” effect induced by LDP noise. We prove that IR-LDP satisfies ϵ-LDP for reported bids, maintains strict budget feasibility, and runs in O(N logN) time. Extensive simulations across diverse budget regimes and user populations further demonstrate that IR-LDP outperforms representative baselines in social welfare, sensing quality, and budget efficiency, while providing ex-post IR for users with costs below the public threshold and a publicly known bound on utility loss for all participants.
- 26 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (3) , 2955-2968
Task-Complexity-Driven Stability Phase Transitions in Crowdsensing Systems
Task complexity is widely regarded as a major barrier to cooperation in mobile crowdsensing (MCS), often leading to trust collapse and market failure. However, this view overlooks the constructive role of task complexity in shaping cooperative evolution. In this article, we propose a three-party evolutionary game framework involving workers, platforms, and task requesters, in which task complexity is explicitly modeled as an endogenous driver of trust dynamics and strategic interactions. We derive a set of anti-collapse conditions under which the marginal benefits of cooperative behavior overcompensate for the marginal costs induced by task complexity. Task complexity thereby propels an evolutionary phase transition from a low-trust trap to a stable cooperative equilibrium by reshaping the payoff structure of cooperative strategies. We further characterize the critical complexity thresholds that govern this phase transition through theoretical stability analysis. Extensive numerical simulations validate the theoretical predictions and demonstrate the robustness and effectiveness of the proposed mechanism in sustaining cooperative behavior across a wide range of task complexities.
- 26 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (3) , 2955-2968
Task-Complexity-Driven Stability Phase Transitions in Crowdsensing Systems
Task complexity is widely regarded as a major barrier to cooperation in mobile crowdsensing (MCS), often leading to trust collapse and market failure. However, this view overlooks the constructive role of task complexity in shaping cooperative evolution. In this article, we propose a three-party evolutionary game framework involving workers, platforms, and task requesters, in which task complexity is explicitly modeled as an endogenous driver of trust dynamics and strategic interactions. We derive a set of anti-collapse conditions under which the marginal benefits of cooperative behavior overcompensate for the marginal costs induced by task complexity. Task complexity thereby propels an evolutionary phase transition from a low-trust trap to a stable cooperative equilibrium by reshaping the payoff structure of cooperative strategies. We further characterize the critical complexity thresholds that govern this phase transition through theoretical stability analysis. Extensive numerical simulations validate the theoretical predictions and demonstrate the robustness and effectiveness of the proposed mechanism in sustaining cooperative behavior across a wide range of task complexities.
- 16 November 2025
- Published by Springer Nature
- p. 38-50
A Reputation-Driven Malicious User Detection for Truth Discovery in Mobile Crowdsensing
- 16 November 2025
- Published by Springer Nature
- p. 38-50
A Reputation-Driven Malicious User Detection for Truth Discovery in Mobile Crowdsensing
- 2 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (6) , 4276-4290
Toward Personalized Privacy-Preserving Content Caching With Edge Cooperation
Caching content at the edge network has emerged as a critical technique to alleviate backhaul congestion, minimize service latency, and improve user Quality of Experience (QoE). Driven by operational profitability, the edge service provider (ESP) necessitates access to user preference data to optimize its caching policies. However, disseminating such sensitive information raises significant privacy concerns. To address this challenge, we propose a privacy-preserving cooperative edge caching framework that jointly enhances caching efficiency and safeguards user preference privacy. Specifically, we design a privacy-oriented popularity estimation protocol, PSRSA, which guarantees the preservation of user privacy while delivering precise content popularity estimations. The PSRSA protocol integrates a randomize-then-shuffle mechanism to obfuscate user data locally prior to aggregation and accommodates heterogeneous privacy preservation requirements across users by dynamically adjusting differential privacy (DP) budgets. Subsequently, we formulate a Stackelberg Game-based Edge Caching (SGEC) algorithm that jointly optimizes the utility functions of both the content provider (CP) and the ESP, thereby ensuring efficient resource allocation at edge servers. Comprehensive evaluations conducted on real-world datasets demonstrate the superiority of the integrated PSRSA+SGEC framework, exhibiting a 35.22% increase in caching utility and a 3.4% improvement in cache hit ratio, while simultaneously achieving a 20.1% reduction in privacy leakage risks, compared to state-of-the-art baselines.
- 2 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (6) , 4276-4290
Toward Personalized Privacy-Preserving Content Caching With Edge Cooperation
Caching content at the edge network has emerged as a critical technique to alleviate backhaul congestion, minimize service latency, and improve user Quality of Experience (QoE). Driven by operational profitability, the edge service provider (ESP) necessitates access to user preference data to optimize its caching policies. However, disseminating such sensitive information raises significant privacy concerns. To address this challenge, we propose a privacy-preserving cooperative edge caching framework that jointly enhances caching efficiency and safeguards user preference privacy. Specifically, we design a privacy-oriented popularity estimation protocol, PSRSA, which guarantees the preservation of user privacy while delivering precise content popularity estimations. The PSRSA protocol integrates a randomize-then-shuffle mechanism to obfuscate user data locally prior to aggregation and accommodates heterogeneous privacy preservation requirements across users by dynamically adjusting differential privacy (DP) budgets. Subsequently, we formulate a Stackelberg Game-based Edge Caching (SGEC) algorithm that jointly optimizes the utility functions of both the content provider (CP) and the ESP, thereby ensuring efficient resource allocation at edge servers. Comprehensive evaluations conducted on real-world datasets demonstrate the superiority of the integrated PSRSA+SGEC framework, exhibiting a 35.22% increase in caching utility and a 3.4% improvement in cache hit ratio, while simultaneously achieving a 20.1% reduction in privacy leakage risks, compared to state-of-the-art baselines.
- 15 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (4) , 1688-1701
CloudRGK: Towards Private Similarity Measurement Between Graphs on the Cloud
Graph kernels are a significant class of tools for measuring the similarity of graph data, which is the basis of a wide range of graph learning methods. However, graph kernels often suffer from high computing overhead. With the shining of cloud computing, it is desirable to transfer the computing burden to the server with abundant computing resources to reduce the cost of local machines. Nonetheless, under the honest-but-curious cloud assumption, the server may peek at the data, raising privacy concerns. To eliminate the risk of data privacy leakage, we propose CloudRGK to securely perform Random walk Graph Kernel(RGK), one of the most well-known graph kernels, on the cloud. We first prove that the edge- and vertex-labeled graphs could be transformed into an equivalent matrix representation. Afterward, we prove that the cloud could perform the core operations in RGK on the encrypted graphs without feature information loss. Evaluations of the real-world graph data demonstrate that our strategy significantly reduces the overhead of the local party to perform RGK without performance degradation. Meanwhile, it introduces only a small amount of extra computation cost. To the best of our knowledge, it is the first work towards private graph kernel computation on the cloud.
- 15 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (4) , 1688-1701
CloudRGK: Towards Private Similarity Measurement Between Graphs on the Cloud
Graph kernels are a significant class of tools for measuring the similarity of graph data, which is the basis of a wide range of graph learning methods. However, graph kernels often suffer from high computing overhead. With the shining of cloud computing, it is desirable to transfer the computing burden to the server with abundant computing resources to reduce the cost of local machines. Nonetheless, under the honest-but-curious cloud assumption, the server may peek at the data, raising privacy concerns. To eliminate the risk of data privacy leakage, we propose CloudRGK to securely perform Random walk Graph Kernel(RGK), one of the most well-known graph kernels, on the cloud. We first prove that the edge- and vertex-labeled graphs could be transformed into an equivalent matrix representation. Afterward, we prove that the cloud could perform the core operations in RGK on the encrypted graphs without feature information loss. Evaluations of the real-world graph data demonstrate that our strategy significantly reduces the overhead of the local party to perform RGK without performance degradation. Meanwhile, it introduces only a small amount of extra computation cost. To the best of our knowledge, it is the first work towards private graph kernel computation on the cloud.
- 17 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (1) , 295-305
Tradeoff Between Capacity and Cost: Maximizing User Recruitment Through Collaboration in Mobile Crowdsensing
Utilizing mobile crowdsensing (MCS) for data collection and analysis has become a prominent paradigm in the Internet of Things (IoTs). However, the existing research predominantly focuses on platform-user interactions, often neglecting the potential for user collaboration, which is crucial for improving data quality and task efficiency. In practical applications, mobile users tend to cooperate with familiar individuals based on their preferences in sensing tasks. To tackle this issue, we introduce a novel MCS model that integrates user cooperation, significantly enhancing the system's overall effectiveness. Specifically, users’ capabilities and costs are synthesized and managed through a cooperation degree matrix. Additionally, cooperation is updated based on historical behaviors and user preferences. To incentivize user participation, currencies are employed for recruitment. Within this framework, we investigate the maximum collaborative user selection (MCUS) problem, which is dedicated to the problem of maximizing the amount of recruitment under user cooperation. The MCUS problem is proved to be an NP-hard problem and thus intractable. To address this, we propose the minimum weighted cost replacement (MWCR) algorithm. Experimental results demonstrate that the MWCR algorithm exhibits low complexity and high efficiency across various scales, making it an excellent solution for collaborative crowd recruitment.
- 17 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (1) , 295-305
Tradeoff Between Capacity and Cost: Maximizing User Recruitment Through Collaboration in Mobile Crowdsensing
Utilizing mobile crowdsensing (MCS) for data collection and analysis has become a prominent paradigm in the Internet of Things (IoTs). However, the existing research predominantly focuses on platform-user interactions, often neglecting the potential for user collaboration, which is crucial for improving data quality and task efficiency. In practical applications, mobile users tend to cooperate with familiar individuals based on their preferences in sensing tasks. To tackle this issue, we introduce a novel MCS model that integrates user cooperation, significantly enhancing the system's overall effectiveness. Specifically, users’ capabilities and costs are synthesized and managed through a cooperation degree matrix. Additionally, cooperation is updated based on historical behaviors and user preferences. To incentivize user participation, currencies are employed for recruitment. Within this framework, we investigate the maximum collaborative user selection (MCUS) problem, which is dedicated to the problem of maximizing the amount of recruitment under user cooperation. The MCUS problem is proved to be an NP-hard problem and thus intractable. To address this, we propose the minimum weighted cost replacement (MWCR) algorithm. Experimental results demonstrate that the MWCR algorithm exhibits low complexity and high efficiency across various scales, making it an excellent solution for collaborative crowd recruitment.
- Open Access
- 10 April 2024
- Published by Springer Nature in Research Square
Particle Swarm Optimization with Latin Hypercube Sampling for Mobility-Aware Task Offloading in D2D-Assisted MEC Networks
In this paper, we consider a Device-to-Device (D2D)-assisted Mobile Edge Computing (MEC) system in which the edge server collaboratively performs tasks with users who possess mobile characteristics. The computational resources of the edge server and the users are limited. Our objective is to minimize latency and energy consumption while maximizing system stability by determining the offloading decisions for all tasks. However, solving this problem is particularly challenging due to the coupling between offloading decisions and user mobility characteristics. To address this challenge, a Particle Swarm Optimization (PSO) algorithm based on Latin Hypercube Sampling (LHS) is proposed. PSO can be employed for iterative computation to obtain the optimal solution by treating the offloading decisions for all tasks as particles. Furthermore, employing LHS for the initialization and updating of the particle swarm can significantly enhance the performance and convergence of the PSO. Simulation results indicate that our proposed algorithm outperforms other algorithms significantly in terms of latency, energy consumption, and system stability while also exhibiting excellent robustness.
- 10 April 2024
- Published by Springer Nature in Research Square
Open AccessParticle Swarm Optimization with Latin Hypercube Sampling for Mobility-Aware Task Offloading in D2D-Assisted MEC Networks
In this paper, we consider a Device-to-Device (D2D)-assisted Mobile Edge Computing (MEC) system in which the edge server collaboratively performs tasks with users who possess mobile characteristics. The computational resources of the edge server and the users are limited. Our objective is to minimize latency and energy consumption while maximizing system stability by determining the offloading decisions for all tasks. However, solving this problem is particularly challenging due to the coupling between offloading decisions and user mobility characteristics. To address this challenge, a Particle Swarm Optimization (PSO) algorithm based on Latin Hypercube Sampling (LHS) is proposed. PSO can be employed for iterative computation to obtain the optimal solution by treating the offloading decisions for all tasks as particles. Furthermore, employing LHS for the initialization and updating of the particle swarm can significantly enhance the performance and convergence of the PSO. Simulation results indicate that our proposed algorithm outperforms other algorithms significantly in terms of latency, energy consumption, and system stability while also exhibiting excellent robustness.
- 19 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (2) , 1660-1671
DGNN: Accurate Darknet Application Classification Adopting Attention Graph Neural Network
Encrypted communications, implemented for the confidential information exchange, facilitate the preservation of individual privacy. Unfortunately, some criminals abuse encrypted communications to conduct illegal activities, leading to the proliferation of the Darknet. To curb malicious darknet activities, the accurate and effective classification of darknet traffic is imperative. Considerable endeavors have been devoted to identifying the darknet traffic. However, the classification of darknet applications has not yielded a satisfactory result. This deficiency arises from the limitations of current approaches, e.g., some traditional methods rely on hand-crafted features that consume labor, and other neural network-based methods disregard the graph structure of the traffic. To tackle these challenges, we propose the Darknet Traffic Graph (DTG), a graph structure that captures the interactions between local clients and remote servers in darknet traffic. Furthermore, based on DTG, we combine the GNN model and attention mechanism to create the Darknet Graph Neural Networks, i.e., DGNN, a powerful model that sufficiently exploits the benign and darknet traffic features. As a result, on the CIC-Darknet2020 dataset, the accuracy of DGNN in traffic classification and application classification is 98.52% and 99.06%, respectively, which outperforms other classifiers.
- 19 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (2) , 1660-1671
DGNN: Accurate Darknet Application Classification Adopting Attention Graph Neural Network
Encrypted communications, implemented for the confidential information exchange, facilitate the preservation of individual privacy. Unfortunately, some criminals abuse encrypted communications to conduct illegal activities, leading to the proliferation of the Darknet. To curb malicious darknet activities, the accurate and effective classification of darknet traffic is imperative. Considerable endeavors have been devoted to identifying the darknet traffic. However, the classification of darknet applications has not yielded a satisfactory result. This deficiency arises from the limitations of current approaches, e.g., some traditional methods rely on hand-crafted features that consume labor, and other neural network-based methods disregard the graph structure of the traffic. To tackle these challenges, we propose the Darknet Traffic Graph (DTG), a graph structure that captures the interactions between local clients and remote servers in darknet traffic. Furthermore, based on DTG, we combine the GNN model and attention mechanism to create the Darknet Graph Neural Networks, i.e., DGNN, a powerful model that sufficiently exploits the benign and darknet traffic features. As a result, on the CIC-Darknet2020 dataset, the accuracy of DGNN in traffic classification and application classification is 98.52% and 99.06%, respectively, which outperforms other classifiers.
- 22 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (2) , 2656-2668
IMRSG: Incentive Mechanism Based on Rubinstein-Starr Game for Mobile CrowdSensing
Exploiting mobile crowdsensing to conduct data collection and analysis has become an emerging trend in IoT computing models. However, in practice, mobile users in crowdsensing networks are unwilling to participate in perceptual tasks without effective stimulation due to limited resources and strategic selfishness. To tackle the problem, a new incentive mechanism is proposed by adopting game theory in this paper. Specifically, the mobile users' preference is considered comprehensively and their energy is changed dynamically through the scheme. Furthermore, the users' preference and energy changes are exploited as equation factors between subsequent users and the platform. To motivate users, we introduce the concept of virtual currency and set a price function that rewards users for participating in sensing tasks in the form of virtual currency. To fit into practical scenarios, we map task interactions to a Rubinstein-Starr bargaining game between a user and sensing platforms based on a fully informative turn-based bargaining model. Through multiple rounds of games between users and crowdsensing platforms, we prove that there is a unique Nash Equilibrium point in the sub-game process of both parties. The analysis based on these models lays a theoretical foundation on the incentive process of mobile crowdsensing. The soundness of modeling and the accuracy of analysis are verified through extensive simulation, which also guides the design of more sophisticated incentive schemes.
- 22 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (2) , 2656-2668
IMRSG: Incentive Mechanism Based on Rubinstein-Starr Game for Mobile CrowdSensing
Exploiting mobile crowdsensing to conduct data collection and analysis has become an emerging trend in IoT computing models. However, in practice, mobile users in crowdsensing networks are unwilling to participate in perceptual tasks without effective stimulation due to limited resources and strategic selfishness. To tackle the problem, a new incentive mechanism is proposed by adopting game theory in this paper. Specifically, the mobile users' preference is considered comprehensively and their energy is changed dynamically through the scheme. Furthermore, the users' preference and energy changes are exploited as equation factors between subsequent users and the platform. To motivate users, we introduce the concept of virtual currency and set a price function that rewards users for participating in sensing tasks in the form of virtual currency. To fit into practical scenarios, we map task interactions to a Rubinstein-Starr bargaining game between a user and sensing platforms based on a fully informative turn-based bargaining model. Through multiple rounds of games between users and crowdsensing platforms, we prove that there is a unique Nash Equilibrium point in the sub-game process of both parties. The analysis based on these models lays a theoretical foundation on the incentive process of mobile crowdsensing. The soundness of modeling and the accuracy of analysis are verified through extensive simulation, which also guides the design of more sophisticated incentive schemes.