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

Xiangwan Fu

dblp:367/7614 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2026
0000-0002-4001-7005ORCID · corroborated

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

Computer networks · 2 · 2 first-author · 2 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 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.

Computer networks
2 papers
Internet of things and sensor networks · 85% Network optimization and economics · 15%
Human-computer interaction and pervasive computing
1 paper
Ubiquitous computing and smart environments · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
mobile crowdsensing
1.922026
TMTA: A Truthful Multi-Task Allocation Scheme for Enhancing Service Quality in Sparse Mobile Crowdsensing · IEEE Trans. Serv. Comput. 2026
Truthful and Dual-Direction Combinatorial Multi-Armed Bandit Scheme to Maximize Profit for Mobile Crowd Sensing · IEEE Trans. Dependable Secur. Comput. 2025
Ubiquitous computing and smart environments › mobile crowdsourcing › crowdsensing
mobile crowdsensing
1.012026
TTDI: Transformer Based Truthful Data Inference in Sparse Mobile Crowdsensing · IEEE Trans. Mob. Comput. 2026
Ubiquitous computing and smart environments › social sensing
truth discovery
1.012026
TTDI: Transformer Based Truthful Data Inference in Sparse Mobile Crowdsensing · IEEE Trans. Mob. Comput. 2026
Network optimization and economics
mechanism design
1.012026
TMTA: A Truthful Multi-Task Allocation Scheme for Enhancing Service Quality in Sparse Mobile Crowdsensing · IEEE Trans. Serv. Comput. 2026
Internet of things and sensor networks › mobile crowdsensing
multi-task allocation
1.012026
TMTA: A Truthful Multi-Task Allocation Scheme for Enhancing Service Quality in Sparse Mobile Crowdsensing · IEEE Trans. Serv. Comput. 2026
Internet of things and sensor networks › mobile crowdsensing
sparse crowdsensing
1.012026
TMTA: A Truthful Multi-Task Allocation Scheme for Enhancing Service Quality in Sparse Mobile Crowdsensing · IEEE Trans. Serv. Comput. 2026
Internet of things and sensor networks
combinatorial multi-armed bandit
0.912025
Truthful and Dual-Direction Combinatorial Multi-Armed Bandit Scheme to Maximize Profit for Mobile Crowd Sensing · IEEE Trans. Dependable Secur. Comput. 2025
Internet of things and sensor networks › mobile crowdsensing
worker recruitment
0.912025
Truthful and Dual-Direction Combinatorial Multi-Armed Bandit Scheme to Maximize Profit for Mobile Crowd Sensing · IEEE Trans. Dependable Secur. Comput. 2025
Data mining › spatiotemporal data mining
spatio-temporal correlation
0.312026
TMTA: A Truthful Multi-Task Allocation Scheme for Enhancing Service Quality in Sparse Mobile Crowdsensing · IEEE Trans. Serv. Comput. 2026
Algorithmic game theory and mechanism design › mechanism design
incentive mechanism design
0.312025
Truthful and Dual-Direction Combinatorial Multi-Armed Bandit Scheme to Maximize Profit for Mobile Crowd Sensing · IEEE Trans. Dependable Secur. Comput. 2025
Algorithmic game theory and mechanism design › mechanism design
truthful mechanism
0.312025
Truthful and Dual-Direction Combinatorial Multi-Armed Bandit Scheme to Maximize Profit for Mobile Crowd Sensing · IEEE Trans. Dependable Secur. Comput. 2025

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

