{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:59:47Z","timestamp":1740142787413,"version":"3.37.3"},"reference-count":37,"publisher":"Oxford University Press (OUP)","issue":"10","license":[{"start":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:00:00Z","timestamp":1720224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["F2021201049","F2021201058"],"award-info":[{"award-number":["F2021201049","F2021201058"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Central Government for Local Science and Technology Development","award":["236Z0701G"],"award-info":[{"award-number":["236Z0701G"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,10,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The location and trajectory information generated in the Internet of Vehicles (IoV) provides sufficient data support for road network planning. However, there is much sensitive information in these data, and publishing them directly will lead to serious privacy leakage risks. Therefore, this paper proposes a trajectory publishing scheme for the Internet of Vehicles based on radix tree (TPRT). Firstly, the trajectory data are divided into multiple location planes based on timestamps and processed using clustering and generalization. This approach addresses the issue of real-life trajectory data having almost no identical prefixes, making it more suitable for storage in radix tree. Then, the directed graph and the shortest path algorithm are utilized to synthesize a new trajectory dataset for publication. Subsequently, a radix tree structure that satisfies differential privacy is defined. In comparison to the research method employing a prefix tree, the radix tree not only captures the spatiotemporal characteristics of the trajectories but also reduces space consumption. Finally, a novel method of noise addition is proposed. In contrast to the traditional layer-by-layer noise addition approach, our method reduces the cost of noise addition and enhances data availability. Experimental results demonstrate that TPRT exhibits superior data availability compared to the baseline methods.<\/jats:p>","DOI":"10.1093\/comjnl\/bxae057","type":"journal-article","created":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T10:41:46Z","timestamp":1720348906000},"page":"2920-2933","source":"Crossref","is-referenced-by-count":0,"title":["TPRT: a trajectory publishing scheme for the Internet of Vehicles based on radix tree"],"prefix":"10.1093","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7068-8002","authenticated-orcid":false,"given":"Junfeng","family":"Tian","sequence":"first","affiliation":[{"name":"School of Cyber Security and Computer, Hebei University , Baoding 071000 ,","place":["China"]},{"name":"Hebei Key Laboratory of High Confidence Information Systems, Hebei University , Baoding 071000 ,","place":["China"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1697-741X","authenticated-orcid":false,"given":"Qi","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Cyber Security and Computer, Hebei University , Baoding 071000 ,","place":["China"]},{"name":"Hebei Key Laboratory of High Confidence Information Systems, Hebei University , Baoding 071000 ,","place":["China"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4701-9767","authenticated-orcid":false,"given":"Jia wei","family":"Shen","sequence":"additional","affiliation":[{"name":"School of Cyber Security and Computer, Hebei University , Baoding 071000 ,","place":["China"]},{"name":"Hebei Key Laboratory of High Confidence Information Systems, Hebei University , Baoding 071000 ,","place":["China"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6838-6929","authenticated-orcid":false,"given":"Tengfei","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Cyber Security and Computer, Hebei University , Baoding 071000 ,","place":["China"]},{"name":"Hebei Key Laboratory of High Confidence Information Systems, Hebei University , Baoding 071000 ,","place":["China"]}]}],"member":"286","published-online":{"date-parts":[[2024,7,6]]},"reference":[{"key":"2024101809313056700_ref1","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/TSMC.2016.2606400","article-title":"A stochastic control approach to maximize profit on service provisioning for mobile cloudlet platforms","volume":"48","author":"Fang","year":"2016","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"2024101809313056700_ref2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1109\/COMST.2015.2410831","article-title":"A survey on platoon-based vehicular cyber-physical systems","volume":"18","author":"Jia","year":"2015","journal-title":"IEEE Commun Surv Tutor"},{"key":"2024101809313056700_ref3","doi-asserted-by":"crossref","first-page":"2658","DOI":"10.1109\/TITS.2015.2506579","article-title":"Evaluating location privacy in vehicular communications and applications","volume":"17","author":"Corser","year":"2016","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2024101809313056700_ref4","doi-asserted-by":"crossref","first-page":"3860","DOI":"10.1109\/TVT.2016.2532863","article-title":"Vehicular fog computing: a viewpoint of vehicles as the infrastructures","volume":"65","author":"Hou","year":"2016","journal-title":"IEEE Trans Veh Technol"},{"key":"2024101809313056700_ref5","doi-asserted-by":"crossref","first-page":"4611","DOI":"10.1109\/TITS.2020.3017109","article-title":"Short-term prediction of urban rail transit passenger flow in external passenger transport hub based on LSTM-LGB-DRS","volume":"22","author":"Jing","year":"2020","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2024101809313056700_ref6","doi-asserted-by":"crossref","first-page":"108090","DOI":"10.1016\/j.ress.2021.108090","article-title":"Evaluation of urban bus service reliability on variable time horizons using a hybrid deep learning method","volume":"217","author":"Zhou","year":"2022","journal-title":"Reliab Eng Syst Saf"},{"first-page":"232","volume-title":"International Conference on Connected Vehicles and Expo (ICCVE)","author":"Rizzo","key":"2024101809313056700_ref7"},{"key":"2024101809313056700_ref8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/srep01376","article-title":"Unique in the crowd: the privacy bounds of human mobility","volume":"3","author":"De Montjoye","year":"2013","journal-title":"Sci Rep"},{"key":"2024101809313056700_ref9","doi-asserted-by":"crossref","first-page":"1606","DOI":"10.1109\/ICDE.2019.00153","volume-title":"2019 IEEE 35th International Conference on Data Engineering (ICDE)","author":"Cao","year":"2019"},{"key":"2024101809313056700_ref10","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1145\/2508859.2516735","volume-title":"Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security","author":"Andr\u00e9s","year":"2013"},{"key":"2024101809313056700_ref11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ins.2011.07.035","article-title":"Privacy-preserving trajectory data publishing by local suppression","volume":"231","author":"Chen","year":"2013","journal-title":"Inf Sci"},{"key":"2024101809313056700_ref12","first-page":"1291","article-title":"Impact of prior knowledge on privacy leakage in trajectory data publishing","volume":"23","author":"Hemkumar","year":"2020","journal-title":"Eng Sci Technol"},{"key":"2024101809313056700_ref13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.knosys.2015.11.007","article-title":"PPTD: preserving personalized privacy in trajectory data publishing by sensitive attribute generalization and trajectory local suppression","volume":"94","author":"Komishani","year":"2016","journal-title":"Knowl-Based Syst"},{"key":"2024101809313056700_ref14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TMC.2020.3000730","article-title":"Eclipse: preserving differential location privacy against long-term observation attacks","volume":"21","author":"Niu","year":"2020","journal-title":"IEEE Trans Mob Comput"},{"key":"2024101809313056700_ref15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s12942-020-00201-9","article-title":"Daily activity locations k-anonymity for the evaluation of disclosure risk of individual GPS datasets","volume":"19","author":"Wang","year":"2020","journal-title":"Int J Health Geogr"},{"key":"2024101809313056700_ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13638-019-1406-4","article-title":"An anonymous entropy-based location privacy protection scheme in mobile social networks","volume":"2019","author":"Ni","year":"2019","journal-title":"EURASIP J Wirel Commun Netw"},{"volume-title":"Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining","year":"2012","author":"Chen","key":"2024101809313056700_ref17"},{"key":"2024101809313056700_ref18","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.07.008","article-title":"Novel trajectory data publishing method under differential privacy","volume":"138","author":"Zhao","year":"2019","journal-title":"Expert Syst Appl"},{"key":"2024101809313056700_ref19","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.ins.2019.05.054","article-title":"A trajectory privacy-preserving scheme based on a dual-K mechanism for continuous location-based services","volume":"527","author":"Zhang","year":"2020","journal-title":"Inf Sci"},{"key":"2024101809313056700_ref20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13677-021-00272-4","article-title":"A trusted de-swinging k-anonymity scheme for location privacy protection","volume":"11","author":"Yang","year":"2022","journal-title":"J Cloud Comput"},{"key":"2024101809313056700_ref21","doi-asserted-by":"crossref","first-page":"54264","DOI":"10.1109\/ACCESS.2021.3071407","article-title":"Semantic and trade-off aware location privacy protection in road networks via improved multi-objective particle swarm optimization","volume":"9","author":"Tian","year":"2021","journal-title":"IEEE Access"},{"key":"2024101809313056700_ref22","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1109\/JIOT.2018.2799545","article-title":"ILLIA: enabling k-anonymity-based privacy preserving against location injection attacks in continuous LBS queries","volume":"5","author":"Zhao","year":"2018","journal-title":"IEEE Internet Things J"},{"key":"2024101809313056700_ref23","first-page":"1","article-title":"Friendship inference based on interest trajectory similarity and Co-occurrence","volume":"33","author":"Tian","year":"2023","journal-title":"Chin J Electron"},{"key":"2024101809313056700_ref24","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.105940","article-title":"Novel trajectory privacy-preserving method based on prefix tree using differential privacy","volume":"198","author":"Zhao","year":"2020","journal-title":"Knowl-Based Syst"},{"key":"2024101809313056700_ref25","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115215","article-title":"Differential privacy trajectory data protection scheme based on R-tree","volume":"182","author":"Yuan","year":"2021","journal-title":"Expert Syst Appl"},{"key":"2024101809313056700_ref26","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1145\/2382196.2382263","volume-title":"Proceedings of the 2012 ACM conference on Computer and communications security","author":"Chen","year":"2012"},{"key":"2024101809313056700_ref27","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1109\/INFOCOM.2015.7218422","volume-title":"2015 IEEE Conference on Computer Communications (INFOCOM)","author":"Hua","year":"2015"},{"key":"2024101809313056700_ref28","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.comnet.2018.07.007","article-title":"SafePath: differentially-private publishing of passenger trajectories in transportation systems","volume":"143","author":"Al-Hussaeni","year":"2018","journal-title":"Comput Netw"},{"key":"2024101809313056700_ref29","doi-asserted-by":"crossref","first-page":"16534","DOI":"10.1109\/TITS.2021.3130978","article-title":"A trajectory released scheme for the internet of vehicles based on differential privacy","volume":"23","author":"Cai","year":"2021","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2024101809313056700_ref30","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.neucom.2021.04.137","article-title":"OPTDP: towards optimal personalized trajectory differential privacy for trajectory data publishing","volume":"472","author":"Cheng","year":"2022","journal-title":"Neurocomputing"},{"key":"2024101809313056700_ref31","doi-asserted-by":"crossref","first-page":"2868","DOI":"10.1109\/TII.2021.3116529","article-title":"Local trajectory privacy protection in 5G enabled industrial intelligent logistics","volume":"18","author":"Yang","year":"2021","journal-title":"IEEE Trans Ind Inform"},{"key":"2024101809313056700_ref32","doi-asserted-by":"crossref","first-page":"4006","DOI":"10.1109\/TIFS.2023.3290486","article-title":"TCPP: achieving privacy-preserving trajectory correlation with differential privacy","volume":"18","author":"Wu","year":"2023","journal-title":"IEEE Trans Inform Forensics Secur"},{"key":"2024101809313056700_ref33","doi-asserted-by":"crossref","first-page":"13784","DOI":"10.1109\/JIOT.2023.3262964","article-title":"A semantic-preserving scheme to trajectory synthesis using differential privacy","volume":"10","author":"Du","year":"2023","journal-title":"IEEE Internet Things J"},{"key":"2024101809313056700_ref34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/IJISP.315593","article-title":"Trajectory data publication based on differential privacy","volume":"17","author":"Gu","year":"2023","journal-title":"Int J Inf Secur Priv"},{"key":"2024101809313056700_ref35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/09540091.2023.2203880","article-title":"Trajectory privacy data publishing scheme based on local optimisation and R-tree","volume":"35","author":"Liu","year":"2023","journal-title":"Connect Sci"},{"key":"2024101809313056700_ref36","doi-asserted-by":"crossref","first-page":"1897","DOI":"10.14778\/3594512.3594520","article-title":"Ldptrace: locally differentially private trajectory synthesis","volume":"16","author":"Du","year":"2023","journal-title":"Proc VLDB Endow"},{"key":"2024101809313056700_ref37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2017.03.015","article-title":"Achieving differential privacy of trajectory data publishing in participatory sensing","volume":"400-401","author":"Li","year":"2017","journal-title":"Inf Sci"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/10\/2920\/59729645\/bxae057.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/10\/2920\/59729645\/bxae057.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T09:31:55Z","timestamp":1729243915000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/67\/10\/2920\/7708711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,6]]},"references-count":37,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2024,7,6]]},"published-print":{"date-parts":[[2024,10,12]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxae057","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2024,10]]},"published":{"date-parts":[[2024,7,6]]}}}