SAFE-CROWD: Secure task allocation for collaborative mobile social network
SAFE-CROWD: Secure task allocation for collaborative mobile social network
复制标题
DOI：
10.1109/chinacom.2014.7054315
复制
发表时间：
2014-08
期刊：
影响因子：
--
通讯作者：
Xiaochen Fan;Panlong Yang;Qingyu Li
中科院分区：
文献类型：
--
作者：
Xiaochen Fan;Panlong Yang;Qingyu Li
随着智能移动设备的普遍使用和无线网络技术的不断增加，移动用户之间的协作变得更加深入和普遍。移动用户之间适当的任务协作可以有效提高网络处理能力，即所谓的“移动云”或“cloudlet”。然而，任务分配面临着安全问题。移动用户之间可能的共谋或重新协作可能会合并特定用户的分配任务。而且，考虑到交付可靠性和任务执行效率，采用复制进行增强，这也会给用户带来更严重的安全威胁。我们研究了在允许移动用户进行任务协作时如何确保安全性。我们的安全方案是建立在负载均衡方案之上的，我们直观的解决方案是，如果能够在用户之间有效地平衡任务，那么安全问题就可以得到保证，因为平均任务分配可以有效提高潜在恶意用户之间串通的阈值。在这项工作中，我们提出了“SAFE-CROWD”：移动用户之间的安全任务卸载和重新分配方案。基本思想很简单，我们利用“球和仓”理论进行任务分配，其中对接触范围内的 d 个移动用户进行调查，然后选择其中负载最小的用户。事实证明，这种简单的情况可以有效地将最大排队长度从θ(log n/log log n)减小到θ(log log n/log d)。受这一理论结果的启发，我们制定了针对安全问题的任务重新分配策略。模拟研究表明，当任务在移动设备之间协作执行时，我们简单但有效的方案可以增强移动用户的安全性。
With the pervasive use of smart mobile devices and increasing wireless networking technologies, collaborations among mobile users are becoming deeper and ubiquitous. Appropriate task collaborations among mobile users could effectively improve the network processing ability with so called `mobile cloud' or `cloudlet'. However, task allocations confront with the security issues. The possible collusion or re-collaborations among the mobile users would possibly merge the allocated tasks of the specific users. Moreover, considering the delivery reliability and task execution efficiency, replications are applied for enhancement, which would also lead to more sever security threat for users. We investigate how to secure the security when task collaborations are allowed for mobile users. Our security scheme is built upon the load balancing scheme, and our intuitive solution is, if the tasks could be effectively balanced among users, the security issues could be guaranteed, because averaging the task assignment could effectively raise the threshold for collusion among potential malicious users. In this work, we propose `SAFE-CROWD': a secure task offloading and reassignment scheme among mobile users. The basic idea is simple, we leverage the `ball and bin' theory for task assignment, where d mobile users in contact range are investigated, and we select the least loaded ones among them. It has been proved that, such simple cases can effectively reduce the largest queueing length from θ(log n/log log n) to θ(log log n/log d). Inspired by this theoretical result, we develop a task reassignment policy for security issues. Simulation studies have shown that, our simple but effective scheme could enhance the security for mobile users, when the tasks are collaboratively executed among mobile devices.