Analysis of Message Delivery Delay in Geographic DTN Routing

被引:4
作者
Matsui, Daiki [1 ]
Yamasaki, Yasuhiro [1 ]
Ohsaki, Hiroyuki [1 ]
机构
[1] Kwansei Gakuin Univ, Sch Sci & Technol, Sanda, Hyogo 6691337, Japan
来源
PROCEEDINGS 2016 IEEE 40TH ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE WORKSHOPS, VOL 1 | 2016年
关键词
Geographic DTN Routing; Analysis of Message Delivery Delay; Multiple Random Walks on a Graph;
D O I
10.1109/COMPSAC.2016.62
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, we derive the average message delivery delay in a geographic DTN routing with multiple mobile agents, where mobility patterns are given by random walk on a graph and message routing algorithm is the Random algorithm. A geographic DTN routing aims at realization of message delivery among multiple (generally, geographically-dispersed) geographic locations on a field without necessity of specific communication infrastructure by utilizing mobility of mobile agents. We model the behaviors of mobile agents as multiple random walks on a graph. Our analysis reveals the effect of system parameters - the number M of mobile agents on the field and the number K of message loads at a geographic location - on the average message delivery delay.
引用
收藏
页码:496 / 497
页数:2
相关论文
共 3 条
[1]  
Efremenko K, 2009, LECT NOTES COMPUT SC, V5687, P476, DOI 10.1007/978-3-642-03685-9_36
[2]  
Lovasz L, 1993, Combinatorics, Paul erdos is eighty, V2, P1
[3]   Performance Comparison of Geographic DTN Routing Algorithms [J].
Seki, Misako ;
Ogura, Kazumine ;
Yamasaki, Yasuhiro ;
Ohsaki, Hiroyuki .
IEEE 39TH ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE WORKSHOPS (COMPSAC 2015), VOL 3, 2015, :617-620