OPAT: Optimized Allocation of Time-Dependent Tasks for Mobile Crowdsensing

被引:79
作者
Huang, Yang [1 ]
Chen, Honglong [1 ]
Ma, Guoqi [1 ]
Lin, Kai [1 ]
Ni, Zhichen [1 ]
Yan, Na [1 ]
Wang, Zhibo [2 ]
机构
[1] China Univ Petr East China, Coll Control Sci & Engn, Qingdao 266500, Peoples R China
[2] Zhejiang Univ, Coll Comp Sci & Technol, Inst Cyberspace Res, Hangzhou 310027, Peoples R China
关键词
Task analysis; Sensors; Resource management; Crowdsensing; Monitoring; Mobile handsets; Informatics; Mobile crowdsensing; task allocation; time budget; time dependent;
D O I
10.1109/TII.2021.3094527
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile crowdsensing (MCS) is an emerging paradigm that leverages pervasive smart terminals equipped with various embedded sensors to collect sensory data for wide applications. As the sensing scale increases in MCS, the design of efficient task allocation becomes crucial. However, many prior task allocation schemes, which ignore the time for task-performing, are not applicable to the scenario where mobile users with limited time budgets are able to undertake multiple sensing tasks. In this article, we focus on the task allocation in time dependent crowdsensing systems and formulate the time dependent task allocation problem, in which both the sensing duration and the user's sensing capacity are considered. We prove that the task allocation problem is NP-hard and propose an efficient task allocation algorithm called optimized allocation scheme of time-dependent tasks (OPAT), which can maximize the sensing capacity of each mobile user. The extensive simulations are conducted to demonstrate the effectiveness of the proposed OPAT scheme.
引用
收藏
页码:2476 / 2485
页数:10
相关论文
共 32 条
[1]   Nowhere to Hide: Efficiently Identifying Probabilistic Cloning Attacks in Large-Scale RFID Systems [J].
Ai, Xin ;
Chen, Honglong ;
Lin, Kai ;
Wang, Zhibo ;
Yu, Jiguo .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2021, 16 :714-727
[2]  
[Anonymous], 2004, Knapsack Problems, DOI DOI 10.1007/978-3-540-24777-710
[3]   DAP: Efficient Detection Against Probabilistic Cloning Attacks in Anonymous RFID Systems [J].
Chen, Honglong ;
Ai, Xin ;
Lin, Kai ;
Yan, Na ;
Wang, Zhibo ;
Jiang, Nan ;
Yu, Jiguo .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2022, 18 (01) :345-355
[4]   Prediction-Based Task Assignment in Spatial Crowdsourcing [J].
Cheng, Peng ;
Lian, Xiang ;
Chen, Lei ;
Shahabi, Cyrus .
2017 IEEE 33RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2017), 2017, :997-1008
[5]  
Cheung M.H., 2015, ACM MobiHoc, P157
[6]  
Deng D., 2013, P 21 ACM SIGSP INT C, P314
[7]  
Dutta P, 2009, SENSYS 09: PROCEEDINGS OF THE 7TH ACM CONFERENCE ON EMBEDDED NETWORKED SENSOR SYSTEMS, P349
[8]   A Crowd-Sensing Framework for Allocation of Time-Constrained and Location-Based Tasks [J].
Estrada, Rebeca ;
Mizouni, Rabeb ;
Otrok, Hadi ;
Ouali, Anis ;
Bentahar, Jamal .
IEEE TRANSACTIONS ON SERVICES COMPUTING, 2020, 13 (05) :769-785
[9]   Mobile Crowdsensing: Current State and Future Challenges [J].
Ganti, Raghu K. ;
Ye, Fan ;
Lei, Hui .
IEEE COMMUNICATIONS MAGAZINE, 2011, 49 (11) :32-39
[10]   ActiveCrowd: A Framework for Optimized Multitask Allocation in Mobile Crowdsensing Systems [J].
Guo, Bin ;
Liu, Yan ;
Wu, Wenle ;
Yu, Zhiwen ;
Han, Qi .
IEEE TRANSACTIONS ON HUMAN-MACHINE SYSTEMS, 2017, 47 (03) :392-403