{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:29:04Z","timestamp":1776439744379,"version":"3.51.2"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T00:00:00Z","timestamp":1701216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T00:00:00Z","timestamp":1701216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Seed Grant to Faculty Members under IoE Scheme","award":["under Dev. Scheme No. 6031"],"award-info":[{"award-number":["under Dev. Scheme No. 6031"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-023-02354-3","type":"journal-article","created":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T11:02:21Z","timestamp":1701255741000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Encounter Count and Interaction Time-Based Routing Protocol for Opportunistic Networks"],"prefix":"10.1007","volume":"5","author":[{"given":"Mohini","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anshul","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pradeepika","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,29]]},"reference":[{"issue":"11","key":"2354_CR1","doi-asserted-by":"publisher","first-page":"4860","DOI":"10.1002\/dac.4860","volume":"34","author":"R Sachdeva","year":"2021","unstructured":"Sachdeva R, Dev A. Review of opportunistic network: assessing past, present, and future. Int J Commun Syst. 2021;34(11):4860.","journal-title":"Int J Commun Syst"},{"key":"2354_CR2","doi-asserted-by":"publisher","first-page":"5855","DOI":"10.1109\/ACCESS.2021.3136927","volume":"10","author":"R Dalal","year":"2021","unstructured":"Dalal R, Khari M, Anzola JP, Garc\u00eda-D\u00edaz V. Proliferation of opportunistic routing: a systematic review. IEEE Access. 2021;10:5855\u201383.","journal-title":"IEEE Access."},{"key":"2354_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1201\/9781003132585-14","volume-title":"Opportunistic networks","author":"M Singh","year":"2021","unstructured":"Singh M, Verma P, Verma A. Security in opportunistic networks. In: Opportunistic networks. CRC Press; 2021. p. 299\u2013312."},{"issue":"3","key":"2354_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/02564602.2015.1094383","volume":"33","author":"M Alajeely","year":"2016","unstructured":"Alajeely M, Doss R, Ahmad A. Security and trust in opportunistic networks\u2014a survey. IETE Tech Rev. 2016;33(3):256\u201368.","journal-title":"IETE Tech Rev"},{"key":"2354_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2021.102208","volume":"104","author":"S Rashidibajgan","year":"2021","unstructured":"Rashidibajgan S, Hupperich T, Doss R, F\u00f6rster A. Secure and privacy-preserving structure in opportunistic networks. Comput Secur. 2021;104: 102208.","journal-title":"Comput Secur"},{"key":"2354_CR6","doi-asserted-by":"publisher","DOI":"10.1201\/9781003304203","volume-title":"Emerging real-world applications of internet of things","author":"A Verma","year":"2022","unstructured":"Verma A, Verma P, Farhaoui Y, Lv Z. Emerging real-world applications of internet of things. CRC Press; 2022. https:\/\/doi.org\/10.1201\/9781003304203."},{"key":"2354_CR7","doi-asserted-by":"publisher","DOI":"10.1201\/9781003304203","volume-title":"Futuristic research trends and applications of internet of things","author":"B Rudra","year":"2022","unstructured":"Rudra B, Verma A, Verma S, Shrestha B. Futuristic research trends and applications of internet of things. CRC Press; 2022. https:\/\/doi.org\/10.1201\/9781003304203."},{"key":"2354_CR8","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1201\/9780429453434-12","volume-title":"Oppor Netw","author":"A Verma","year":"2018","unstructured":"Verma A, Singh M, Pattanaik K, Singh B. Future networks inspired by opportunistic networks. In: Oppor Netw. London: Chapman and Hall\/CRC; 2018. p. 230\u201346."},{"key":"2354_CR9","doi-asserted-by":"publisher","unstructured":"Verma A, Pattanaik KK, Ingavale A. In: Woungang I, Dhurandher SK, Anpalagan A, Vasilakos AV (eds) Context-based routing protocols for OppNets. New York: Springer New York; 2013. pp. 69\u201397. https:\/\/doi.org\/10.1007\/978-1-4614-3514-3_3.","DOI":"10.1007\/978-1-4614-3514-3_3"},{"key":"2354_CR10","unstructured":"Vahdat A, Becker D, et al. Epidemic routing for partially connected ad hoc networks 2000."},{"key":"2354_CR11","doi-asserted-by":"crossref","unstructured":"Spyropoulos T, Psounis K, Raghavendra CS. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, 2005:pp. 252\u2013259.","DOI":"10.1145\/1080139.1080143"},{"key":"2354_CR12","doi-asserted-by":"crossref","unstructured":"Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks. In: Service Assurance with Partial and Intermittent Resources: First International Workshop, SAPIR 2004, Fortaleza, Brazil, August 19\u20136, 2004. Proceedings, Springer, 2004:pp. 239\u2013254.","DOI":"10.1007\/978-3-540-27767-5_24"},{"key":"2354_CR13","doi-asserted-by":"publisher","DOI":"10.3390\/asi5010019","author":"S Ajjaj","year":"2022","unstructured":"Ajjaj S, El Houssaini S, Hain M, El Houssaini M-A. Performance assessment and modeling of routing protocol in vehicular ad hoc networks using statistical design of experiments methodology: A comprehensive study. Appl Syst Innov. 2022. https:\/\/doi.org\/10.3390\/asi5010019.","journal-title":"Appl Syst Innov"},{"key":"2354_CR14","doi-asserted-by":"crossref","unstructured":"Ajjaj S, El\u00a0Houssaini S, Hain M, El\u00a0Houssaini M-A. A new approach for evaluating the performance of Aodv routing protocol in vanets using the Plackett\u2013Burman method. In: Digital Technologies and Applications: Proceedings of ICDTA 21, Fez, Morocco, Springer. 2021:pp. 1021\u20131032.","DOI":"10.1007\/978-3-030-73882-2_93"},{"issue":"3","key":"2354_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.14569\/JACSA.2011.020315","volume":"2","author":"A Verma","year":"2011","unstructured":"Verma A, Srivastava DA. Integrated routing protocol for opportunistic networks. Int J Adv Comput Sci Appl. 2011;2(3):85\u201392. https:\/\/doi.org\/10.14569\/JACSA.2011.020315.","journal-title":"Int J Adv Comput Sci Appl"},{"key":"2354_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1201\/9781315200804","volume-title":"Opportunistic networking: vehicular, D2D and cognitive radio networks","author":"A Verma","year":"2017","unstructured":"Verma A, Pattanaik K. Routing protocols in opportunistic networks. In: Opportunistic networking: vehicular, D2D and cognitive radio networks. 1st ed. London: Taylor Francis Group\/CRC Press; 2017. p. 123\u201366. https:\/\/doi.org\/10.1201\/9781315200804.","edition":"1"},{"key":"2354_CR17","doi-asserted-by":"publisher","DOI":"10.1201\/9781003132585","volume-title":"Opportunistic networks: fundamentals, applications and emerging trends","author":"A Verma","year":"2021","unstructured":"Verma A, Verma P, Dhurandher SK, Woungang I. Opportunistic networks: fundamentals, applications and emerging trends. CRC Press; 2021."},{"key":"2354_CR18","doi-asserted-by":"crossref","unstructured":"Grasic S, Davies E, Lindgren A, Doria A. The evolution of a dtn routing protocol-prophetv2. In: Proceedings of the 6th ACM Workshop on Challenged Networks, 2011:pp. 27\u201330.","DOI":"10.1145\/2030652.2030661"},{"issue":"2","key":"2354_CR19","first-page":"1145","volume":"9","author":"VRV Lakshmi","year":"2019","unstructured":"Lakshmi VRV, Gireesh KT. Opportunistic mobile social networks: architecture, privacy, security issues and future directions. Int J Electr Comput Eng. 2019;9(2):1145\u201352.","journal-title":"Int J Electr Comput Eng"},{"issue":"1","key":"2354_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S1005-8885(14)60270-3","volume":"21","author":"G Cheng","year":"2014","unstructured":"Cheng G, Mei S, Zhang Y, Xing Y-H, Bao X-Y. Routing protocol based on social characteristics for opportunistic networks. J China Univ Posts Telecommun. 2014;21(1):67\u2013103.","journal-title":"J China Univ Posts Telecommun"},{"key":"2354_CR21","first-page":"1","volume":"2018","author":"H Lenando","year":"2018","unstructured":"Lenando H, Alrfaay M. Epsoc: social-based epidemic-based routing protocol in opportunistic mobile social network. Mob Inform Syst. 2018;2018:1\u20138.","journal-title":"Mob Inform Syst"},{"key":"2354_CR22","doi-asserted-by":"crossref","unstructured":"Rachman ZA, Maharani W, et\u00a0al. The analysis and implementation of degree centrality in weighted graph in social network analysis. In: 2013 International Conference of Information and Communication Technology (ICoICT), 2013:pp. 72\u201376. IEEE.","DOI":"10.1109\/ICoICT.2013.6574552"},{"key":"2354_CR23","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.comnet.2017.07.005","volume":"129","author":"SJ Borah","year":"2017","unstructured":"Borah SJ, Dhurandher SK, Woungang I, Kumar V. A game theoretic context-based routing protocol for opportunistic networks in an iot scenario. Comput Netw. 2017;129:572\u201384.","journal-title":"Comput Netw"},{"key":"2354_CR24","doi-asserted-by":"publisher","unstructured":"Qin Y, Li L, Liu H, Gtr: a novel routing scheme based on game theory in opportunistic networks. In: 2014 IEEE\/CIC International Conference on Communications in China, ICCC 2015;2014:775\u2013779. https:\/\/doi.org\/10.1109\/ICCChina.2014.7008381.","DOI":"10.1109\/ICCChina.2014.7008381"},{"key":"2354_CR25","first-page":"121","volume":"9","author":"K Ahmad","year":"2017","unstructured":"Ahmad K, Fathima M, Jain V, Fathima A. Fuzzy-prophet: a novel routing protocol for opportunistic network. Int J Inform Technol. 2017;9:121\u20137.","journal-title":"Int J Inform Technol"},{"issue":"1","key":"2354_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/JHS-210648","volume":"27","author":"K Khalid","year":"2021","unstructured":"Khalid K, Woungang I, Dhurandher SK, Singh J, Barolli L. A fuzzy-based check-and-spray geocast routing protocol for opportunistic networks. J High Speed Netw. 2021;27(1):1\u201312.","journal-title":"J High Speed Netw"},{"issue":"3","key":"2354_CR27","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1109\/JSYST.2016.2630923","volume":"12","author":"DK Sharma","year":"2016","unstructured":"Sharma DK, Dhurandher SK, Woungang I, Srivastava RK, Mohananey A, Rodrigues JJ. A machine learning-based protocol for efficient routing in opportunistic networks. IEEE Syst J. 2016;12(3):2207\u201313.","journal-title":"IEEE Syst J"},{"key":"2354_CR28","doi-asserted-by":"crossref","unstructured":"Sharma DK, Sharma A, Kumar J, et\u00a0al. Knnr: K-nearest neighbour classification based routing protocol for opportunistic networks. In: 2017 Tenth International Conference on Contemporary Computing (IC3), 2017;pp. 1\u20136. IEEE.","DOI":"10.1109\/IC3.2017.8284342"},{"key":"2354_CR29","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.procs.2017.03.162","volume":"107","author":"M-H Yao","year":"2017","unstructured":"Yao M-H, Bao X-I, Zhang S, Wang Y, Shi Z-J. Opportunistic networks model with restricted time-space. Procedia Comput Sci. 2017;107:608\u201317. https:\/\/doi.org\/10.1016\/j.procs.2017.03.162. (Advances in Information and Communication Technology: Proceedings of 7th International Congress of Information and Communication Technology (ICICT2017)).","journal-title":"Procedia Comput Sci."},{"key":"2354_CR30","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.jnca.2014.03.007","volume":"42","author":"P Pirozmand","year":"2014","unstructured":"Pirozmand P, Wu G, Jedari B, Xia F. Human mobility in opportunistic networks: characteristics, models and prediction methods. J Netw Comput Appl. 2014;42:45\u201358.","journal-title":"J Netw Comput Appl"},{"key":"2354_CR31","doi-asserted-by":"crossref","unstructured":"Fathima M, Ahmad K, Fathima A. Mobility models and routing protocols in opportunistic networks: a survey. Int J Adv Res Comput Sci. 2017;8(5).","DOI":"10.1201\/9780429453434-5"},{"key":"2354_CR32","doi-asserted-by":"crossref","unstructured":"Shahzamal M, Pervez M, Zaman M, Hossain M. Mobility models for delay tolerant network: a survey. Int J Wirel Mob Netw (IJWMN) 2014;6.","DOI":"10.5121\/ijwmn.2014.6410"},{"key":"2354_CR33","doi-asserted-by":"crossref","unstructured":"Dhurandher SK, Borah S, Woungang I, Sharma DK, Arora K, Agarwal D. Edr: an encounter and distance based routing protocol for opportunistic networks. In: 2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA), 2016:pp. 297\u2013302. IEEE","DOI":"10.1109\/AINA.2016.15"},{"key":"2354_CR34","doi-asserted-by":"crossref","unstructured":"Spyropoulos T, Psounis K, Raghavendra CS. Single-copy routing in intermittently connected mobile networks. In: 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004., 2004:pp. 235\u2013244. IEEE.","DOI":"10.1109\/SAHCN.2004.1381922"},{"key":"2354_CR35","doi-asserted-by":"crossref","unstructured":"Sati S, Probst C, Graffi K. Analysis of buffer management policies for opportunistic networks. In: 2016 25th International Conference on Computer Communication and Networks (ICCCN), 2016:pp. 1\u20138. IEEE.","DOI":"10.1109\/ICCCN.2016.7568494"},{"key":"2354_CR36","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1201\/9781003320333-18","volume-title":"Research advances in network technologies","author":"M Singh","year":"2023","unstructured":"Singh M, Verma A, Verma P. Empirical analysis of the performance of routing protocols in opportunistic networks. In: Research advances in network technologies. London: CRC Press; 2023. p. 257\u201372."},{"key":"2354_CR37","doi-asserted-by":"crossref","unstructured":"Khalid K, Woungang I, Dhurandher SK, Barolli L, Carvalho GH, Takizawa M. An energy-efficient routing protocol for infrastructure-less opportunistic networks. In: 2016 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS), 2016;pp. 237\u2013244. IEEE.","DOI":"10.1109\/IMIS.2016.150"},{"key":"2354_CR38","doi-asserted-by":"crossref","unstructured":"Alenazi MJ, Cheng Y, Zhang D, Sterbenz JP. Epidemic routing protocol implementation in ns-3. In: Proceedings of the 2015 Workshop on Ns-3, 2015;pp. 83\u201390.","DOI":"10.1145\/2756509.2756523"},{"key":"2354_CR39","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nen A, Ott J, K\u00e4rkk\u00e4inen T. The one simulator for dtn protocol evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, 2009:pp. 1\u201310.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"issue":"2","key":"2354_CR40","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. Simulating mobility and dtns with the one. J Commun. 2010;5(2):92\u2013105.","journal-title":"J Commun"},{"key":"2354_CR41","doi-asserted-by":"publisher","unstructured":"Fraire JA, Madoery P, Raverta F, Finochietto JM, Velazco R. Dtnsim: Bridging the gap between simulation and implementation of space-terrestrial dtns. In: 2017 6th International Conference on Space Mission Challenges for Information Technology (SMC-IT), 2017;pp. 120\u2013123. https:\/\/doi.org\/10.1109\/SMC-IT.2017.27.","DOI":"10.1109\/SMC-IT.2017.27"},{"key":"2354_CR42","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-12842-5_14","volume-title":"Recent advances in network simulation: the OMNeT++ environment and its ecosystem","author":"A Udugama","year":"2019","unstructured":"Udugama A, F\u00f6rster A, Dede J, Kuppusamy V. Simulating opportunistic networks with omnet++. In: Recent advances in network simulation: the OMNeT++ environment and its ecosystem. Cham: Springer; 2019. p. 425\u201349."},{"key":"2354_CR43","doi-asserted-by":"crossref","unstructured":"Denda R, Banchs A, Effelsberg W. The fairness challenge in computer networks. In: Quality of Future Internet Services: First COST 263 International Workshop, QofIS 2000 Berlin, Germany, September 25\u201326, 2000 Proceedings 1. Springer, 2000:pp. 208\u2013220.","DOI":"10.1007\/3-540-39939-9_17"},{"issue":"1","key":"2354_CR44","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/SURV.2013.050113.00015","volume":"16","author":"H Shi","year":"2014","unstructured":"Shi H, Prasad RV, Onur E, Niemegeers IGMM. Fairness in wireless networks: issues, measures and challenges. IEEE Commun Surv Tutor. 2014;16(1):5\u201324. https:\/\/doi.org\/10.1109\/SURV.2013.050113.00015.","journal-title":"IEEE Commun Surv Tutor"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-02354-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-023-02354-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-02354-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T07:54:46Z","timestamp":1730706886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-023-02354-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,29]]},"references-count":44,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["2354"],"URL":"https:\/\/doi.org\/10.1007\/s42979-023-02354-3","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,29]]},"assertion":[{"value":"14 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2023","order":3,"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":"Conflict of Interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"43"}}