transformer · 2.0multi-armed bandit · 2.0discrete heuristic algorithm · 2.0attention mechanism · 2.0upper confidence bound · 1.7regret analysis · 1.7combinatorial multi-armed bandit · 1.7
YearPublicationVenuePosition
2026 TTDI: Transformer Based Truthful Data Inference in Sparse Mobile Crowdsensing
abstract
In Sparse Mobile Crowdsensing, many data inference schemes have been proposed without considering the sensing dataset with different trust levels which contains unrecognizable false data, resulting in high inference error and poor practical utility. To address this challenge, we propose a Transformer based Truthful Data Inference (TTDI) scheme that can tolerate false data interference to enhance data inference quality. Firstly, the trust-weighted loss function (TLF) is proposed to reduce the false interference for data inference model training. The TLF implements a differential model parameter updating strategy for data with different trust levels, which can enhance and weaken the effect of high-trust and low-trust data on the trained data inference model, respectively. Secondly, the transformer based truthful spatiotemporal feature extraction (T-TSFE) algorithm is proposed to mitigate the mutual interference between biased spatiotemporal features. The T-TSFE extracts data features through temporal and spatial multi-head attention respectively, which reduces the propagation of false information across the spatiotemporal dimensions. Finally, we conduct extensive experiments with four real-world air quality datasets to verify the effectiveness of the TTDI in data inference quality.
Xiangwan Fu, Anfeng Liu, Houbing Song, Tian Wang 0001, Mianxiong Dong, Chao Qian 0014
IEEE Trans. Mob. Comput.1
2026 TMTA: A Truthful Multi-Task Allocation Scheme for Enhancing Service Quality in Sparse Mobile Crowdsensing
abstract
In sparse mobile crowdsensing, the platform con-structs services based on low-cost data collection through data inference schemes, where the quality of the inferred data directly affects the service quality. Existing data inference schemes assume that workers report trustworthy data, which is not practical in SMCS. It is urgent to establish a high-quality data collection scheme for data inference that can tolerate false data to enhance inferred data quality. To address this challenge, we propose a Truthful Multi-Task Allocation (TMTA) scheme. First, we estimate the spatiotemporal correlation between areas for iden-tifying areas with high importance to the data inference process. Second, a trust-based multi-task allocation algorithm is proposed to ensure that the sensing data from high-importance areas have high trust levels. Third, a multi-armed bandit based trustworthy worker identification strategy is proposed to prioritize Multi-Task allocation for workers who can be effectively identified as trustworthy. Finally, a truthful discrete heuristic algorithm is proposed to optimize the multi-task allocation using the proposed hybrid neighbor-mode strategy, which reduces the difficulty of searching for high-utility multi-task allocations. Extensive exper-iments on two real-world air-quality datasets demonstrate that TMTA consistently outperforms six baseline methods, achieving average reductions of 24.70% in RMSE and 17.79% in sensing cost across five experimental scenarios.
Xiangwan Fu, Qingyong Deng, Anfeng Liu, Haolin Liu 0001, Zhetao Li
IEEE Trans. Serv. Comput.1
2025 Truthful and Dual-Direction Combinatorial Multi-Armed Bandit Scheme to Maximize Profit for Mobile Crowd Sensing
abstract
Nowadays, Mobile Crowd Sensing (MCS) has become a popular paradigm for large-scale data collection using ubiquitous mobile sensing devices. However, most existing works do not consider that requester's payments are unknown prior, and assume that workers are honest, which may not be true in practice. To address these problems, we propose a novel Truthful and Dual-direction Combinatorial Multi-Armed Bandit (TD-CMAB) scheme, which maximizes the total profit of the dual-direction platform for both the worker side and the requester side. Specifically, for the worker side, to overcome the problem that the platform is not clear whether sensed data are true, we propose a worker recruitment strategy that identifies and recruits honest workers at low cost through the Upper Confidence Bound (UCB) algorithm based on truth data discovery. For the requester side, where requesters’ payments are unknown prior, we model requester selection as a CMAB problem and solve it by the proposed adaptive UCB algorithm. Furthermore, we theoretically prove the worst regret bound of the TD-CMAB. Finally, we evaluate the effectiveness of the TD-CMAB scheme through extensive experiments using the Beijing taxi dataset.
Xiangwan Fu, Saiqin Long, Anfeng Liu, Ju Ren 0001, Bin Guo 0001, Zhetao Li
IEEE Trans. Dependable Secur. Comput.1
2024 ATWR-SMR: An Area-Constrained Truthful-Worker Recruitment-Based Sensing Map Recovery Scheme for Sparse MCS in Extreme-Environment Internet of Things
abstract
Sparse mobile crowdsensing (SMCS) is a prospective solution for large-scale data sensing through mobile devices of Internet of Things (IoT) systems where IoT systems cannot obtain the sensing data of the area under extreme environments. The unsensed area data can be obtained by the data inference algorithm trained by the sensed data of recruited workers. However, recruited workers may upload false data in exchange for payment, and the platform is unable to distinguish between true and false data. In this article, our goal is to maximize the SMCS platform’s total profit, where the platform cannot verify the authenticity of the sensed data, and the requester’s payment is based on the sensing task’s data quality. To meet the objective, we propose the area-constrained truthful worker recruitment-based sensing map recovery (ATWR-SMR) scheme, which includes the area constraint, the area-constrained truthful worker recruitment, and the sensing map recovery. 1) The area constraint establishes the importance of areas by history data differences in the sliding window. 2) The truthful worker recruitment identifies trustworthy workers by the truthful upper confidence bound algorithm and recruits low-cost trustworthy workers to sense high-importance areas. 3) The sensing map recovery infers the unsensed data by the deep matrix factorization algorithm trained by the history truthful data set. Finally, we verify the effectiveness of the ATWR-SMR scheme in improving the total profit of the platform through extensive comparison experiments based on the China air quality data set.
Xiangwan Fu, Anfeng Liu, Naixue Xiong, Tian Wang 0001, Shaobo Zhang 0001
IEEE Internet Things J.1