{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:41:27Z","timestamp":1740148887822,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T00:00:00Z","timestamp":1542758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T00:00:00Z","timestamp":1542758400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP16K00449"],"award-info":[{"award-number":["JP16K00449"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s12065-018-0189-6","type":"journal-article","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T04:23:51Z","timestamp":1542774231000},"page":"93-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Message broadcasting by opportunistic communication on unit disk graphs"],"prefix":"10.1007","volume":"13","author":[{"given":"Kenya","family":"Shinki","sequence":"first","affiliation":[]},{"given":"Kouichirou","family":"Sugihara","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0227-7452","authenticated-orcid":false,"given":"Naohiro","family":"Hayashibara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"189_CR1","doi-asserted-by":"publisher","unstructured":"Alzoubi KM, Wan PJ, Frieder O (2002) Message-optimal connected dominating sets in mobile ad hoc networks. In: Proceedings of the 3rd ACM international symposium on mobile ad hoc networking & computing, MobiHoc \u201902. ACM, New York. \nhttps:\/\/doi.org\/10.1145\/513800.513820\n\n, pp 157\u2013164","DOI":"10.1145\/513800.513820"},{"key":"189_CR2","doi-asserted-by":"crossref","unstructured":"Bacanli SS, Solmaz G, Turgut D (2015) Opportunistic message broadcasting in campus environments. In: 2015 IEEE global communications conference, GLOBECOM 2015, San Diego, CA, USA, December 6\u201310, 2015, pp 1\u20136","DOI":"10.1109\/GLOCOM.2015.7417464"},{"key":"189_CR3","doi-asserted-by":"crossref","unstructured":"Baldoni R, Beraldi R, Quema V, Querzoni L, Tucci-Piergiovanni S (2007) 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","DOI":"10.1145\/1266894.1266898"},{"key":"189_CR4","doi-asserted-by":"publisher","unstructured":"Birand B, Zafer M, Zussman G, Lee KW (2011) 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 \u201911, pp 292\u2013301. IEEE Computer Society, Washington, DC. \nhttps:\/\/doi.org\/10.1109\/MASS.2011.36","DOI":"10.1109\/MASS.2011.36"},{"issue":"6","key":"189_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 AA (2007) Optimizing random walk search algorithms in p2p networks. Comput Netw 51(6):1499\u20131514. \nhttps:\/\/doi.org\/10.1016\/j.comnet.2006.08.004","journal-title":"Comput Netw"},{"issue":"6","key":"189_CR6","doi-asserted-by":"publisher","first-page":"4514","DOI":"10.1103\/PhysRevE.47.4514","volume":"47","author":"SV Buldyrev","year":"1993","unstructured":"Buldyrev SV, Goldberger AL, Havlin S, Peng CK, Simons M, Stanley HE (1993) Generalized L\u00e9vy-walk model for DNA nucleotide sequences. Phys Rev E 47(6):4514\u20134523","journal-title":"Phys Rev E"},{"issue":"7","key":"189_CR7","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 JL (2006) Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans Mob Comput 5(7):893\u2013905. \nhttps:\/\/doi.org\/10.1109\/TMC.2006.104","journal-title":"IEEE Trans Mob Comput"},{"issue":"1","key":"189_CR8","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 (2011) A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents. Discret Event Dyn Syst 21(1):41\u201361. \nhttps:\/\/doi.org\/10.1007\/s10626-010-0092-5","journal-title":"Discret Event Dyn Syst"},{"key":"189_CR9","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1038\/nature06199","volume":"449","author":"AM Edwards","year":"2007","unstructured":"Edwards AM, Phillips RA, Watkins NW, Freeman MP, Murphy EJ, Afanasyev V, Buldyrev SV, da Luz MGE, Raposo EP, Stanley HE, Viswanathan GM (2007) Revisiting L\u00e9vy flight search patterns of wandering albatrosses, bumblebees and deer. Nature 449:1044\u20131048","journal-title":"Nature"},{"key":"189_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-34952-2_9","volume-title":"Internet of Things and Inter-cooperative Computational Technologies for Collective Intelligence","author":"Akihiro Fujihara","year":"2013","unstructured":"Fujihara A, Miwa H (2013) Homesick L\u00e9vy walk and optimal forwarding criterion of utility-based routing under sequential encounters. In: Proceedings of the internet of things and inter-cooperative computational technologies for collective intelligence 2013, pp 207\u2013231"},{"issue":"7","key":"189_CR11","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1109\/TMC.2013.160","volume":"13","author":"\u00d3 Helgason","year":"2014","unstructured":"Helgason \u00d3, Kouyoumdjieva ST, Karlsson G (2014) Opportunistic communication and human mobility. IEEE Trans Mob Comput 13(7):1597\u20131610","journal-title":"IEEE Trans Mob Comput"},{"issue":"1","key":"189_CR12","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 (2009) The hitting and cover times of random walks on finite graphs using local degree information. Theor Comput Sci 410(1):94\u2013100","journal-title":"Theor Comput Sci"},{"key":"189_CR13","unstructured":"Katada Y, Nishiguchi A, Moriwaki K, Watanabe R (2015) Swarm robotic network using Levy flight in target detection problem. In: Proceedings of the first international symposium on swarm behavior and bio-inspired robotics (SWARM2015), Kyoto, Japan, pp 310\u2013315"},{"key":"189_CR14","unstructured":"Koyama H, Namatame A (2008) Comparison of efficiency of random walk based search and Levy flight search. Technical Report\u00a020, Information Processing Society of Japan (in Japanese)"},{"key":"189_CR15","doi-asserted-by":"publisher","unstructured":"Kuhn F, Wattenhofer R (2003) Constant-time distributed dominating set approximation. In: Proceedings of the twenty-second annual symposium on principles of distributed computing, PODC \u201903. ACM, New York, pp 25\u201332. \nhttps:\/\/doi.org\/10.1145\/872035.872040","DOI":"10.1145\/872035.872040"},{"key":"189_CR16","unstructured":"L\u00e9vy P (1937) Th\u00e9orie de L\u2019addition des Variables Al\u00e9atoires. Gauthier-Villars"},{"issue":"1","key":"189_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1504\/IJSSC.2016.076568","volume":"6","author":"QT Minh","year":"2016","unstructured":"Minh QT, Yamada S (2016) Evaluations of commodity WiFi-based multihop access network for disaster recovery. IJSSC 6(1):3\u201311","journal-title":"IJSSC"},{"key":"189_CR18","doi-asserted-by":"publisher","first-page":"20170086","DOI":"10.1098\/rsif.2017.0086","volume":"14","author":"N Mizumoto","year":"2017","unstructured":"Mizumoto N, Abe MS, Dobata S (2017) Optimizing mating encounters by sexually dimorphic movements. J R Soc Interface 14:20170086","journal-title":"J R Soc Interface"},{"issue":"16\u201318","key":"189_CR19","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 (2010) The hitting and cover times of metropolis walks. Theor Comput Sci 411(16\u201318):1889\u20131894","journal-title":"Theor Comput Sci"},{"issue":"3","key":"189_CR20","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 SJ, Chong S (2011) On the levy-walk nature of human mobility. IEEE\/ACM Trans Netw 19(3):630\u2013643. \nhttps:\/\/doi.org\/10.1109\/TNET.2011.2120618","journal-title":"IEEE\/ACM Trans Netw"},{"key":"189_CR21","doi-asserted-by":"crossref","unstructured":"Shinki K, Nishida M, Hayashibara N (2017) Message dissemination using l\u00e9vy flight on unit disk graphs. In: IEEE 31st international conference on advanced information networking and applications (AINA\u201917), Taipei, Taiwan","DOI":"10.1109\/AINA.2017.102"},{"key":"189_CR22","unstructured":"Sugihara K, Hayashibara N (2017) Collecting data in sensor networks using homesick L\u00e9vy walk. In: The 20th international conference on network-based information systems, Toronto, ON, Canada, pp 779\u2013786"},{"issue":"3","key":"189_CR23","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 UB (2015) Novel sampling algorithm for human mobility-based mobile phone sensing. IEEE Internet Things J 2(3):210\u2013220","journal-title":"IEEE Internet Things J"},{"issue":"1","key":"189_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1504\/IJSSC.2016.076569","volume":"6","author":"N Uchida","year":"2016","unstructured":"Uchida N, Ishida T, Shibata Y (2016) Delay tolerant networks-based vehicle-to-vehicle wireless networks for road surveillance systems in local areas. IJSSC 6(1):12\u201320. \nhttps:\/\/doi.org\/10.1504\/IJSSC.2016.076569","journal-title":"IJSSC"},{"key":"189_CR25","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-20757-0_21","volume-title":"NETWORKING 2011","author":"Nicholas C. Valler","year":"2011","unstructured":"Valler NC, Prakash BA, Tong H, Faloutsos M, Faloutsos C (2011) Epidemic spread in mobile ad hoc networks: Determining the tipping point. In: Proceedings of the 10th international IFIP TC 6 conference on networking\u2014volume Part I, NETWORKING\u201911. Springer, Berlin, pp 266\u2013280. \nhttp:\/\/dl.acm.org\/citation.cfm?id=2008780.2008807"},{"key":"189_CR26","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1038\/381413a0","volume":"381","author":"GM Viswanathan","year":"1996","unstructured":"Viswanathan GM, Afanasyev V, Buldyrev SV, Murphy EJ, Prince PA, Stanley HE (1996) L\u00e9vy flight search patterns of wandering albatrosses. Nature 381:413\u2013415","journal-title":"Nature"},{"key":"189_CR27","doi-asserted-by":"crossref","unstructured":"Yang XS (2009) Cuckoo search via l\u00e9vy flights. In: Proceedings of world congress on nature & biologically inspired computing (NaBIC 2009), pp 210\u2013214","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"189_CR28","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-1-84882-983-1_15","volume-title":"Research and development in intelligent systems XXVI","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Firefly algorithm, L\u00e9vy flights and global optimization. In: Bramer M, Ellis R, Petridis M (eds) Research and development in intelligent systems XXVI. Springer, London, pp 209\u2013218"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-018-0189-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12065-018-0189-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-018-0189-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T17:34:41Z","timestamp":1589650481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12065-018-0189-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,21]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["189"],"URL":"https:\/\/doi.org\/10.1007\/s12065-018-0189-6","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"type":"print","value":"1864-5909"},{"type":"electronic","value":"1864-5917"}],"subject":[],"published":{"date-parts":[[2018,11,21]]},"assertion":[{"value":"30 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}