Maximizing spatial–temporal coverage in mobile crowd-sensing based on public transports with predictable trajectory
Mobile crowd-sensing is a prospective paradigm especially for intelligent mobile terminals, which collects ubiquitous data efficiently in metropolis. The existing crowd-sensing schemes based on intelligent terminals mainly consider the current trajectory of the participants, and the quality highly d...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-08-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147718795351 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850157658564198400 |
|---|---|
| author | Chaowei Wang Chensheng Li Cai Qin Weidong Wang Xiuhua Li |
| author_facet | Chaowei Wang Chensheng Li Cai Qin Weidong Wang Xiuhua Li |
| author_sort | Chaowei Wang |
| collection | DOAJ |
| description | Mobile crowd-sensing is a prospective paradigm especially for intelligent mobile terminals, which collects ubiquitous data efficiently in metropolis. The existing crowd-sensing schemes based on intelligent terminals mainly consider the current trajectory of the participants, and the quality highly depends on the spatial-temporal coverage which is easily weakened by the mobility of participants. Nowadays, public transports are widely used and affordable in many cities around the globe. Public transports embedded with substantial sensors act as participants in crowd-sensing, but different from the intelligent terminals, the trajectory of public transports is schedulable and predictable, which sheds an opportunity to achieve high-quality crowd-sensing. Therefore, based on the predictable trajectory of public transports, we design a novel system model and formulate the selection of public transports as an optimization problem to maximize the spatial–temporal coverage. After proving the public transport selection is non-deterministic polynomial-time hardness, an approximation algorithm is proposed and the coverage is close to 1. We evaluate the proposed algorithm with samples of real T-Drive trajectory data set. The results show that our algorithm achieves a near optimal coverage and outperforms existing algorithms. |
| format | Article |
| id | doaj-art-349ede037b3548d79ba8a05f8d5fe80d |
| institution | OA Journals |
| issn | 1550-1477 |
| language | English |
| publishDate | 2018-08-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-349ede037b3548d79ba8a05f8d5fe80d2025-08-20T02:24:05ZengWileyInternational Journal of Distributed Sensor Networks1550-14772018-08-011410.1177/1550147718795351Maximizing spatial–temporal coverage in mobile crowd-sensing based on public transports with predictable trajectoryChaowei WangChensheng LiCai QinWeidong WangXiuhua LiMobile crowd-sensing is a prospective paradigm especially for intelligent mobile terminals, which collects ubiquitous data efficiently in metropolis. The existing crowd-sensing schemes based on intelligent terminals mainly consider the current trajectory of the participants, and the quality highly depends on the spatial-temporal coverage which is easily weakened by the mobility of participants. Nowadays, public transports are widely used and affordable in many cities around the globe. Public transports embedded with substantial sensors act as participants in crowd-sensing, but different from the intelligent terminals, the trajectory of public transports is schedulable and predictable, which sheds an opportunity to achieve high-quality crowd-sensing. Therefore, based on the predictable trajectory of public transports, we design a novel system model and formulate the selection of public transports as an optimization problem to maximize the spatial–temporal coverage. After proving the public transport selection is non-deterministic polynomial-time hardness, an approximation algorithm is proposed and the coverage is close to 1. We evaluate the proposed algorithm with samples of real T-Drive trajectory data set. The results show that our algorithm achieves a near optimal coverage and outperforms existing algorithms.https://doi.org/10.1177/1550147718795351 |
| spellingShingle | Chaowei Wang Chensheng Li Cai Qin Weidong Wang Xiuhua Li Maximizing spatial–temporal coverage in mobile crowd-sensing based on public transports with predictable trajectory International Journal of Distributed Sensor Networks |
| title | Maximizing spatial–temporal coverage in mobile crowd-sensing based on public transports with predictable trajectory |
| title_full | Maximizing spatial–temporal coverage in mobile crowd-sensing based on public transports with predictable trajectory |
| title_fullStr | Maximizing spatial–temporal coverage in mobile crowd-sensing based on public transports with predictable trajectory |
| title_full_unstemmed | Maximizing spatial–temporal coverage in mobile crowd-sensing based on public transports with predictable trajectory |
| title_short | Maximizing spatial–temporal coverage in mobile crowd-sensing based on public transports with predictable trajectory |
| title_sort | maximizing spatial temporal coverage in mobile crowd sensing based on public transports with predictable trajectory |
| url | https://doi.org/10.1177/1550147718795351 |
| work_keys_str_mv | AT chaoweiwang maximizingspatialtemporalcoverageinmobilecrowdsensingbasedonpublictransportswithpredictabletrajectory AT chenshengli maximizingspatialtemporalcoverageinmobilecrowdsensingbasedonpublictransportswithpredictabletrajectory AT caiqin maximizingspatialtemporalcoverageinmobilecrowdsensingbasedonpublictransportswithpredictabletrajectory AT weidongwang maximizingspatialtemporalcoverageinmobilecrowdsensingbasedonpublictransportswithpredictabletrajectory AT xiuhuali maximizingspatialtemporalcoverageinmobilecrowdsensingbasedonpublictransportswithpredictabletrajectory |