Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yajiang Huang

dblp:381/2889 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2026
0009-0006-5023-0738ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Computer networks · 2 · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 50% Network optimization and economics · 50%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › wireless sensor network
data collection
0.912025
QLP-DCS: A Quality-Aware, Low-Cost, and Privacy-Preserving Data Collection Service for Mobile Crowd Sensing · IEEE Trans. Serv. Comput. 2025
Network optimization and economics › game theory
game-theoretic networking
0.912025
QLP-DCS: A Quality-Aware, Low-Cost, and Privacy-Preserving Data Collection Service for Mobile Crowd Sensing · IEEE Trans. Serv. Comput. 2025
Internet of things and sensor networks
mobile crowdsensing
0.912025
QLP-DCS: A Quality-Aware, Low-Cost, and Privacy-Preserving Data Collection Service for Mobile Crowd Sensing · IEEE Trans. Serv. Comput. 2025
Network optimization and economics › auction mechanism
reverse auction
0.912025
QLP-DCS: A Quality-Aware, Low-Cost, and Privacy-Preserving Data Collection Service for Mobile Crowd Sensing · IEEE Trans. Serv. Comput. 2025
Privacy and data protection
location privacy
0.912025
QLP-DCS: A Quality-Aware, Low-Cost, and Privacy-Preserving Data Collection Service for Mobile Crowd Sensing · IEEE Trans. Serv. Comput. 2025

Methods — techniques the papers use, named apart from their topics

upper confidence bound · 1.7truth discovery · 1.7reverse auction · 1.7matrix perturbation · 1.7
YearPublicationVenuePosition
2026 PPT-TWR: A Privacy-Preserving Trust learning scheme for intelligent team worker recruitment in Mobile Crowd sensing
Yajiang Huang, Yipu Gong, Feijiang Han, Anfeng Liu, Tian Wang 0001, Mianxiong Dong, Houbing Song
Expert Syst. Appl.1
2026 PUWR-TSSG: A CMAB-based post-unknown worker recruitment scheme for Three-Stage Stackelberg Games in Mobile Crowd Sensing
Kejia Fan, Jianheng Tang 0001, Yaohui Han, Yajiang Huang, Anfeng Liu, Naixue Xiong, Shaobo Zhang 0001, Tian Wang 0001, Mianxiong Dong
Inf. Sci.5
2026 TPTD: A trusted privacy-preserving truth discovery scheme for quality enhancement in team-based mobile crowd sensing
Yajiang Huang, Yipu Gong, Yanbo Zhai, Songning Lai, Anfeng Liu, Tian Wang 0001, Mianxiong Dong, Houbing Song
Knowl. Based Syst.1
2025 A Quality-Aware and Obfuscation-Based Data Collection Scheme for Cyber-Physical Metaverse Systems
abstract
In pursuit of an immersive virtual experience within the Cyber-Physical Metaverse Systems (CPMS), the construction of Avatars often requires a significant amount of real-world data. Mobile Crowd Sensing (MCS) has emerged as an efficient method for collecting data for CPMS. While progress has been made in protecting the privacy of workers, little attention has been given to safeguarding task privacy, potentially exposing the intentions of applications and posing risks to the development of the Metaverse. Additionally, existing privacy protection schemes hinder the exchange of information among entities, inadvertently compromising the quality of the collected data. To this end, we propose a Quality-aware and Obfuscation-based Task Privacy-Preserving (QOTPP) scheme, which protects task privacy and enhances data quality without third-party involvement. The QOTPP scheme initially employs the insight of “showing the fake, and hiding the real” by employing differential privacy techniques to create fake tasks and conceal genuine ones. Additionally, we introduce a two-tier truth discovery mechanism using Deep Matrix Factorization (DMF) to efficiently identify high-quality workers. Furthermore, we propose a Combinatorial Multi-Armed Bandit (CMAB)-based worker incentive and selection mechanism to improve the quality of data collection. Theoretical analysis confirms that our QOTPP scheme satisfies essential properties such as truthfulness, individual rationality, and ε-differential privacy. Extensive simulation experiments validate the state-of-the-art performance achieved by QOTPP.
Jianheng Tang 0001, Kejia Fan, Yajiang Huang, Anfeng Liu, Naixue Xiong, Mianxiong Dong, Tian Wang 0001, Shaobo Zhang 0001
ACM Trans. Multim. Comput. Commun. Appl.5
2025 QLP-DCS: A Quality-Aware, Low-Cost, and Privacy-Preserving Data Collection Service for Mobile Crowd Sensing
abstract
In the service of Mobile Crowd Sensing (MCS), High-quality Data Collection (HDC), Bilateral Location Privacy Preservation (BLPP), and sensing cost are three pivotal issues. It is widely believed that HDC necessitates the recruitment of workers with high Quality of Service (QoS), which is related to the sensing data capabilities of the recruited workers and the worker-task distances. However, submitting high-quality data demands more resources from the workers, incurring higher costs. Meanwhile, BLPP techniques, aiming to conceal the locations of the workers and tasks, may impede the evaluation of the workers' QoS. Therefore, there is still a lack of a low-cost and BLPP high QoS data collection research. Motivated by this, we propose a Quality-Aware, Low-Cost, and Privacy-Preserving Data Collection Service (QLP-DCS) for MCS. First, we propose a matrix perturbation-based approach to achieve BLPP while preserving the partial order relationship of distances. Subsequently, we employ the Upper Confidence Bound indexes-based reverse auction recruiting workers to balance exploration and exploitation with the low sensing cost. Then, we propose a multi-level truth discovery approach and establish an effective trust verification mechanism. Theoretical analysis and extensive experiments validate the superior performance of our QLP-DCS.
Yajiang Huang, Jialin Guo, Anfeng Liu, Jianheng Tang 0001, Tian Wang 0001, Mianxiong Dong, Houbing Song
IEEE Trans. Serv. Comput.1
2024 CRL-MABA: A Completion Rate Learning-Based Accurate Data Collection Scheme in Large-Scale Energy Internet
abstract
The Energy Internet (EI) aims to build a sustainable energy ecosystem by connecting diverse energy sources and prosumers. Mobile Crowd Sensing (MCS) enables efficient data collection for monitoring and aggregation from distributed devices. Given the complex behavior of workers driven by self-interest, recruiting trustworthy, high-quality, and inexpensive workers remains a significant challenge in research and practice. Previous studies often assume that worker characteristics are known or can be obtained after data collection. However, evaluating worker qualities is quite challenging in the face of multi-source data and complex workers. To address this, we propose a Completion Rate Learning based Multi-Armed Bandit reverse Auction (CRL-MABA) scheme for identifying and selecting high-quality workers in MCS. Our CRL-MABA scheme first proposes a Spatial-Temporal Upper Confidence Bound (STUCB) method to recruit workers, considering both the quality of workers for exploitation and the spatiotemporal features for exploration. In addition, the Dual-Stage Data Estimation Mechanism (DSDEM) and Long-Term and Short-Term Memory Learning (LTSTML) are designed to identify workers accurately and efficiently. Importantly, our proposed scheme avoids the impractical assumptions in previous works while satisfying important criteria such as truthfulness, individual rationality, and computational efficiency. The effectiveness of our scheme is demonstrated through extensive experimental results, which show its superiority over existing strategies.
Kejia Fan, Jianheng Tang 0001, Wenxuan Xie, Feijiang Han, Yajiang Huang, Zhenzhe Qu, Anfeng Liu, Naixue Xiong, Tian Wang 0001, Shaobo Zhang 0001
IEEE Internet Things J.5