Comparison of Movement Model in DTN by

Varying the Buffer Space

MANSI UPPAL1, JYOTI CHAUDHARY2
1

M.TECH. Scholar, TIT&S BHIWANI, INDIA

mnsuppal@gmail.com

Assistant Professor, Department of Computer Engineering, TIT&S BHIWANI, INDIA

Jyotiseptember20@rediffmail.com

Abstract-- A class of wireless network is represented by

Delay Tolerant Networks (DTNs) that experience
regular and long lasting partitions due to light
distribution of nodes in the network topology. In DTN,
store-carry-forward mechanism is used for packets
routing. In this paper, for performance evaluation three
popular routing protocols are used namely; Epidemic,
Direct Delivery and First contact. The performance of
these routing protocols generates a new subarea
movement model based on the splitting of network
simulation area.

Keywords-- Delay Tolerant Network (DTN), The ONE

(Opportunistic Network) simulator, Movement Models,
Routing protocols, TTL (time to live).

I.

INTRODUCTION

Delay Tolerant Network (DTN) represents a class

of wireless networks that has no connected path
between a source and the destination. The network is
partitioned into several sub-networks in DTN. DTNs
represent a class of wireless systems with no
infrastructure and support the functionality of
networks experiencing recurrent and long lasting
partitions. Delay tolerant networking [1] has received
major attention in recent years. Since in DTN, the
destination path is not connected, so the main
purpose here is to find the intermediate nodes for
routing the packets [2, 3]. When two nodes come in
contact with each other, they may exchange the
packets and such an occasion is known as encounter.
In DTN, store-carry-forward model is used for packet
delivery. According to this model, each node along
the path receives the packets from the preceding node
as it comes in contact with that particular node. That
node stores the packet temporarily until it encounters
next intermediary node. And when encounter occurs
the packet is provided to next intermediate node. And
up to destination same procedure is followed [4, 5].

Routing and forwarding of data packets in DTN is a

thought-provoking task because of the uncertainty of
elasticity and irregular behavior of the nodes [6].
There are several issues in Delay Tolerant Networks
that needs to be addressed. The most vital factor is
encounter schedule, capacity of network, storage
capacity, energy etc. [7]. DTNs may be characterized
by combination of any of the following:

Irregular connectivity: Inconsistent path

between the source and destination.
Unbalanced data rates: The Internet does
support some forms of unbalanced bidirectional data, as in cable TV or
unbalanced DSL access.
High error rates: In DTN error rate over
the link is quite high.
Indistinct
mobility
patterns:
Contrasting the case with public bus
services that maintain fixed routes,
many DTN applications doesnt know
future behavior of a node.
This paper is organized as follows. Section 2 presents
the background and related work that are important
for the understanding of DTN. In Section 3, the
simulation setup and various norms used to fake
different routing protocols of DTN are described.
Section 4 is devoted to the simulation results.
Section5 concludes the work and provides some
insights on future work.
II.

BACKGROUND AND RELATED WORK

Outline of three routing protocols for DTN,

namely Epidemic [8], Direct delivery routing [9]
and First contact [10], have been described.
1) Epidemic
Vahdat & Becker [8] proposed one of the simplest
and earliest routing schemes for DTN. It is a
flooding-based scheme. In this routing scheme , to

increase the message delivery rate, various copies of

message is send by source node to various nodes in
hope that at least one route message will reach to
destination node. In this routing scheme, maximum
no of resources are used like high bandwidth etc.

2) Direct Delivery Routing

Perhaps the earliest manifestation of direct-contact
based delivery schemes for DTNs is the well-known
info - station model [9]. Data delivery is one of the
simplest approaches that work when source and
destination are in direct contact. In other words, the
source waits for its radio range in the destination and
then straight delivers the packet to the same. In this
scheme no additional copy of data is made as well as
no additional resources are used. However, some
limitations are that source and destination may never
have direct contact with each other and sometimes
the delivery delay can be extremely high.
3) First Contact

5 MB

TTL

100 sec

Cell size

5m

Reports

Message size

500KB 1MB

The setting and configurations used for varying the

fields are as follows:
The following performance metrics are reflected for
comparative analysis of the routing protocols:

In this routing, nodes are randomly selected from

various available nodes and messages are sent to
those nodes. In case no node available then node
have to wait until nodes come in the range of that
node.
III.

Buffer size

SIMULATION SETUP

In this work, ONE simulator [11] is used for the

simulation. Three different types of movement
models present in ONE simulator, namely Random
Waypoint [12], Map Based Movement [13], Shortest
Path Map Based Movement [13], have been used for
simulation. In this work, the nodes are assumed
portable in nature. The various simulation parameters
taken in this work are given as per below table:

TABLE 1: Simulation Parameters

Simulation time

30000 sec

Simulation area

(4500*3400m) Helsinki
downtown area

Bt_interface_transmit_speed

250kbps

Bt_interface_transmit_range

10kbps

Number of groups

Throughput: Ratio of messages delivered to

