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

Ping Wang 0045

dblp:37/1304-45 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2024
0009-0006-9259-8223ORCID · conflict

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

Computer networks · 4 · 3 first-author · 4 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 · 75% Network optimization and economics · 25%
Network and information security
1 paper
Cryptographic protocols and secure computation · 50% Cryptographic primitives and cryptanalysis · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › mechanism design
incentive mechanism
0.812024
A UAV-Assisted Truth Discovery Approach With Incentive Mechanism Design in Mobile Crowd Sensing · IEEE/ACM Trans. Netw. 2024
Internet of things and sensor networks
mobile crowdsensing
0.812024
A UAV-Assisted Truth Discovery Approach With Incentive Mechanism Design in Mobile Crowd Sensing · IEEE/ACM Trans. Netw. 2024
Internet of things and sensor networks › mobile crowdsensing
truth discovery
0.812024
A UAV-Assisted Truth Discovery Approach With Incentive Mechanism Design in Mobile Crowd Sensing · IEEE/ACM Trans. Netw. 2024
Internet of things and sensor networks › mobile sensing › aerial sensing
UAV-assisted sensing
0.812024
A UAV-Assisted Truth Discovery Approach With Incentive Mechanism Design in Mobile Crowd Sensing · IEEE/ACM Trans. Netw. 2024
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.812024
Propagation Verification Under Social Relationship Privacy Awareness in Mobile Crowdsourcing · IEEE Trans. Mob. Comput. 2024
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.812024
Propagation Verification Under Social Relationship Privacy Awareness in Mobile Crowdsourcing · IEEE Trans. Mob. Comput. 2024

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

zero-knowledge proofs · 1.5trust evaluation · 1.5homomorphic encryption · 1.5trust modeling · 0.8game theory · 0.8
YearPublicationVenuePosition
2024 Recruitment From Social Networks for the Cold Start Problem in Mobile Crowdsourcing
abstract
Mobile crowdsourcing (MCS) endeavors to attain reliable truth by recruiting large numbers of users with handheld mobile devices to collect the data. However, during the early stages of platform development, MCS encounters the cold start problem, failing to complete the task. Existing research addresses this issue by leveraging social networks for user recruitment. Nevertheless, there is a predominant focus on the user quantity, and the quality of task completion is ignored. Additionally, fairness considerations among users are lacking. Therefore, this article proposes recruitment based on social users’ trust (RSUT) to solve the cold start problem while maintaining high task completion quality. Specifically, we propose the activation model based on the user awareness to simulate the influence of social users and task attributes on activation from the perspective of unregistered users, which is more realistic. Additionally, we measure the user’s contribution and then design a reward system based on the user’s contribution to ensure fairness. Finally, social network-based trust evaluation is proposed to identify malicious users and update rewards in real time according to task requirements to ensure high-quality completion of tasks within budget constraints. Extensive experimental results demonstrate the superior performance of RSUT compared to the state-of-the-art methods in task completion quality, user recruitment, and task completion rate.
Ping Wang 0045, Zhetao Li, Saiqin Long, Jiangtao Wang 0001, Zhihui Tan, Haolin Liu 0001
IEEE Internet Things J.1
2024 Propagation Verification Under Social Relationship Privacy Awareness in Mobile Crowdsourcing
abstract
Mobile crowdsourcing aims to recruit enough workers holding mobile devices to collect data. Nevertheless, the platform will have cold start problems when the number of workers is limited. Existing studies have proposed solving this problem by propagating tasks to social networks for social recruitment. However, they neglect to verify workers’ propagation, leading to malicious workers reducing the platform's utility. Furthermore, during propagation verification, it is imperative to protect the privacy of social relationships among workers, as it can significantly influence the propagation. Therefore, this paper proposes Zero-knowledge Propagation Verification based on Social Relationship Encryption (ZPV-SRE) to improve the platform's utility. Specifically, we transform the propagation verification problem into a problem of computing the solution of the function. Then, the Zero-knowledge proof is used to prove the propagation, in which the worker's social relationship is protected through homomorphic encryption. Considering that ZPV-SRE will incur a significant time cost, we propose Trust-guided Zero-knowledge Propagation Verification based on Social Relationship Encryption (TZPV-SRE), which updates the worker's trust based on the verification results and selects suspicious workers for verification. The experimental results show ZPV-SRE improves the platform's utility as high as 104.05% over the state-of-the-art methods, while TZPV-SRE reduces time costs and ensures improvement.
Ping Wang 0045, Saiqin Long, Haolin Liu 0001, Qingyong Deng, Zhetao Li
IEEE Trans. Mob. Comput.1
2024 A UAV-Assisted Truth Discovery Approach With Incentive Mechanism Design in Mobile Crowd Sensing
abstract
Incentive mechanisms are essential to incentive workers carrying mobile handheld devices to participate in mobile crowd sensing and finally achieve good truth discovery performance. However, malicious workers may report false or malicious data to defraud rewards, resulting in service quality degradation. Moreover, the existing incentive mechanism is challenging to identify malicious workers when recruiting workers in reality, which results in low accuracy of truth discovery and waste of cost. In this paper, we propose an Incentive-based Truth Discovery (ITD) scheme to incentive credible workers to submit high-quality data, thereby enhancing the accuracy of truth discovery. In the ITD, an unmanned aerial vehicle (UAV)-assisted split-aggregation truth discovery mechanism is proposed firstly to infer the truth. The addition of the UAV can improve the accuracy of truth discovery and assist in evaluating workers’ trust. Then, we evaluate the quality of participants’ data and propose a data quality-based trust meter to update each worker’s trust to guide future recruitment efforts. Finally, a Quality-aware Trustworthy Incentive (QTI) mechanism is proposed to select credible workers for data collection and provide them with reasonable payments. The experimental results show that ITD improves the accuracy of truth discovery by 98.47%, over the state-of-the-art, at a sensing cost reduced by as high as 43.89%.
Ping Wang 0045, Zhetao Li, Bin Guo 0001, Saiqin Long, Suiming Guo, Jiannong Cao 0001
IEEE/ACM Trans. Netw.1
2023 A novel coverage-aware task allocation scheme in Cooperative Mobile Crowd Sensing
Zhetao Li, Zhihui Tan, Saiqin Long, Ping Wang 0045, Qingyong Deng
Ad Hoc Networks5