Name
Abstract | ||
|---|---|---|
Mobile crowdsensing is a new paradigm in which a crowd of mobile users exploit their carried smart devices to conduct complex computation and sensing tasks in mobile social networks (MSNs). In this paper, we focus on the task assignment problem in mobile crowdsensing. Unlike traditional task scheduling problems, the task assignment in mobile crowdsensing must follow the mobility model of users in MSNs. To solve this problem, we propose an oFfline Task Assignment (FTA) algorithm and an oNline Task Assignment (NTA) algorithm. Both FTA and NTA adopt a greedy task assignment strategy. Moreover, we prove that the FTA algorithm is an optimal offline task assignment algorithm, and give a competitive ratio of the NTA algorithm. In addition, we demonstrate the significant performance of our algorithms through extensive simulations, based on four real MSN traces and a synthetic MSN trace. |
Year | Venue | Keywords |
|---|---|---|
2015 | 2015 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM) | Crowdsensing, delay tolerant network, mobile social network, task assignment |
Field | DocType | ISSN |
Mobile social network,Delay-tolerant networking,Computer science,Scheduling (computing),Computer network,Mobility model,Exploit,Assignment problem,Competitive analysis,Computation,Distributed computing | Conference | 0743-166X |
Citations | PageRank | References |
25 | 0.74 | 13 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mingjun Xiao | 1 | 520 | 41.54 |
| Jie Wu | 2 | 8307 | 592.07 |
| Liusheng Huang | 3 | 1082 | 123.52 |
| Yunsheng Wang | 4 | 204 | 12.54 |
| Cong Liu | 5 | 586 | 30.47 |