TY - JOUR
T1 - Timeliness-Aware Incentive Mechanism for Vehicular Crowdsourcing in Smart Cities
AU - Chen, Xianhao
AU - Zhang, Lan
AU - Pang, Yawei
AU - Lin, Bin
AU - Fang, Yuguang
PY - 2022/9
Y1 - 2022/9
N2 - Vehicular crowdsourcing is a promising paradigm that takes advantage of powerful onboard capabilities of vehicles to perform various tasks in smart cities. To fulfill this vision, a well-designed incentive mechanism is essential to stimulate the participation of vehicles. In this paper, we propose a timeliness-aware incentive mechanism for vehicular crowdsourcing by taking vehicle's uncertain travel time into account. In view of the stochastic nature of traffic conditions, we derive a tractable expression for the probability distribution of task delay based on a discrete-time traffic model. By leveraging reverse auction framework, we model the utility of a service requester as a function in terms of uncertain task delay and incurred payment. To maximize the requester's utility under a budget constraint, we cast the mechanism design as a non-monotone submodular maximization problem over a knapsack constraint. Based on this formulation, we develop a truthful budgeted utility maximization auction (TBUMA), which is truthful, budget feasible, profitable, individually rational and computationally efficient. Through extensive trace-based simulations, we demonstrate the effectiveness of our proposed incentive mechanism.
AB - Vehicular crowdsourcing is a promising paradigm that takes advantage of powerful onboard capabilities of vehicles to perform various tasks in smart cities. To fulfill this vision, a well-designed incentive mechanism is essential to stimulate the participation of vehicles. In this paper, we propose a timeliness-aware incentive mechanism for vehicular crowdsourcing by taking vehicle's uncertain travel time into account. In view of the stochastic nature of traffic conditions, we derive a tractable expression for the probability distribution of task delay based on a discrete-time traffic model. By leveraging reverse auction framework, we model the utility of a service requester as a function in terms of uncertain task delay and incurred payment. To maximize the requester's utility under a budget constraint, we cast the mechanism design as a non-monotone submodular maximization problem over a knapsack constraint. Based on this formulation, we develop a truthful budgeted utility maximization auction (TBUMA), which is truthful, budget feasible, profitable, individually rational and computationally efficient. Through extensive trace-based simulations, we demonstrate the effectiveness of our proposed incentive mechanism.
KW - crowdsensing
KW - edge computing
KW - incentive mechanism
KW - reverse auction
KW - Vehicular crowdsourcing
UR - http://www.scopus.com/inward/record.url?scp=85099724146&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85099724146&origin=recordpage
U2 - 10.1109/TMC.2021.3052963
DO - 10.1109/TMC.2021.3052963
M3 - RGC 21 - Publication in refereed journal
SN - 1536-1233
VL - 21
SP - 3373
EP - 3387
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 9
ER -