Name
Abstract | ||
|---|---|---|
Mobile crowdsensing recruits a massive group of mobile workers to cooperatively finish a sensing task through their smart devices (mobile phones, ipads, etc.). In this paper, the communication in social network for delivering the sensing data of mobile crowdsensing is considered, where some requesters publish the sensing tasks to all the Point of Interests (PoIs), and the workers are recruited to take the sensing data in the PoI until they could communicate with the requester through an offline and online connection. We first use the semi-Markov model to predict the offline encounter situation. Then, the worker's utility is decided by both the offline encounter and social connection probabilities. The Worker Recruitment for Self-organized MSC (WEO) is further presented through recruiting a set of workers, who have the maximum communication probability with the requesters. We prove that the optimal recruitment problem is NP-hard, and we introduce a practical greedy heuristic method for this problem, the performance of the greedy method is also tested. Two real-world traces, roma/ taxi and epfl are tested in our simulations, where WEO always achieves the highest delivery ratio of sensing tasks among different recruitment strategies. |
Year | Venue | Keywords |
|---|---|---|
2018 | 2018 27TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND NETWORKS (ICCCN) | Worker recruitment, Self-organized, Mobile social crowdsensing |
Field | DocType | Citations |
Publication,Social network,Task analysis,Computer science,Crowdsensing,Sensing data,Computer network,Greedy algorithm | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| En Wang | 1 | 57 | 15.09 |
| Yongjian Yang | 2 | 39 | 14.05 |
| Jie Wu | 3 | 23 | 11.49 |
| Dongming Luan | 4 | 3 | 2.74 |
| Hengzhi Wang | 5 | 0 | 2.37 |