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

Jingpu Liang

dblp:310/6171 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0002-4473-0537ORCID · corroborated

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

Security and privacy · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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.

Network and information security
1 paper
Privacy and data protection · 50% Authentication and access control · 50%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection › privacy-preserving sensing
privacy-preserving crowdsensing
1.012026
Multidimensional Trust Evaluation and Task Match Based Workers Recruitment Scheme for MCS · IEEE Trans. Dependable Secur. Comput. 2026
Authentication and access control › trust management
trust evaluation
1.012026
Multidimensional Trust Evaluation and Task Match Based Workers Recruitment Scheme for MCS · IEEE Trans. Dependable Secur. Comput. 2026
Internet of things and sensor networks
mobile crowdsensing
0.312026
Multidimensional Trust Evaluation and Task Match Based Workers Recruitment Scheme for MCS · IEEE Trans. Dependable Secur. Comput. 2026
Internet of things and sensor networks › mobile crowdsensing
task matching
0.312026
Multidimensional Trust Evaluation and Task Match Based Workers Recruitment Scheme for MCS · IEEE Trans. Dependable Secur. Comput. 2026

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

upper confidence bound · 2.0optimized data quality matching · 2.0expectation-maximization · 2.0
YearPublicationVenuePosition
2026 Multidimensional Trust Evaluation and Task Match Based Workers Recruitment Scheme for MCS
abstract
Recruiting trust workers to achieve high data quality at low cost has become a promising approach in Mobile Crowdsensing (MCS). However, most existing trust evaluation methods only adopt a single-dimensional trust model, neglecting the fact that a worker's trustworthiness can vary across different task types, which leads to suboptimal task–worker matching, poor data quality, and inefficient cost utilization. To this end, we propose a Multidimensional Trust Evaluation and Task Matching (MTE-TM) based workers recruitment scheme to improve data quality while reducing costs for MCS. First, we represent worker trustworthiness by a composite of expected trust values and variance, enabling task-specific trust assessment that extends traditional single-dimensional trust to a multidimensional domain. A novel Expectation-Maximization (EM)-based trust evaluation mechanism is also introduced to improve accuracy. Second, we design a new worker selection method that combines a worker's trust level and the width of the confidence interval to compute their Upper Confidence Bound (UCB) index, which effectively guides worker selection toward optimal outcomes. Third, we propose an Optimized Data Quality Matching (ODQM) algorithm that assigns tasks to workers with high priority and low bid prices under budget constraints, thereby further improving data quality. The experimental results demonstrate the significant performance improvements of our scheme, achieving 45.54$\sim$95.55% optimization in trust evaluation, 65.01$\sim$72.95% improvement in data quality, and a notable reduction in regret.
Yuxin Liu 0001, Ziyi He, Jingpu Liang, Zhetao Li, Qingyong Deng
IEEE Trans. Dependable Secur. Comput.3
2022 An Intelligent and Trust UAV-Assisted Code Dissemination 5G System for Industrial Internet-of-Things
abstract
A large number of devices with communication and sensing capabilities are connected to the 5G network and facilitate distributed industrial Internet of Things (IIoT) applications. Those devices can update their program code by using software-defined technologies and upgrade functions without hardware replacement, thus, greatly facilitating the development of IIoT applications. Disseminating code safely to these devices is a pivotal issue. However, the existing methods rarely consider whether the code received by devices is integrated. Therefore, an unmanned aerial vehicle (UAV) assisted trustworthy code dissemination (UTCD) framework in 5G-enabled intelligent IIoT systems is proposed to select credible mobile vehicles (MVs) to disseminate code with opportunistic routing style. In the UTCD framework, a verifiable trust evaluation scheme is proposed to identify the trust of the MVs by sending the UAV to collect the code wait to be verified (CWV) directly from the selected devices (bedrock devices) as evidence. This scheme is a fundamental change from the previous passive, indirect and unverifiable trust evaluation schemes. In UTCD, a bedrock devices selection scheme is presented by selecting as few bedrock devices as possible to collect as much the CWV as possible with the minimum cost. After that, based on the CWV, which is collected from bedrock devices, a complete trust evaluation scheme is proposed to obtain the trust of MVs. Furthermore, a UAV trajectory optimization algorithm is proposed to obtain as much CWV as possible within the limited conditions of UAV. Finally, comprehensive experiments conduct on a real-life dataset demonstrate that the proposed scheme outperforms the existing schemes in terms of the efficiency and security of code dissemination.
Jingpu Liang, Wei Liu 0077, Naixue Xiong, Anfeng Liu, Shaobo Zhang 0001
IEEE Trans. Ind. Informatics1