{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:10:40Z","timestamp":1743055840124,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030397456"},{"type":"electronic","value":"9783030397463"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39746-3_41","type":"book-chapter","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T12:04:31Z","timestamp":1580385871000},"page":"395-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Human Mobility and Message Caching in Opportunistic Networks"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Sueda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naohiro","family":"Hayashibara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,31]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science (SFCS 1979), pp. 218\u2013223 (1976)","DOI":"10.1109\/SFCS.1979.34"},{"key":"41_CR2","doi-asserted-by":"publisher","unstructured":"Alzoubi, K.M., Wan, P.J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2002, pp. 157\u2013164. ACM, New York (2002). \nhttps:\/\/doi.org\/10.1145\/513800.513820","DOI":"10.1145\/513800.513820"},{"key":"41_CR3","unstructured":"Baldoni, R., Beraldi, R., Quema, V., Querzoni, L., Tucci-Piergiovanni, S.: Tera: Topic-based event routing for peer-to-peer architectures. In: Proceedings of the 2007 International Conference on Distributed Event-based Systems, pp. 2\u201313 (2007)"},{"key":"41_CR4","doi-asserted-by":"publisher","unstructured":"Birand, B., Zafer, M., Zussman, G., Lee, K.W.: Dynamic graph properties of mobile networks under levy walk mobility. In: Proceedings of the 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2011, pp. 292\u2013301. IEEE Computer Society, Washington, DC (2011). \nhttps:\/\/doi.org\/10.1109\/MASS.2011.36","DOI":"10.1109\/MASS.2011.36"},{"issue":"6","key":"41_CR5","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1016\/j.comnet.2006.08.004","volume":"51","author":"N Bisnik","year":"2007","unstructured":"Bisnik, N., Abouzeid, A.A.: Optimizing random walk search algorithms in P2P networks. Comput. Netw. 51(6), 1499\u20131514 (2007). \nhttps:\/\/doi.org\/10.1016\/j.comnet.2006.08.004","journal-title":"Comput. Netw."},{"issue":"6","key":"41_CR6","doi-asserted-by":"publisher","first-page":"4514","DOI":"10.1103\/PhysRevE.47.4514","volume":"47","author":"SV Buldyrev","year":"1993","unstructured":"Buldyrev, S.V., Goldberger, A.L., Havlin, S., Peng, C.K., Simons, M., Stanley, H.E.: Generalized l\u00e9vy-walk model for dna nucleotide sequences. Phys. Rev. E 47(6), 4514\u20134523 (1993)","journal-title":"Phys. Rev. E"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Desta, M.S., Hyyti\u00e4, E., Ker\u00e4nen, A., K\u00e4rkk\u00e4inen, T., Ott, J.: Evaluating (Geo) content sharing with the one simulator. In: Proceedings of the 14th ACM Symposium Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM) (2013)","DOI":"10.1145\/2508222.2512839"},{"issue":"7","key":"41_CR8","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/TMC.2006.104","volume":"5","author":"S Dolev","year":"2006","unstructured":"Dolev, S., Schiller, E., Welch, J.L.: Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mobi. Comput. 5(7), 893\u2013905 (2006). \nhttps:\/\/doi.org\/10.1109\/TMC.2006.104","journal-title":"IEEE Trans. Mobi. Comput."},{"issue":"1","key":"41_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10626-010-0092-5","volume":"21","author":"M Draief","year":"2011","unstructured":"Draief, M., Ganesh, A.: A random walk model for infection on graphs: Spread of epidemics & rumours with mobile agents. Discrete Event Dyn. Syst. 21(1), 41\u201361 (2011). \nhttps:\/\/doi.org\/10.1007\/s10626-010-0092-5","journal-title":"Discrete Event Dyn. Syst."},{"key":"41_CR10","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1038\/nature06199","volume":"449","author":"AM Edwards","year":"2007","unstructured":"Edwards, A.M., Phillips, R.A., Watkins, N.W., Freeman, M.P., Murphy, E.J., Afanasyev, V., Buldyrev, S.V., da Luz, M.G.E., Raposo, E.P., Stanley, H.E., Viswanathan, G.M.: Revisiting l\u00e9vy flight search patterns of wandering albatrosses, bumblebees and deer. Nature 449, 1044\u20131048 (2007)","journal-title":"Nature"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Fujihara, A., Miwa, H.: Homesick l\u00e9vy walk and optimal forwarding criterion of utility-based routing under sequential encounters. In: 2013 Proceedings of the Internet of Things and Inter-cooperative Computational Technologies for Collective Intelligence 2013, pp. 207\u2013231 (2013)","DOI":"10.1007\/978-3-642-34952-2_9"},{"key":"41_CR12","doi-asserted-by":"publisher","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, CHANTS 2011, pp. 27\u201330. ACM, New York (2011). \nhttps:\/\/doi.org\/10.1145\/2030652.2030661","DOI":"10.1145\/2030652.2030661"},{"issue":"7","key":"41_CR13","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1109\/TMC.2013.160","volume":"13","author":"\u00d3 Helgason","year":"2014","unstructured":"Helgason, \u00d3., Kouyoumdjieva, S.T., Karlsson, G.: Opportunistic communication and human mobility. IEEE Trans. Mob. Comput. 13(7), 1597\u20131610 (2014)","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"1","key":"41_CR14","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.tcs.2008.10.020","volume":"410","author":"S Ikeda","year":"2009","unstructured":"Ikeda, S., Kubo, I., Yamashita, M.: The hitting and cover times of random walks on finite graphs using local degree information. Theor. Comput. Sci. 410(1), 94\u2013100 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"41_CR15","doi-asserted-by":"publisher","unstructured":"Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. In: Proceedings of the Twenty-second Annual Symposium on Principles of Distributed Computing, PODC 2003, pp. 25\u201332. ACM, New York (2003). \nhttps:\/\/doi.org\/10.1145\/872035.872040","DOI":"10.1145\/872035.872040"},{"key":"41_CR16","unstructured":"L\u00e9vy, P.: Th\u00e9orie de L\u2019addition des Variables Al\u00e9atoires. Gauthier-Villars (1937)"},{"issue":"130","key":"41_CR17","doi-asserted-by":"publisher","first-page":"20170086","DOI":"10.1098\/rsif.2017.0086","volume":"14","author":"N Mizumoto","year":"2017","unstructured":"Mizumoto, N., Abe, M.S., Dobata, S.: Optimizing mating encounters by sexually dimorphic movements. J. R. Soc. Interface 14(130), 20170086 (2017)","journal-title":"J. R. Soc. Interface"},{"issue":"16\u201318","key":"41_CR18","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.1016\/j.tcs.2010.01.032","volume":"411","author":"Y Nonaka","year":"2010","unstructured":"Nonaka, Y., Ono, H., Sadakane, K., Yamashita, M.: The hitting and cover times of metropolis walks. Theor. Comput. Sci. 411(16\u201318), 1889\u20131894 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"41_CR19","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1109\/TNET.2011.2120618","volume":"19","author":"I Rhee","year":"2011","unstructured":"Rhee, I., Shin, M., Hong, S., Lee, K., Kim, S.J., Chong, S.: On the levy-walk nature of human mobility. IEEE\/ACM Trans. Netw. 19(3), 630\u2013643 (2011). \nhttps:\/\/doi.org\/10.1109\/TNET.2011.2120618","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Shinki, K., Hayashibara, N.: Resource exploration using l\u00e9vy walk on unit disk graphs. In: The 32nd IEEE International Conference on Advanced Information Networking and Applications, AINA-2018. Krakow, Poland (2018)","DOI":"10.1109\/AINA.2018.00034"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Shinki, K., Nishida, M., Hayashibara, N.: Message dissemination using l\u00e9vy flight on unit disk graphs. In: The 31st IEEE International Conference on Advanced Information Networking and Applications, AINA 2017, Taipei, Taiwan ROC (2017)","DOI":"10.1109\/AINA.2017.102"},{"key":"41_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TNET.2007.897964","volume":"14","author":"T Spyropoulos","year":"2008","unstructured":"Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Efficient routing in intermittently connected mobile networks: the multiple-copy case. IEEE\/ACM Trans. Netw. 14, 77\u201390 (2008)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"41_CR23","doi-asserted-by":"crossref","unstructured":"Sueda, T., Hayashibara, N.: Opportunistic communication by pedestrians with roadside units as message caches. In: Proceedings of the 22nd International Conference on Network-Based Information Systems, NBiS 2019, pp. 167\u2013177 (2013)","DOI":"10.1007\/978-3-030-29029-0_16"},{"issue":"3","key":"41_CR24","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/JIOT.2014.2388074","volume":"2","author":"M Thejaswini","year":"2015","unstructured":"Thejaswini, M., Rajalakshmi, P., Desai, U.B.: Novel sampling algorithm for human mobility-based mobile phone sensing. IEEE Internet Things J. 2(3), 210\u2013220 (2015)","journal-title":"IEEE Internet Things J."},{"key":"41_CR25","unstructured":"Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks. Technical report. CS-2000-06, Duke University (2000)"},{"key":"41_CR26","unstructured":"Valler, N.C., Prakash, B.A., Tong, H., Faloutsos, M., Faloutsos, C.: Epidemic spread in mobile ad hoc networks: determining the tipping point. In: Proceedings of the 10th International IFIP TC 6 Conference on Networking - volume Part I, NETWORKING 2011, pp. 266\u2013280. Springer-Verlag, Heidelberg (2011). \nhttp:\/\/dl.acm.org\/citation.cfm?id=2008780.20088"},{"key":"41_CR27","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1038\/381413a0","volume":"381","author":"GM Viswanathan","year":"1996","unstructured":"Viswanathan, G.M., Afanasyev, V., Buldyrev, S.V., Murphy, E.J., Prince, P.A., Stanley, H.E.: L\u00e9vy flight search patterns of wandering albatrosses. Nature 381, 413\u2013415 (1996)","journal-title":"Nature"},{"key":"41_CR28","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Cuckoo search via L\u00e9vy flights. In: Proceedings of World Congress on Nature & Biologically Inspired Computing, NaBIC 2009, pp. 210\u2013214 (2009)","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"41_CR29","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Firefly algorithm, l\u00e9vy flights and global optimization. Research and Development in Intelligent Systems XXVI, pp. 209\u2013218 (2010)","DOI":"10.1007\/978-1-84882-983-1_15"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances in Internet, Data and Web Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39746-3_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T20:15:26Z","timestamp":1580415326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39746-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030397456","9783030397463"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39746-3_41","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"31 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EIDWT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Emerging Internetworking, Data & Web Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eidwt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}