{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T02:50:03Z","timestamp":1773197403060,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"31","license":[{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"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":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-025-20672-x","type":"journal-article","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T05:52:39Z","timestamp":1739857959000},"page":"37885-37910","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["MOHSQO: Multi objective harmony search algorithm based QoS optimization in delay tolerant networks"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5539-7477","authenticated-orcid":false,"given":"Nidhi","family":"Sonkar","sequence":"first","affiliation":[]},{"given":"Sudhakar","family":"Pandey","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,18]]},"reference":[{"key":"20672_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.comnet.2017.11.010","volume":"130","author":"A Roy","year":"2018","unstructured":"Roy A, Acharya T, DasBit S (2018) Quality of service in delay tolerant networks: A survey. Comput Networks 130:121\u2013133","journal-title":"Comput Networks"},{"key":"20672_CR2","unstructured":"Ma M, Lu C, Li H (2016) Delay tolerant networking, in Delay Tolerant Networks: Protocols and Applications"},{"key":"20672_CR3","doi-asserted-by":"publisher","unstructured":"Umaparvathi M, Bhalaji N, Jothi Prasanna S, Parthiban N (2016) Analysis of Creido Enhanced Chord Overlay Protocol Under Different Movement Models in Delay Tolerant Networks. Wirel Pers Commun. https:\/\/doi.org\/10.1007\/s11277-016-3277-x","DOI":"10.1007\/s11277-016-3277-x"},{"key":"20672_CR4","doi-asserted-by":"crossref","unstructured":"Vasilakos AV, Zhang Y, Spyropoulos T (2016) Delay tolerant networks: Protocols and applications. CRC press","DOI":"10.1201\/b11309"},{"key":"20672_CR5","doi-asserted-by":"publisher","unstructured":"Sun W, Liu C, Wang D (2012) On Delay-Tolerant Networking and Its Application. Delay-Tolerant Netw Its Appl Wei 51(Iccsit 2011): pp 238\u2013244. https:\/\/doi.org\/10.7763\/IPCSIT.2012.V51.42","DOI":"10.7763\/IPCSIT.2012.V51.42"},{"key":"20672_CR6","unstructured":"Rodrigues JJPC (2020) Advances in delay-tolerant networks (DTNs): Architecture and enhanced performance. Woodhead Publishing"},{"issue":"1","key":"20672_CR7","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/SURV.2012.032612.00004","volume":"15","author":"Y Zhu","year":"2013","unstructured":"Zhu Y, Xu B, Shi X, Wang Y (2013) A survey of social-based routing in delay tolerant networks: Positive and negative social effects. IEEE Commun Surv Tutorials 15(1):387\u2013401. https:\/\/doi.org\/10.1109\/SURV.2012.032612.00004","journal-title":"IEEE Commun Surv Tutorials"},{"issue":"5","key":"20672_CR8","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1007\/s11036-017-0817-x","volume":"23","author":"M Harounabadi","year":"2018","unstructured":"Harounabadi M, Mitschele-Thiel A (2018) Stigmergic Communication for Self-Organized Multi Ferry Delay Tolerant Networks. Mob Networks Appl 23(5):1260\u20131269. https:\/\/doi.org\/10.1007\/s11036-017-0817-x","journal-title":"Mob Networks Appl"},{"key":"20672_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00185-7_1","volume":"191","author":"XS Yang","year":"2009","unstructured":"Yang XS (2009) Harmony search as a metaheuristic algorithm. Stud Comput Intell 191:1\u201314. https:\/\/doi.org\/10.1007\/978-3-642-00185-7_1","journal-title":"Stud Comput Intell"},{"key":"20672_CR10","doi-asserted-by":"publisher","unstructured":"Geem ZW (2009) Music-inspired harmony search algorithm: theory and applications, vol. 191. Springer. https:\/\/doi.org\/10.1007\/978-3-642-00185-7","DOI":"10.1007\/978-3-642-00185-7"},{"issue":"8","key":"20672_CR11","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1016\/j.engappai.2013.05.008","volume":"26","author":"D Manjarres","year":"2013","unstructured":"Manjarres D et al (2013) A survey on applications of the harmony search algorithm. Eng Appl Artif Intell 26(8):1818\u20131831. https:\/\/doi.org\/10.1016\/j.engappai.2013.05.008","journal-title":"Eng Appl Artif Intell"},{"key":"20672_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.entcs.2011.11.025","volume":"281","author":"J Ricart","year":"2011","unstructured":"Ricart J, H\u00fcttemann G, Lima J, Bar\u00e1n B (2011) Multiobjective harmony search algorithm proposals. Electron Notes Theor Comput Sci 281:51\u201367","journal-title":"Electron Notes Theor Comput Sci"},{"issue":"2","key":"20672_CR13","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s00521-016-2662-4","volume":"30","author":"P Lalwani","year":"2018","unstructured":"Lalwani P, Das S, Banka H, Kumar C (2018) CRHS: clustering and routing in wireless sensor networks using harmony search algorithm. Neural Comput Appl 30(2):639\u2013659. https:\/\/doi.org\/10.1007\/s00521-016-2662-4","journal-title":"Neural Comput Appl"},{"key":"20672_CR14","doi-asserted-by":"publisher","unstructured":"Chandren Muniyandi R, Hasan MK, Hammoodi MR, Maroosi A (2021) An Improved Harmony Search Algorithm for Proactive Routing Protocol in VANET. J Adv Transp 2021. https:\/\/doi.org\/10.1155\/2021\/6641857","DOI":"10.1155\/2021\/6641857"},{"key":"20672_CR15","unstructured":"Johnson DB, Maltz DA (2007) Dynamic Source Routing in Ad Hoc Wireless Networks. In: Mobile Computing"},{"key":"20672_CR16","doi-asserted-by":"publisher","DOI":"10.1145\/190809.190336","author":"CE Perkins","year":"1994","unstructured":"Perkins CE, Bhagwat P (1994) Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for 9mobile computers. ACM SIGCOMM Comput Commun Rev. https:\/\/doi.org\/10.1145\/190809.190336","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"20672_CR17","doi-asserted-by":"publisher","unstructured":"Perkins CE, Royer EM (1999) Ad-hoc on-demand distance vector routing. https:\/\/doi.org\/10.1109\/MCSA.1999.749281","DOI":"10.1109\/MCSA.1999.749281"},{"key":"20672_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.09.023","author":"VV Mandhare","year":"2016","unstructured":"Mandhare VV, Thool VR, Manthalkar RR (2016) QoS Routing enhancement using metaheuristic approach in mobile ad-hoc network. Comput Networks. https:\/\/doi.org\/10.1016\/j.comnet.2016.09.023","journal-title":"Comput Networks"},{"key":"20672_CR19","unstructured":"Vasilakos A, Ricudis C, Anagnostakis K, Pedrycz W, Pitsillides A, Gao XZ (2001) Evolutionary-fuzzy prediction for strategic ID-QoS: Routing in broadband networks. Int J Parallel Distrib Syst Netw"},{"key":"20672_CR20","doi-asserted-by":"publisher","unstructured":"Vasilakos A, Saltouros MP, Atlassis AF, Pedrycz W (2003) Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques. IEEE Trans Syst. Man Cybern Part C Appl Rev. https:\/\/doi.org\/10.1109\/TSMCC.2003.817354","DOI":"10.1109\/TSMCC.2003.817354"},{"key":"20672_CR21","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.082713.00184","author":"M Youssef","year":"2014","unstructured":"Youssef M, Ibrahim M, Abdelatif M, Chen L, Vasilakos AV (2014) Routing metrics of cognitive radio networks: A survey. IEEE Commun Surv Tutorials. https:\/\/doi.org\/10.1109\/SURV.2013.082713.00184","journal-title":"IEEE Commun Surv Tutorials"},{"key":"20672_CR22","unstructured":"Vahdat A, Becker D (2000) Epidemic Routing for Partially-Connected Ad Hoc Networks. Technical Report CS-200006. Department of Computer Science, Duke University. Recuperado de: http:\/\/issg.cs.duke.edu\/epidemic\/epidemic.pdf"},{"key":"20672_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2011.05.005","author":"AT Prodhan","year":"2011","unstructured":"Prodhan AT, Das R, Kabir H, Shoja GC (2011) TTL based routing in opportunistic networks. J Netw Comput Appl. https:\/\/doi.org\/10.1016\/j.jnca.2011.05.005","journal-title":"J Netw Comput Appl"},{"key":"20672_CR24","doi-asserted-by":"publisher","unstructured":"Burgess J, Gallagher B, Jensen D, Levine BN (2006) MaxProp: Routing for vehicle-based disruption-tolerant networks. https:\/\/doi.org\/10.1109\/INFOCOM.2006.228.","DOI":"10.1109\/INFOCOM.2006.228"},{"key":"20672_CR25","doi-asserted-by":"publisher","unstructured":"Pathak S, Gondaliya N, Raja N (2017) A survey on PROPHET based routing protocol in delay tolerant network. 2017 Int Conf Emerg Trends Innov ICT ICEI, pp 110\u2013115, 2017. https:\/\/doi.org\/10.1109\/ETIICT.2017.7977020","DOI":"10.1109\/ETIICT.2017.7977020"},{"key":"20672_CR26","doi-asserted-by":"publisher","unstructured":"Spyropoulos T, Psounis K, Raghavendra CS (2005) Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. ACM SIGCOMM Work. Delay-Tolerant Netw, pp 252\u2013259. https:\/\/doi.org\/10.1145\/1080139.1080143","DOI":"10.1145\/1080139.1080143"},{"key":"20672_CR27","doi-asserted-by":"publisher","unstructured":"Spyropoulos T, Psounis K, Raghavendra CS (2007) Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. https:\/\/doi.org\/10.1109\/PERCOMW.2007.108","DOI":"10.1109\/PERCOMW.2007.108"},{"key":"20672_CR28","doi-asserted-by":"publisher","DOI":"10.4304\/jcm.5.2.117-129","author":"G Sandulescu","year":"2010","unstructured":"Sandulescu G, Nadjm-Tehrani S (2010) Adding redundancy to replication in window-aware delay-tolerant routing. J Commun. https:\/\/doi.org\/10.4304\/jcm.5.2.117-129","journal-title":"J Commun"},{"issue":"2","key":"20672_CR29","doi-asserted-by":"publisher","first-page":"92","DOI":"10.4304\/jcm.5.2.92-105","volume":"5","author":"A Ker\u00e4nen","year":"2010","unstructured":"Ker\u00e4nen A, K\u00e4rkk\u00e4inen T, Ott J (2010) Simulating mobility and DTNs with the ONE. J Commun 5(2):92\u2013105. https:\/\/doi.org\/10.4304\/jcm.5.2.92-105","journal-title":"J Commun"},{"key":"20672_CR30","doi-asserted-by":"publisher","unstructured":"Lorandi M, Custode LL, Iacca G ()Genetic Improvement of Routing Protocols for Delay Tolerant Networks 1(1):1\u201337, 2021. https:\/\/doi.org\/10.1145\/3453683","DOI":"10.1145\/3453683"},{"issue":"3","key":"20672_CR31","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.jestch.2019.01.016","volume":"22","author":"H Bello-Salau","year":"2019","unstructured":"Bello-Salau H, Aibinu AM, Wang Z, Onumanyi AJ, Onwuka EN, Dukiya JJ (2019) An optimized routing algorithm for vehicle ad-hoc networks. Eng Sci Technol an Int J 22(3):754\u2013766","journal-title":"Eng Sci Technol an Int J"},{"key":"20672_CR32","doi-asserted-by":"publisher","unstructured":"Bitaghsir SA, Hendessi F (2011) An intelligent routing protocol for delay tolerant networks using genetic algorithm. https:\/\/doi.org\/10.1007\/978-3-642-22875-9_31.","DOI":"10.1007\/978-3-642-22875-9_31"},{"issue":"1","key":"20672_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1687-1499-2014-147","volume":"2014","author":"A Omidvar","year":"2014","unstructured":"Omidvar A, Mohammadi K (2014) Particle swarm optimization in intelligent routing of delay-tolerant network routing. EURASIP J Wirel Commun Netw 2014(1):1\u20138","journal-title":"EURASIP J Wirel Commun Netw"},{"issue":"3","key":"20672_CR34","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1007\/s11277-018-6065-y","volume":"104","author":"A Abbasi","year":"2019","unstructured":"Abbasi A, Derakhshanfard N (2019) Determination of Relay Node Based on Fuzzy Logic in Delay Tolerant Network. Wirel Pers Commun 104(3):1023\u20131036. https:\/\/doi.org\/10.1007\/s11277-018-6065-y","journal-title":"Wirel Pers Commun"},{"issue":"April","key":"20672_CR35","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 (2021) Optimizing the performance of vehicular delay tolerant networks using multi-objective PSO and artificial intelligence. Comput Commun 177(April):10\u201323. https:\/\/doi.org\/10.1016\/j.comcom.2021.06.006","journal-title":"Comput Commun"},{"issue":"9\u201310","key":"20672_CR36","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1080\/17517575.2019.1633691","volume":"14","author":"S Singh","year":"2020","unstructured":"Singh S, Kumar P (2020) MH-CACA: multi-objective harmony search-based coverage aware clustering algorithm in WSNs. Enterp Inf Syst 14(9\u201310):1325\u20131353","journal-title":"Enterp Inf Syst"},{"key":"20672_CR37","doi-asserted-by":"crossref","unstructured":"Sharma D, Gupta V (2017) Improving coverage and connectivity using harmony search algorithm in wireless sensor network, in: 2017 International Conference on Emerging Trends in Computing and Communication Technologies (ICETCCT), pp 1\u20137","DOI":"10.1109\/ICETCCT.2017.8280297"},{"key":"20672_CR38","doi-asserted-by":"crossref","unstructured":"Elewaily DI, Ali HA, Saleh AI, Abdelsalam MM (2024) Ad Hoc Networks Delay \/ Disruption-Tolerant Networking-based the Integrated Deep-Space Relay Network\u202f: State-of-the-Art. Ad Hoc Networks 152(August) 2023","DOI":"10.1016\/j.adhoc.2023.103307"},{"key":"20672_CR39","doi-asserted-by":"publisher","DOI":"10.1145\/3665927","author":"PR D\u2019Argenio","year":"2024","unstructured":"D\u2019Argenio PR, Fraire J, Hartmanns A, Raverta F (2024) Comparing Statistical, Analytical, and Learning-Bas9ed Routing Approaches for Delay-Tolerant Networks. ACM Trans Model Comput Simul. https:\/\/doi.org\/10.1145\/3665927","journal-title":"ACM Trans Model Comput Simul"},{"issue":"1","key":"20672_CR40","doi-asserted-by":"publisher","first-page":"65","DOI":"10.12928\/telkomnika.v22i1.24801","volume":"22","author":"NI Er","year":"2023","unstructured":"Er NI, Singh KD, Couturier C, Bonnin J-M (2023) \u201cTowards a simple and efficient vehicular delay tolerant networks routing protocol for data collection in smart cities\u201d, TELKOMNIKA (Telecommunication Comput. Electron Control 22(1):65. https:\/\/doi.org\/10.12928\/telkomnika.v22i1.24801","journal-title":"Electron Control"},{"issue":"2","key":"20672_CR41","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368","journal-title":"Simulation"},{"key":"20672_CR42","doi-asserted-by":"crossref","unstructured":"Misra S, Kumar B, Sujata S, Saha BK, Pal S (2016) Opportunistic Mobile Networks","DOI":"10.1007\/978-3-319-29031-7"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-025-20672-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-025-20672-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-025-20672-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T09:43:07Z","timestamp":1758102187000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-025-20672-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,18]]},"references-count":42,"journal-issue":{"issue":"31","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["20672"],"URL":"https:\/\/doi.org\/10.1007\/s11042-025-20672-x","relation":{},"ISSN":["1573-7721"],"issn-type":[{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,18]]},"assertion":[{"value":"20 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}