6 February 2023 in IEEE Transactions on Intelligent Transportation Systems
Vehicle trajectory data is critical for traffic management and location-based services. However, the released trajectories raise serious privacy concerns because they contain sensitive information such as homes and workplaces. Based on differential privacy, this problem can be addressed by generating synthetic trajectories from the original sensitive data while guaranteeing personal privacy. Unfortunately, existing methods focus on synthesizing trajectory datasets that preserve summary-level statistics (e.g., the overall distribution of user movements), making these synthetic trajectories lose individual-level mobility patterns. As shown in our experiment, this results in the low performance of their synthetic datasets in real-world applications. To address these limitations, we propose a novel solution for Synthesizing Private and Realistic Trajectories, namely SPRT, whose key idea is to integrate the public geography structures of the target area into the process of private trajectory synthesis. This enables us to capture more accurate mobility patterns to synthesize realistic trajectories, which can preserve both summary-level statistics and individual-level mobility behaviors. Consequently, the synthetic trajectories generated by SPRT are more similar to real trajectories and therefore more practical. We evaluate the performance of SPRT in real-world applications by applying its synthetic data to a series of trajectory analytic tasks. The results demonstrate that our solution improves data utility by at least 37% over state-of-the-art approaches.
16 May 2018 in IEEE Access
Virtual machine (VM) consolidation techniques are a means to improve energy efficiency and the utilization of cloud data center resources. However, aggressive VM consolidation approaches lead to physical host over-utilization and generate massive undesired VM migrations, which cause degradation of the performance of both the hosts and the VM. Additionally, it has been a significant challenge to improve energy efficiency and resource utilization in the data center while delivering services with guaranteed quality of service (QoS). To address the problem, we propose an enhancing energy-efficient and QoS dynamic virtual machine consolidation (EQVC) method, which consists of four algorithms that correspond to different stages in VM consolidation. In this approach, we select redundant VMs from the hosts before they overload and migrate the VMs to other hosts to save energy and guarantee QoS requirements. We also introduce a host-model with adaptive reserved resources to prevent re-overload of hosts. To prove the effectiveness of our proposed method and algorithms, we experiment under different workload traces from a real system. The experimental results demonstrate that EQVC approach can significantly outperform other traditional methods regarding energy consumption, QoS guarantees, and the number of VM migrations.
21 June 2023 in IEEE Transactions on Knowledge and Data Engineering
Vehicle trajectory data is essential for traffic management and location-based services. However, publishing real-life trajectory data has been challenging because vehicle trajectories contain users’ sensitive information. Differential privacy addresses such problems by publishing a synthetic version of the input dataset, but existing works always assume the real-world data is absolutely accurate. This assumption no longer holds in trajectory data because it typically contains errors due to inaccurate positioning services, which leads to poor performance of data synthesized by such trajectories. Even worse, existing works may generate unrealistic trajectories due to their coarse data synthesis methods, resulting in low practical utility or even inability to handle complex tasks. In this paper, we propose a P rivacy-preserving and U tility-enhancing framework for T rajectory S ynthesization ( PUTS ). Our framework mitigates the impact of data errors in trajectories on differential privacy mechanisms, by exploiting map-matching techniques and real-world road network structure. In PUTS , a two-layer approach from path to trajectory synthesis is proposed to not only guarantee the reality of synthetic trajectories, but also scale up PUTS in real-world applications. Extensive experiments on real-world datasets show that PUTS significantly outperforms existing methods in terms of utility in a range of real-world applications.
14 October 2024 in IEEE Transactions on Information Forensics and Security
Valuable information and knowledge can be learned from users’ location traces and support various location-based applications such as intelligent traffic control, incident response, and COVID-19 contact tracing. However, due to privacy concerns, no authority could simply collect users’ private location traces for mining or even publishing. To echo such concerns, local differential privacy (LDP) enables individual privacy by allowing each user to report a perturbed version of their data. Unfortunately, when applied to location traces, LDP cannot preserve the semantics in the context of location traces because it treats all locations (i.e., various points of interest) as equally sensitive. This results in a low utility of LDP mechanisms for collecting location traces. In this paper, we address the challenge of collecting and sharing location traces with valuable semantics while providing sufficient privacy protection for participating users. We first propose semantic-constrained local differential privacy (SLDP), a new privacy model to provide a provable mathematical privacy guarantee while preserving desirable semantics. Then, we design a location trace perturbation mechanism (LTPM) that users can use to perturb their traces in a way that satisfies SLDP. Finally, we propose a private location trace synthesis (PLTS) framework in which users use LTPM to perturb their traces before sending them to the collector, who aggregates the users’ perturbed data to generate location traces with valuable semantics. Extensive experiments on three real-world datasets demonstrate that our PLTS outperforms existing state-of-the-art methods by at least 21% in a range of real-world applications, such as spatial visiting queries and frequent pattern mining, under the same privacy leakage.
23 February 2024 in IEEE Transactions on Knowledge and Data Engineering
While collecting data from a large population, local differential privacy (LDP), which only sends users' perturbed data to the data collector, becomes a popular solution to preserving each user's privacy. However, as high-dimensional data collection becomes prevalent for machine learning, LDP suffers from low utility (a.k.a., the dimensionality curse) as its privacy budget in each dimension is severely diluted. In a previous work [1], we proposed an analytical framework for benchmarking various LDP mechanisms and a re-calibration protocol for its utility enhancement in high-dimensional space. However, they have several limitations, including difficulty in setting a suitable benchmark parameter (i.e., the probabilistic supremum of deviation), a mismatch of the metric with prevalent experimental metrics, and costly re-benchmarking operation upon population change. In this paper, we propose a toolbox LDPTube to address these issues. It first consists of a non-parametric benchmark in high-dimensional space, which adopts MSE as the metric and avoids re-benchmarking upon population change. Then we adapt this benchmark to personalized LDP, where each user can choose her own privacy budget and privacy region. Last but not the least, we enhance the re-calibration protocol in [1] by an adaptive protocol HDR4ME* that opportunistically chooses suitable regularization terms that can maximize utility. We verify the correctness and effectiveness of these new solutions by both theoretical analysis and experimental results.
26 September 2024 in International Journal of Machine Learning and Cybernetics