Incentive Mechanism for Uncertain Tasks under Differential Privacy
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
Incentive Mechanism for Uncertain Tasks under Differential Privacy. / Jiang, Xikun; Ying, Chenhao; Li, Lei; Düdder, Boris; Wu, Haiqin; Jin, Haiming; Luo, Yuan.
In: IEEE Transactions on Services Computing, Vol. 17, No. 3, 2024, p. 977-989.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Incentive Mechanism for Uncertain Tasks under Differential Privacy
AU - Jiang, Xikun
AU - Ying, Chenhao
AU - Li, Lei
AU - Düdder, Boris
AU - Wu, Haiqin
AU - Jin, Haiming
AU - Luo, Yuan
N1 - Publisher Copyright: IEEE
PY - 2024
Y1 - 2024
N2 - Mobile crowd sensing (MCS) has emerged as an increasingly popular sensing paradigm due to its cost-effectiveness. This approach relies on platforms to outsource tasks to participating workers when prompted by task publishers. Although incentive mechanisms have been devised to foster widespread participation in MCS, most of them focus only on static tasks (i.e., tasks for which the timing and type are known in advance) and do not protect the privacy of worker bids. In a dynamic and resource-constrained environment, tasks are often uncertain (i.e., the platform lacks a priori knowledge about the tasks) and worker bids may be vulnerable to inference attacks. This paper presents an incentive mechanism HERALD*, that takes into account the uncertainty and hidden bids of tasks without real-time constraints. Theoretical analysis reveals that HERALD* satisfies a range of critical criteria, including truthfulness, individual rationality, differential privacy, low computational complexity, and low social cost. These properties are then corroborated through a series of evaluations.
AB - Mobile crowd sensing (MCS) has emerged as an increasingly popular sensing paradigm due to its cost-effectiveness. This approach relies on platforms to outsource tasks to participating workers when prompted by task publishers. Although incentive mechanisms have been devised to foster widespread participation in MCS, most of them focus only on static tasks (i.e., tasks for which the timing and type are known in advance) and do not protect the privacy of worker bids. In a dynamic and resource-constrained environment, tasks are often uncertain (i.e., the platform lacks a priori knowledge about the tasks) and worker bids may be vulnerable to inference attacks. This paper presents an incentive mechanism HERALD*, that takes into account the uncertainty and hidden bids of tasks without real-time constraints. Theoretical analysis reveals that HERALD* satisfies a range of critical criteria, including truthfulness, individual rationality, differential privacy, low computational complexity, and low social cost. These properties are then corroborated through a series of evaluations.
KW - Costs
KW - Differential privacy
KW - Differential Privacy
KW - Incentive Mechanism
KW - Mobile Crowd Sensing
KW - Privacy
KW - Real-time systems
KW - Sensors
KW - Task analysis
KW - Time factors
KW - Uncertain Tasks without Real-time Constraints
U2 - 10.1109/TSC.2024.3376199
DO - 10.1109/TSC.2024.3376199
M3 - Journal article
AN - SCOPUS:85188465181
VL - 17
SP - 977
EP - 989
JO - IEEE Transactions on Services Computing
JF - IEEE Transactions on Services Computing
SN - 1939-1374
IS - 3
ER -
ID: 389599053