首页> 外文期刊>Services Computing, IEEE Transactions on >A Crowd-Sensing Framework for Allocation of Time-Constrained and Location-Based Tasks
【24h】

A Crowd-Sensing Framework for Allocation of Time-Constrained and Location-Based Tasks

机译:用于分配时间限制和基于位置的任务的人群传感框架

获取原文
获取原文并翻译 | 示例

摘要

Thanks to the capabilities of the built-in sensors of smart devices, mobile crowd-sensing (MCS) has become a promising technique for massive data collection. In this paradigm, the service provider recruits workers (i.e., common people with smart devices) to perform sensing tasks requested by the consumers. To efficiently handle workers' recruitment and task allocation, several factors have to be considered such as the quality of the sensed data that the workers can deliver and the different tasks locations. This allocation becomes even more challenging when the MCS tries to efficiently allocate multiple tasks under limited budget, time constraints, and the uncertainty that selected workers will not be able to perform the tasks. In this paper, we propose a service computing framework for time constrained-task allocation in location based crowd-sensing systems. This framework relies on (1) a recruitment algorithm that implements a multi-objective task allocation algorithm based on Particle Swarm Optimization, (2) queuing schemes to handle efficiently the incoming sensing tasks in the server side and at the end-user side, (3) a task delegation mechanism to avoid delaying or declining the sensing requests due to unforeseen user context, and (4) a reputation management component to manage the reputation of users based on their sensing activities and task delegation. The platform goal is to efficiently determine the most appropriate set of workers to assign to each incoming task so that high quality results are returned within the requested response time. Simulations are conducted using real datasets from Foursquare(1) and Enron email social network.(2) Simulation results show that the proposed framework maximizes the aggregated quality of information, reduces the budget and response time to perform a task and increases the average recommenders' reputation and their payment.
机译:由于智能设备内置传感器的功能,移动人群传感(MCS)已成为大规模数据收集的有希望的技术。在此范式中,服务提供商招募工人(即常见的智能设备),以执行消费者请求的传感任务。为了有效处理工人的招聘和任务分配,必须考虑几个因素,例如劳动人员可以提供和不同任务位置的感知数据的质量。当MCS试图在有限预算,时间约束和所选工人无法执行任务的不确定性下,当MCS尝试有效地分配多个任务时,这种分配变得更具挑战性。在本文中,我们向基于位置的人群传感系统中的时间约束任务分配提出了一种服务计算框架。该框架依赖于(1)招募的算法,实现了基于粒子群优化的多目标任务分配算法;(2)排队方案来有效地处理传入的感测任务在服务器侧和最终用户侧,( 3)任务委派机制,以避免由于不可预见的用户上下文而延迟或拒绝传感请求,并根据其感知活动和任务委托来管理用户声誉的声誉管理组件。平台目标是有效地确定最合适的工人集,以便为每个传入任务分配,以便在所请求的响应时间内返回高质量结果。使用Foursquare(1)和ENRON电子网络进行实际数据集进行仿真。(2)仿真结果表明,建议的框架最大限度地提高了汇总的信息质量,减少了执行任务的预算和响应时间并增加了平均推荐员声誉及其付款。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号