A Semiopportunistic Task Allocation Framework for Mobile Crowdsensing with Deep Learning

被引:7
作者
Xie, Zhenzhen [1 ]
Hu, Liang [1 ]
Huang, Yan [2 ]
Pang, Junjie [3 ,4 ]
机构
[1] Jilin Univ, Coll Comp Sci & Technol, Changchun 130012, Jilin, Peoples R China
[2] Kennesaw State Univ, Coll Comp & Software Engn, Atlanta, GA 30339 USA
[3] Qingdao Univ, Business Sch, Qingdao 266000, Shandong, Peoples R China
[4] Qingdao Univ, Coll Comp Sci & Software Engn, Qingdao 266000, Shandong, Peoples R China
基金
中国国家自然科学基金;
关键词
NETWORK; RECRUITMENT;
D O I
10.1155/2021/6643229
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The IoT era observes the increasing demand for data to support various applications and services. The Mobile Crowdsensing (MCS) system then emerged. By utilizing the hybrid intelligence of humans and sensors, it is significantly beneficial to keep collecting high-quality sensing data for all kinds of IoT applications, such as environmental monitoring, intelligent healthcare services, and traffic management. However, the service quality of MCS systems relies on a dedicated designed task allocation framework, which needs to consider the participant resource bottleneck and system utility at the same time. Recent studies tend to use a different solution to solve the two challenges. The incentive mechanism is for resolving the participant shortage problem, and task assignment methods are studied to find the best match of participants and system utility goal of MCS. Thus, existing task allocation frameworks fail to consider the participant's expectations deeply. We propose a semiopportunistic concept-based solution to overcome this issue. Similar to the "shared mobility" concept, our proposed task allocation framework can offer the participants routing advice without disturbing their original travel plan. The participant can accomplish the sensing request on his route. We further consider the system constraints to determine a subgroup of participants that can obtain the utility optimization goal. Specifically, we use the Graph Attention Network (GAT) to produce the target sensing area's virtual representation and provide the participant with a payoff-maximized route. Such a method makes our solution adapt to most of MCS scenarios' conditions instead of using fixed system settings. Then, a reinforcement learning- (RL-) based task assignment is adopted, which can help the MCS system towards better performance improvements while support different utility functions. The simulation results on various conditions demonstrate the superior performance of the proposed solution.
引用
收藏
页数:15
相关论文
共 49 条
[1]  
Arora S., 2020, SURVEY GRAPH NEURAL
[2]  
Bello I., 2017, P 5 INT C LEARN REPR
[3]   Exploiting Multi-Dimensional Task Diversity in Distributed Auctions for Mobile Crowdsensing [J].
Cai, Zhipeng ;
Duan, Zhuojun ;
Li, Wei .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2021, 20 (08) :2576-2591
[4]   Trading Private Range Counting over Big IoT Data [J].
Cai, Zhipeng ;
He, Zaobo .
2019 39TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2019), 2019, :144-153
[5]   A Differential-Private Framework for Urban Traffic Flows Estimation via Taxi Companies [J].
Cai, Zhipeng ;
Zheng, Xu ;
Yu, Jiguo .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2019, 15 (12) :6492-6499
[6]   A Private and Efficient Mechanism for Data Uploading in Smart Cyber-Physical Systems [J].
Cai, Zhipeng ;
Zheng, Xu .
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2020, 7 (02) :766-775
[7]   Collective Data-Sanitization for Preventing Sensitive Information Inference Attacks in Social Networks [J].
Cai, Zhipeng ;
He, Zaobo ;
Guan, Xin ;
Li, Yingshu .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2018, 15 (04) :577-590
[8]  
Capponi A, 2019, IEEE COMMUN SURV TUT, V21, P2419, DOI [10.1109/COMST.2019.2914030, 10.1109/isscs.2019.8801767]
[9]   Ridesharing in North America: Past, Present, and Future [J].
Chan, Nelson D. ;
Shaheen, Susan A. .
TRANSPORT REVIEWS, 2012, 32 (01) :93-112
[10]   Improved Algorithms for Orienteering and Related Problems [J].
Chekuri, Chandra ;
Korula, Nitish ;
Pal, Martin .
ACM TRANSACTIONS ON ALGORITHMS, 2012, 8 (03)