IJSTE - International Journal of Science Technology & Engineering | Volume 3 | Issue 04 | October 2016

ISSN (online): 2349-784X

Contact based Routing in Delay Tolerance

Network
Hardeep Singh
M. Tech. Student
Department of Computer Science & Application
Ch. Devi Lal University, Sirsa(Hr), India

Kuldeep Kumar
Assistant Professor
Department of Computer Science & Application
Ch. Devi Lal University, Sirsa(Hr), India

Abstract
Delay tolerant networks (DTNs) transport application data by creating a store and forward network where no infrastructure
exists. Although end-to-end connectivity may not be available between two nodes, DTN routing protocols instead take advantage
of temporal paths created in the network as nodes encounter their neighbors and exchange messages they have been asked to
forward. Todays Internet has been very successful at connecting communicating devices round the globe. It has been made
possible by using a set of protocols, which is widely known as TCP/IP protocol suite.DTN has different routing protocols for
transferring data. Here, performance of four routing protocols Epidemic, First contact, Direct delivery, and Prophet is evaluated
with Random way Point Model, Shortest Path Map-Based Movement Model, Map Route Movement Model under two different
scenarios and show best routing protocols among them. It is implemented in ONE simulator.
Keywords: Delay Tolerance Network, Models, ONE, Routing Protocols, Scenario
________________________________________________________________________________________________________
I.

INTRODUCTION

Delay Tolerant Networking (DTN) is an approach to computer network architecture that aims to address the technical issues in
heterogeneous networks that experience lack of continuous network connectivity. Delay Tolerant Networks (DTNs) enable data
transfer when mobile nodes are only intermittently connected DTNs represent a class of infrastructure-less wireless systems that
support the functionality of networks experiencing frequent and long lasting partitions. A DTN follows store carry - forward
mechanism to forward the data packets. Delay (or disruption) tolerant networking, provides an alternative approach to a
variety of emerging wireless applications and architectures that challenge the limitations facing the transport and
routing layers in the TCP/IP model. The traditional Internet model assumes low error rates, low propagation delays and,
most importantly, a steady end-to-end connection between any source/destination pair of nodes. However, a class of
challenged networks which violates one or more of these assumptions are becoming increasingly in demand and are being
underserved by the TCP/IP paradigm . Such networks mainly suffer from frequent temporary partitions and are referred to
as Intermittently Connected Networks (ICNs). This phenomenon is particularly apparent in rural areas such as wild
habitats and villages that lack basic infrastructures.
II. ROUTING PROTOCOL
In computer networks, one fundamental feature is the process of routing data from source to destination. Routing in delaytolerant networking concerns itself with the ability to transport, or route, data from a source to a destination, which is a
fundamental ability all communication networks must have. Delay- and disruption-tolerant networks (DTNs) are characterized
by their lack of connectivity, resulting in a lack of instantaneous end-to-end paths. There are many protocols in Delay Tolerance
Network. Here, following four protocols are studied
First Contact routing, node send a message randomly using any available contact. if none of the path is available then the
message wait for that particular path until become available and is assigned to first available contact. This result is only a
single copy of every message in the network.
Epidemic Routing protocol is the first introduced routing protocol in the history of DTN. In this flooding based forwarding
mechanism, Each and every node receives a message, replicate it and send it to the other nodes which encounter in the
network. Messages are stored in the buffer with its unique identifier called summary vector. When two nodes are
communicates with each other in the network, they exchange and compare their summary vector and transmit the messages
Spray and Wait routing protocol consists of two phases, spray phase and wait phase. In spray phase, Source node transmits
L no of copies of the message to the nodes which it encounters and goes to the waiting phase for the delivery confirmation.
In the wait phase, nodes are waiting for the delivery confirmation. Message is delivered to its destination by spraying L
copies of messages to the relay nodes.
MaxProp is probability based forwarding routing protocol. Each node set the probability of nodes to reach the destination
node with hop count. Nodes exchange values with their neighbour nodes. The probability value is used to calculate the

All rights reserved by www.ijste.org

96

Contact based Routing in Delay Tolerance Network

(IJSTE/ Volume 3 / Issue 04 / 017)

destination path cost. When the buffer is full, MaxProp selects the higher priority value of the message and transmit with
low hop count. MaxProp gives poor performance when nodes have small buffer space because of threshold value.
PROPHET (Probability Routing Protocol using History of Encounters and Transitivity)
PRoPHET works based on delivery predictability, transitivity and aging. If a node visited a location many times than there
is a possibility to visit that location again. In this method, to estimate the probabilistic metric called delivery predictability.
III. CONTACT-BASED ROUTING (CBR)

