First Meeting Time Formula of Two Random Walkers toward Understanding Epidemic Information Dissemination

被引：0

作者：

Sakumoto, Yusuke ^{[1
]}

Ohsaki, Hiroyuki ^{[2
]}

机构：

[1] Tokyo Metropolitan Univ, Grad Sch Syst Design, Tokyo, Japan

[2] Kwansei Gakuin Univ, Grad Sch Sci & Technol, Nishinomiya, Hyogo, Japan

来源：

2017 IEEE 41ST ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 2 | 2017年

关键词：

epidemic information dissemination; random walk; spectral graph theory;

D O I：

10.1109/COMPSAC.2017.130

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We model the behavior of a mobile agent as a random walk on a network, and derive the formula of the expected time until two random walkers meet on the basis of the spectral graph theory. The validity of the derived formula is confirmed by the comparison with simulation results. We believe that our work contributes to understanding the property of epidemic information dissemination, and designing a mechanism for efficient dissemination in mobile ad hoc networks.

引用

页码：262 / 263

页数：2