AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Regular Paper

Cloaking Region Based Passenger Privacy Protection in Ride-Hailing Systems

Department of Computer and Information Sciences, Temple University, Pennsylvania 19122, U.S.A.
School of Computer Science and Technology, University of Science and Technology of China, Hefei 230036, China

Recommended by IEEE MASS 2019A preliminary version was published in the Proceedings of IEEE MASS 2019.

Show Author Information

Abstract

With the quick development of the sharing economy, ride-hailing services have been increasingly popular worldwide. Although the service provides convenience for users, one concern from the public is whether the location privacy of passengers would be protected. Service providers (SPs) such as Didi and Uber need to acquire passenger and driver locations before they could successfully dispatch passenger orders. To protect passengers’ privacy based on their requirements, we propose a cloaking region based order dispatch scheme. In our scheme, a passenger sends the SP a cloaking region in which his/her actual location is not distinguishable. The trade-off of the enhanced privacy is the loss of social welfare, i.e., the increase in the overall pick-up distance. To optimize our scheme, we propose to maximize the social welfare under passengers’ privacy requirements. We investigate a bipartite matching based approach. A theoretical bound on the matching performance under specific privacy requirements is shown. Besides passengers’ privacy, we allow drivers to set up their maximum pick-up distance in our extended scheme. The extended scheme could be applied when the number of drivers exceeds the number of passengers. Nevertheless, the global matching based scheme does not consider the interest of each individual passenger. The passengers with low privacy requirements may be matched with drivers far from them. To this end, a pricing scheme including three strategies is proposed to make up for the individual loss by allocating discounts on their riding fares. Extensive experiments on both real-world and synthetic datasets show the efficiency of our scheme.

Electronic Supplementary Material

Download File(s)
jcst-35-3-629-Highlights.pdf (274.2 KB)

References

【1】
【1】
 
 
Journal of Computer Science and Technology
Pages 629-646

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Duan Y, Gao G-J, Xiao M-J, et al. Cloaking Region Based Passenger Privacy Protection in Ride-Hailing Systems. Journal of Computer Science and Technology, 2020, 35(3): 629-646. https://doi.org/10.1007/s11390-020-0256-1

1004

Views

5

Crossref

N/A

Web of Science

5

Scopus

0

CSCD

Received: 30 December 2019
Revised: 11 March 2020
Published: 29 May 2020
©Institute of Computing Technology, Chinese Academy of Sciences 2020