{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T13:28:58Z","timestamp":1761658138908,"version":"build-2065373602"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"the Basic Scientific Research Funds of Universities of Heilongjiang Province","award":["2022-KYYWF-1045"],"award-info":[{"award-number":["2022-KYYWF-1045"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Internet Things"],"DOI":"10.1007\/s43926-025-00220-7","type":"journal-article","created":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T13:24:14Z","timestamp":1761657854000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An opportunistic network routing algorithm based on adaptive message replica number adjustment"],"prefix":"10.1007","volume":"5","author":[{"given":"Hezhe","family":"Wang","sequence":"first","affiliation":[]},{"given":"Huiqiang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,28]]},"reference":[{"issue":"10","key":"220_CR1","doi-asserted-by":"publisher","first-page":"3133","DOI":"10.1109\/JSAC.2023.3310071","volume":"41","author":"Z Zheng","year":"2023","unstructured":"Zheng Z, Du B, Zhao C, et al. Path merging based betweenness centrality algorithm in delay tolerant networks. IEEE J Sel Areas Commun. 2023;41(10):3133\u201345.","journal-title":"IEEE J Sel Areas Commun"},{"key":"220_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2023.103289","volume":"151","author":"CJ Lowe","year":"2023","unstructured":"Lowe CJ, Clark RA, McGrath CN, et al. A delay-tolerant network approach to satellite pickup and delivery scheduling. Ad Hoc Netw. 2023;151:103289.","journal-title":"Ad Hoc Netw"},{"issue":"5","key":"220_CR3","doi-asserted-by":"publisher","first-page":"6356","DOI":"10.1007\/s11227-023-05702-5","volume":"80","author":"A Abbas","year":"2024","unstructured":"Abbas A, Hasan R. A multi-attribute-based data forwarding scheme for delay tolerant networks. J Supercomput. 2024;80(5):6356\u201381.","journal-title":"J Supercomput"},{"issue":"6","key":"220_CR4","doi-asserted-by":"publisher","first-page":"3605","DOI":"10.1007\/s12083-021-01209-z","volume":"14","author":"W Chen","year":"2021","unstructured":"Chen W, Su J, Cui C, et al. Topology control routing strategy based on message forwarding in apron opportunistic networks. Peer-to-Peer Netw Appl. 2021;14(6):3605\u201318.","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"8","key":"220_CR5","doi-asserted-by":"publisher","first-page":"5801","DOI":"10.1109\/TWC.2022.3143533","volume":"21","author":"L Cao","year":"2022","unstructured":"Cao L, Viswanathan R. Average operation time of bundle protocol in delay\/disruption-tolerant networks. IEEE Trans Wirel Commun. 2022;21(8):5801\u201313.","journal-title":"IEEE Trans Wirel Commun"},{"issue":"2","key":"220_CR6","doi-asserted-by":"publisher","first-page":"1952","DOI":"10.1109\/TVT.2021.3133449","volume":"71","author":"C Han","year":"2021","unstructured":"Han C, Yao H, Mai T, et al. QMIX aided routing in social-based delay-tolerant networks. IEEE Trans Veh Technol. 2021;71(2):1952\u201363.","journal-title":"IEEE Trans Veh Technol"},{"key":"220_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2022.102902","volume":"133","author":"Y Azzoug","year":"2022","unstructured":"Azzoug Y, Boukra A. Enhanced UAV-aided vehicular delay tolerant network (VDTN) routing for urban environment using a bio-inspired approach. Ad Hoc Netw. 2022;133:102902.","journal-title":"Ad Hoc Netw"},{"key":"220_CR8","unstructured":"Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks. 2000."},{"key":"220_CR9","doi-asserted-by":"crossref","unstructured":"Spyropoulos T, Psounis K, Raghavendra CS. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. 2005: 252\u2013259.","DOI":"10.1145\/1080139.1080143"},{"key":"220_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2021.102663","volume":"123","author":"FD Raverta","year":"2021","unstructured":"Raverta FD, Fraire JA, Madoery PG, et al. Routing in delay-tolerant networks under uncertain contact plans. Ad Hoc Netw. 2021;123:102663.","journal-title":"Ad Hoc Netw"},{"key":"220_CR11","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.comcom.2021.06.006","volume":"177","author":"V Chourasia","year":"2021","unstructured":"Chourasia V, Pandey S, Kumar S. Optimizing the performance of vehicular delay tolerant networks using multi-objective PSO and artificial intelligence. Comput Commun. 2021;177:10\u201323.","journal-title":"Comput Commun"},{"key":"220_CR12","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s11276-020-02458-1","volume":"27","author":"AK Singh","year":"2021","unstructured":"Singh AK, Pamula R. An efficient and intelligent routing strategy for vehicular delay tolerant networks: an efficient routing strategy for VDTN. Wirel Netw. 2021;27:383\u2013400.","journal-title":"Wirel Netw"},{"key":"220_CR13","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1007\/s12083-020-00873-x","volume":"13","author":"A Karami","year":"2020","unstructured":"Karami A, Derakhshanfard N. RPRTD: Routing protocol based on remaining time to encounter nodes with destination node in delay tolerant network using artificial neural network. Peer-to-Peer Netw Appl. 2020;13:1406\u201322.","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"4","key":"220_CR14","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1109\/TMC.2017.2743703","volume":"17","author":"W Li","year":"2017","unstructured":"Li W, Galluccio L, Bassi F, et al. Distributed faulty node detection in delay tolerant networks: design and analysis. IEEE Trans Mob Comput. 2017;17(4):831\u201344.","journal-title":"IEEE Trans Mob Comput"},{"issue":"7","key":"220_CR15","doi-asserted-by":"publisher","first-page":"4134","DOI":"10.1109\/TMC.2022.3144683","volume":"22","author":"L Rashidi","year":"2022","unstructured":"Rashidi L, Towsley D, Mohseni-Kabir A, et al. On the performance analysis of epidemic routing in non-sparse delay tolerant networks. IEEE Trans Mob Comput. 2022;22(7):4134\u201349.","journal-title":"IEEE Trans Mob Comput"},{"key":"220_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.iot.2024.101425","volume":"29","author":"G Wei","year":"2025","unstructured":"Wei G, et al. Social relationships and location information based routing algorithm in opportunistic networks. Inter Things. 2025;29:101425.","journal-title":"Inter Things"},{"key":"220_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2024.103455","volume":"157","author":"Y Fu","year":"2024","unstructured":"Fu Y, et al. An energy recovery routing algorithm for opportunistic networks based on connection stability and node encounter type. Ad Hoc Netw. 2024;157:103455.","journal-title":"Ad Hoc Netw"},{"issue":"Mar.","key":"220_CR18","volume":"154","author":"J Chen","year":"2024","unstructured":"Chen J, Yang X, Huang XB. CR-5: Resource optimization opportunistic network routing algorithm based on node dynamic attributes. Ad Hoc Netw. 2024;154(Mar.):103356.1-103356.9.","journal-title":"Ad Hoc Netw"},{"issue":"3","key":"220_CR19","doi-asserted-by":"publisher","first-page":"2909","DOI":"10.1007\/s11276-025-03911-9","volume":"31","author":"P Rezaei","year":"2025","unstructured":"Rezaei P, Derakhshanfard N. Reinforcement learning based routing in delay tolerant networks. Wirel Netw. 2025;31(3):2909\u201323.","journal-title":"Wirel Netw"},{"key":"220_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2025.103755","author":"T Zhang","year":"2025","unstructured":"Zhang T, Zhang R, Yang Z, et al. Temsroute: a temporally and socially aware routing framework for delay-tolerant networks. Ad Hoc Netw. 2025. https:\/\/doi.org\/10.1016\/j.adhoc.2025.103755.","journal-title":"Ad Hoc Netw"},{"key":"220_CR21","doi-asserted-by":"publisher","first-page":"103381","DOI":"10.1016\/j.adhoc.2023.103381","volume":"155","author":"L Cong","year":"2024","unstructured":"Cong L, Ding H, Xie N, et al. Space delay-tolerant network routing algorithm based on node clustering and social attributes. Ad Hoc Netw. 2024;155:103381.","journal-title":"Ad Hoc Netw"},{"issue":"11","key":"220_CR22","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1049\/cmu2.12626","volume":"17","author":"J Wu","year":"2023","unstructured":"Wu J, Jin H, Cai S, et al. A delay tolerant network routing algorithm based on multi-step double Q-learning. IET Communicat. 2023;17(11):1321\u201333.","journal-title":"IET Communicat"},{"issue":"2","key":"220_CR23","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/s12083-023-01470-4","volume":"16","author":"Q Ayub","year":"2023","unstructured":"Ayub Q, Rashid S. Community trend message locking routing protocol for delay tolerant network. Peer-to-Peer Netw Appl. 2023;16(2):1155\u201373.","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"4","key":"220_CR24","doi-asserted-by":"publisher","first-page":"1873","DOI":"10.1007\/s11276-023-03239-2","volume":"29","author":"J Wu","year":"2023","unstructured":"Wu J, Cai S, Jin H, et al. Vehicular delay tolerant network routing algorithm based on trajectory clustering and dynamic Bayesian network. Wireless Netw. 2023;29(4):1873\u201389.","journal-title":"Wireless Netw"},{"issue":"3","key":"220_CR25","doi-asserted-by":"publisher","first-page":"3054","DOI":"10.1109\/TITS.2023.3292592","volume":"25","author":"H Lin","year":"2023","unstructured":"Lin H, Qian J, Di B. Learning for adaptive multi-copy relaying in vehicular delay tolerant network. IEEE Trans Intell Transp Syst. 2023;25(3):3054\u201363.","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"220_CR26","doi-asserted-by":"publisher","first-page":"104","DOI":"10.23919\/JCC.fa.2022-0663.202503","volume":"22","author":"IA Shah","year":"2025","unstructured":"Shah IA, Mushtaq A, Singh R. Pentago SnW: an improved spray and wait protocol for delay tolerant wireless sensor networks. China Commun. 2025;22(3):104\u201314.","journal-title":"China Commun"},{"issue":"12","key":"220_CR27","doi-asserted-by":"publisher","first-page":"107901","DOI":"10.1016\/j.comnet.2021.107901","volume":"189","author":"L Wu","year":"2021","unstructured":"Wu L, Cao S, Chen Y, et al. An adaptive multiple spray-and-wait routing algorithm based on social circles in delay tolerant networks. Comput Network. 2021;189(12):107901.","journal-title":"Comput Network"},{"key":"220_CR28","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nen A, Ott J, and K\u00e4rkk\u00e4inen T. The ONE simulator for DTN protocol evaluation. Proceedings of the 2nd international conference on simulation tools and techniques. 2009.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"}],"container-title":["Discover Internet of Things"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43926-025-00220-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43926-025-00220-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43926-025-00220-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T13:24:28Z","timestamp":1761657868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43926-025-00220-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,28]]},"references-count":28,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["220"],"URL":"https:\/\/doi.org\/10.1007\/s43926-025-00220-7","relation":{},"ISSN":["2730-7239"],"issn-type":[{"value":"2730-7239","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,28]]},"assertion":[{"value":"30 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"115"}}