کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6888587 | 1445068 | 2018 | 29 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Minimum-cost mobile crowdsourcing with QoS guarantee using matrix completion technique
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Minimum-cost mobile crowdsourcing with QoS guarantee using matrix completion technique Minimum-cost mobile crowdsourcing with QoS guarantee using matrix completion technique](/preview/png/6888587.png)
چکیده انگلیسی
Mobile crowdsourcing is a promising solution for data collection, whereby a crowd of participants are recruited and paid for participation in data collection. To minimize the total crowdsourcing cost while guaranteeing the quality of service (QoS) of the tasks, this paper proposes a novel Matrix Completion Technique based Data Collection (MCTDC) scheme. Specifically, we explore the multi-dimensional correlation of data to reduce the data amount required while guaranteeing the QoS, by means of Matrix Completion Technique. Furthermore, to select the minimum set of appropriate participants, we redefine the contribution degree as the ratio of the valid data from a given participant and the total amount data it collects. The participants with high contribution degree are recruited to sense and report data. By doing so, the system can satisfy the demand of application quickly with less participants and less data amount, namely, with minimum cost and QoS guarantee. Extensive simulation results are provided, which demonstrates the proposed MFTDC scheme can significantly reduce the data redundancy and the number of participants.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pervasive and Mobile Computing - Volume 49, September 2018, Pages 23-44
Journal: Pervasive and Mobile Computing - Volume 49, September 2018, Pages 23-44
نویسندگان
Yingying Ren, Yuxin Liu, Ning Zhang, Anfeng Liu, Neal N. Xiong, Zhiping Cai,