Road network mix-zones for anonymous location based services

Palanisamy, Balaji; Ravichandran, Shruthi; Liu, Ling; Han, Binh; Lee, Kisung; Pu, Carlton

doi:10.1109/icde.2013.6544929

Cited by 14 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The social spot may be a parking lot, which contains many vehicles, where vehicles change pseudonym randomly, this social spot naturally become a mix zone. A mix zone‐based approach called MobiMix is proposed for privacy preservation in the road network 22 . Multiple factors have been considered while designing mix zone, such as zone geometry, the spatial constraints on user movement patterns, statistical behavior of the user population.…”

Section: Related Workmentioning

confidence: 99%

“…A mix zone-based approach called MobiMix is proposed for privacy preservation in the road network. 22 Multiple factors have been considered while designing mix zone, such as zone geometry, the spatial constraints on user movement patterns, statistical behavior of the user population. The zone is fixed in a region and privacy provided only in that region, however, outside zone area no privacy protection.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Privacy‐preserving multilevel obfuscation scheme for vehicular network

Ullah

Shah

Khan

et al. 2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

For accessing various location‐based services (LBS), a device needs to update its location frequently. The vehicle requires to exchange location messages with LBS while moving on the road network. These messages contain sensitive information of vehicles, that is, location, identity, direction, and other contents. LBS is not trusted and may conspire with an adversary to capture the location messages and based on the location information the adversary tracks the future location spots of the vehicle driver. Existing location privacy schemes require the collaboration of neighbor vehicles to anonymize their location. However, such collaboration needs the consent of the neighbor vehicles. In addition, the messages exchanged with LBS contain the real identity of a vehicle and the vehicle is exposed to identity threat. In this article, we propose a multilevel location privacy scheme (MLPS) for a vehicle using location services. The vehicle generates duplicate messages by taking location positions of transmission range vehicles to anonymize its location and identity. We simulate the proposed scheme for various vehicle traffic densities. The simulation results show that the proposed scheme MLPS is more efficient than the existing scheme in terms of anonymity set size, location obfuscation, and location traceability. The MLPS reduces the vehicle location traceability from 50% to 1% compared with the existing scheme.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Privacy‐preserving multilevel obfuscation scheme for vehicular network

Ullah

Shah

Khan

et al. 2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…In recent times, the study of road networks has been emerged in the area of data management in general and spatial data management in particular [10]. Also, we have witnessed a significant development of wireless internet and mobile devices.…”

Section: Introductionmentioning

confidence: 99%

Utility Driven Job Selection Problem on Road Networks

Singhal¹,

Banerjee²

2022

Preprint

View full text Add to dashboard Cite

In this paper, we study the problem of Utility Driven Job Selection on Road Networks for which the inputs are: a road network with the vertices as the set of Point-Of-Interests (Henceforth mentioned as POI) and the edges are road segments joining the POIs, a set of jobs with their originating POI, starting time, duration, and the utility. A worker can earn the utility associated with the job if (s)he performs this. As the jobs are originating at different POIs, the worker has to move from one POI to the other one to take up the job. Some budget is available for this purpose. Any two jobs can be taken up by the worker only if the finishing time of the first job plus traveling time from the POI of the first job to the second one should be less than or equal to the starting time of the second job. We call this constraint as the temporal constraint. The goal of this problem is to choose a subset of the jobs to maximize the earned utility such that the budget and temporal constraints should not be violated. We present two solution approaches with detailed analysis. First one of them works based on finding the locally optimal job at the end of every job and we call this approach as the Best First Search Approach. The other approach is based on the Nearest Neighbor Search on road networks. We perform a set of experiments with real-world trajectory datasets to demonstrate the efficiency and effectiveness of the proposed solution approaches. We observe that the proposed approaches lead to more utility compared to baseline methods.

show abstract