{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:17:56Z","timestamp":1742959076375,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030954048"},{"type":"electronic","value":"9783030954055"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95405-5_22","type":"book-chapter","created":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T19:03:13Z","timestamp":1643655793000},"page":"307-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Trust Management-Based Route Planning Scheme in LBS Network"],"prefix":"10.1007","author":[{"given":"Xinyang","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bohan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianlun","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaying","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,31]]},"reference":[{"issue":"3","key":"22_CR1","first-page":"557","volume":"54","author":"L Bohan","year":"2017","unstructured":"Bohan, L., Chao, Z., Dongjing, L., Jianqiu, X., Bin, X., Xiaolin, Q.: A DSP-Topk query optimization algorithm supporting indoor obstacle space. J. Comput. Res. Develop. 54(3), 557 (2017)","journal-title":"J. Comput. Res. Develop."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.procs.2020.06.065","volume":"174","author":"T Dai","year":"2020","unstructured":"Dai, T., et al.: Continuous route planning over a dynamic graph in real-time. Procedia Comput. Sci. 174, 111\u2013114 (2020)","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W., et al.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s41019-019-00114-z","volume":"5","author":"Y Ji","year":"2020","unstructured":"Ji, Y., Chai, Y., Zhou, X., Ren, L., Qin, Y.: Smart intra-query fault tolerance for massive parallel processing databases. Data Sci. Eng. 5(1), 65\u201379 (2020)","journal-title":"Data Sci. Eng."},{"issue":"6","key":"22_CR6","first-page":"1559","volume":"18","author":"C Lai","year":"2016","unstructured":"Lai, C., Zhang, K., Cheng, N., Li, H., Shen, X.: SIRC: a secure incentive scheme for reliable cooperative downloading in highway VANETs. IEEE Trans. Intell. Transp. Syst. 18(6), 1559\u20131574 (2016)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"3765","DOI":"10.1109\/TITS.2020.3035869","volume":"22","author":"B Li","year":"2020","unstructured":"Li, B., Liang, R., Zhu, D., Chen, W., Lin, Q.: Blockchain-based trust management model for location privacy preserving in VANETs. IEEE Trans. Intell. Transp. Syst. 22, 3765\u20133775 (2020)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"9","key":"22_CR8","doi-asserted-by":"publisher","first-page":"4095","DOI":"10.1109\/TVT.2012.2209903","volume":"61","author":"Q Li","year":"2012","unstructured":"Li, Q., Malip, A., Martin, K.M., Ng, S.L., Zhang, J.: A reputation-based announcement scheme for VANETs. IEEE Trans. Veh. Technol. 61(9), 4095\u20134108 (2012)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1109\/TITS.2015.2494017","volume":"17","author":"W Li","year":"2015","unstructured":"Li, W., Song, H.: Art: an attack-resistant trust management scheme for securing vehicular ad hoc networks. IEEE Trans. Intell. Transp. Syst. 17(4), 960\u2013969 (2015)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-030-65390-3_36","volume-title":"Advanced Data Mining and Applications","author":"R Liang","year":"2020","unstructured":"Liang, R., Li, B., Song, X.: Blockchain-based privacy preserving trust management model in VANET. In: Yang, X., Wang, C.-D., Islam, M.S., Zhang, Z. (eds.) ADMA 2020. LNCS (LNAI), vol. 12447, pp. 465\u2013479. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65390-3_36"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Liu, H., Li, X., Li, H., Ma, J., Ma, X.: Spatiotemporal correlation-aware dummy-based privacy protection scheme for location-based services. In: IEEE Conference on Computer Communications, IEEE INFOCOM 2017, pp. 1\u20139. IEEE (2017)","DOI":"10.1109\/INFOCOM.2017.8056978"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"4101","DOI":"10.1109\/JIOT.2019.2957421","volume":"7","author":"X Liu","year":"2020","unstructured":"Liu, X., Huang, H., Xiao, F., Ma, Z.: A blockchain-based trust management with conditional privacy-preserving announcement scheme for VANETs. IEEE Internet Things J. 7, 4101\u20134112 (2020)","journal-title":"IEEE Internet Things J."},{"issue":"6","key":"22_CR13","doi-asserted-by":"publisher","first-page":"2722","DOI":"10.1109\/TCOMM.2018.2800756","volume":"66","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Fang, X., Xiao, M., Mumtaz, S.: Decentralized beam pair selection in multi-beam millimeter-wave networks. IEEE Trans. Commun. 66(6), 2722\u20132737 (2018)","journal-title":"IEEE Trans. Commun."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"45655","DOI":"10.1109\/ACCESS.2018.2864189","volume":"6","author":"Z Lu","year":"2018","unstructured":"Lu, Z., Liu, W., Wang, Q., Qu, G., Liu, Z.: A privacy-preserving trust model based on blockchain for VANETs. IEEE Access 6, 45655\u201345664 (2018)","journal-title":"IEEE Access"},{"issue":"2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"2034","DOI":"10.1109\/TVT.2019.2957744","volume":"69","author":"B Luo","year":"2019","unstructured":"Luo, B., Li, X., Weng, J., Guo, J., Ma, J.: Blockchain enabled trust-based location privacy protection scheme in VANET. IEEE Trans. Veh. Technol. 69(2), 2034\u20132048 (2019)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"8","key":"22_CR16","doi-asserted-by":"publisher","first-page":"3947","DOI":"10.1109\/TVT.2011.2162972","volume":"60","author":"ME Mahmoud","year":"2011","unstructured":"Mahmoud, M.E., Shen, X.: An integrated stimulation and punishment mechanism for thwarting packet dropping attack in multihop wireless networks. IEEE Trans. Veh. Technol. 60(8), 3947\u20133962 (2011)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Malviya, N., Madden, S.R., Bhattacharya, A.: A continuous query system for dynamic route planning. In: 2011 IEEE 27th International Conference on Data Engineering, pp. 792\u2013803 (2011)","DOI":"10.1109\/ICDE.2011.5767844"},{"key":"22_CR18","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Decentralized Business Review, p. 21260 (2008)"},{"issue":"11","key":"22_CR19","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.14778\/3236187.3236211","volume":"11","author":"Y Tong","year":"2018","unstructured":"Tong, Y., Zeng, Y., Zhou, Z., Chen, L., Xu, K.: A unified approach to route planning for shared mobility. Proc. VLDB Endow. 11(11), 1633\u20131646 (2018)","journal-title":"Proc. VLDB Endow."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Xu, J., Guo, L., Ding, Z., Sun, X., Liu, C.: Traffic aware route planning in dynamic road networks. In: International Conference on Database Systems for Advanced Applications, pp. 576\u2013591 (2012)","DOI":"10.1007\/978-3-642-29038-1_41"},{"key":"22_CR21","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-981-15-8685-9_49","volume-title":"Advances in Systems, Control and Automations","author":"BP Yagitala","year":"2021","unstructured":"Yagitala, B.P., Prince Mary, S.: Traffic status update system with trust level management using blockchain. In: Bhoi, A.K., Mallick, P.K., Balas, V.E., Mishra, B.S.P. (eds.) Advances in Systems, Control and Automations. LNEE, vol. 708, pp. 471\u2013478. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-15-8685-9_49"},{"issue":"2","key":"22_CR22","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1109\/JIOT.2018.2836144","volume":"6","author":"Z Yang","year":"2018","unstructured":"Yang, Z., Yang, K., Lei, L., Zheng, K., Leung, V.C.: Blockchain-based decentralized trust management in vehicular networks. IEEE Internet Things J. 6(2), 1495\u20131505 (2018)","journal-title":"IEEE Internet Things J."},{"issue":"11","key":"22_CR23","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manage. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manage. Sci."}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95405-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T19:05:59Z","timestamp":1643655959000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95405-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030954048","9783030954055"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95405-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"31 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/adma2021.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT3","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"116","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}