Skip to main content

Migration Privacy Protection Based on Scheduling Algorithm for Online Car-Hailing

  • Conference paper
  • First Online:
Security and Privacy in Social Networks and Big Data (SocialSec 2021)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1495))

  • 369 Accesses

Abstract

In the era of rapid development of mobile Internet technology and big data technology, people enjoy more convenient travel because of Online Car-hailing. At the same time, the location privacy of drivers and passengers has also been leaked due to the use of Online Car-hailing. The traditional privacy preserving encryption technology for Online Car-hailing has a large amount of computation and low efficiency. In order to solve these problems, the Migration Privacy Protection based on Scheduling Algorithm (MPSA) for Online car-hailing is proposed in this paper. Firstly, the road network model is established through the road network matching technology. Secondly, the shortest path between the passenger and the car is calculated through A* algorithm and Dijkstra algorithm. Finally, the location privacy protection between the driver and the passenger is realized through the offset technology. In this paper, a scientific experiment is carried out on real data to verify the superiority of MPSA in privacy protection effect and operation efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.cnblogs.com/arxive/p/7511468.html.

References

  1. 21st Century Business Herald. https://m.21jingji.com/article/20210715/020f3c860939158be3eb50add203838a.html. Accessed 15 July 2021

  2. Zhou, X., Men, Z.: Research on the problems and path of government supervision on online car-hailing. Time-Honored Brand Mark. 2021(01), 39–40 (2021)

    Google Scholar 

  3. Cao, M., Zhang, L., Bi, X., Zhao, K.: Personalized (α, I) - diversity K-anonymity privacy protection model. Comput. Sci. 45(11), 180–186 (2018)

    Google Scholar 

  4. Xu, Z., Zhang, J., Tsai, P., Lin, L., Zhuo, C.: Spatiotemporal mobility based trajectory privacy-preserving algorithm in location-based services. Sensors 21(6), 1–14 (2021)

    Article  Google Scholar 

  5. Shao, J., Liu, R., Lin, X.: FINE: a fine-grained privacy-preserving location-based service framework for mobile devices. In: IEEE INFOCOM 2014 - IEEE Conference on Computer Communications, Toronto, ON, Canada, pp. 244–252. IEEE (2014)

    Google Scholar 

  6. Yin, C., Xi, J., Sun, R., Wang, J.: Location privacy protection based on differential privacy strategy for big data in industrial internet of things. IEEE Trans. Ind. Inf. 14(8), 3628–3636 (2018)

    Article  Google Scholar 

  7. Kini, A., Kulkarni, S.: Real time implementation of k fake location generation algorithm to protect location privacy in location based service. In: 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI), Udupi, India, pp.142–148. IEEE (2017)

    Google Scholar 

  8. Lin, S., Ye, A., Xu, L.: K-anonymity location privacy protection method based on coordinate transformation. Mini-Micro Syst. 37(1), 119–123 (2016)

    Google Scholar 

  9. Yue, Y., Gong, J.: An efficient implementation of shortest path algorithm based on Dijkstra algorithm. J. Wuhan Tech. Univ. Surv. Mapp. 24(3), 209–212 (1999)

    Google Scholar 

  10. Ju, C., Luo, Q., Yan, X.: Path planning using an improved a-star algorithm. In: 2020 11th International Conference on Prognostics and System Health Management (PHM-2020 Jinan), Jinan, China, pp. 23–26. IEEE (2020)

    Google Scholar 

  11. Pham, A., et al.: PrivateRide: a privacy-enhanced ride-hailing Service. In: Proceedings on Privacy Enhancing Technologies, pp. 38–56. PETS, American Samoa (2017)

    Google Scholar 

  12. Yu, H., Zhang, X., Yu, X.: Hail the Closest Driver on Roads: privacy-preserving ride matching in online ride hailing services. Secur. Commun. Netw. 2020(2), 1–13 (2020)

    Article  Google Scholar 

  13. Li, F., Zhang, C., Niu, B., Li, H., Hua, J.: Efficient trajectory privacy protection scheme. J. Commun. 36(12), 114–123 (2015)

    Google Scholar 

  14. Xu, J.: Decentralized location privacy protection method of offset grid. In: Modern Computer, pp. 113–120 (2019)

    Google Scholar 

Download references

Funding

This work is funded by the National Natural Science Foundation of China (No. 61902069 and U1905211), the Science Foundation of FuJian University of Technology (GY-Z21048, GY-Z18181 and GY-Z21024), the Natural Science Foundation of Fujian Province of China (2021J011068), and the Key Project of Shanghai Science and Technology Innovation Action Plan under Grant (19DZ1100400).

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ding, Q., Zhang, J., Lin, L., Xu, Z., Wang, Y. (2021). Migration Privacy Protection Based on Scheduling Algorithm for Online Car-Hailing. In: Lin, L., Liu, Y., Lee, CW. (eds) Security and Privacy in Social Networks and Big Data. SocialSec 2021. Communications in Computer and Information Science, vol 1495. Springer, Singapore. https://doi.org/10.1007/978-981-16-7913-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-7913-1_11

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-7912-4

  • Online ISBN: 978-981-16-7913-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics