{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:13:08Z","timestamp":1774926788535,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819610921","type":"print"},{"value":"9789819610938","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_30","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:50Z","timestamp":1739999930000},"page":"355-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Opportunistic Routing Using Q-Learning with\u00a0Context Information"],"prefix":"10.1007","author":[{"given":"Xiaojing","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayu","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Winston K. G.","family":"Seah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celimuge","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"30_CR1","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT press, Cambridge (2018)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Yuan, F.,\u00a0Wu, J.,\u00a0Zhou, H.,\u00a0Liu, L.: A double Q-learning routing in delay tolerant networks. In: Proceedings of the IEEE International Conference on Communications (ICC), pp. 1\u20136 (2019)","DOI":"10.1109\/ICC.2019.8761526"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"5733","DOI":"10.1109\/ACCESS.2020.2963850","volume":"8","author":"J Wu","year":"2020","unstructured":"Wu, J., Fang, M., Li, H., Li, X.: RSU-assisted traffic-aware routing based on reinforcement learning for urban vanets. IEEE Access 8, 5733\u20135748 (2020)","journal-title":"IEEE Access"},{"key":"30_CR4","unstructured":"Yesuf, F.Y.,\u00a0Prathap, M.: CARL-DTN: context adaptive reinforcement learning based routing algorithm in delay tolerant network. arXiv preprint arXiv:2105.00544"},{"issue":"3","key":"30_CR5","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.: Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob. Comput. Commun. Rev. 7(3), 19\u201320 (2003)","journal-title":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"issue":"5","key":"30_CR6","first-page":"1145","volume":"36","author":"F Zhang","year":"2015","unstructured":"Zhang, F., Wang, X., Zhang, S.: Buffer aware prophet routing algorithm for opportunistic networks. Comput. Eng. Des. 36(5), 1145\u20131150 (2015)","journal-title":"Comput. Eng. Des."},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nen, A.,\u00a0Ott, J.,\u00a0K\u00e4rkk\u00e4inen, T.: The ONE simulator for DTN protocol evaluation. In: SIMUTools \u201909: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, ICST, New York, NY, USA (2009)","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"30_CR8","unstructured":"Vahdat, A.,\u00a0Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical report. CS-200006. Duke University (2000)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Chen, J.,\u00a0Xu, G.,\u00a0Wu, X.,\u00a0Wei, F.,\u00a0He, L.: Energy balance and cache optimization routing algorithm based on communication willingness. In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), pp. 1\u20136 (2021)","DOI":"10.1109\/WCNC49053.2021.9417387"},{"issue":"7","key":"30_CR10","doi-asserted-by":"publisher","first-page":"4134","DOI":"10.1109\/TMC.2022.3144683","volume":"22","author":"L Rashidi","year":"2023","unstructured":"Rashidi, L., Towsley, D., Mohseni-Kabir, A., Movaghar, A.: On the performance analysis of epidemic routing in non-sparse delay tolerant networks. IEEE Trans. Mob. Comput. 22(7), 4134\u20134149 (2023). https:\/\/doi.org\/10.1109\/TMC.2022.3144683","journal-title":"IEEE Trans. Mob. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:55Z","timestamp":1739999935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}