Computer Science ›› 2023, Vol. 50 ›› Issue (11A): 221000184-10.doi: 10.11896/jsjkx.221000184

• Information Security • Previous Articles     Next Articles

Safe Efficient and Decentralized Model for Mobile Crowdsensing Incentive

ZHOU Yuying1, MA Miao1, SHEN Qiqi1, REN Jie1, ZHANG Mingrui1,2, YANG Bo1   

  1. 1 School of Computer Science,Shaanxi Normal University,Xi'an 710119,China
    2 Software Engineering Institute,East China Normal University,Shanghai 200062,China
  • Published:2023-11-09
  • About author:ZHOU Yuying,born in 1997,master.Her main research interests include blockchain technology and mobile crowdsensing.
    MA Miao,born in 1977,Ph.D,professor,Ph.D supervisor.Her recent main research interests include video analysis,mobile crowdsensing and smart education.
  • Supported by:
    National Natural Science Foundation of China(U2001205,62377031),Fundamental Research Funds for the Central Universities(2021CSLY021,GK202007033) and Key Research and Development Program in Shaanxi Province(2023-YBGY-241).

Abstract: In order to solve the problem of trust safety and inefficient perception task execution in the existing mobile crowdsen-sing incentive model,this paper proposes a safe efficient and decentralized model for mobile crowdsensing incentive.Employing blockchain to decentralize user management,the model completes the interaction and chain transaction among task publisher,participant and miner,realizes task publishing,participant selection,data quality evaluation and payment through PCSC(participant control smart contract) and TCSC(task control smart contract).In the process of participant selection,this paper proposes a “task-participants” matching mechanism based on BP neural network,which refers the time-location attribute of participants in historical data respectively to find out the most suitable participants for the current task.Then an adaptive reputation updating mechanism is suggested,that is,“giving reward and reputation incentive to the winner,giving reputation compensation to the non-winner who is willing to participate,and giving reputation punishment to the continuous non-participants who are suitable for the current task”.Security analysis and experimental results show that the proposed incentive model is safe,efficient and decentra-lized,since it not only can significantly improve the task completion rate,perceived data quality,participants’ benefits and user participation on the international open benchmark Brightkite dataset,but also can work on blockchain due to the efficiency of PCSC and TCSC using Solidity.

Key words: Mobile crowdsensing, Back propagation neural network, Participant selection strategy, Blockchain, Reputation mana-gement

CLC Number: 

  • TP391
