首页> 外文会议>IEEE International Conference on Communications >An Online Mechanism for Crowdsensing with Uncertain Task Arriving
【24h】

An Online Mechanism for Crowdsensing with Uncertain Task Arriving

机译:不确定任务到达的人群拥挤在线机制

获取原文

摘要

In this paper, an online incentive mechanism in crowdsensing systems is studied. Different from most of the existing works which considered the smartphone users arriving at the crowdsourcer in an online fashion, we concentrate on the uncertain task arrivals, and consider the smartphone user allocation problem by jointly taking the cost capacity of each smartphone user and the sensing data quality requirement into consideration. In our model, since the tasks arrive at the crowdsourcer in an online manner, the crowdsourcer must make decisions timely to choose a suitable subset of smartphone users to achieve a sound competitive ratio (compared to the offline solution) once the tasks arrive. For the purpose of minimizing social cost in the whole system and achieving truthfulness, an online strategy proof incentive mechanism is designed by applying randomized auction framework. Theoretical and simulation results verify the effectiveness of the proposed online incentive mechanism.
机译:本文研究了人群感知系统中的一种在线激励机制。与大多数现有研究认为智能手机用户以在线方式到达众包来源不同,我们专注于不确定的任务到达,并通过综合考虑每个智能手机用户的成本能力和感知数据来考虑智能手机用户分配问题。质量要求考虑在内。在我们的模型中,由于任务以在线方式到达众包源,因此众包源必须及时做出决定,以选择合适的智能手机用户子集,以在任务到达后实现合理的竞争比(与离线解决方案相比)。为了最大限度地降低整个系统的社会成本,实现真实性,应用随机拍卖框架设计了一种在线策略证明激励机制。理论和仿真结果验证了所提出的在线激励机制的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号