TY - JOUR
T1 - Delay-Sensitive Mobile Crowdsensing
T2 - Algorithm Design and Economics
AU - Cheung, Man Hon
AU - Hou, Fen
AU - Huang, Jianwei
PY - 2018/12
Y1 - 2018/12
N2 - In a delay-sensitive mobile crowdsensing (MCS) platform, a service provider offers monetary incentives to mobile users for participating in the data collection and reporting their obtained data by a deadline. One aspect missing from most prior literature in the incentive mechanism design is the consideration of the detailed data reporting process through cellular or Wi-Fi networks. In this paper, we consider the interactions between the service provider and the users in two stages. First, the service provider chooses a reward to maximize its expected profit under the incomplete information of the users' responses. Next, given the reward, each user makes his participation and reporting decisions, which are complicated due to his mobility and network heterogeneity. We propose an algorithm to compute the optimal user's decisions under the general setting using dynamic programming, and derive closed-form decision criteria for the special yet practical case of a non-discounted reward. We compute the optimal reward by characterizing the solution set and the discontinuity in the profit function. Simulation results show that our proposed algorithm achieves a significant gain in the user payoff over three benchmark heuristic schemes. In addition, a service provider's profit is sensitive to the estimation of the users' Wi-Fi availabilities.
AB - In a delay-sensitive mobile crowdsensing (MCS) platform, a service provider offers monetary incentives to mobile users for participating in the data collection and reporting their obtained data by a deadline. One aspect missing from most prior literature in the incentive mechanism design is the consideration of the detailed data reporting process through cellular or Wi-Fi networks. In this paper, we consider the interactions between the service provider and the users in two stages. First, the service provider chooses a reward to maximize its expected profit under the incomplete information of the users' responses. Next, given the reward, each user makes his participation and reporting decisions, which are complicated due to his mobility and network heterogeneity. We propose an algorithm to compute the optimal user's decisions under the general setting using dynamic programming, and derive closed-form decision criteria for the special yet practical case of a non-discounted reward. We compute the optimal reward by characterizing the solution set and the discontinuity in the profit function. Simulation results show that our proposed algorithm achieves a significant gain in the user payoff over three benchmark heuristic schemes. In addition, a service provider's profit is sensitive to the estimation of the users' Wi-Fi availabilities.
KW - cellular and Wi-Fi networks
KW - dynamic programming
KW - Mobile crowdsensing
KW - profit maximization
KW - service provider
KW - cellular and Wi-Fi networks
KW - dynamic programming
KW - Mobile crowdsensing
KW - profit maximization
KW - service provider
KW - cellular and Wi-Fi networks
KW - dynamic programming
KW - Mobile crowdsensing
KW - profit maximization
KW - service provider
UR - http://www.scopus.com/inward/record.url?scp=85043789849&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85043789849&origin=recordpage
U2 - 10.1109/TMC.2018.2815694
DO - 10.1109/TMC.2018.2815694
M3 - RGC 21 - Publication in refereed journal
SN - 1536-1233
VL - 17
SP - 2761
EP - 2774
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 12
M1 - 8315500
ER -