Many vehicles spend a significant amount of time in urban traffic congestion. Due to the evolution of autonomous cars, driver assistance systems, and in-vehicle entertainment, many vehicles have plentiful computational and communication capacity. How can we deploy data collection and processing tasks on these (slowly) moving vehicles to productively use any spare resources? To answer this question, we study the efficient placement of distributed services on a moving vehicle cluster. We present a macroscopic flow model for an intersection in Dublin, Ireland, using real vehicle density data. We show that such aggregate flows are highly predictable (even though the paths of individual vehicles are not known in advance), making it viable to deploy services harnessing vehicles' sensing capabilities. Our main contribution is a detailed mathematical specification for a task-based, distributed service placement model that scales according to the resource requirements and is robust to the changes caused by the mobility of the cluster. We formulate this as a constrained optimization problem, with the objective of minimizing overall processing and communication costs. Our results show that jointly scaling tasks and finding a mobility-aware, optimal placement results in reduced processing and communication costs compared to an autonomous vehicular edge computing-based na\"{i}ve solution.
翻译:许多车辆在城市交通拥堵中花费了大量时间。由于自治汽车、司机协助系统和车辆娱乐的演变,许多车辆具有充分的计算和通信能力。我们如何在这些(低度)移动车辆上部署数据收集和处理任务,以生产使用任何剩余资源?为了回答这个问题,我们研究了在移动车辆集群上有效安排分配服务的问题。我们用真正的车辆密度数据为在爱尔兰都柏林的交叉点提供了一个宏观流动模式。我们表明,这种总流量非常可预测(即使个人车辆的行进不为人所知),因此能够部署利用车辆的感知能力的服务。我们的主要贡献是根据资源需求,对基于任务的分配服务安置模式作出详细的数学规格说明,该模式根据任务、分布式服务安排模式的规模,对集群流动所带来的变化十分有力。我们将此设计成一个有限的优化问题,目的是尽量减少总体处理和通信成本。我们的结果表明,联合扩大任务的规模,并找到机动性、最佳的安置结果,与自主的视觉边缘计算机解决方案相比,在降低处理和通信成本方面产生最佳效果。