A reinforcement learning-based routing for delay tolerant networks

被引:39
作者
Rolla, Vitor G. [1 ]
Curado, Marilia [1 ]
机构
[1] Univ Coimbra, CISUC, Dept Engn Informat, P-3030290 Coimbra, Portugal
关键词
Delay tolerant routing; Multi-agent systems; Reinforcement-learning; Gossip algorithms;
D O I
10.1016/j.engappai.2013.07.017
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Delay Tolerant Reinforcement-Based (DTRB) is a delay tolerant routing solution for IEEE 80231 wireless networks which enables device to device data exchange without the support of any pre-existing network infrastructure. The solution utilizes Multi-Agent Reinforcement Learning techniques to learn about routes in the network and forward/replicate the messages that produce the best reward. The rewarding process is executed by a learning algorithm based on the distances between the nodes, which are calculated as a function of time from the last meetings. DTRB is a flooding-based delay tolerant routing solution. The simulation results show that DTRB can deliver more messages than a traditional delay tolerant routing solution does in densely populated areas, with similar end-to-end delay and lower network overhead. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2243 / 2250
页数:8
相关论文
共 34 条
[21]   Encounter-Based Routing in DTNs [J].
Nelson, Samuel C. ;
Bakht, Mehedi ;
Kravets, Robin .
IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, :846-854
[22]   The structure and function of complex networks [J].
Newman, MEJ .
SIAM REVIEW, 2003, 45 (02) :167-256
[23]  
Niekum S., 2011, Proceedings of the 13th annual conference companion on Genetic and evolutionary computation - GECCO, P177
[24]  
Perkins C., 2003, RFC 3561
[25]   Could Shakespeare Have Tweeted Hamlet? [J].
Predd, Joel B. .
IEEE SPECTRUM, 2011, 48 (08) :64-64
[26]   Gossip Algorithms [J].
Shah, Devavrat .
FOUNDATIONS AND TRENDS IN NETWORKING, 2008, 3 (01) :1-125
[27]  
Spyropoulos T., 2009, IEEE MOBILE COMPUTIN, P1
[28]  
Spyropoulos T., 2005, P ACM SIGCOMM 2005 W, P252
[29]   Efficient routing in intermittently connected mobile networks: The single-copy case [J].
Spyropoulos, Thrasyvoulos ;
Psounis, Konstantinos ;
Raghavendra, Cauligi S. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (01) :63-76
[30]  
Varga A., 2001, P EUR SIM MULT ESM 2