Price: Hybrid geographic and contact-based forwarding in delay-tolerant networks

被引:5
作者
Boc, Mathias [3 ]
Fladenmuller, Anne [2 ]
de Amorim, Marcelo Dias [2 ]
Galluccio, Laura [1 ]
Palazzo, Sergio [1 ]
机构
[1] Univ Catania, DIEEI, I-95125 Catania, Italy
[2] Univ Paris 04, L1P6 CNRS, UPMC, F-75252 Paris 05, France
[3] CEA, LIST Commun Syst Lab, F-91191 Gif Sur Yvette, France
关键词
Delay-tolerant networks; Store-carry-forward algorithms; Opportunistic communications; Mobility;
D O I
10.1016/j.comnet.2011.03.014
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Similarity-based techniques relying on contact patterns among nodes have shown to provide high delivery success rate when performing routing in delay-tolerant networks (DTN). Nevertheless, such approaches work well only when nodes exhibit high similarity values. In this paper, we propose Price (Periodicity-based Routing in Intermittently-Connected Environments), an agenda-based greedy forwarding scheme for DTNs that combines geographic-oriented forwarding with contact-based forwarding by relying packets according to predictable patterns of locations and contacts. We define the operation of Price and evaluate the performance of geographic forwarding under the framework of graph navigation to unveil a small-world phenomenon. We then gauge the performance of Price using a real-life mobility data set according to various well-known routing solutions such as Flooding, Prophet, Bubble Rap, and Wait. Simulation results show that Price largely outperforms other solutions, especially in terms of combined cost/delivery ratio. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:2352 / 2360
页数:9
相关论文
共 31 条
[1]  
[Anonymous], IEEE T WIRELESS COMM
[2]  
ASHBROOK D, 2003, J PERSONAL UBIQUITOU, V7
[3]  
BALASUBRAMANIAN A, 2010, IEEE ACM T NETWORKIN, V18
[4]  
BALAZINSKA M, 2003, P ACM USENIX MOBYSYS
[5]  
BOC M, 2007, P ACM CONEXT
[6]  
BOSE P, 1999, P INT WORKSH DISCR A
[7]  
BURGESS J, 2006, P IEEE INF
[8]  
CAPKUN S, 2001, P IEEE HICSS 34
[9]  
FERRARA D, 2005, P IEEE INF
[10]  
HENDERSON T, 2004, P ACM MOB