{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T04:08:16Z","timestamp":1770523696365,"version":"3.49.0"},"reference-count":32,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T00:00:00Z","timestamp":1731283200000},"content-version":"vor","delay-in-days":315,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372206"],"award-info":[{"award-number":["62372206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672257"],"award-info":[{"award-number":["61672257"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272189"],"award-info":[{"award-number":["62272189"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p>In opportunistic network, the regular connectivity of nodes and their individual conditions significantly influence message transmission. To address this, we propose an improved spray and wait routing algorithm based on stable transmission capacity evaluation of nodes (referred to as STCESW), which is derived from traditional Prophet and spray and wait algorithms but surpasses them. STCESW incorporates network models that consider node connection stability and transmission capacity, aiming to enhance the update and punishment formulas for node delivery probability. Furthermore, it combines the residual message buffer size of nodes with the angle between motion directions of nodes to determine more efficient and extensive message spraying in the network. The simulation results clearly indicate that STCESW significantly outperforms the other three enhanced algorithms in both SPMBM and RWP. It demonstrates its robust performance in terms of delivery probability, showing an increase ranging from 2% to 87% across diverse node buffer sizes or simulation time intervals. Additionally, it compromises slightly on delivery latency while maintaining relatively stable message latency and buffer time.<\/jats:p>","DOI":"10.1155\/2024\/7471329","type":"journal-article","created":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T10:18:36Z","timestamp":1731320316000},"source":"Crossref","is-referenced-by-count":1,"title":["An Improved Spray and Wait Routing Algorithm Based on Stable Transmission Capacity Evaluation of Nodes in Opportunistic Network"],"prefix":"10.1155","volume":"2024","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3528-9920","authenticated-orcid":false,"given":"Feng","family":"Huang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1447-8761","authenticated-orcid":false,"given":"Jianqun","family":"Cui","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7101-5750","authenticated-orcid":false,"given":"Yanan","family":"Chang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2587-2572","authenticated-orcid":false,"given":"Tong","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6043-5191","authenticated-orcid":false,"given":"Min","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3021-0522","authenticated-orcid":false,"given":"Yi","family":"Yang","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2024,11,11]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/MVT.2011.941892"},{"key":"e_1_2_11_2_2","doi-asserted-by":"crossref","unstructured":"JainS. FallK. andPatraR. Routing in a delay tolerant network Proceedings of the ACM SIGCOMM 2004 Conference on Applications Technologies Architectures and Protocols for Computer Communication 2004 Portland Oregon USA 145\u2013158 https:\/\/doi.org\/10.1145\/1015467.1015484.","DOI":"10.1145\/1015467.1015484"},{"key":"e_1_2_11_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2159844"},{"key":"e_1_2_11_4_2","doi-asserted-by":"crossref","unstructured":"AyeleE. D. MeratniaN. andHavingaP. J. M. Towards a new opportunistic IoT network architecture for wildlife monitoring system 2018 9th IFIP International Conference on New Technologies Mobility and Security (NTMS) 2018 Paris France 1\u20135 https:\/\/doi.org\/10.1109\/NTMS.2018.8328721 2-s2.0-85050924344.","DOI":"10.1109\/NTMS.2018.8328721"},{"key":"e_1_2_11_5_2","doi-asserted-by":"crossref","unstructured":"QinX. HuangG. ZhangB. andLiC. Sparse relays assisted opportunistic routing for data offloading in vehicular networks ICC 2021 - IEEE International Conference on Communications 2021 Montreal QC Canada 1\u20136 https:\/\/doi.org\/10.1109\/ICC42927.2021.9500617.","DOI":"10.1109\/ICC42927.2021.9500617"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.3390\/info9110263"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-023-01248-9"},{"key":"e_1_2_11_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-10549-5_43"},{"key":"e_1_2_11_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2100280"},{"key":"e_1_2_11_10_2","doi-asserted-by":"publisher","DOI":"10.32604\/csse.2023.024836"},{"key":"e_1_2_11_11_2","doi-asserted-by":"crossref","unstructured":"TarifM. EffatparvarM. andMoghadamB. N. Enhancing energy efficiency of underwater sensor network routing aiming to achieve reliability 2024 Third International Conference on Distributed Computing and High Performance Computing (DCHPC) 2024 Tehran Iran Islamic Republic 1\u20137 https:\/\/doi.org\/10.1109\/DCHPC60845.2024.10454083.","DOI":"10.1109\/DCHPC60845.2024.10454083"},{"key":"e_1_2_11_12_2","unstructured":"VahdatA.andBeckerD. Epidemic routing for partially-connected ad hoc networks 2000 Technical Report CS-200006 Duke University Durham."},{"key":"e_1_2_11_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"e_1_2_11_14_2","doi-asserted-by":"crossref","unstructured":"SpyropoulosT. PsounisK. andRaghavendraC. S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking 2005 Philadelphia Pennsylvania USA 252\u2013259 https:\/\/doi.org\/10.1145\/1080139.1080143 2-s2.0-84885775524.","DOI":"10.1145\/1080139.1080143"},{"key":"e_1_2_11_15_2","doi-asserted-by":"crossref","unstructured":"WangG. ShaoM. LiR. MaY. andWangB. Spray and wait routing algorithm based on transfer utility of node in DTN 2015 IEEE International Conference on Progress in Informatics and Computing (PIC) 2015 Nanjing 428\u2013432 https:\/\/doi.org\/10.1109\/PIC.2015.7489883 2-s2.0-84979690311.","DOI":"10.1109\/PIC.2015.7489883"},{"key":"e_1_2_11_16_2","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3030"},{"key":"e_1_2_11_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-022-09820-w"},{"key":"e_1_2_11_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2020.107536"},{"key":"e_1_2_11_19_2","doi-asserted-by":"publisher","DOI":"10.23919\/JCC.2022.00.021"},{"key":"e_1_2_11_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.107901"},{"key":"e_1_2_11_21_2","doi-asserted-by":"publisher","DOI":"10.1080\/02564602.2022.2049903"},{"key":"e_1_2_11_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/dac.5133"},{"key":"e_1_2_11_23_2","doi-asserted-by":"crossref","unstructured":"AkhterT.andHossenM. S. An association rule based PRoPHET (ARBP) routing protocol in an opportunistic network 2022 International Conference on Recent Progresses in Science Engineering and Technology (ICRPSET) 2022 Rajshahi Bangladesh 1\u20134 https:\/\/doi.org\/10.1109\/ICRPSET57982.2022.10188567.","DOI":"10.1109\/ICRPSET57982.2022.10188567"},{"key":"e_1_2_11_24_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:WINE.0000036458.88990.e5"},{"key":"e_1_2_11_25_2","doi-asserted-by":"crossref","unstructured":"RoyerE. M. Melliar-SmithP. M. andMoserL. E. An analysis of the optimum node density for ad hoc mobile networks ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240) 2001 Helsinki Finland 857\u2013861 https:\/\/doi.org\/10.1109\/ICC.2001.937360.","DOI":"10.1109\/ICC.2001.937360"},{"key":"e_1_2_11_26_2","doi-asserted-by":"crossref","unstructured":"SpyropoulosT. PsounisK. andRaghavendraC. S. Performance analysis of mobility-assisted routing Proceedings of the 7th ACM International Symposium on Mobile ad Hoc Networking and Computing 2006 Florence Italy 49\u201360 https:\/\/doi.org\/10.1145\/1132905.1132912.","DOI":"10.1145\/1132905.1132912"},{"key":"e_1_2_11_27_2","first-page":"609","article-title":"Probabilistic routing algorithm based on node similarity rate in opportunity network","volume":"42","author":"Cui J.","year":"2021","journal-title":"Journal of Chinese Computer Systems"},{"key":"e_1_2_11_28_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJICT.2020.110786"},{"key":"e_1_2_11_29_2","first-page":"1257","article-title":"Probabilistic routing algorithm based on connection separation time in delay tolerant network","volume":"44","author":"Cui J.","year":"2023","journal-title":"Journal of Chinese Computer Systems"},{"key":"e_1_2_11_30_2","doi-asserted-by":"crossref","unstructured":"KernenA. OttJ. andKrkkinenT. The ONE simulator for DTN protocol evaluation Proceedings of the 2nd International Conference on Simulation Tools and Techniques 2009 Rome Italy https:\/\/doi.org\/10.4108\/icst.simutools2009.5674 2-s2.0-84922954336.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.15918\/j.tbit1001-0645.2019.01.012"},{"key":"e_1_2_11_32_2","doi-asserted-by":"publisher","DOI":"10.3390\/electronics13050868"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2024\/7471329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T10:18:43Z","timestamp":1731320323000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2024\/7471329"}},"subtitle":[],"editor":[{"given":"Jos\u00e9","family":"Molina","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["10.1155\/2024\/7471329"],"URL":"https:\/\/doi.org\/10.1155\/2024\/7471329","archive":["Portico"],"relation":{},"ISSN":["1550-1329","1550-1477"],"issn-type":[{"value":"1550-1329","type":"print"},{"value":"1550-1477","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]},"article-number":"7471329"}}