21 October 2021 in IEEE Internet of Things Journal
In metropolitan areas with heavy transit demands, electric vehicles (EVs) are expected to be continuously driving without recharging downtime. Wireless power transfer (WPT) provides a promising solution for in-motion EV charging. Nevertheless, previous works are not directly applicable for the deployment of in-motion wireless chargers due to their different charging characteristics. The challenge of deploying in-motion wireless chargers to support the continuous driving of EVs in a metropolitan road network with the minimum cost remains unsolved. We propose CatCharger to tackle this challenge. By analyzing a metropolitan-scale data set, we found that traffic attributes like vehicle passing speed, daily visit frequency at intersections (i.e., landmarks), and their variances are diverse, and these attributes are critical to in-motion wireless charging performance. Driven by these observations, we first group landmarks with similar attribute values using the entropy minimization clustering method, and select candidate landmarks from the groups with suitable attribute values. Then, we use the kernel density estimator (KDE) to deduce the expected vehicle residual energy at each candidate landmark and consider EV drivers’ routing choice behavior in charger deployment. Finally, we determine the deployment locations by formulating and solving a multiobjective optimization problem, which maximizes vehicle traffic flow at charger deployment positions while guaranteeing the continuous driving of EVs at each landmark. Trace-driven experiments demonstrate that CatCharger increases the ratio of driving EVs at the end of a day by 12.5% under the same deployment cost.
30 July 2021 in IEEE Photonics Technology Letters
The threat and defend model of optical steganography based on amplified spontaneous emission noise is experimentally demonstrated. Although the optical delays in a steganography system generate large key space to hide and recover the stealth signals, delays in interferometer introduce spectral fringes that can be identified by the coherent detection attack and thus expose the stealth channel. To defend such attacks, the spectral fringes are removed by with stealth data rate that is beyond the response speed of the coherent detection. Experimental results show that the spectral signatures can be protected by both wideband property of spontaneous emission noise and setting up the optical delays and data rate within the secure range. Such defending method can guide the design of a secure optical steganography system.
18 January 2023 in IEEE Internet of Things Journal
In this article, we demonstrate that by using a temporal sequence of applied brake signals collected from a vehicle, attackers can still possibly infer the vehicle’s route over the period, even though brake-signal data does not reveal any specific location information. Our route inference is basically composed of three steps. At first, we categorize brake-signal subsequences into four different driving maneuvers (i.e., stopping from a certain speed, reducing speed to adjust with the traffic flow, and taking left and right turns). Second, we estimate the number of intersections traversed by the vehicle using the applied brake signals and their corresponding maneuvers. Finally, we design a graph-based route-selection algorithm to find a list of (paths) routes from the regional map using the predicted driving maneuvers and the speed profile. We evaluate our approach using over 450 km of transportation data, which has been collected from 25 individuals. The experimental results demonstrate that, by resorting to our solution, 92.04% of the original drivers’ trajectory can be successfully recovered from their brake data regardless of driver and vehicle models.
1 April 2025 in Proceedings on Privacy Enhancing Technologies
Geo-obfuscation serves as a location privacy protection mechanism (LPPM), enabling mobile users to share obfuscated locations with servers, rather than their exact locations. This method can protect users’ location privacy when data breaches occur on the server side since the obfuscation process is irreversible. To reduce the utility loss caused by data obfuscation, linear programming (LP) is widely employed, which, however, might suffer from a polynomial explosion of decision variables, rendering it impractical in largescale geo-obfuscation applications. In this paper, we propose a new LPPM, called Locally Relevant Geo-obfuscation (LR-Geo), to optimize geo-obfuscation using LP in a time-efficient manner. This is achieved by confining the geoobfuscation calculation for each user exclusively to the locally relevant (LR) locations to the user’s actual location. Given the potential risk of LR locations disclosing a user’s actual whereabouts, we enable users to compute the LP coefficients locally and upload them only to the server, rather than the LR locations. The server then solves the LP problem based on the received coefficients. Furthermore, we refine the LP framework by incorporating an exponential obfuscation mechanism to guarantee the indistinguishability of obfuscation distribution across multiple users. Based on the constraint structure of the LP formulation, we apply Benders’ decomposition to further enhance computational efficiency. Our theoretical analysis confirms that, despite the geo-obfuscation being calculated independently for each user, it still meets geo-indistinguishability constraints across multiple users with high probability. Finally, the experimental results based on a real-world dataset demonstrate that LR-Geo outperforms existing geo-obfuscation methods in computational time, data utility, and privacy preservation.