skip to main content


This content will become publicly available on August 30, 2024

Title: HPRoP: Hierarchical Privacy-Preserving Route Planning for Smart Cities
Route Planning Systems (RPS) are a core component of autonomous personal transport systems essential for safe and efficient navigation of dynamic urban environments with the support of edge-based smart city infrastructure, but they also raise concerns about user route privacy in the context of both privately-owned and commercial vehicles. Numerous high profile data breaches in recent years have fortunately motivated research on privacy-preserving RPS, but most of them are rendered impractical by greatly increased communication and processing overhead. We address this by proposing an approach called Hierarchical Privacy-Preserving Route Planning (HPRoP) which divides and distributes the route planning task across multiple levels, and protects locations along the entire route. This is done by combining Inertial Flow partitioning, Private Information Retrieval (PIR), and Edge Computing techniques with our novel route planning heuristic algorithm. Normalized metrics were also formulated to quantify the privacy of the source/destination points (endpoint location privacy) and the route itself (route privacy). Evaluation on a simulated road network showed that HPRoP reliably produces routes differing only by ≤20% in length from optimal shortest paths, with completion times within ∼ 25 seconds which is reasonable for a PIR-based approach. On top of this, more than half of the produced routes achieved near-optimal endpoint location privacy (∼ 1.0) and good route privacy (≥ 0.8).  more » « less
Award ID(s):
2238815 1818901
NSF-PAR ID:
10466144
Author(s) / Creator(s):
; ; ; ; ; ; ;
Date Published:
Journal Name:
ACM Transactions on Cyber-Physical Systems
ISSN:
2378-962X
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Recent work has considered personalized route planning based on user profiles, but none of it accounts for human trust. We argue that human trust is an important factor to consider when planning routes for automated vehicles. This article presents a trust-based route-planning approach for automated vehicles. We formalize the human-vehicle interaction as a partially observable Markov decision process (POMDP) and model trust as a partially observable state variable of the POMDP, representing the human’s hidden mental state. We build data-driven models of human trust dynamics and takeover decisions, which are incorporated in the POMDP framework, using data collected from an online user study with 100 participants on the Amazon Mechanical Turk platform. We compute optimal routes for automated vehicles by solving optimal policies in the POMDP planning and evaluate the resulting routes via human subject experiments with 22 participants on a driving simulator. The experimental results show that participants taking the trust-based route generally reported more positive responses in the after-driving survey than those taking the baseline (trust-free) route. In addition, we analyze the trade-offs between multiple planning objectives (e.g., trust, distance, energy consumption) via multi-objective optimization of the POMDP. We also identify a set of open issues and implications for real-world deployment of the proposed approach in automated vehicles. 
    more » « less
  2. We show that it is possible to achieve information theoretic location privacy for secondary users (SUs) in database-driven cognitive radio networks (CRNs) with an end-to-end delay less than a second, which is significantly better than that of the existing alternatives offering only a computational privacy. This is achieved based on a keen observation that, by the requirement of Federal Communications Commission (FCC), all certified spectrum databases synchronize their records. Hence, the same copy of spectrum database is available through multiple (distinct) providers. We harness the synergy between multi-server private information retrieval (PIR) and database-driven CRN architecture to offer an optimal level of privacy with high efficiency by exploiting this observation. We demonstrated, analytically and experimentally with deployments on actual cloud systems that, our adaptations of multi-server PIR outperform that of the (currently) fastest single-server PIR by a magnitude of times with information-theoretic security, collusion resiliency, and fault-tolerance features. Our analysis indicates that multi-server PIR is an ideal cryptographic tool to provide location privacy in database-driven CRNs, in which the requirement of replicated databases is a natural part of the system architecture, and therefore SUs can enjoy all advantages of multi-server PIR without any additional architectural and deployment costs. 
    more » « less
  3. Fixed-route bus systems are an important part of the urban transportation mix. A considerable disadvantage of buses is their slow speed, which is in part due to frequent stops, but also due to the lack of segregation from other vehicles in traffic. As such, assessing bus routes is an important aspect of route planning, scheduling, and the creation of dedicated bus lanes. In this work, we use bus tracking data from the Washington Metropolitan Area Transit Authority to discover speed patterns in relation to bus stops throughout the day. This gives us an insight on whether the routes are affected by traffic congestion or more random events such as traffic lights. We first employ a macro-level qualitative analysis to identify patterns across different trips. A micro-level quantitative analysis further refines this approach by analyzing the speed patterns around bus stops. Our analysis is based on bus odometer data, which is a one-dimensional representation of trips that has considerable accuracy when looking at speed patterns. Exploiting route metadata in relation to stops, we use Dynamic Time Warping to cluster different stops based on their speed profiles throughout the day. The clustering can be used to generate a spatiotemporal route profile and we show how such a profile provides actionable intelligence for route planning purposes. 
    more » « less
  4. Geodesign is a participatory planning approach in which stakeholders use geographic information systems to develop and vet alternative design scenarios in a collaborative and iterative process. This study is based on a 2019 geodesign workshop in which 17 participants from industry, government, university, and non-profit sectors worked together to design an initial network of hydrogen refueling stations in the Hartford, Connecticut, metropolitan area. The workshop involved identifying relevant location factors, rapid prototyping of station network designs, and developing consensus on a final design. The geodesign platform, which was designed specifically for facility location problems, enables breakout groups to add or delete stations with a simple point-and-click operation, view and overlay different map layers, compute performance metrics, and compare their designs to those of other groups. By using these sources of information and their own expert local knowledge, participants recommended six locations for hydrogen refueling stations over two distinct phases of station installation. We quantitatively and qualitatively compared workshop recommendations to solutions of three optimal station location models that have been used to recommend station locations, which minimize travel times from stations to population and traffic or maximize trips that can be refueled on origin–destination routes. In a post-workshop survey, participants rated the workshop highly for facilitating mutual understanding and information sharing among stakeholders. To our knowledge, this workshop represents the first application of geodesign for hydrogen refueling station infrastructure planning. 
    more » « less
  5. This paper proposes a new formulation for the school bus scheduling problem (SBSP), which optimizes school start times and bus operation times to minimize transportation cost. The goal is to minimize the number of buses to serve all bus routes such that each route arrives in a time window before school starts. We show that introducing context-specific features, common in many school districts, can lead to a new time-indexed integer linear programming (ILP) formulation. Based on a strengthened version of the linear relaxation of the ILP, we develop a dependent randomized rounding algorithm that yields near-optimal solutions for large-scale problem instances. The efficient formulation and solution approach enable quick generation of multiple solutions to facilitate strategic planning, which we demonstrate with data from two public school districts in the United States. We also generalize our methodologies to solve a robust version of the SBSP. 
    more » « less