Privacy-Preserving Data Aggregation for Mobile Crowdsensing With Externality: An Auction Approach

被引:39
作者
Zhang, Mengyuan [1 ]
Yang, Lei [2 ]
He, Shibo [1 ]
Li, Ming [3 ]
Zhang, Junshan [4 ]
机构
[1] Zhejiang Univ, State Key Lab Ind Control Technol, Hangzhou 310027, Peoples R China
[2] Univ Nevada, Dept Comp Sci & Engn, Reno, NV 89557 USA
[3] Univ Texas Arlington, Dept Comp Sci & Engn, Arlington, TX 76019 USA
[4] Arizona State Univ, Sch Elect Comp & Energy Engn, Tempe, AZ 85287 USA
基金
美国国家科学基金会; 国家重点研发计划;
关键词
Sensors; Data privacy; Data aggregation; Crowdsensing; Privacy; Task analysis; Noise measurement; Crowd sensing; incentive mechanism; privacy-preserving; data aggregation; TASKS;
D O I
10.1109/TNET.2021.3056490
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We develop an auction framework for privacy-preserving data aggregation in mobile crowdsensing, where the platform plays the role as an auctioneer to recruit workers for sensing tasks. The workers are allowed to report noisy versions of their data for privacy protection; and the platform selects workers by taking into account their sensing capabilities to ensure the accuracy level of the aggregated result. Observe that when moving the control of data privacy from the data aggregator to the workers, the data aggregator has limited market power in the sense that it can only partially control the noise by judiciously choosing a subset of workers based on workers' privacy preferences. This introduces externalities because the privacy of each worker depends on the total noise in the aggregated result that in turn relies on which workers are selected. Specifically, we first consider a privacy-passive scenario where workers participate if their privacy loss can be adequately compensated by the rewards. We explicitly characterize the externalities and the hidden monotonicity property of the problem, making it possible to design a truthful, individually rational and computationally efficient incentive mechanism. We then extend the results to a privacy-proactive scenario where workers have individual requirements for their perceivable data privacy levels. Our proposed mechanisms for both scenarios can select a subset of workers to (nearly) minimize the cost of purchasing their private sensing data subject to the accuracy requirement of the aggregated result. We validate the proposed scheme through theoretical analysis as well as extensive simulations.
引用
收藏
页码:1046 / 1059
页数:14
相关论文
共 35 条
[1]   Budget Feasible Procurement Auctions [J].
Anari, Nima ;
Goel, Gagan ;
Nikzad, Afshin .
OPERATIONS RESEARCH, 2018, 66 (03) :637-652
[2]   Frugal Path Mechanisms [J].
Archer, Aaron ;
Tardos, Eva .
ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (01)
[3]  
Cheung M.H., 2015, ACM MobiHoc, P157
[4]   A survey on privacy in mobile participatory sensing applications [J].
Christin, Delphine ;
Reinhardt, Andreas ;
Kanhere, Salil S. ;
Hollick, Matthias .
JOURNAL OF SYSTEMS AND SOFTWARE, 2011, 84 (11) :1928-1946
[5]  
Dandekar Pranav, 2014, ACM Transactions on Economics and Computation, V2, DOI 10.1145/2629665
[6]   Motivating Smartphone Collaboration in Data Acquisition and Distributed Computing [J].
Duan, Lingjie ;
Kubo, Takeshi ;
Sugiyama, Kohei ;
Huang, Jianwei ;
Hasegawa, Teruyuki ;
Walrand, Jean .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2014, 13 (10) :2320-2333
[7]  
Duan LJ, 2012, IEEE INFOCOM SER, P1701, DOI 10.1109/INFCOM.2012.6195541
[8]  
Dwork C, 2006, LECT NOTES COMPUT SC, V4052, P1
[9]  
Feng ZN, 2014, IEEE INFOCOM SER, P1231, DOI 10.1109/INFOCOM.2014.6848055
[10]   Selling privacy at auction [J].
Ghosh, Arpita ;
Roth, Aaron .
GAMES AND ECONOMIC BEHAVIOR, 2015, 91 :334-346