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

Xiao-Tian Yang

dblp:372/8914 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0009-0780-8815ORCID · reported

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

Computer networks · 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
Network optimization and economics · 67% Internet of things and sensor networks · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › mechanism design
incentive mechanism
0.812024
UMIM: Utility-Maximization Incentive Mechanism for Mobile Crowd Sensing · IEEE Trans. Mob. Comput. 2024
Internet of things and sensor networks
mobile crowdsensing
0.812024
UMIM: Utility-Maximization Incentive Mechanism for Mobile Crowd Sensing · IEEE Trans. Mob. Comput. 2024
Network optimization and economics
resource allocation
0.812024
UMIM: Utility-Maximization Incentive Mechanism for Mobile Crowd Sensing · IEEE Trans. Mob. Comput. 2024
Computational social science and digital humanities › social influence
social network influence
0.212024
UMIM: Utility-Maximization Incentive Mechanism for Mobile Crowd Sensing · IEEE Trans. Mob. Comput. 2024

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

proximal policy optimization · 1.5influence propagation · 1.5experience replay · 1.5
YearPublicationVenuePosition
2024 UMIM: Utility-Maximization Incentive Mechanism for Mobile Crowd Sensing
abstract
Mobile Crowd Sensing (MCS) represents a novel paradigm which utilizes intelligent devices carried by mobile users to collect and transmit data. Appropriate incentives are essential to recruit enough participants for sensing tasks. Existing works have designed some incentive mechanisms for MCS, which are not suitable for scenarios when the participants increase significantly as a result of the booming cost. To solve the above cost problem, a Utility-Maximization Incentive Mechanism (UMIM) is proposed in this paper by leveraging the influence propagation on the social network. Participants in the same social network can benefit from the data shared by others, which shows the utility of sensing data and can be regarded as a non-monetary incentive and make the participants stay positive under relative low payoff. Therefore, by improving the utility of sensing data, the incentive cost can be effectively reduced. To maximize the data utility, we further design a tree-based structure to improve the priority experience replay mechanism of Proximal Policy Optimization (PPO) in UMIM. This improvement makes the high priority experience to be sampled more quickly and efficiently, as a result, the network can learn more effectively. Numerical results show that UMIM can further improve the data utility and have better convergence.
Xin-Wei Yao 0001, Xiao-Tian Yang, Qiang Li 0054, Chufeng Qi, Xiangjie Kong 0001, Xiang-Yang Li 0001
IEEE Trans. Mob. Comput.2