{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T22:14:31Z","timestamp":1778883271504,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T00:00:00Z","timestamp":1535328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s12652-018-0993-y","type":"journal-article","created":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T16:25:03Z","timestamp":1535387103000},"page":"1307-1324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Supernode routing: a grid-based message passing scheme for sparse opportunistic networks"],"prefix":"10.1007","volume":"10","author":[{"given":"Deepak Kumar","family":"Sharma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepika","family":"Kukreja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samarth","family":"Chugh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shubham","family":"Kumaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"key":"993_CR1","doi-asserted-by":"crossref","unstructured":"Boldrini C, Conti M, Jacopini J, Passarella A (2007) Hibop: a history based routing protocol for opportunistic networks. In: World of wireless, mobile and multimedia networks, 2007. WoWMoM 2007. IEEE international symposium. IEEE, pp 1\u201312","DOI":"10.1109\/WOWMOM.2007.4351716"},{"key":"993_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-017-0462-z","author":"SJ Borah","year":"2017","unstructured":"Borah SJ, Dhurandher SK, Woungang I et al (2017) A multi-objectives based technique for optimized routing in opportunistic networks. J Ambient Intell Humaniz Comput. \n                    https:\/\/doi.org\/10.1007\/s12652-017-0462-z","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"993_CR3","doi-asserted-by":"crossref","unstructured":"Burgess J, Gallagher B, Jensen D, Levine BN (2006) Maxprop: routing for vehicle-based disruption-tolerant networks. In: INFOCOM 2006. 25th IEEE international conference on computer communications. Proceedings, IEEE, pp 1\u201311","DOI":"10.1109\/INFOCOM.2006.228"},{"key":"993_CR4","doi-asserted-by":"publisher","unstructured":"Dhurandher SK, Sharma DK, Woungang I, Chao H (2011) Performance evaluation of various routing protocols in opportunistic networks. In: 2011 IEEE GLOBECOM workshops (GC Wkshps), pp 1067\u20131071. \n                    https:\/\/doi.org\/10.1109\/GLOCOMW.2011.6162342","DOI":"10.1109\/GLOCOMW.2011.6162342"},{"issue":"3","key":"993_CR5","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1007\/s11227-014-1195-9","volume":"69","author":"SK Dhurandher","year":"2014","unstructured":"Dhurandher SK, Sharma DK, Woungang I, Gupta R, Garg S (2014) Gaer: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks. J Supercomput 69(3):1183\u20131214","journal-title":"J Supercomput"},{"key":"993_CR6","doi-asserted-by":"crossref","unstructured":"Dhurandher SK, Borah SJ, Obaidat MS, Sharma DK, Gupta S, Baruah B (2015) Probability-based controlled flooding in opportunistic networks. In: e-business and telecommunications (ICETE), 2015 12th international joint conference, vol\u00a06. IEEE, pp 3\u20138","DOI":"10.5220\/0005580300030008"},{"key":"993_CR7","doi-asserted-by":"crossref","unstructured":"Dhurandher SK, Borah S, Woungang I, Sharma DK, Arora K, Agarwal D (2016a) Edr: an encounter and distance based routing protocol for opportunistic networks. In: Advanced information networking and applications (AINA), 2016 IEEE 30th international conference. IEEE, pp 297\u2013302","DOI":"10.1109\/AINA.2016.15"},{"issue":"2","key":"993_CR8","first-page":"73","volume":"5","author":"SK Dhurandher","year":"2016","unstructured":"Dhurandher SK, Woungang I, Arora J, Gupta H (2016b) History-based secure routing protocol to detect blackhole and greyhole attacks in opportunistic networks. Recent Adv Commun Netw Technol (Formerly Recent Patents on Telecommunication) 5(2):73\u201389","journal-title":"Recent Adv Commun Netw Technol (Formerly Recent Patents on Telecommunication)"},{"issue":"7","key":"993_CR9","doi-asserted-by":"publisher","first-page":"e2989","DOI":"10.1002\/dac.2989","volume":"30","author":"SK Dhurandher","year":"2017","unstructured":"Dhurandher SK, Sharma DK, Woungang I, Saini A (2017) An energy-efficient history-based routing scheme for opportunistic networks. Int J Commun Syst 30(7):e2989. \n                    https:\/\/doi.org\/10.1002\/dac.2989","journal-title":"Int J Commun Syst"},{"key":"993_CR10","doi-asserted-by":"publisher","unstructured":"Fall K (2003) A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications, SIGCOMM \u201903. ACM, New York, pp 27\u201334. \n                    https:\/\/doi.org\/10.1145\/863955.863960","DOI":"10.1145\/863955.863960"},{"issue":"4","key":"993_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/1030194.1015484","volume":"34","author":"S Jain","year":"2004","unstructured":"Jain S, Fall K, Patra R (2004) Routing in a delay tolerant network. SIGCOMM Comput Commun Rev 34(4):145\u2013158. \n                    https:\/\/doi.org\/10.1145\/1030194.1015484","journal-title":"SIGCOMM Comput Commun Rev"},{"key":"993_CR12","doi-asserted-by":"publisher","unstructured":"Ker\u00e4nen A, Ott J, K\u00e4rkk\u00e4inen T (2009) The one simulator for dtn protocol evaluation. In: Proceedings of the 2nd international conference on simulation tools and techniques, ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), Simutools \u201909. ICST, Brussels, pp 55:1\u201355:10. \n                    https:\/\/doi.org\/10.4108\/ICST.SIMUTOOLS2009.5674","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"993_CR13","unstructured":"Lilien L, Kamal ZH, Bhuse V, Gupta a (2006) Opportunistic networks: the concept and research challenges. In: Int workshop on research challenges in security and privacy for mobile and wireless networks, pp 1\u201336"},{"key":"993_CR14","doi-asserted-by":"crossref","unstructured":"Lin CY, Chung JY, Li CT, Hu CL, Lien YN (2017) Geo-routing with angle-based decision in delay-tolerant networks. In: Ubi-media computing and workshops (Ubi-Media), 2017 10th international conference. IEEE, pp 1\u20135","DOI":"10.1109\/UMEDIA.2017.8074152"},{"issue":"3","key":"993_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/961268.961272","volume":"7","author":"A Lindgren","year":"2003","unstructured":"Lindgren A, Doria A, Schelen O (2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob Comput Commun Rev 7(3):19\u201320. \n                    https:\/\/doi.org\/10.1145\/961268.961272","journal-title":"ACM SIGMOBILE Mob Comput Commun Rev"},{"key":"993_CR16","doi-asserted-by":"crossref","unstructured":"Musolesi M, Hailes S, Mascolo C (2005) Adaptive routing for intermittently connected mobile ad hoc networks. In: World of wireless mobile and multimedia networks, 2005. WoWMoM 2005. 6th IEEE international symposium. IEEE, pp 183\u2013189","DOI":"10.1109\/WOWMOM.2005.17"},{"key":"993_CR17","first-page":"611","volume-title":"International conference on network-based information systems","author":"DK Sharma","year":"2017","unstructured":"Sharma DK, Dhurandher SK, Woungang I, Bansal A, Gupta A (2017) GD-CAR: a genetic algorithm based dynamic context aware routing protocol for opportunistic networks. In: International conference on network-based information systems. Springer, Toronto, pp 611\u2013622"},{"key":"993_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-018-0697-3","author":"DK Sharma","year":"2018","unstructured":"Sharma DK, Dhurandher SK, Agarwal D, Arora K (2018a) krop: k-means clustering based routing protocol for opportunistic networks. J Ambient Intell Humaniz Comput. \n                    https:\/\/doi.org\/10.1007\/s12652-018-0697-3","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"993_CR19","doi-asserted-by":"publisher","unstructured":"Sharma DK, Dhurandher SK, Woungang I, Srivastava RK, Mohananey A, Rodrigues JJPC (2018b) A machine learning-based protocol for efficient routing in opportunistic networks. IEEE Syst J. \n                    https:\/\/doi.org\/10.1109\/JSYST.2016.2630923","DOI":"10.1109\/JSYST.2016.2630923"},{"key":"993_CR20","doi-asserted-by":"crossref","unstructured":"Spyropoulos T, Psounis K, Raghavendra CS (2005) Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking (WDTN \u201905), Philadelphia, PA, USA, 22\u201326 August 2005, pp 252\u2013259","DOI":"10.1145\/1080139.1080143"},{"key":"993_CR21","unstructured":"Vahdat A, Becker D et al (2000) Epidemic routing for partially connected ad hoc networks. Technical report number CS-200006, Duke University, pp 1\u201314"},{"issue":"12","key":"993_CR22","doi-asserted-by":"publisher","first-page":"e3230","DOI":"10.1002\/ett.3230","volume":"28","author":"R Zhao","year":"2017","unstructured":"Zhao R, Wang X, Zhang L, Lin Y (2017) A social-aware probabilistic routing approach for mobile opportunistic social networks. Trans Emerg Telecommun Technol 28(12):e3230. \n                    https:\/\/doi.org\/10.1002\/ett.3230","journal-title":"Trans Emerg Telecommun Technol"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0993-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-018-0993-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0993-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T23:26:50Z","timestamp":1566862010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-018-0993-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,27]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["993"],"URL":"https:\/\/doi.org\/10.1007\/s12652-018-0993-y","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,27]]},"assertion":[{"value":"16 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}