Loading…
A Deep Learning-Based Mobile Crowdsensing Scheme by Predicting Vehicle Mobility
Mobile crowdsensing is an emerging paradigm that selects users to complete sensing tasks. Recently, mobile vehicles are adopted to perform sensing data collection tasks in the urban city due to their ubiquity and mobility. In this article, we study how mobile vehicles can be optimally selected in or...
Saved in:
Published in: | IEEE transactions on intelligent transportation systems 2021-07, Vol.22 (7), p.4648-4659 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Mobile crowdsensing is an emerging paradigm that selects users to complete sensing tasks. Recently, mobile vehicles are adopted to perform sensing data collection tasks in the urban city due to their ubiquity and mobility. In this article, we study how mobile vehicles can be optimally selected in order to collect maximum data from the urban environment in a future period of tens of minutes. We formulate the recruitment of vehicles as a maximum data limited budget problem. The application scenario is generalized to a realistic online setting where vehicles are continuously moving in real-time and the data center decides to recruit a set of vehicles immediately. A deep learning-based scheme through mobile vehicles (DLMV) is proposed to collect sensing data in the urban environment. We first propose a deep learning-based offline algorithm to predict vehicle mobility in a future time period. Furthermore, we propose a greedy online algorithm to recruit a subset of vehicles with a limited budget for the NP-Complete problem. Extensive experimental evaluations are conducted on the real mobility dataset in Rome. The results have not only verified the efficiency of our proposed solution but also validated that DLMV can improve the quantity of collected sensing data compared with other algorithms. |
---|---|
ISSN: | 1524-9050 1558-0016 |
DOI: | 10.1109/TITS.2020.3023446 |