A Performance Comparison of Delay-Tolerant Network Routing Protocols

被引：67

作者：

Abdelkader, Tamer ^{[1
]}

Naik, Kshirasagar ^{[2
]}

Nayak, Amiya ^{[3
]}

Goel, Nishith ^{[4
]}

Srivastava, Vineet ^{[4
]}

机构：

[1] Ain Shams Univ, Dept Informat Syst, Cairo, Egypt

[2] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada

[3] Univ Ottawa, Sch Informat Technol & Engn, Ottawa, ON K1N 6N5, Canada

[4] Cistech Ltd, Matthews, NC USA

来源：

IEEE NETWORK | 2016年 / 30卷 / 02期

关键词：

D O I：

10.1109/MNET.2016.7437024

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Networks that lack continuous end-to-end connections among their nodes due to node mobility, constrained power sources, or limited data storage space are called DTNs. To overcome the intermittent connectivity, DTN nodes store and carry the data packets they receive until they come into communication range of each other. In addition, they spread multiple copies of the same packet on the network to increase the delivery probability. In recent years, several routing protocols have been developed specifically for DTNs. These protocols vary in the number of copies they spread and the information they use to guide the packets to their destinations. There have been some reviews of those protocols, but no performance comparison has been conducted. In this article, we study four well-known DTN routing protocols: EPIDEMIC, Spray-and-Wait, PROPHET, and MAXPROP. We introduce a procedural form to present the protocols. We measure the performance of the protocols in terms of packet delivery, delivery cost, and average packet delay. We compare the protocols' performance together with the results of optimal routing using real-life scenarios of vehicles and pedestrians roaming in a city. We conduct several simulation experiments to show the impact of changing buffer capacity, packet lifetime, packet generation rate, and number of nodes on the performance metrics. The article is concluded by providing guidelines to develop an efficient DTN routing protocol. To the best of our knowledge, this work is the first to provide a detailed performance comparison among the diverse collection of DTN routing protocols.

引用

页码：46 / 53

页数：8

共 16 条

[1]

Abdelkader T., 2010, 2010 International Computer Engineering Conference (ICENCO 2010), P16, DOI 10.1109/ICENCO.2010.5720418

[2] SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping [J].