A survey paper on routing in delay-tolerant networks

Puri, Parul; Singh, M. P.

doi:10.1109/iciscon.2013.6524206

Cited by 25 publications

(13 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A great body of work has been devoted to the area of DTN routing in the literature [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17]. DTN has many routing algorithms, but they hardly consider the energy constraint.…”

Section: Related Workmentioning

confidence: 99%

Multicopy Energy Aware Distance and Inter-Contact Delay Routing (EDICDR) Approach for Delay Tolerant Networks

Lobiyal¹

2019

IJCNIS

View full text Add to dashboard Cite

In this paper, we propose to optimize energy and overheads of a network by reducing the copies of messages in the network. The key idea behind the proposed scheme is to select the distance of encountered node from the destination to decide the relay nodes. This limits the number of relay nodes and thus reduces the communication energy and message overheads by producing lesser number of copies of the messages in the network. Further to maintain delivery of messages, the proposed protocol evaluates delivery probability of relay nodes. The measures of probability are inter-contact delay and variance in delay between the nodes. This probability is used to decide how many copies of a message is transferred to the encountered node. This further reduces the communication energy as well as message overheads. The simulation results show that our proposed strategy reduces message overheads and energy consumption as compared to the previous existing strategy while maintaining comparable delivery probability.

show abstract

Section: Related Workmentioning

confidence: 99%

Multicopy Energy Aware Distance and Inter-Contact Delay Routing (EDICDR) Approach for Delay Tolerant Networks

Lobiyal¹

2019

IJCNIS

View full text Add to dashboard Cite

show abstract

“…al. [40], concludes only that most protocols are designed to perform well only under a certain set of conditions, while Mangrulkar et. al.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Survey papers reviewed for this work include [20], [21], [23], [33], [35], [39], and [40]. While some of these papers predominantly summarize different theories and strategies behind routing decisions, others are grounded in real-world protocols.…”

Section: Literature Reviewmentioning

confidence: 99%

GAPR2: A DTN Routing Protocol for Communications in Challenged, Degraded, and Denied Environments

Killeen¹

2015

View full text Add to dashboard Cite

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington ABSTRACT (maximum 200 words)This thesis explores the foundation of modern Disruption Tolerant Protocols. It introduces a previously unpublished protocol with high probability of delivery called the Geolocation Assisted Predictive Routing (GAPR) Protocol and implements Vector Routing for The ONE Simulator. GAPR and Vector are then combined and implemented as GAPR2, a new protocol that provides delivery ratio near the best in the field while incurring a quarter of the overhead. GAPR2, GAPR, and Vector, along with the most widely referenced DTN routing protocols (Epidemic, MaxProp, and PRoPHETv2) are extensively simulated and their performance evaluated using three mobility models: the Helsinki scenario, a random mobility model, and a military scenario based on a real-world annual exercise. The custom-built military mobility model uses GIS topographical data and custom GIS overlays to implement a realistic scenario terrain. The performance of each protocol is evaluated.This thesis shows through simulation that DTN networks can be employed to enhance communications capabilities without expensive infrastructure or significant platform upgrades. Further, this thesis shows through large-scale simulations that such a network is capable of operating over hundreds of square kilometers and provides the simulation framework to test future routing protocols or equipment configurations. SUBJECT TERMS ABSTRACTThis thesis explores the foundation of modern Disruption Tolerant Protocols. It introduces a previously unpublished protocol with high probability of delivery called the Geolocation Assisted Predictive Routing (GAPR) Protocol and implements Vector Routing for The ONE Simulator. GAPR and Vector are then combined and implemented as GAPR2, a new protocol that provides delivery ratio near the best in the field while incurring a quarter of the overhead. GAPR2, GAPR, and Vector, along with the most widely referenced DTN routing protocols (Epidemic, MaxProp, and PRoPHETv2) are extensively simulated and their performance evaluated using three mobility models: the Helsinki scenario, a random mobility model, and a military scenario based on a real-world annual exercise. The custom-built military mobility model uses GIS topographical data and custom GIS overlays to implement a realistic scenario terrain. The performance of each protocol is evaluated.This thesis shows through simulation that DTN networks can be employed to enhance communications capabilities without expensive infrastructure or significant platform upgrades. Further, this thesis shows through large-scale simulations that suc...

show abstract

“…But in OppNet, route establishment is done dynamically as per the availability of nodes in the network between source and destination [5,6]. In literature, the available routing protocols for OppNets could be classified as flooding-based and forwarding-based.…”

Section: Literature Surveymentioning

confidence: 99%

“…These nodes will again create a directional arc to destination and repeat the below mentioned steps to find next suitable relaying node for data delivery. Neighbours() (4) for m ϵ neighbours do (5) if distance(m, Ā) < distance(T) then (6) setofRelayNode ← m (7) for s1 ϵ setofRelayNode do (8) if d is in range of s1 then (9) complete transmission to destination (10) else (11) s = s1 (12) goto step 3 (13) end if (14) end for (15)end for…”

Section: A Threshold Distance Parameter T Is Set Between the Nodementioning

confidence: 99%

Efficient Dissemination Technique for Opportunistic Networks

Gupta¹

2018

IJCA

View full text Add to dashboard Cite

Opportunistic Network (OppNet) provides intermittent connectivity in infrastructure less environment without information loss. Intermittent connectivity can be defined as alliance of nodes in a network for communication between them. To establish a routing path in such a heterogeneous environment is a challenging task. The opportunistic networks are also known as Delay Tolerant Network (DTN) as in these types of network, transmission delay associated in relaying data could be very high. In this paper, an efficient data dissemination technique has been introduced to send the information from a Source to Destination. The results generated during simulation for performance metrics such as message delivery ratio, number of data messages generated and average delay are showing the efficiency of the proposed work.

show abstract

A survey paper on routing in delay-tolerant networks

Cited by 25 publications

References 14 publications

Multicopy Energy Aware Distance and Inter-Contact Delay Routing (EDICDR) Approach for Delay Tolerant Networks

Multicopy Energy Aware Distance and Inter-Contact Delay Routing (EDICDR) Approach for Delay Tolerant Networks

GAPR2: A DTN Routing Protocol for Communications in Challenged, Degraded, and Denied Environments

Efficient Dissemination Technique for Opportunistic Networks

Contact Info

Product

Resources

About