![](/images/graphics-bg.png)
Optimal Task Partition with Delay Requirement in Mobile Crowdsourcing
المؤلفون المشاركون
Zhai, Linbo
Wang, Hua
Li, Xiaole
المصدر
Wireless Communications and Mobile Computing
العدد
المجلد 2019، العدد 2019 (31 ديسمبر/كانون الأول 2019)، ص ص. 1-12، 12ص.
الناشر
Hindawi Publishing Corporation
تاريخ النشر
2019-09-12
دولة النشر
مصر
عدد الصفحات
12
التخصصات الرئيسية
تكنولوجيا المعلومات وعلم الحاسوب
الملخص EN
Mobile crowdsourcing takes advantage of mobile devices such as smart phones and tablets to process data for a lot of applications (e.g., geotagging for mobile touring guiding monitoring and spectrum sensing).
In this paper, we propose a mobile crowdsourcing paradigm to make a task requester exploit encountered mobile workers for high-quality results.
Since a task may be too complex for a single worker, it is necessary for a task requester to divide a complex task into several parts so that a mobile worker can finish a part of the task easily.
We describe the task crowdsourcing process and propose the worker arrival model and task model.
Furthermore, the probability that all parts of the complicated task are executed by mobile workers is introduced to evaluate the result of task crowdsourcing.
Based on these models, considering computing capacity and rewards for mobile workers, we formulate a task partition problem to maximize the introduced probability which is used to evaluate the result of task crowdsourcing.
Then, using a Markov chain, a task partition policy is designed for the task requester to realize high-quality mobile crowdsourcing.
With this task partition policy, the task requester is able to divide the complicated task into precise number of parts based on mobile workers’ arrival, and the probability that the total parts are executed by mobile workers is maximized.
Also, the invalid number of task assignment attempts is analyzed accurately, which is helpful to evaluate the resource consumption of requesters due to probing potential workers.
Simulations show that our task partition policy improves the results of task crowdsourcing.
نمط استشهاد جمعية علماء النفس الأمريكية (APA)
Zhai, Linbo& Wang, Hua& Li, Xiaole. 2019. Optimal Task Partition with Delay Requirement in Mobile Crowdsourcing. Wireless Communications and Mobile Computing،Vol. 2019, no. 2019, pp.1-12.
https://search.emarefa.net/detail/BIM-1212169
نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)
Zhai, Linbo…[et al.]. Optimal Task Partition with Delay Requirement in Mobile Crowdsourcing. Wireless Communications and Mobile Computing No. 2019 (2019), pp.1-12.
https://search.emarefa.net/detail/BIM-1212169
نمط استشهاد الجمعية الطبية الأمريكية (AMA)
Zhai, Linbo& Wang, Hua& Li, Xiaole. Optimal Task Partition with Delay Requirement in Mobile Crowdsourcing. Wireless Communications and Mobile Computing. 2019. Vol. 2019, no. 2019, pp.1-12.
https://search.emarefa.net/detail/BIM-1212169
نوع البيانات
مقالات
لغة النص
الإنجليزية
الملاحظات
Includes bibliographical references
رقم السجل
BIM-1212169
قاعدة معامل التأثير والاستشهادات المرجعية العربي "ارسيف Arcif"
أضخم قاعدة بيانات عربية للاستشهادات المرجعية للمجلات العلمية المحكمة الصادرة في العالم العربي
![](/images/ebook-kashef.png)
تقوم هذه الخدمة بالتحقق من التشابه أو الانتحال في الأبحاث والمقالات العلمية والأطروحات الجامعية والكتب والأبحاث باللغة العربية، وتحديد درجة التشابه أو أصالة الأعمال البحثية وحماية ملكيتها الفكرية. تعرف اكثر
![](/images/kashef-image.png)