{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T20:18:37Z","timestamp":1772741917216,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031226762","type":"print"},{"value":"9783031226779","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-22677-9_43","type":"book-chapter","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T09:04:32Z","timestamp":1673341472000},"page":"788-800","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Routing Protocol Based on Mission-Oriented Opportunistic Networks"],"prefix":"10.1007","author":[{"given":"Yahui","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinlian","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuan-Ching","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.future.2017.04.012","volume":"83","author":"X Li","year":"2018","unstructured":"Li, X., Niu, J., Kumari, S., et al.: A robust biometrics based three-factor authentication scheme for global mobility networks in smart city. Futur. Gener. Comput. Syst. 83, 607\u2013618 (2018)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"10","key":"43_CR2","first-page":"3828","volume":"50","author":"L Jiang","year":"2018","unstructured":"Jiang, L., Liu, J., Zhou, D., et al.: Predicting the evolution of hot topics: a solution based on the online opinion dynamics model in social network. IEEE Trans. Syst. Man Cybern.: Syst. 50(10), 3828\u20133840 (2018)","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Diao, C., Zhang, D., Liang, W., et al.: A Novel spatial-temporal multi-scale alignment graph neural network security model for vehicles prediction. IEEE Trans. Intell. Transp. Syst. (2022)","DOI":"10.1109\/TITS.2022.3140229"},{"issue":"4","key":"43_CR4","doi-asserted-by":"publisher","first-page":"664","DOI":"10.3390\/sym13040664","volume":"13","author":"Y Yu","year":"2021","unstructured":"Yu, Y., Yu, J., Chen, Z., et al.: A universal routing algorithm based on intuitionistic fuzzy multi-attribute decision-making in opportunistic social networks. Symmetry 13(4), 664 (2021)","journal-title":"Symmetry"},{"issue":"3","key":"43_CR5","doi-asserted-by":"publisher","first-page":"1606","DOI":"10.1109\/JIOT.2017.2787800","volume":"5","author":"X Li","year":"2017","unstructured":"Li, X., Peng, J., Niu, J., et al.: A robust and energy efficient authentication protocol for industrial internet of things. IEEE Internet Things J. 5(3), 1606\u20131615 (2017)","journal-title":"IEEE Internet Things J."},{"issue":"13","key":"43_CR6","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.3390\/electronics10131595","volume":"10","author":"Y Dong","year":"2021","unstructured":"Dong, Y., Chang, L., Luo, J., et al.: A routing query algorithm based on time-varying relationship group in opportunistic social networks. Electronics 10(13), 1595 (2021)","journal-title":"Electronics"},{"issue":"2","key":"43_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.3390\/info10020049","volume":"10","author":"P Zou","year":"2019","unstructured":"Zou, P., Zhao, M., Wu, J., et al.: Routing algorithm based on trajectory prediction in opportunistic networks. Information 10(2), 49 (2019)","journal-title":"Information"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.scs.2017.12.031","volume":"38","author":"S Zhang","year":"2018","unstructured":"Zhang, S., Li, X., Liu, H., et al.: A privacy-preserving friend recommendation scheme in online social networks. Sustain. Cities Soc. 38, 275\u2013285 (2018)","journal-title":"Sustain. Cities Soc."},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.jnca.2017.07.001","volume":"103","author":"X Li","year":"2018","unstructured":"Li, X., Niu, J., Kumari, S., et al.: A three-factor anonymous authentication scheme for wireless sensor networks in internet of things environments. J. Netw. Comput. Appl. 103, 194\u2013204 (2018)","journal-title":"J. Netw. Comput. Appl."},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.future.2016.05.007","volume":"72","author":"S Zhang","year":"2017","unstructured":"Zhang, S., Liu, Q., Lin, Y.: Anonymizing popularity in online social networks with full utility. Futur. Gener. Comput. Syst. 72, 227\u2013238 (2017)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"1","key":"43_CR11","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TVT.2012.2217159","volume":"62","author":"T Wang","year":"2012","unstructured":"Wang, T., Jia, W., Xing, G., et al.: Exploiting statistical mobility models for efficient Wi-Fi deployment. IEEE Trans. Veh. Technol. 62(1), 360\u2013373 (2012)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.comcom.2019.06.003","volume":"145","author":"DG Akestoridis","year":"2019","unstructured":"Akestoridis, D.G., Papapetrou, E.: A framework for the evaluation of routing protocols in opportunistic networks. Comput. Commun. 145, 14\u201328 (2019)","journal-title":"Comput. Commun."},{"issue":"4","key":"43_CR13","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1007\/s12652-018-0697-3","volume":"10","author":"DK Sharma","year":"2019","unstructured":"Sharma, D.K., Dhurandher, S.K., Agarwal, D., et al.: kROp: k-Means clustering based routing protocol for opportunistic networks. J. Ambient. Intell. Humaniz. Comput. 10(4), 1289\u20131306 (2019)","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"issue":"1","key":"43_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.3390\/s17010139","volume":"17","author":"T Wang","year":"2017","unstructured":"Wang, T., Wu, Q., Wen, S., et al.: Propagation modeling and defending of a mobile sensor worm in wireless sensor and actuator networks. Sensors 17(1), 139 (2017)","journal-title":"Sensors"},{"issue":"9","key":"43_CR15","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s12243-018-0654-3","volume":"73","author":"RI Ciobanu","year":"2018","unstructured":"Ciobanu, R.I., Reina, D.G., Dobre, C., et al.: Context-adaptive forwarding in mobile opportunistic networks. Ann. Telecommun. 73(9), 559\u2013575 (2018)","journal-title":"Ann. Telecommun."},{"key":"43_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ins.2019.08.064","volume":"508","author":"Y Wu","year":"2020","unstructured":"Wu, Y., Huang, H., Wu, N., et al.: An incentive-based protection and recovery strategy for secure big data in social networks. Inf. Sci. 508, 79\u201391 (2020)","journal-title":"Inf. Sci."},{"issue":"1","key":"43_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13638-018-1277-0","volume":"2018","author":"R Zhao","year":"2018","unstructured":"Zhao, R., Zhang, L., Wang, X., et al.: A novel energy-efficient probabilistic routing method for mobile opportunistic networks. EURASIP J. Wirel. Commun. Netw. 2018(1), 1\u201315 (2018)","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"3","key":"43_CR18","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s12652-017-0462-z","volume":"9","author":"SJ Borah","year":"2018","unstructured":"Borah, S.J., Dhurandher, S.K., Woungang, I., et al.: A multi-objectives based technique for optimized routing in opportunistic networks. J. Ambient. Intell. Humaniz. Comput. 9(3), 655\u2013666 (2018)","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"issue":"8","key":"43_CR19","doi-asserted-by":"publisher","first-page":"74","DOI":"10.3390\/fi10080074","volume":"10","author":"K Liu","year":"2018","unstructured":"Liu, K., Chen, Z., Wu, J., et al.: Predict and forward: an efficient routing-delivery scheme based on node profile in opportunistic networks. Futur. Internet 10(8), 74 (2018)","journal-title":"Futur. Internet"},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"Boldrini, C., Conti, M., Jacopini, J., et al.: Hibop: a history based routing protocol for opportunistic networks. In: 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks. IEEE, pp. 1\u201312 (2007)","DOI":"10.1109\/WOWMOM.2007.4351716"},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"Gupta, A., Bansal, A., Naryani, D., et al.: CRPO: cognitive routing protocol for opportunistic networks. In: Proceedings of the International Conference on High Performance Compilation, Computing and Communications, pp. 121\u2013125 (2017)","DOI":"10.1145\/3069593.3069610"},{"issue":"3","key":"43_CR22","first-page":"4736","volume":"5","author":"D Kiranmayi","year":"2014","unstructured":"Kiranmayi, D.: Evaluation of epidemic routing protocol in delay tolerant networks. Int. J. Comput. Sci. Inf. Technol. 5(3), 4736\u20134740 (2014)","journal-title":"Int. J. Comput. Sci. Inf. Technol."},{"key":"43_CR23","doi-asserted-by":"crossref","unstructured":"Grasic, S., Davies, E., Lindgren, A., et al.: The evolution of a DTN routing protocol-PRoPHETv2[C]. In: Proceedings of the 6th ACM Workshop on Challenged Networks, pp. 27\u201330 (2011)","DOI":"10.1145\/2030652.2030661"},{"key":"43_CR24","doi-asserted-by":"crossref","unstructured":"Magaia, N., Borrego, C., Pereira, P., et al.: PRIVO: a privacy-preserving opportunistic routing protocol for delay tolerant networks. In: 2017 IFIP Networking Conference (IFIP Networking) and Workshops. IEEE, pp. 1\u20139 (2017)","DOI":"10.23919\/IFIPNetworking.2017.8264835"},{"issue":"1","key":"43_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3122984","volume":"18","author":"H Zhang","year":"2017","unstructured":"Zhang, H., Wan, L., Chen, Y., et al.: Adaptive message routing and replication in mobile opportunistic networks for connected communities. ACM Trans. Internet Technol. (TOIT) 18(1), 1\u201322 (2017)","journal-title":"ACM Trans. Internet Technol. (TOIT)"},{"issue":"8","key":"43_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.3390\/a11080125","volume":"11","author":"Y Yan","year":"2018","unstructured":"Yan, Y., Chen, Z., Wu, J., et al.: An effective data transmission algorithm based on social relationships in opportunistic mobile social networks. Algorithms 11(8), 125 (2018)","journal-title":"Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22677-9_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T09:14:31Z","timestamp":1673342071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22677-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031226762","9783031226779"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22677-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"10 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2022","order":10,"name":"conference_id","label":"Conference ID","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","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":"33","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":"10","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":"36% - 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":"3","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":"5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}