COUSTIC:设备到设备云中任务分配的组合双向拍卖
COUSTIC: Combinatorial Double auction for Task Assignment in Device-to-Device Clouds
摘要:
随着物联网(IOT)的新兴技术,移动设备的能力已经极大地增加。然而,在大数据时代,在一台设备上完成任务仍然具有挑战性。众包技术作为一种新兴技术,利用大量的设备来完成大规模的传感任务,已经得到越来越多的研究关注。大多数现有的作品要么假设设备愿意合作,利用集中式机制或设计激励算法,使用双重拍卖。这对于处理前者缺乏集中式控制器的情况是不实际的,并且不适用于后者卖方设备也是资源受限的情况。在本文中,我们提出了一个真实的激励机制与组合双拍卖的设备到设备(D2D)云中的人群感知任务分配,其中一个移动终端密集的传感任务可以雇用一组空闲的邻居设备。通过这种新的机制,时间关键的传感任务可以及时处理与分布式的性质。我们证明了所提出的机制是真实的,个人理性,预算平衡和计算效率。仿真结果表明,组合双向拍卖机制比现有的双向拍卖机制和集中式最大匹配算法分别获得了26.3%和15.8%的收益。
英文摘要:
With the emerging technologies of Internet of Things (IOTs), the capabilities of mobile devices have increased tremendously. However, in the big data era, to complete tasks on one device is still challenging. As an emerging technology, crowdsourcing utilizing crowds of devices to facilitate large scale sensing tasks has gaining more and more research attention. Most of existing works either assume devices are willing to cooperate utilizing centralized mechanisms or design incentive algorithms using double auctions. Which is not practical to deal with the case when there is a lack of centralized controller for the former, and not suitable to the case when the seller device is also resource constrained for the later. In this paper, we propose a truthful incentive mechanism with combinatorial double auction for crowd sensing task assignment in device-to-device (D2D) clouds, where a single mobile device with intensive sensing task can hire a group of idle neighboring devices. With this new mechanism, time critical sensing tasks can be handled in time with a distributed nature. We prove that the proposed mechanism is truthful, individual rational, budget balance and computational efficient. Our simulation results demonstrate that combinatorial double auction mechanism gets a 26.3% and 15.8% gains in comparison to existing double auction scheme and the centralized maximum matching based algorithm respectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。