Crowdsensing Data Trading for Unknown Market: Privacy, Stability, and Conflicts

被引:2
作者
Sun, He [1 ]
Xiao, Mingjun [1 ]
Xu, Yin [1 ]
Gao, Guoju [2 ]
Zhang, Shu [1 ]
机构
[1] Univ Sci & Technol China, Sch Comp Sci & Technol, State Key Lab Cognit Intelligence, Suzhou Inistitute Adv Study, Hefei 230026, Peoples R China
[2] Soochow Univ, Sch Comp Sci & Technol, Suzhou, Peoples R China
基金
中国国家自然科学基金;
关键词
Task analysis; Data integrity; Data collection; Mobile computing; Privacy; Indexes; Stability criteria; Crowdsensing data trading; differential privacy; stable matching; multi-player multi-armed bandit; conflicts avoiding; INCENTIVE MECHANISM; POLICIES;
D O I
10.1109/TMC.2024.3399816
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, Crowdsensing Data Trading (CDT) has emerged as a new data trading paradigm, where buyers crowdsource data collection tasks to a group of mobile users with sensing devices (a.k.a., sellers) who sell the collected data to them, through a platform as the broker for a long-term data trading. One of the most critical issues in CDT is ensuring the stability of the matching between buyers and sellers in the data trading market. In this paper, we focus on privacy protection and the stability problems in the CDT market with unknown preference sequences of buyers. The goal is to protect sellers' data qualities and ensure the CDT market's stability while maximizing the cumulative data quality for each task. We model this problem as a differentially private multi-player multi-armed competing bandit problem and propose a novel metric of the approximate stability, called delta-stability. We propose a privacy-preserving stable CDT mechanism called DPS-CB to solve this problem in the centralized setting, which is based on stable matching theory, and competing bandit strategy. Moreover, we extend it into decentralized setting in order to avoid the competitive matching conflicts caused in this setting and propose a Conflicts-avoiding DPS-CB mechanism, called CDPS-CB, by using Bernoulli probability and selecting feasible sets of sellers. In addition, we prove the security and stability of the CDT market under privacy concerns and analyze the regret performance of DPS-CB and CDPS-CB mechanisms, respectively. Finally, the significant performance of these two mechanisms is demonstrated through extensive simulations on a real-world dataset.
引用
收藏
页码:11719 / 11734
页数:16
相关论文
共 54 条
[1]   Parameterized algorithms for stable matching with ties and incomplete lists [J].
Adil, Deeksha ;
Gupta, Sushmita ;
Roy, Sanjukta ;
Saurabh, Saket ;
Zehavi, Meirav .
THEORETICAL COMPUTER SCIENCE, 2018, 723 :1-10
[2]   Secure Crowdsensed Data Trading Based on Blockchain [J].
An, Baoyi ;
Xiao, Mingjun ;
Liu, An ;
Xu, Yun ;
Zhang, Xiangliang ;
Li, Qing .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2023, 22 (03) :1763-1778
[3]   Crowdsensing Data Trading based on Combinatorial Multi-Armed Bandit and Stackelberg Game [J].
An, Baoyi ;
Xiao, Mingjun ;
Liu, An ;
Xie, Xike ;
Zhou, Xiaofang .
2021 IEEE 37TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2021), 2021, :253-264
[4]  
Basu S., 2021, P INT C MATCH LEARN, P705
[5]   Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems [J].
Bubeck, Sebastien ;
Cesa-Bianchi, Nicolo .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 5 (01) :1-122
[6]  
Cappiello AG, 2019, 2019 INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS (ISSCS 2019), DOI [10.1109/COMST.2019.2914030, 10.1109/isscs.2019.8801767]
[7]   Private and Continual Release of Statistics [J].
Chan, T. -H. Hubert ;
Shi, Elaine ;
Song, Dawn .
ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2011, 14 (03)
[8]   Stable Task Assignment for Mobile Crowdsensing With Budget Constraint [J].
Dai, Chenxin ;
Wang, Xiumin ;
Liu, Kai ;
Qi, Deyu ;
Lin, Weiwei ;
Zhou, Pan .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2021, 20 (12) :3439-3452
[9]  
Dai X., 2021, P INT C NEUR INF PRO, p12 798
[10]  
Dubey A., 2020, Advances in Neural Information Processing Systems, V33, P6003