定制公交共享的隐私保护乘车集群:一种雾辅助方法

Yuanyuan He, Jianbing Ni, Ben Niu, Fenghua Li, Xuemin Shen
{"title":"定制公交共享的隐私保护乘车集群:一种雾辅助方法","authors":"Yuanyuan He, Jianbing Ni, Ben Niu, Fenghua Li, Xuemin Shen","doi":"10.23919/WIOPT.2018.8362850","DOIUrl":null,"url":null,"abstract":"Customized-bus Sharing Service (CSS) enables a centralized server to schedule comfortable bus trips for users by ride clustering based on the individual requirements. It has been increasingly popular in crowded metropolises, bringing a lot of convenience and reducing trip costs to users. Ride clustering is essential for the server to determine the stops of a customized bus, but it also leads to the exposure of users' current locations and spatio-temporal patterns. Although privacy-preserving ride clustering can generate optimal bus routes, it depends on frequent interactions between users and the server, so all the users should be always online. In this paper, we propose a privacy-preserving ride clustering scheme for CSS to support off-line users, in which fog computing is introduced to assist the server in generating bus route without the exposure of users' travel plans. Fog servers are able to perform ride clustering interacting with the server, after receiving the preferred pick-up and drop-off positions from users. Thus, the users are unnecessary to be always online. In addition, the Paillier cryptosystem and randomization technique are leveraged to protect the user's privacy without sacrificing the clustering quality. Finally, the proposed privacy-preserving ride clustering scheme is demonstrated to have the advantage of low computational and communication overhead with high security guarantees.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Privacy-preserving ride clustering for customized-bus sharing: A fog-assisted approach\",\"authors\":\"Yuanyuan He, Jianbing Ni, Ben Niu, Fenghua Li, Xuemin Shen\",\"doi\":\"10.23919/WIOPT.2018.8362850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Customized-bus Sharing Service (CSS) enables a centralized server to schedule comfortable bus trips for users by ride clustering based on the individual requirements. It has been increasingly popular in crowded metropolises, bringing a lot of convenience and reducing trip costs to users. Ride clustering is essential for the server to determine the stops of a customized bus, but it also leads to the exposure of users' current locations and spatio-temporal patterns. Although privacy-preserving ride clustering can generate optimal bus routes, it depends on frequent interactions between users and the server, so all the users should be always online. In this paper, we propose a privacy-preserving ride clustering scheme for CSS to support off-line users, in which fog computing is introduced to assist the server in generating bus route without the exposure of users' travel plans. Fog servers are able to perform ride clustering interacting with the server, after receiving the preferred pick-up and drop-off positions from users. Thus, the users are unnecessary to be always online. In addition, the Paillier cryptosystem and randomization technique are leveraged to protect the user's privacy without sacrificing the clustering quality. Finally, the proposed privacy-preserving ride clustering scheme is demonstrated to have the advantage of low computational and communication overhead with high security guarantees.\",\"PeriodicalId\":231395,\"journal\":{\"name\":\"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/WIOPT.2018.8362850\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WIOPT.2018.8362850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

定制公交共享服务(CSS)是一种集中式服务器,根据用户的个人需求,通过乘车集群的方式,为用户安排舒适的公交行程。它在拥挤的大都市中越来越受欢迎,给用户带来了很多便利,降低了出行成本。乘车集群对于服务器确定定制巴士的站点至关重要,但它也会暴露用户当前的位置和时空模式。尽管隐私保护乘车集群可以生成最优公交路线,但它依赖于用户与服务器之间的频繁交互,因此所有用户都应该始终在线。在本文中,我们提出了一种用于支持离线用户的CSS的隐私保护乘车集群方案,该方案引入雾计算,在不暴露用户出行计划的情况下协助服务器生成公交路线。雾服务器能够在接收到用户的首选上车和下车位置后,与服务器进行乘车集群交互。因此,用户不需要一直在线。此外,利用Paillier密码系统和随机化技术在不牺牲聚类质量的前提下保护用户隐私。最后,本文提出的保隐私乘车聚类方案具有计算和通信开销低、安全性高的优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Privacy-preserving ride clustering for customized-bus sharing: A fog-assisted approach
Customized-bus Sharing Service (CSS) enables a centralized server to schedule comfortable bus trips for users by ride clustering based on the individual requirements. It has been increasingly popular in crowded metropolises, bringing a lot of convenience and reducing trip costs to users. Ride clustering is essential for the server to determine the stops of a customized bus, but it also leads to the exposure of users' current locations and spatio-temporal patterns. Although privacy-preserving ride clustering can generate optimal bus routes, it depends on frequent interactions between users and the server, so all the users should be always online. In this paper, we propose a privacy-preserving ride clustering scheme for CSS to support off-line users, in which fog computing is introduced to assist the server in generating bus route without the exposure of users' travel plans. Fog servers are able to perform ride clustering interacting with the server, after receiving the preferred pick-up and drop-off positions from users. Thus, the users are unnecessary to be always online. In addition, the Paillier cryptosystem and randomization technique are leveraged to protect the user's privacy without sacrificing the clustering quality. Finally, the proposed privacy-preserving ride clustering scheme is demonstrated to have the advantage of low computational and communication overhead with high security guarantees.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic resource allocation in radio-over-fiber enabled dense cellular networks Energy efficient scheduling for IoT applications with offloading, user association and BS sleeping in ultra dense networks Asymmetric regenerating codes for heterogeneous distributed storage systems Trekking based distributed algorithm for opportunistic spectrum access in infrastructure-less network Speed scaling under QoS constraints with finite buffer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1