{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:37:08Z","timestamp":1773272228209,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T00:00:00Z","timestamp":1588032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T00:00:00Z","timestamp":1588032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"FCT\/MCTES","award":["UIDB\/EEA\/50008\/2020"],"award-info":[{"award-number":["UIDB\/EEA\/50008\/2020"]}]},{"DOI":"10.13039\/501100010688","name":"Instituto Nacional de Ci\u00eancia e Tecnologia da Criosfera","doi-asserted-by":"publisher","award":["309335\/2017-5"],"award-info":[{"award-number":["309335\/2017-5"]}],"id":[{"id":"10.13039\/501100010688","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s11276-020-02331-1","type":"journal-article","created":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T13:04:05Z","timestamp":1588079045000},"page":"4319-4338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["RLProph: a dynamic programming based reinforcement learning approach for optimal routing in opportunistic IoT networks"],"prefix":"10.1007","volume":"26","author":[{"given":"Deepak Kumar","family":"Sharma","sequence":"first","affiliation":[]},{"given":"Joel J. P. C.","family":"Rodrigues","sequence":"additional","affiliation":[]},{"given":"Vidushi","family":"Vashishth","sequence":"additional","affiliation":[]},{"given":"Anirudh","family":"Khanna","sequence":"additional","affiliation":[]},{"given":"Anshuman","family":"Chhabra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,28]]},"reference":[{"issue":"5","key":"2331_CR1","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/635506.605408","volume":"30","author":"P Juang","year":"2002","unstructured":"Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L. S., & Rubenstein, D. (2002). Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. ACM SIGARCH Computer Architecture News, 30(5), 96\u2013107.","journal-title":"ACM SIGARCH Computer Architecture News"},{"issue":"1","key":"2331_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/MC.2004.1260729","volume":"37","author":"A Pentland","year":"2004","unstructured":"Pentland, A., Fletcher, R., & Hasson, A. (2004). Daknet: Rethinking connectivity in developing nations. Computer, 37(1), 78\u201383.","journal-title":"Computer"},{"key":"2331_CR3","unstructured":"Doria, A., Uden, M., & Pandey, D. P. (2002). Providing connectivity to the saami nomadic community. International Conference on open collaborative design for sustainable innovation. 01\/12\/2002-02\/12\/2002."},{"issue":"6","key":"2331_CR4","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1016\/j.jnca.2012.12.028","volume":"36","author":"B Guo","year":"2013","unstructured":"Guo, B., Zhang, D., Wang, Z., Yu, Z., & Zhou, X. (2013). Opportunistic IoT: Exploring the harmonious interaction between human and the internet of things. Journal of Network and Computer Applications, 36(6), 1531\u20131539.","journal-title":"Journal of Network and Computer Applications"},{"key":"2331_CR5","unstructured":"Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University. Available from: https:\/\/cloudcoder.cs.duke.edu\/techreports\/2000\/2000-06.ps."},{"issue":"3","key":"2331_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/961268.961272","volume":"7","author":"A Lindgren","year":"2003","unstructured":"Lindgren, A., Doria, A., & Schel\u00e9n, O. (2003). Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computer Communication and Review., 7(3), 19\u201320. https:\/\/doi.org\/10.1145\/961268.961272.","journal-title":"SIGMOBILE Mobile Computer Communication and Review."},{"key":"2331_CR7","doi-asserted-by":"crossref","unstructured":"Dhurandher, S. K., Sharma, D. K., Woungang, I., & Bhati, S. (2013). HBPR: History based prediction for routing in infrastructure-less opportunistic networks. In 2013 IEEE 27th international Conference on advanced information networking and applications (AINA) (pp. 931\u2013936).","DOI":"10.1109\/AINA.2013.105"},{"issue":"5","key":"2331_CR8","doi-asserted-by":"publisher","first-page":"1694","DOI":"10.1007\/s11227-014-1243-5","volume":"71","author":"SK Dhurandher","year":"2015","unstructured":"Dhurandher, S. K., Sharma, D. K., Woungang, I., & Saini, A. (2015). Efficient routing based on past information to predict the future location for message passing in infrastructure-less opportunistic networks. The Journal of Supercomputing, 71(5), 1694\u20131711.","journal-title":"The Journal of Supercomputing"},{"issue":"3","key":"2331_CR9","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1109\/JSYST.2016.2630923","volume":"12","author":"DK Sharma","year":"2016","unstructured":"Sharma, D. K., Dhurandher, S. K., Woungang, I., Srivastava, R. K., Mohananey, A., & Rodrigues, J. J. (2016). A machine learning-based protocol for efficient routing in opportunistic networks. IEEE Systems Journal, 12(3), 2207\u20132213.","journal-title":"IEEE Systems Journal"},{"key":"2331_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.comcom.2018.12.001","volume":"134","author":"V Vashishth","year":"2019","unstructured":"Vashishth, V., Chhabra, A., & Sharma, D. K. (2019). GMMR: A Gaussian mixture model based unsupervised machine learning approach for optimal routing in opportunistic IoT networks. Computer Communications, 134, 138\u2013148.","journal-title":"Computer Communications"},{"key":"2331_CR11","unstructured":"Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., & Wierstra, D., et\u00a0al. (2013). Playing atari with deep reinforcement learning. arXiv preprint arXiv:1312.5602."},{"issue":"7676","key":"2331_CR12","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1038\/nature24270","volume":"550","author":"D Silver","year":"2017","unstructured":"Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., et al. (2017). Mastering the game of Go without human knowledge. Nature, 550(7676), 354.","journal-title":"Nature"},{"key":"2331_CR13","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1512\/iumj.1957.6.56038","volume":"6","author":"R Bellman","year":"1957","unstructured":"Bellman, R. (1957). A Markovian Decision Process. Indiana University Mathematics Journal, 6, 679\u2013684.","journal-title":"Indiana University Mathematics Journal"},{"key":"2331_CR14","doi-asserted-by":"publisher","unstructured":"Telser, L. G. (1961). Dynamic Programming and Markov Processes. Ronald A. Howard. Journal of Political Economy., 69(3), 296\u2013297. https:\/\/doi.org\/10.1086\/258477.","DOI":"10.1086\/258477"},{"key":"2331_CR15","doi-asserted-by":"crossref","unstructured":"Huang, T. K., Lee, C. K., & Chen, L. J. (2010). Prophet+: An adaptive prophet-based routing protocol for opportunistic network. In 2010 24th IEEE international Conference on advanced information networking and applications (AINA) (pp. 112\u2013119). IEEE.","DOI":"10.1109\/AINA.2010.162"},{"key":"2331_CR16","unstructured":"Nguyen, H. A., Giordano, S., & Puiatti, A. (2007). Probabilistic routing protocol for intermittently connected mobile ad hoc network (propicman). In IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (pp. 1\u20136). Available from: https:\/\/ieeexplore.ieee.org\/abstract\/document\/4351696\/."},{"key":"2331_CR17","unstructured":"Leguay, J., Friedman, T., & Conan, V. (2005). MobySpace: Mobility pattern space routing for DTNs. In ACM SIGCOMM Conference."},{"key":"2331_CR18","doi-asserted-by":"crossref","unstructured":"Burns, B., Brock, O., & Levine, B. N. (2005). MV routing and capacity building in disruption tolerant networks. In Proceedings IEEE 24th annual joint Conference of the IEEE computer and communications societies (vol.\u00a01, pp. 398\u2013408).","DOI":"10.1109\/INFCOM.2005.1497909"},{"key":"2331_CR19","doi-asserted-by":"crossref","unstructured":"Boldrini, C., Conti, M., Jacopini, J., & Passarella, A. (2007). HiBOp: A history based routing protocol for opportunistic networks. In 2007 IEEE international Symposium on a world of wireless, mobile and multimedia networks (pp. 1\u201312).","DOI":"10.1109\/WOWMOM.2007.4351716"},{"key":"2331_CR20","unstructured":"Dhurandher, S. K., Borah, S. J., Obaidat, M. S., Sharma, D. K., Gupta, S., & Baruah, B. (2015). Probability-based controlled flooding in opportunistic networks. In: 2015 12th International joint Conference one-Business and telecommunications (ICETE) (vol.\u00a06, pp. 3\u20138). IEEE."},{"issue":"7","key":"2331_CR21","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1109\/TC.2013.55","volume":"63","author":"M Xiao","year":"2014","unstructured":"Xiao, M., Wu, J., & Huang, L. (2014). Community-aware opportunistic routing in mobile social networks. IEEE Transactions on Computers, 63(7), 1682\u20131695.","journal-title":"IEEE Transactions on Computers"},{"key":"2331_CR22","unstructured":"Sharma, D. K., Sharma, A., & Kumar, J., et\u00a0al. (2017). KNNR: K-nearest neighbour classification based routing protocol for opportunistic networks. In: 2017 Tenth international Conference on contemporary computing (IC3) (pp. 1\u20136). IEEE."},{"key":"2331_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-015-1136-4","author":"N Derakhshanfard","year":"2017","unstructured":"Derakhshanfard, N., Sabaei, M., & Rahmani, A. (2017). CPTR: Conditional probability tree based routing in opportunistic networks. Wireless Networks. https:\/\/doi.org\/10.1007\/s11276-015-1136-4.","journal-title":"Wireless Networks"},{"key":"2331_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-018-01907-2","author":"J Zhang","year":"2019","unstructured":"Zhang, J., Huang, H., et al. (2019). Destination-aware metric based social routing for mobile opportunistic networks. Wireless Networks. https:\/\/doi.org\/10.1007\/s11276-018-01907-2.","journal-title":"Wireless Networks"},{"key":"2331_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-015-1048-3","author":"K Jang","year":"2016","unstructured":"Jang, K., Lee, J., et al. (2016). An adaptive routing algorithm considering position and social similarities in an opportunistic network. Wireless Networks. https:\/\/doi.org\/10.1007\/s11276-015-1048-3.","journal-title":"Wireless Networks"},{"key":"2331_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-017-1636-5","author":"S Malekyan","year":"2019","unstructured":"Malekyan, S., Bag-Mohammadi, M., et al. (2019). On selection of forwarding nodes for long opportunistic routes. Wireless Networks. https:\/\/doi.org\/10.1007\/s11276-017-1636-5.","journal-title":"Wireless Networks"},{"key":"2331_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-018-1691-6","author":"J Wu","year":"2019","unstructured":"Wu, J., Chen, Z., & Zhao, M. (2019). Information cache management and data transmission algorithm in opportunistic social networks. Wireless Networks. https:\/\/doi.org\/10.1007\/s11276-018-1691-6.","journal-title":"Wireless Networks:"},{"key":"2331_CR28","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (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 (pp. 252\u2013259). ACM.","DOI":"10.1145\/1080139.1080143"},{"key":"2331_CR29","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2007). Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Null, (pp. 79\u201385). IEEE.","DOI":"10.1109\/PERCOMW.2007.108"},{"key":"2331_CR30","doi-asserted-by":"crossref","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) (pp.\u00a055).","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"2331_CR31","unstructured":"Fayyad, U., & Irani, K. (1993). Multi-interval discretization of continuous-valued attributes for classification learning. Available from: https:\/\/trs.jpl.nasa.gov\/handle\/2014\/35171."},{"issue":"2","key":"2331_CR32","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TKDE.2004.1269594","volume":"16","author":"LA Kurgan","year":"2004","unstructured":"Kurgan, L. A., & Cios, K. J. (2004). CAIM discretization algorithm. IEEE Transactions on Knowledge and Data Engineering, 16(2), 145\u2013153.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"2331_CR33","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1016\/j.ins.2007.09.004","volume":"178","author":"CJ Tsai","year":"2008","unstructured":"Tsai, C. J., Lee, C. I., & Yang, W. P. (2008). A discretization algorithm based on class-attribute contingency coefficient. Information Sciences, 178(3), 714\u2013731.","journal-title":"Information Sciences"},{"key":"2331_CR34","unstructured":"Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., & Chaintreau, A. (2009). CRAWDAD dataset cambridge\/haggle (v. 2009-05-29); Downloaded from https:\/\/crawdad.org\/cambridge\/haggle\/20090529.Accessed 6 Jan 2020."},{"key":"2331_CR35","doi-asserted-by":"crossref","unstructured":"Chhabra, A., Vashishth, V., & Sharma, D. K. (2017). A game theory based secure model against Black hole attacks in Opportunistic Networks. In 2017 51st Annual conference on information sciences and systems (CISS), (pp. 1\u20136). IEEE.","DOI":"10.1109\/CISS.2017.7926114"},{"issue":"4","key":"2331_CR36","doi-asserted-by":"publisher","first-page":"e3487","DOI":"10.1002\/dac.3487","volume":"31","author":"A Chhabra","year":"2018","unstructured":"Chhabra, A., Vashishth, V., & Sharma, D. K. (2018). A fuzzy logic and game theory based adaptive approach for securing opportunistic networks against black hole attacks. International Journal of Communication Systems., 31(4), e3487.","journal-title":"International Journal of Communication Systems."},{"key":"2331_CR37","doi-asserted-by":"crossref","unstructured":"Chhabra, A., Vashishth, V., & Sharma, D. K. (2017). SEIR: A Stackelberg game based approach for energy-aware and incentivized routing in selfish Opportunistic Networks. In 2017 51st Annual Conference on information sciences and systems (CISS), (pp. 1\u20136). IEEE.","DOI":"10.1109\/CISS.2017.7926113"},{"key":"2331_CR38","unstructured":"Sutton, R. S., McAllester, D. A., Singh, S. P., & Mansour, Y. (2000). Policy gradient methods for reinforcement learning with function approximation. In Advances in neural information processing systems (pp. 1057\u20131063)."},{"key":"2331_CR39","unstructured":"Van\u00a0Hasselt, H., Guez, A., & Silver, D. (2016). Deep reinforcement learning with double q-learning. In Thirtieth AAAI Conference on Artificial Intelligence. Available from: https:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI16\/paper\/viewPaper\/12389."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-020-02331-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11276-020-02331-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-020-02331-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:15:08Z","timestamp":1619568908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11276-020-02331-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,28]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["2331"],"URL":"https:\/\/doi.org\/10.1007\/s11276-020-02331-1","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,28]]},"assertion":[{"value":"28 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}