Joint Sensing and Computation Incentive Mechanism for Mobile Crowdsensing Networks: A Multiagent Reinforcement Learning Approach

Mobile crowdsensing (MCS) is a novel sensing paradigm by utilizing mobile users (MUs) to collect data from environment. Considering the finite sensing and computing resources of MUs, it is crucial to inspire MUs to take part in crowdsensing willingly. In this study, a multiagent-deep-reinforcement-learning (DRL)-based incentive mechanism is investigated to tackle the joint data sensing and computing issues. Specifically, due to the heterogeneity of sensing tasks, multiple MCS platforms (MCPs) motivate MUs to participate in different tasks. The interaction between MCPs and MUs is modeled as a multileader-multifollower Stackelberg game with Stackelberg equilibrium proved by derivation. Moreover, the Stackelberg game is transformed as a Markov decision process (MDP) to deal with a multiagent DRL method without any prior knowledge. Due to the continuous high-dimensional action space of multiple MCPs and MUs, a multiagent double actors deep deterministic policy gradient (MA-DADDPG) algorithm is proposed to obtain the optimal sensing data size, computing resource, and incentive payment policies. Extensive simulation results illustrate the effectiveness of the proposed crowdsensing incentive mechanism.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2024-12-27
DOI
https://doi.org/10.1109/jiot.2024.3523407
Citations
7
Primary Topic
Mobile Crowdsensing and Crowdsourcing
Type
article
Field-Weighted Citation Impact
2.88

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Joint Sensing and Computation Incentive Mechanism for Mobile Crowdsensing Networks: A Multiagent Reinforcement Learning Approach

Yiyang Pei, Dusit Niyato, Nan Zhao, Yiling Sun
7 citations
IEEE Internet of Things Journal
Mobile Crowdsensing and Crowdsourcing
2.88
article

Joint Sensing and Computation Incentive Mechanism for Mobile Crowdsensing Networks: A Multiagent Reinforcement Learning Approach

Yiyang Pei, Dusit Niyato, Nan Zhao, Yiling Sun
article en
7 citations

Abstract

Mobile crowdsensing (MCS) is a novel sensing paradigm by utilizing mobile users (MUs) to collect data from environment. Considering the finite sensing and computing resources of MUs, it is crucial to inspire MUs to take part in crowdsensing willingly. In this study, a multiagent-deep-reinforcement-learning (DRL)-based incentive mechanism is investigated to tackle the joint data sensing and computing issues. Specifically, due to the heterogeneity of sensing tasks, multiple MCS platforms (MCPs) motivate MUs to participate in different tasks. The interaction between MCPs and MUs is modeled as a multileader-multifollower Stackelberg game with Stackelberg equilibrium proved by derivation. Moreover, the Stackelberg game is transformed as a Markov decision process (MDP) to deal with a multiagent DRL method without any prior knowledge. Due to the continuous high-dimensional action space of multiple MCPs and MUs, a multiagent double actors deep deterministic policy gradient (MA-DADDPG) algorithm is proposed to obtain the optimal sensing data size, computing resource, and incentive payment policies. Extensive simulation results illustrate the effectiveness of the proposed crowdsensing incentive mechanism.

IEEE Internet of Things JournalVol. 12(9)
Singapore Institute of Technology (SG), Nanyang Technological University (SG), Hubei University of Technology (CN)
Natural Science Foundation of Hubei Province
Openalex Percentile: Top 7%
Mobile Crowdsensing and Crowdsourcing
2.88
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.