ハヤシバラ ナオヒロ   HAYASHIBARA NAOHIRO
  林原 尚浩
   所属   京都産業大学  情報理工学部 情報理工学科
   職種   准教授
発表年月日 2019/03/28
発表テーマ Lévy Walk on Graphs: Message Dissemination and Uninformed Search
会議名 The 33rd International Conference on Advanced Information Networking and Applications (AINA-2019)
国名 日本
開催地名 Matsue, Shimane
開催期間 2019/03/27~2019/03/29
会議区分 国際会議
講演区分 基調講演
単独共同区分 単独
発表者・共同発表者 Naohiro Hayashibara
概要 Random walks play an important role in computer science, spreading a wide range of topics in theory and practice, including networking, distributed systems, and optimization. Particularly, Lévy walk, a family of random walks, has attracted attention in recent years in the context of mobile ad-hoc networks, delay-tolerant networks, opportunistic communication, and global optimization problems. The goal of this keynote is to introduce Lévy walk and its variants and presenting the challenge on Geometric graphs, especially Unit disk graphs, regarding message dissemination and uninformed search by using Lévy walk. The results on both message dissemination and uninformed search show that Lévy walk is quite efficient compared to random walks because of its ballistic trajectory. They also clarify the relationship between the efficiency of message dissemination and uninformed search, and the average degree/the diameter of the graphs.