The primary goal of a DTN routing protocol is to obtain high message delivery ratios and good latency performance, while
maintaining low overhead. However, current flooding based protocols (e.g., MaxProp, RAPID) achieve high delivery ratios at
the expense of excessive network resource usage, and current quota-based protocols (e.g., Spray And Wait, Spray and Focus)
that reduce this overhead are not able to achieve comparable delivery rates. we present Contact-Based Routing, a quota-based
DTN routing protocol that achieves high delivery ratios comparable to flooding-based protocols, while maintaining low network
overhead. This improvement in delivery ratio is accomplished by taking advantage of the following observed mobility property
of certain networks: the future rate of node encounters can be roughly predicted by past data. This property is useful because
nodes that experience a large number of encounters are more likely to successfully pass the message along to the final destination
than those nodes who only infrequently encounter others. Many networks experience this phenomenon; examples include
disaster recovery networks, where ambulances and police tend to be more mobile and bridge more cluster gaps than civilians,
and vehicular-based networks, where certain vehicles take popular routes.
IV. ALGORITHM
This algorithm is used to measure the contact duration between nodes and also calculate the most frequent nodes. Contact
duration describes the amount of time that nodes may contact with Each other most frequent nodes are those nodes whose
contact is repeated multiple time with destination find the most frequent node and least frequent node, and give the high priority
to most frequent node and neglect the least frequent nodes.
Initialize all variables
n=total no. of nodes, cd=contact duration
Cr=Receiving Tine, Cs=Sending Time
TTL=Time to live
For each nodes check the message TTL time
If TTL is less than the counter, then
compute contact duration Cd=Cr-Cs
compute most frequent node
Most frequent node=largest count[i]
send the message to higher duration node or most frequent node
Else sent the message to another node
Drop te message
Stop
V. SIMULATION PARAMETERS
Table 1
Simulation Parameters
Parameter Description
Value
Simulator
One Simulator
Simulation Time
33000
Mobility Model
Shortest path First model
No. of groups
6
Buffer Size
5m
Waiting time
0,120
Time To Live
300 Min
Communication Interface
Bluetooth Interface
Speed
0.5-3.0
Routing Scheme
Epidemic Routing

All rights reserved by www.ijste.org

97

Contact based Routing in Delay Tolerance Network

(IJSTE/ Volume 3 / Issue 04 / 017)

VI. PERFORMANCE METRICS

Delivery Ratio
It is defined as the ratio of the number of messages actually delivered to the destination and the number of messages sent by the
sender.

Delivery Probability
Delivery Probability of number of messages that are correctly received by the receiver.
Latency Average
The latency measured here is the time that elapses between the creation of a message and its delivery at its destination.
Average Buffer Time
This is the average time that messages spend during its transit in the buffer nodes. This is not a metric of time spent in the buffer
by the messages delivered, but it is the average of the time spent by all messages delivered and abandoned or stranded in the
buffers of intermediate nodes.
VII. SIMULATION RESULTS AND DISCUSSION
Various Number of Nodes
Delivery Ratio

Fig. 1: CBR Delivery Ratio

Delivery Prob

Fig. 2: CBR Delivery Ratio

All rights reserved by www.ijste.org

98

Contact based Routing in Delay Tolerance Network

(IJSTE/ Volume 3 / Issue 04 / 017)

Latency Average

Fig. 3: Latency average and average buffer time is average in case of Epidemic Routing and CBR

Average Buffer Time

Fig. 4: Latency average and average buffer time is average in case of Epidemic Routing and CBR

In Fig 1 & 2 shows that the CBR delivery ratio and Probability is higher as compare to Epidemic routing and other case fig 3 & 4
shows that latency average and average buffer time is average in case of Epidemic Routing and CBR.
VIII. CONCLUSION
From the simulation results, we found that: the proposed case is better than Default Epidmic Routing because it has Maximum
Delivery Ratio, Delivery Probability, Minimum- Latency Average, Buffer Time Average. Comparing the performance of
Epidemic Routing and Proposed case scenario no. of nodes variation conclusion is made that performance of CBR is better than
Default case Routing. Another conclusion is that Shortest path first model is better than other models and routing Scheme gives
its best result in contact Based Routing
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]

Savita, Prof. D.K. Lobiyal, Location Information and Inter-Contact based Routing approach for Delay Tolerant Networks 3rd International Conference
on Recent Trends in Computing 2015 (ICRTC-2015)
Nirbhay K. Chaubey, Pooja Mistri, An Encounter Based Routing in Delay Tolerant Network (DTN): A Hybrid Approach, Vol. 4, Issue 5, May 2016
Chirag Patel, Nimit Modi, Age Encounter Based Routing Algorithm for Delay Tolerance Network, Vol-1 Issue-5 2015
Navdeep Kour, Gopal Sharma, PERFORMANCE EVALUATION OF ROUTING POLICY IN DELAY TOLERANCE NETWORK WITH VARIOUS
MOBILITY MODELS,27Aug.2016
Vijay Kumar Samyal, Sukvinder Singh Bamber and Nirmal Singh, Performance Evaluation of Delay Tolerant Network Routing Protocols, International
Conference on Advancements in Engineering and Technology (ICAET 2015)
Luming Wan, Feiyang Liu, Juan Zhang and Haibo Zhang, PERFORMANCE EVALUATION OF ROUTING PROTOCOLS FOR DELAY TOLERANT
NETWORKS
Deepak Kumar , Akshay Goel ,Encounter Based Routing in DTN: A Review, International Journal of Engineering Trends and Applications (IJETA)
Volume 2 Issue 4, July-Aug 2015
P. Manoranjan Kumar, S. Lakshmi Soujanya Asst Professor, Utility Based Routing in Mobile Networks, International Journal of P2P Network Trends
and Technology (IJPTT) -Volume3Issue7-August 2013

All rights reserved by www.ijste.org

99

Contact based Routing in Delay Tolerance Network

(IJSTE/ Volume 3 / Issue 04 / 017)
[9] Samuel C. Nelson, Mehedi Bakht, and Robin Kravets, EncounterBased Routing in DTNs
[10] R. J. D'Souza & Johny Jose, Routing Approaches in Delay Tolerant Networks: A Survey, 2010 International Journal of Computer Applications (0975 8887) Volume 1 No. 17
[11] Long Vu, Quang Do, Klara Nahrstedt, 3R:Fine-grainedEncounter-basedRoutinginDelayTolerantNetworks
[12] Paresh C. Patel, Nikhil N. Gondaliya, Encounter based Routing and Buffer Management Scheme in Delay Tolerant Network, International Journal of
Computer Applications (0975 8887) Volume 131 No.18, December 2015

All rights reserved by www.ijste.org

100