{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T04:32:18Z","timestamp":1749184338879,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953836"},{"type":"electronic","value":"9783030953843"}],"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-95384-3_10","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"147-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Spatio-Temporal Topology Routing Algorithm for Opportunistic Network Based on Self-attention Mechanism"],"prefix":"10.1007","author":[{"given":"Xiaorui","family":"Wu","sequence":"first","affiliation":[]},{"given":"Gang","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Xinyu","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Baoqi","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Xiangyu","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"2214","DOI":"10.1109\/COMST.2015.2411335","volume":"17","author":"N Chakchouk","year":"2015","unstructured":"Chakchouk, N.: A survey on opportunistic routing in wireless communication networks. IEEE Commun. Surv. Tutorials 17(4), 2214\u20132241 (2015)","journal-title":"IEEE Commun. Surv. Tutorials"},{"issue":"7","key":"10_CR2","first-page":"1065","volume":"46","author":"M Xiao","year":"2009","unstructured":"Xiao, M., Huang, L.: Delay-tolerant network routing algorithm. J. Comput. Res. Dev. 46(7), 1065 (2009)","journal-title":"J. Comput. Res. Dev."},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.3724\/SP.J.1001.2009.00124","volume":"20","author":"YP Xiong","year":"2009","unstructured":"Xiong, Y.P., Sun, L.M., Niu, J.W., Liu, Y.: Opportunistic networks. J. Softw. 20(1), 124\u2013137 (2009)","journal-title":"J. Softw."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Ehsan, S., et al.: Design and analysis of delay-tolerant sensor networks for monitoring and tracking free-roaming animals. IEEE Trans. Wireless Commun. 11(3), 1220\u20131227 (2012)","DOI":"10.1109\/TWC.2012.012412.111405"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/MWC.2015.7054724","volume":"22","author":"S Bitam","year":"2015","unstructured":"Bitam, S., Mellouk, A., Zeadally, S.: Vanet-cloud: a generic cloud computing model for vehicular ad hoc networks. IEEE Wirel. Commun. 22(1), 96\u2013102 (2015)","journal-title":"IEEE Wirel. Commun."},{"key":"10_CR6","unstructured":"Hao, L.I., Chen, Z., Jia, W.U., Software, S.O., University C.S.: Opportunistic network routing algorithm based on community and sociality. Computer Engineering (2015)"},{"issue":"3","key":"10_CR7","first-page":"600","volume":"26","author":"HD Ma","year":"2015","unstructured":"Ma, H.D., Yuan, P.Y., Zhao, D.: Research progress on routing problem in mobile opportunistic networks. J. Softw. 26(3), 600\u2013616 (2015)","journal-title":"J. Softw."},{"key":"10_CR8","unstructured":"Lin, Y.C., Chen, Z.G., Jia, W.U., S.O. Software, and C. S. University. Routing algorithm for computing similarity between nodes in opportunistic network. Journal of Chinese Computer Systems (2018)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Liu, M.Y., Chen, Z.G., Jia, W.U.: Efficient forwarding strategy for computing the cosine similarity of data packets between nodes in opportunistic network. J. Chinese Comput. Syst. 11(8), 119 (2019)","DOI":"10.3390\/a11080119"},{"key":"10_CR10","unstructured":"Cui, J., Wu, S., Chang, Y., Huang, D.: Probabilistic routing algorithm based on node similarity rate in opportunity network. J. Chin. Comput. Syst. 42(3), 6"},{"key":"10_CR11","unstructured":"Liang, Z., Yang, F., Jianping, L.I.: Community structure detection based on node similarity in complex networks. J. Comput. Appl. 35(5), 1213 (2015)"},{"issue":"7","key":"10_CR12","first-page":"2024","volume":"39","author":"FU Lidong","year":"2019","unstructured":"Lidong, F.U., Hao, W., Dan, L.I., Fan, L.I.: Community dividing algorithm based on similarity of common neighbor nodes. J. Comput. Appl. 39(7), 2024 (2019)","journal-title":"J. Comput. Appl."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Xiaokaiti, A., Qian, Y., Wu, J.: Efficient data transmission for community detection algorithm based on node similarity in opportunistic social networks. Complex. 2021, 9928771:1\u20139928771:18 (2021)","DOI":"10.1155\/2021\/9928771"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Mssn: An attribute-aware transmission algorithm exploiting node similarity for opportunistic social networks. Information (Switzerland) 10(10), 299 (2019)","DOI":"10.3390\/info10100299"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Fcns: A fuzzy routing-forwarding algorithm exploiting comprehensive node similarity in opportunistic social networks. Symmetry, 10(8) (2018)","DOI":"10.3390\/sym10080338"},{"issue":"2","key":"10_CR16","first-page":"18","volume":"43","author":"C Zhou","year":"2019","unstructured":"Zhou, C., Dong, Y., Tian, H.: An opportunistic networks energy-saving routing algorithm based on epidemic and sleeping mechanism. J. Beijing Jiaotong Univ. 43(2), 18 (2019)","journal-title":"J. Beijing Jiaotong Univ."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Chen, J., Xu, G., Wu, X., Wei, F., He, L.: Energy balance and cache optimization routing algorithm based on communication willingness. In: 2021 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1\u20136. IEEE (2021)","DOI":"10.1109\/WCNC49053.2021.9417387"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Sankar, A., Wu, Y., Gou, L., Zhang, W., Yang, H.: Dysat: deep neural representation learning on dynamic graphs via self-attention networks. In: Proceedings of the 13th International Conference on Web Search and Data Mining, pp. 519\u2013527 (2020)","DOI":"10.1145\/3336191.3371845"},{"key":"10_CR19","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, pp. 5998\u20136008 (2017)"},{"issue":"1","key":"10_CR20","first-page":"272","volume":"29","author":"Z Wang","year":"2012","unstructured":"Wang, Z., Wang, X.H., Sui, J.Q.: Extending research for one simulator of opportunistic network. Jisuanji Yingyong Yanjiu 29(1), 272\u2013276 (2012)","journal-title":"Jisuanji Yingyong Yanjiu"}],"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-030-95384-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:22:45Z","timestamp":1645518165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95384-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953836","9783030953843"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95384-3_10","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":"23 February 2022","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"403","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":"145","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":"0","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.12","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":"2.27","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)"}}]}}