destination and messages created by source
node.
Message delivery probability: Messages
probability that are correctly received by
the destination within a given time period.
Average hop count: It is average number
of hops between source and destination
nodes.
Overhead ratio: It is defined as:
(No. of Relayed Messages No. of
delivered messages)/ (No of Delivered
Messages)
Average buffer time: Average time for
which messages stayed in buffer at each
node.
Latency average: It is defined as the
average message delay from creation to
delivery.

IV.

SIMULATION
RESULTS
VARYING BUFFER SPACE

BY

When the buffer space is varied, the graphs obtained

for various performance matrices are given as per
below:
1) Delivery Probability
The fig 4.1 shows how the delivery probability of the
messages varies when the buffer space is varied for
cluster movement model and the proposed movement
model. It is clear from the figure that the delivery
probability of the packets is higher in proposed
movement model.

3) Throughput
The fig 4.3 shows the graph between throughput and
number of nodes. The graph depicts that the
throughput is higher in case of the proposed
movement model.

Fig 4.1 Buffer space v/s delivery probability

2) Drop Rate of messages

The fig 4.2 shows the graph between drop
messages and number of nodes for the
movement model and proposed movement
The figure shows that the drop rate is higher
of previous movement model and lesser
proposed work.

rate of
cluster
model.
in case
in the

Fig 4.3 Buffer space v/s Throughput

4) Overhead ratio
The fig 4.4 shows the graph between the number of
nodes and the overhead ratio. The graph shows that
the overhead ratio for the proposed subarea based
movement model is lesser then the previous cluster
movement model.

Fig 4.2 Buffer space v/s drop rate

Fig 4.4 Buffer space v/s overhead ratio

V.

CONCLUSION AND FUTURE WORK

The presented work is about to define a subarea

based movement that is based on splitting of the
network simulation area. When the proposed subarea
based movement model is compared with the
previous cluster movement model, it shows that the
delivery probability of the packets and the throughput
is higher in the proposed movement model. And the
drop rate of messages and the overhead ratio in case
of the proposed subarea movement model is lesser as
compared to the cluster movement model. Thus the
simulation results show that the proposed subarea
based movement model is better than the previous
cluster movement model.
REFERENCES
[1] Dimitris Vardalis and Vassilis Tsaoussidis, Exploiting the
potential of DTN for energy-efficient inter- networking, 2014
Elsevier
[2] Nelson I. Dopico, lvaro Gutirrez and Santiago Zazo.
Performance analysis of a delay tolerant application for herd
localization. 2011 Elsevier B.V
[3] Seunghun Cha, Elmurod Talipov and Hojung Cha. Data
delivery scheme for intermittently connected mobile sensor
networks. 0140-3664/$, 2012 Elsevier.
[4] Shyam Kapadia, Bhaskar Krishnamachari and Lin Zhang.
Data Delivery in Delay Tolerant Networks: A Survey.
[5] Haigang Gong and Lingfei Yu. Study on Routing Protocols for
Delay Tolerant Mobile Networks. Volume 2013, Article ID
145727, Hindawi Publishing Corporation.
[6] Philip Ginzboorg, Valtteri Niemi and Jrg Ott, Fragmentation
algorithms for DTN links, 2012 Elsevier

[7] Movement Models Based Performance Comparison of Routing

Protocols in Delay Tolerant Networks, Vinit Kumar1, Anita
Singhrova, International Journal of Innovative Research in
Science, Engineering and Technology.
[8] Vahdat, A. & Becker, D. (2000), Epidemic routing for
partially-connected ad hoc networks, Proceedings of the 2005
ACM, New York, NY, USA, pp. 229236.
[9] Frenkiel, R., Badrinath, B., Borres, J. & Yates, R. (2000), The
info - stations challenge: balancing cost and ubiquity in delivering
wireless data, Personal Communications, IEEE 7(2): 66 71.
[10] Performance Analysis of Various Movement Models in DTN
Heena, Vishal Garg IOSR Journal of Computer Engineering
(IOSR-JCE) e-ISSN: p-ISSN: 2278-8727, PP 48-52
[11] Ari Kernen, Jrg Ott, and Teemu Krkkinen, The ONE
simulator for DTN protocol evaluation, In Proceedings of the 2nd
International Conference on Simulation Tools and Techniques,
Simutools 09, ICST, Brussels, Belgium, Belgium, 2009. ICST
(Institute for Computer Sciences, Social-Informatics and
Telecommunications Engineering).
[12] C. Bettstetter, H. Hartenstein, and X. Perez-Costa,
Stochastic properties of the random waypoint mobility model:
Epoch length, direction distribution and cell change rate, In
MSWIM 02, ACM Press, 2002
[13] Vasco N. G. J. Soares, Joel J. P. C. Rodrigues, Farid
Farahmand, Impact Analysis of the Shortest Path Movement
Model on Routing Strategies for VDTNs in a Rural Region,
Instituto de Telecomunicaes, Portugal, in the framework of the
Project VDTN Lab.