[1]CAPPONI A,FIANDRINO C,KANTARCI B,et al.A surveyon mobile crowdsensing systems:Challenges,solutions,and opportunities[J].IEEE Communications Surveys and Tutorials,2019,21(3):2419-2465.
[2]LI M,WENG J,YANG A,et al.CrowdBC:A blockchain-baseddecentralized framework for crowdsourcing[J].IEEE Transactions on Parallel and Distributed Systems,2019,30(6):1251-1266.
[3]WANG J,WANG L,WANG Y,et al.Task allocation in mobile crowd sensing:State-of-the-art and future opportunities[J].IEEE Internet of Things Journal,2018,5(5):3747-3757.
[4]WEI K,HUANG K,WU Y,et al.High-performance uavcrowdsensing:A deep reinforcement learning approach[J].IEEE Internet of Things Journal,2022,19(9):18487-18499.
[5]WU Y,ZENG J R,PENG H,et al.Survey on incentive mechanisms for crowd sensing[J].Journal of Software,2016,27(8):2025-2047.
[6]WANG J,HUANG Y,ZHAO G S,et al.The incentive model for mobile crowd sensing oriented to differences in mission costs[J].Journal of Electronics and Information Technology,2019,41(6):1503-1509.
[7]DUAN L,KUBO T,SUGIYAMA K,et al.Incentive mechanismsfor smartphone collaboration in data acquisition and distributed computing[C]//Proceedings IEEE INFOCOM.2012:1701-1709.
[8]ZHANG H,LIU B,SUSANTO H,et al.Incentive mechanismfor proximity-based Mobile Crowd Service systems[C]//Proceedings of the 2016 IEEE Conference on Computer Comunications.2016:1-9.
[9]ZHANG S,WU J,LU S.Minimum makespan workload dissemination in DTNs:Making full utilization of computational surplus around[C]//Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing.2013:293-296.
[10]CHEUNG M H,SOUTHWELL R,HOU F,et al.Distributedtime-sensitive task selection in mobile crowdsensing[C]//Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing.2015:157-166.
[11]BENTOV I,KUMARESAN R.How to use bitcoin to design fair protocols[C]//Proceedings of Annual International Cryptology Conference.2014:421-439.
[12]GERVAIS A,KARAME G O,WÜST K,et al.On the security and performance of proof of work blockchains[C]//Proceedings of the ACM Conference on Computer and Communications Security.2016:3-16.
[13]ANDRYCHOWICZ M,DZIEMBOWSKI S,MALINOWSKI D,et al.Secure multiparty computations on bitcoin[J].Communications of the ACM,2016,59(4):76-84.
[14]ANDRYCHOWICZ M,DZIEMBOWSKI S,MALINOWSKI D,et al.Fair two-party computations via bitcoin deposits[C]//Proceedings of International Conference on Financial Cryptography and Data Security.2014:105-121.
[15]KUMARESAN R,BENTOV I.How to use bitcoin to incentivize correct computations[C]//Proceedings of the ACM Conference on Computer and Communications Security.2014:30-41.
[16]HE Y H,LI M R,LI H,et al.Incentive mechanism based on blockchain in swarm intelligence perception application[J].Journal of Computer Research and Development,2019,56(3):544-554.
[17]ZHU S D,HU H,LI Y S.zkCrowd:A hybrid blockchain-based crowdsourcing platform[J].IEEE Transactions on Industrial Informatics,2020,16(6):4196-4205.
[18]SHANNON C E.A mathematical theory of communication[J].ACM Sigmobile Mobile Computing and Communications Review,2001,5(1):3-55.
[19]REDDY S,ESTRIN D,SRIVASTAVA M.Recruitment framework for participatory sensing data collections[C]//Interna-tional Conference on Pervasive Computing.2010:138-155.
[20]YANG D,XUE G,FANG X,et al.Crowdsourcing to smart-phones:Incentive mechanism design for mobile phone sensing[C]//Proceedings of the Annual International Conference on Mobile Computing and Networking.2012:173-184.
[21]JAIMES L G,VERGARA-LAURENS I,LABRADOR M A.A location-based incentive mechanism for participatory sensing systems with budget constraints[C]//Proceedings of the IEEE International Conference on Pervasive Computing and Communications.2012:103-108.
[22]ZHANG D,XIONG H,WANG L,et al.CrowdRecruiter:Selecting participants for piggyback crowdsensing under probabilistic coverage constraint[C]//Proceedings of the ACM International Joint Conference on Pervasive and Ubiquitous Computing.2014:703-714.
[23]NAN W Q,GUO B,CHEN H H,et al.Dynamic incentive modelof group intelligence perception based on multiple interactions across spaces[J].Chinese Journal of Computers,2015,38(12):2412-2425.
[24]LIU Y,GUO B,WU W L,et al.Research on the optimizationmethod of multi task participants in mobile swarm intelligence perception[J].Chinese Journal of Computers,2017,40(8):1872-1887.
[25]ZHANG M R,WANG T,YANG B.A Blockchain-Based Framework for Crowd Intelligence[J].Journal of Cryptologic Research,2021,8(2):248-259.
[26]ZHOU Y Y.Research on mobile crowd sensing incentive method based on blockchain[D].Xi’an:Shaanxi Normal University,2022.
[27]LI X,JIANG P,CHEN T,et al.A survey on the security of blockchain systems[J].Future Generation Computer Systems,2020,107:841-853.
[28]MYERS A,LESKOVEC J.Complex networks standard public data sets[OL].[2021-03-15].http://snap.stanford.edu/data/ loc-brightkite.html.
[29]LEE J S,HOH B.Dynamic pricing incentive for participatorysensing[J].Pervasive and Mobile Computing,2010,6(6):693-708.
[1] TONG Fei, SHAO Ranran. Study on Blockchain Based Access Control Model for Cloud Data [J]. Computer Science, 2023, 50(9): 16-25.
[2] WANG Junlu, LIU Qiang, ZHANG Ran, JI Wanting, SONG Baoyan. Blockchain-based Dual-branch Structure Expansion Model [J]. Computer Science, 2023, 50(8): 365-371.
[3] HUANG Baohua, PENG Li, ZHAO Weihong, CHEN Ningjiang. Practical Byzantine Consensus Algorithm Based on Verifiable Random Functions [J]. Computer Science, 2023, 50(6A): 220300064-6.
[4] LIN Feilong, YUE Yuedong, ZHENG Jianhui, CHEN Zhongyu, LI Minglu. Blockchain-based Identity Authentication and Authorization Mechanism [J]. Computer Science, 2023, 50(6A): 220700158-9.
[5] PAN Lu, LUO Tao, NIU Xinzheng. Restart and Recovery Algorithm Based on Distributed Cluster Nodes [J]. Computer Science, 2023, 50(6A): 220300205-6.
[6] YANG Jian, WANG Kaixuan. Tripartite Evolutionary Game Analysis of Medical Data Sharing Under Blockchain Architecture [J]. Computer Science, 2023, 50(6A): 221000080-7.
[7] TAN Pengliu, WANG Runshu, ZENG Wenhao, WANG Shikun, ZOU Wenshi. Overview of Blockchain Consensus Algorithms [J]. Computer Science, 2023, 50(6A): 220400200-12.
[8] XIAO Jian, YANG Min. Multi-factor Blockchain Private Key Protection Scheme Based on Secret Sharing [J]. Computer Science, 2023, 50(6): 307-312.
[9] LIU Wei, GUO Lingbei, XIA Yujie, SHE Wei, TIAN Zhao. Raft Consensus Algorithm Based on Credit Evaluation Model [J]. Computer Science, 2023, 50(6): 322-329.
[10] ZHANG Shue, TIAN Chengwei, LI Baogang. Review of Identity Authentication Research Based on Blockchain Technology [J]. Computer Science, 2023, 50(5): 329-347.
[11] LIU Zerun, ZHENG Hong, QIU Junjie. Smart Contract Vulnerability Detection Based on Abstract Syntax Tree Pruning [J]. Computer Science, 2023, 50(4): 317-322.
[12] CHANG Sha, WU Yahui, DENG Su, MA Wubin, ZHOU Haohao. Online Task Allocation Strategy Based on Lyapunov Optimization in Mobile Crowdsensing [J]. Computer Science, 2023, 50(2): 50-56.
[13] SUN Min, XU Senwei, SHAN Tong. LN-ERCL Lightning Network Optimization Scheme [J]. Computer Science, 2023, 50(11A): 230200115-5.
[14] CHEN Ruixiang, JIAO Jian, WANG Ruohua. Smart Contract Vulnerability Detection System Based on Ontology Reasoning [J]. Computer Science, 2023, 50(10): 336-342.
[15] ZHANG Yushu, HE Xiaotong, XIAO Xiangli, ZHU Youwen, WANG Liangming. Grouping Storage Optimization Method for Blockchain Ledger Based on Erasure Code [J]. Computer Science, 2023, 50(10): 350-361.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!