DFPS: A Distributed Mobile System for Free Parking Assignment
DFPS: A Distributed Mobile System for Free Parking Assignment
复制标题
DOI：
10.1109/tmc.2021.3080222
复制
发表时间：
2022-12
影响因子：
7.9
通讯作者：
Abeer Hakeem;Reza Curtmola;Xiaoning Ding;C. Borcea
中科院分区：
文献类型：
--
作者：
Abeer Hakeem;Reza Curtmola;Xiaoning Ding;C. Borcea
在路边寻找空的停车位会浪费时间，让人沮丧，浪费燃料，还会造成污染。这个问题已经通过集中解决方案得到了解决，该解决方案执行停车分配并将其传输到驾驶员的智能手机上。然而，这些解决方案存在两个内在问题：可伸缩性，因为服务器必须执行密集的计算并与驱动程序通信；还有隐私，因为司机必须向服务器披露他们的目的地。本文提出了一种分布式移动免费泊车分配系统DFPS。DFPS解决了可扩展性问题，通过驾驶员的智能手机协同计算停车分配，并通过集中调度器接收停车请求并将其分发到智能手机网络。DFPS中停车司机的手机以K-D树的形式构建，以分布式方式服务停车请求。DFPS从调度程序中删除了计算，并大大减少了它的通信负载。DFPS通过一种基于熵的隐身技术解决了隐私问题，该技术运行在司机的智能手机上，对调度员隐藏司机的目的地。评估结果表明，DFPS具有可扩展性，比集中式系统获得更好的出行时间，同时保护了驾驶员目的地的隐私。
Cruising for vacant curbside parking spaces causes waste of time, frustration, waste of fuel, and pollution. This problem has been addressed by centralized solutions that perform parking assignments and communicate them to drivers’ smart phones. These solutions suffer, however, from two intrinsic problems: scalability, as the server has to perform intensive computation and communication with the drivers; and privacy, as the drivers have to disclose their destinations to the server. This article proposes DFPS, a distributed mobile system for free parking assignment. DFPS solves the scalability problem by using the drivers’ smart phones to cooperatively compute the parking assignments, and a centralized dispatcher to receive and distribute parking requests to the network of smart phones. The phones of the parked drivers in DFPS are structured in a K-D tree to serve parking requests in a distributed fashion. DFPS removes the computation from the dispatcher and substantially reduces its communication load. DFPS solves the privacy problem through an entropy-based cloaking technique that runs on drivers’ smart phones and conceals drivers’ destinations from the dispatcher. The evaluation demonstrates that DFPS is scalable and obtains better travel time than a centralized system, while protecting the privacy of drivers’ destinations.