Research Article
Mobile Data Sharing with Multiple User Collaboration in Mobile Crowdsensing (Short Paper)
@INPROCEEDINGS{10.1007/978-3-030-12981-1_25, author={Changjia Yang and Peng Li and Tao Zhang and Yu Jin and Heng He and Lei Nie and Qin Liu}, title={Mobile Data Sharing with Multiple User Collaboration in Mobile Crowdsensing (Short Paper)}, proceedings={Collaborative Computing: Networking, Applications and Worksharing. 14th EAI International Conference, CollaborateCom 2018, Shanghai, China, December 1-3, 2018, Proceedings}, proceedings_a={COLLABORATECOM}, year={2019}, month={2}, keywords={Crowdsensing Mobile data sharing Multiple users collaboration Stable marriage problem}, doi={10.1007/978-3-030-12981-1_25} }- Changjia Yang
Peng Li
Tao Zhang
Yu Jin
Heng He
Lei Nie
Qin Liu
Year: 2019
Mobile Data Sharing with Multiple User Collaboration in Mobile Crowdsensing (Short Paper)
COLLABORATECOM
Springer
DOI: 10.1007/978-3-030-12981-1_25
Abstract
With the development of the Internet and smart phone, mobile data sharing have been attracted many researcher’s attentions. In this paper, we investigate the mobile data sharing problem in mobile crowdsensing. There are a large number of users, each user can be a mobile data acquisition, or can be a mobile data sharing, the problem is how to optimal choose users to collaborative sharing their idle mobile data to others. We consider two data sharing models, One-to-Many and Many-to-Many data sharing model when users share their mobile data. For One-to-Many model, we propose an OTM algorithm based on the greedy algorithm to share each one’s data. For Many-to-Many model, we translate the problem into the stable marriage problem (SMP), and we propose a MTM algorithm based on the SMP algorithm to solve this problem. Experimental results show that our methods are superior to the other approaches.