{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:49:45Z","timestamp":1743094185045,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319723945"},{"type":"electronic","value":"9783319723952"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72395-2_14","type":"book-chapter","created":{"date-parts":[[2017,12,8]],"date-time":"2017-12-08T04:56:41Z","timestamp":1512709001000},"page":"137-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Message Routing Algorithm Using Overhearing in Community Opportunistic Networks"],"prefix":"10.1007","author":[{"given":"Junhai","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siwang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yapin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,9]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1109\/TWC.2015.2476466","volume":"15","author":"L Yao","year":"2016","unstructured":"Yao, L., Man, Y., Huang, Z., Deng, J., Wang, X.: Secure routing based on social similarity in opportunistic networks. IEEE Trans. Wirel. Commun. 15(1), 594\u2013605 (2016)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"8","key":"14_CR2","doi-asserted-by":"crossref","first-page":"7384","DOI":"10.1109\/TVT.2017.2668396","volume":"66","author":"X Zhu","year":"2017","unstructured":"Zhu, X., Li, Y., Jin, D., Lu, J.: Contact-aware optimal resource allocation for mobile data offloading in opportunistic vehicular networks. IEEE Trans. Veh. Technol. 66(8), 7384\u20137399 (2017)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"12","key":"14_CR3","doi-asserted-by":"crossref","first-page":"3156","DOI":"10.1109\/TMC.2016.2524571","volume":"15","author":"MA Alim","year":"2016","unstructured":"Alim, M.A., Li, X., Nguyen, N.P., Thai, M.T., Helal, A.: Structural vulnerability assessment of community-based routing in opportunistic networks. IEEE Trans. Mob. Comput. 15(12), 3156\u20133170 (2016)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"14119","DOI":"10.1109\/ACCESS.2017.2730233","volume":"5","author":"MA Rahman","year":"2017","unstructured":"Rahman, M.A., Lee, Y., Koo, I.: EECOR: an energy-efficient cooperative opportunistic routing protocol for underwater acoustic sensor networks. IEEE Access 5, 14119\u201314132 (2017)","journal-title":"IEEE Access"},{"issue":"3","key":"14_CR5","first-page":"19","volume":"7","author":"A Lindgren","year":"2004","unstructured":"Lindgren, A., Doria, A., Schel\u00e9n, O.: Probabilistic routing in intermittently connected networks. ACM 7(3), 19\u201320 (2004)","journal-title":"ACM"},{"issue":"11","key":"14_CR6","doi-asserted-by":"crossref","first-page":"1576","DOI":"10.1109\/TMC.2010.246","volume":"10","author":"P Hui","year":"2011","unstructured":"Hui, P., Crowcroft, J., Yoneki, E.: BUBBLE rap: social-based forwarding in delay-tolerant networks. IEEE Trans. Mob. Comput. 10(11), 1576\u20131589 (2011)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility. In: 5th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, White Plains, NY, USA, pp. 79\u201385. IEEE (2007)","DOI":"10.1109\/PERCOMW.2007.108"},{"issue":"5 Pt 2","key":"14_CR8","first-page":"1","volume":"70","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Analysis of weighted networks. Phys. Rev. E: Stat. Nonlinear Soft Matter Phys. 70(5 Pt 2), 1\u20139 (2004)","journal-title":"Phys. Rev. E: Stat. Nonlinear Soft Matter Phys."},{"key":"14_CR9","unstructured":"Haggle. \nhttp:\/\/www.haggleproject.org\n\n. Accessed 11 Oct 2016"},{"issue":"4","key":"14_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00779-005-0046-3","volume":"10","author":"N Eagle","year":"2006","unstructured":"Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. Pers. Ubiquit. Comput. 10(4), 255\u2013268 (2006)","journal-title":"Pers. Ubiquit. Comput."}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Anonymity in Computation, Communication, and Storage"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72395-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,11]],"date-time":"2017-12-11T04:08:38Z","timestamp":1512965318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72395-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319723945","9783319723952"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72395-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}