DTN PROTOCOL DESIGN

A Minor Project Report Submitted

in Partial Fulfillment of the requirements
for the degree of

MASTER OF TECHNOLOGY
in

COMPUTER SCIENCE & ENGINEERING

(SPL.IN INFORMATION SECURITY)
Submitted By

Twarita Bera(Admission No.-16MT001463)

Under the Guidance of

Dr. Rajendra Pamula

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

INDIAN INSTITUTE OF TECHNOLOGY (INDIAN SCHOOL OF MINES), DHANBAD

DHANBAD – 826004

INDIA
 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

INDIAN INSTITUTE OF TECHNOLOGY (INDIAN SCHOOL OF MINES), DHANBAD

CERTIFICATE

This is to certify that the Minor Project Work entitled “Studies on Fractal Dielectric
Resonator Antenna” submitted by TWARITA BERA (Admission No. 16MT001463) has
been carried out under the guidance & supervision of Dr.RAJENDRA PAMULA. The
project is approved for submission towards partial fulfillment as required for the award of
degree of MASTER of TECHNOLOGY in COMPUTER SCIENCE & ENGINEERING
(2017-2018) from Indian Institute of Technology (Indian School of Mines), Dhanbad
(Jharkhand).

Dr.Rajendra Pamula

Assistant Professor
IIT-ISM Dhanbad
 ACKNOWLEDGEMENT

It is with immense gratitude that I acknowledge the support and help of my supervisor,
Dr. Rajendra Pamula, Assistant professor of Computer Science & Engineering
Department at IIT-ISM, Dhanbad, for his valuable guidance during the course of the
project. I am highly indebted to him for constantly encouraging me by giving his critics
on my work. I am grateful to him for having given me the support and confidence. His
trust and support inspired me the most in making right decisions and I am glad to work
with him.

Twarita Bera
 ABSTRACT

Continuous network connectivity has always been a significant issue in the area of
networks.DTN provides architecture that casts upon the problem of discontinuity in the
network and tries to solve it. Such dropping of connectivity is found in tremendous
terrestrial atmosphere and planetary systems.Instead of direct delivery of data from
source to destination through a physical medium(coaxial cables,wires)DTN uses the help
of intermediate nodes that can relay messages from one node to another through
replication to avoid data loss.But these nodes may act selfish to save their energy,battery
power,bandwidth and so on and may not agree to forward data packets which leads to
lack of co-operation and hence hampers transferability in the network.To combat this
selfish behaviour various incentives or rewards have been proposed to these nodes such
they assist with each other and make the network communication smoother.
 TABLE OF CONTENTS
Page No.
Chapter 1
1.1 Introduction

1.2 Delay Tolerant Networks(DTN)

 Basic Characteristics
 Applications
 Challenges
 Areas of Research
1.3 Basic Routing Protocols
• Epidemic
• Prophet
• Maxprop
• Spray and Wait
Chapter 2
2.1 Related Works
2.2 Proposed Work

Chapter 3
3.1 Performance Evaluation
3.2 Results
3.3 Parameters
3.4 Result Comparison
3.5 Graphs
Chapter 4
4.1 Future Scope
4.2 Conclusion
4.3 References
 Chapter 1
1.1 Introduction
Delay Tolerant Networks are special purpose networks which seeks to enhance mobility
of nodes thus increasing interoperability.Traditionally end to end path communication
was used for delivering packets which was to be maintained throughout the duration of a
communication session.This arrangement had many drawbacks such as disruption of the
channel,sudden loss of data packets,attacks of third party and many more.So DTN chose
intermediate nodes as means of data transfer tool which uses the store -carry- forward
method.DTN cocentrates on reliable message routing rather acessing the best node to
guarantee delivery of the message.Nodes while moving carries the messages hop by hop
and replication of the packets is done at the same time.While coming contact with other
node it shares the message and also retains a copy of it.The Bundle Protocol in the
Bundle layer of DTN allows contiguous data blocks instead of individual data to be
transmitted through the network for faster communication.It has custody based
retransmission alongwith opportunistic connectivity that is able to interoperate with
intermittent connectivity.The bundle protocol agent of each node is expected to provide
the following services to the node's application agent:

 commencing a registration .

 terminating a registration.

 switching a registration between Active and Passive states.

 transmitting a bundle to an identified bundle endpoint.

 canceling a transmission.

 polling a registration that is in the passive state.

 delivering a received bundle.

A delay-tolerant network requires hardware that can store large amounts of data. The
system must be able to survive extended power loss and system restarts. It must also be
immediately accessible at any point of time. The data stored on these system must be
organized and prioritized by software that ensures accurate and reliable store-and-forward
functionality.DTN has high efficiency latency,reusability of networks and also good
security where integrity and authentication are well maintained.It gives high priority
messages more chances to communicate thus keeping good quality service.So,DTN gives
a motive to prevail in the communication zone of the networks where the distance is
relatively large and beyond human reach.

Apart from the various usefulness there are number of challanges to face in the DTN
networks.

 Nodes that demand reward in forwarding the messages may not be pleased with it
and thus will disagree to communicate further which leads to lack of co-
operation in the networks.

 Replication of messages may guarantee that there will be no loss of original

messages but with huge no.of copies of the messages leads to traffic and lowers the
performance overhead of the entire network.

 Multicast security is another problem where there is no restriction of registration of

nodes at end point.This may lead to attacks on any node and leakage of
information to the third party.

 Only secret or public keys are used for exchange of information in the nodes but
there is no combination of it.Any intruder may know either of the keys and steal
the information .So,key management is also an issue to it.
1.2 Delay Tolerant Networks(DTN)

 Basic Characteristics

1. Hop-by-hop transfer of a message in the absence of end-to-end communication

path.

2. Storing a message, carrying it along often for a long time, and transmitting during
a subsequent contact with another node.

3. Replication of a message rather than forwarding it.

4. Experiences high message delivery latency, typically in the order of hours.

 Applications

Although DTNs were originally conceived for interplanetary use, they may have a
far greater number of applications on Earth. Here is a short summary of the
possible applications:

Space Agencies: International Space Station communication (currently operational

for research), interplanetary communication, future space-debris monitoring.

Military and Intelligence: Mobile ad-hoc networks (MANETs) for wireless

communication and monitoring, cargo tracking, search and rescue communication,
unmanned aerial vehicle (UAV) communication and control.

Commercial: Cargo and vehicle tracking (by road, rail, sea, and air), in-store and
in-warehouse asset tracking, data transactions (e.g., financial, reservations),
agricultural crop monitoring, processing-plant monitoring, communication in
underground mines.

Public Service and Safety: Security and disaster communication, search and
rescue communication, humanitarian relief monitoring, smart-city event-response,
smart transportation networks, smart electric-power networks, global airport-traffic
control, infrastructure-integrity monitoring, unmanned aerial vehicle (UAV)
communication and control, remote learning.
Personal Use: Personal monitoring and communication in wilderness and urban
areas, fire-and-forget text messaging.

Environmental Monitoring: Animal migration, soil properties and stability,

atmospheric and oceanographic conditions, seismological events.

Engineering and Scientific Research: Network subject-matter experts, academic

research by faculty and students.

Undersea Communication: Submarines, unmanned undersea vehicles, oil and

mining undersurface sensors. Beneath the surface of water, only sound is effective
for communication over distance, and the speed of sound in water is only about 1
km/sec.

 Challenges

Key Management The major open issue in DTN security is the lack of a
delay-tolerant method for key management. We are at the stage where we
only really know how to use existing schemes, which ultimately require an
on-line status checking service or key distribution service which is not
practical in a high delay or highly disrupted environment. The only generally
applicable schemes we currently have are basically equivalent to shared
secrets or else irrevocable public key (or certificate based) schemes. Clearly,
this is an area where more research work could produce interesting results.

Handling Replays In most networking scenarios, we either wish to

eliminate or else dramatically reduce the probability of messages being
replayed. In some DTN contexts this will also be the case －particularly as
replaying a (e.g., authenticated, authorized) message can be a fairly straight
forward way to consume scarce network resources. The element of delay in
DTNs also complicates handling replays. Replay detection schemes
generally depend on noting some unique aspect of messages (via digesting
of some message fields) and then keeping a list of (the digests of) recently
seen messages. The problem in the DTN context is the "recently seen" part
of such replay detection algorithms, since maintaining a list for say 30 days
would be fairly resource intensive, but might be required if latencies are of
that size. So the most obvious ways to protect against replays are
problematic. The result is that the extent to which we can, or should, define a
generic DTN replay detection scheme is hard to determine and at this point
remains an open DTN security issue.

Traffic Analysis A general traffic analysis protection scheme is probably

not, in any case, a realistic goal for DTNs, given their tendency to be
resource-scarce and there have been no calls for a generic approach to this
problem. However, for some disruption tolerant networks, hiding traffic
(e.g., the existence of a signal from a sensor net) may be a very important
security requirement. So, the first open issue here is the extent to which there
is a real need for a generic scheme for protection against traffic analysis. If
there were, then the second open issue is how to define such a scheme to be
delay and disruption tolerant and which also doesn’t consume too many
resources. Finally, traffic analysis protection may be left as a local matter for
the underlying network layers.

Routing Protocol Security DTN routing protocol security must clearly be

in our list of open issues. However, if a putative DTN routing protocol was
to use either the Bundle protocol or LTP, it could clearly make use of their
existing security features. The security mechanism proposed for metadata
blocks has been generalized for other non-payload blocks and may provide a
solution to some of these issues.

Multicast Security Within DTN, there is currently no mechanism defined

for restricting which nodes may register in a “multicast” or “anycast”
endpoint. The security architecture currently does not address the security
aspects of enabling a node to register with a particular multicast or anycast
EID. Without a capability to restrict the registration of nodes in multicast or
anycast endpoints, any node may register in such an endpoint and thereby
receive traffic sent to that endpoint. In addition, even though an endpoint
may be a singleton endpoint, meaning that it is not permitted to contain more
than one node, it may be possible for a second or more node to register in a
singleton endpoint and receive bundles that are sent to that endpoint if the
bundles are routed in such a way that they are forwarded to that node (e.g.,
using flood routing).
 Areas of Reasearch

Routing

The design of the most efficient routing protocol for DTNs/OMNs still remains an open
problem. The key challenge of routing is to ensure as many number delivery of of
messages as possible using different available information, if at all, under diverse
scenarios. In the recent past, several routing protocols have been proposed that offer
interesting performance profile.
Congestion

Congestion mitigation in DTNs is particularly interesting and difficult due to its divergent
characteristics from the traditional Internet. In particular, unlike the Internet,high latency
in DTNs makes propagation of congestion indicator through the network impractical.
Similar to other networks, research on congestion in DTNs have focused on two
approaches—congestion avoidance and control.

Energy

Mobile devices are key components in DTNs.In most of the cases mobile devices have
limited battery and they have to always standby to prepare store-carry-forward services.
How to improve the energy efficiency of these communications given the tradeoff at the
moment between energy consumption and data forwarding performance becomes an
important research topic.Some have given ideas like a wake up mechanism where mobile
devices will only work when it is desired.This would give a high data forwarding
probability.

Security

DTNs are vulnerable to many malicious actions and bring a number of new security
challenges. The use of intermediate nodes as relays offers extraordinary opportunities
for security attacks, including compromising information integrity, authenticity, user
privacy and system performance. The use of specific routing mechanisms including
flooding-based ones may even increase the risks associated with inserting false
information into the network. Extra traffic injected by malicious nodes creates another
serious threat due to resource scarcity of DTNs in some application scenarios.
Unauthorized access and utilization of DTN resources for specific malicious actions are
other serious concerns. It is important to note that the research on DTN security is more
challenging compared to conventional mobile ad hoc networks due to its unique security
characteristics

1.3 Basic Routing Protocols

Epidemic

The epidemic routing protocol (and similar protocols in distributed systems) is modeled
after the spreading of epidemic diseases in real life.With this analogy, a node consisting
of a message, m, may be considered as already infected. Now, when such a node comes in
contact with another node not having that message, the former node transmits m to the
latter and thereby, infects it.
Each packet generated is assigned a unique ID that is associated with it and all its copies
until they are dropped or delivered to the destination. The list of all the packets’ IDs ina
node’s buffer is called the summary vector. When two nodes meet, they exchange their
summary vectors. All data packets that are stored in one node and not in the other are
ordered ona first-come first-served basis to be transmitted to the other node. Packet
transfer then starts until the contact duration ends. Assuming that the contact duration is
long enough totransfer all the uncommon packets, the two nodes will have the same
packet list after their contact ends. Given unlimited buffersize, long enough contact
durations, unlimited lifetime for the data packets, and a non-infinite partitioned network,
EPIDEMIC routing guarantees the delivery of all the packets to their destinations. In
addition, it guarantees the lowest end-to-enddelay, because each packet is routed on all
possible paths from the source, and one of the copies will be on the shortest path.
1: Procedure Name: OnContact
2: Input: node a, node b, integer ContactDuration
3: DropExpiredPackets(a,b)
4: ExchangeSummaryVector(a,b)
5: if ContactDuration > 0 then
6: pkt=GetPacket(a)
7: if pkt then
8: if NotReceivedBefore(pkt,b) then
9: if IsDestination(pkt,b) then
10: SendPacket(pkt,a)
11: ConsumePacket(pkt,b)
12: else
13: SendPacket(pkt,a)
14: StorePacket(pkt,b)
15: end if
16: ContactDuration=ContactDuration-size(pkt) Fig:1
17: end if
18: end if
19: end if

Prophet
The protocol estimates a node metric called delivery predictability, P(a, b), at each node
a for each destination b. When two nodes meet, they update their delivery predictability
toward each other. Then the two nodes exchange their delivery predictability list toward
other nodes to each other to update their delivery predictability toward the other nodes
using the following equations.

Direct Update:

P(a, b) = P (a,b)old + (1 – P(a,b )old )Pinit

where P (a,b) old is the value of P(a,b) before updating, Pinit belongs to [0,1]is an
initialization constant. This update is done when the two nodes a and b come into direct
contact with each other.

Transitive Update:

P(a, b) = P (a,b)old + (1 – P(a,b )old )P(a,c)P(c,b)beta

where beta belons to [0,1] is the transitivity constant which reflects the impact of
transitivity on the delivery predictability. This equationupdates the delivery predictability
of node a toward node a through the transitive contact between a and c.

Aging:

P(a, b) = P (a,b)old g^k

where g belongs to [0,1] is the aging constant, and k is the number of time units that have
elapsed since the last time the metric was aged. This equation decreases the delivery
predictability by the time passed without direct between the two nodes a and
b.PROPHET provides a partial guiding toward thedestinationby tracing the contacts
between nodes and assigningweights to these contacts whether directly or through
intermediate nodes. Therefore, PROPHET is expected to outperform the blind protocols
in delivery ratio. On the other hand, it is expected that the average packet delay may
increase due to waiting for a good next node in the path. A pseudo-code for PROPHET is
provided below:-

1: Procedure Name: OnContact

2: Input: node a, node b, integer ContactDuration
3: DropExpiredPackets(a,b)
4: ExchangeSummaryVector(a,b)
5: UpdateDeliveryPredictability()
6: if ContactDuration > 0 then
7: pkt=GetPacket(a)
8: if pkt then
9: if NotReceivedBefore(pkt,b) then
10: if IsDestination(pkt,b) then
11: SendPacket(pkt,a)
12: ConsumePacket(pkt,b)
13: else
14: DPn1=DeliveryPredictability(pkt,a)
15: DPn2=DeliveryPredictability(pkt,b)
16: if DPn2 > DPn1 then
17: SendPacket(pkt,a)
18: StorePacket(pkt,b)
19: endif
20: endif
21: ContactDuration=ContactDuration-size(pkt)
22: endif
23: endif
24: endif
 Fig:2

Maxprop
The MAXPROP protocol proposed in [10] estimates a node metric, P(a, b), similar to
PROPHET. When two nodes a and b meet, they strengthen the link between each other
by addinga constant a which is set to equal 1 in the protocol. Then the two nodes divide
their delivery predictability towards all the nodes including each other by 1 + a so that the
sum of alldelivery predictability remains 1.
P(a,b) = P (a,b)old + alpha
P(a,c) = P (a,b)old /(1 + alpha)
where alpha belongs to [0,1] is the updating constant, which is set to 1 in their work, and
c is every other node including b.The node metric is used only when the hop count of the
packet is greater than a certain threshold. The main contribution of MAXPROP is in its
buffer management. Packets are sorted according to their hop count if the hop count is
below a certain threshold. Otherwise, packets are sorted with their delivery predictability.
In this way, MAXPROPfavors packets with lower hop count to spread in the network.
The pseudo-code for MAXPROP is shown in the following algorithm.

1: Procedure Name: OnContact

2: Input: node a, node b, integer ContactDuration
3: DropExpiredPackets(a,b)
4: ExchangeSummaryVector(a,b)
5: UpdateDeliveryPredictability()
6: SortPackets() /* Using MAXPROP sorting criteria */
7: if ContactDuration > 0 then
8: pkt=GetPacket(a)
9: /* pkt is the packet with the minimum hop count,
or higher delivery predictability */
10: if pkt then
11: if NotReceivedBefore(pkt,b) then
12: if IsDestination(pkt,b) then
13: SendPacket(pkt,a)
14: ConsumePacket(pkt,b)
15: else
16: SendPacket(pkt,a)
17: StorePacket(pkt,b) Fig:3
18: endif
19: ContactDuration=ContactDuration-size(pkt)
20: endif
21: endif
22: endif

SnW
DTNs usually involve devices that are energy-sensitive in which saving energy becomes
one of its main objectives, ifnot the main one. Energy consumption is mostly incurred in
the communication process (transmission and reception). To save energy, it is required to
decrease the number of transmissions and receptions. Motivated by this fact, the authors
proposed the SnW routing protocol. The idea of SnW is to limit the number of packet
copies in the network. A packet copy, transferred from one node to another, is associated
with the number of further copies allowed for the second node to distribute. This number
is decreased by the number of transfersfor this packet at each node. When the allowed
number of copies reaches one, the carrying node stops generating any more copies of the
packet and keeps its single copy until it either meets the destination or the packet
isdropped becauseof a buffer overflow or lifetime expiry. A binary version of SnW is also
proposed i, in which each node is allowed to use half the number of copies allowed for
the packet, and theother half is left for the receiving node. The pseudo-code for the binary
SnW is shown.
1: Procedure Name: OnContact
2: Input: node a, node b, integer ContactDuration
3: DropExpiredPackets(a,b)
4: ExchangeSummaryVector(a,b)
5: if ContactDuration > 0 then
6: pkt=GetPacket(a)
7: if pkt then
8: if NotReceivedBefore(pkt,b) then
9: if IsDestination(pkt,b) then
10: SendPacket(pkt,a)
11: ConsumePacket(pkt,b)
12: else
13: NrOfCopies=GetNrOfCopies(pkt,a)
14: if NrOfCopies > 1 then
15: SendPacket(pkt,a)
16: StorePacket(pkt,b)
17: SetNrOfCopies(pkt,a,NrOfCopies/2)
18: SetNrOfCopies(pkt,b,NrOfCopies/2)
19: endif
20: endif
21: ContactDuration=ContactDuration-size(pkt)
22: endif
23: endif
24: endif

Chapter 2

2.1 Related Works

In paper[1]CAIS: A Copy Adjustable Incentive Scheme in Community-Based Socially

Aware Networking the protocol uses single data replication for enhancement of delivery
ratio ,reducing overhead ratio and shorter latency ratio.It divides the group of networks
into social and non-social community then distributes credits to the network through it's
virtual credit storage.The concept of virtual credit also helps to simulate selfish nodes
such that it helps in forwarding data.

Paper[2]SEIR: A Stackelberg Game Based Approach for Energy-Aware and Incentivized

Routing in Selfish Opportunistic Networks is based on Stackleberg game theory model
which has used the optimal reward to give to the nodes which behave selfishly and do not
allow proper communication.It chooses those nodes whose time of arrival is greater in the
vicinity of source for faster delivery .Linear Reward Inaction Algorithm is used to
maintain Stackleberg equilibrium.

In this paper[3] An Incentive-Compatible Routing Protocol for Two-Hop Delay-Tolerant

Networks ICRP is presented with multiple copies for two-hop DTNs based on the
algorithmic game theory. Encounter probability and transmission cost is taken into
consideration to deal with the misconduction of selfish nodes. It has the strategy to select
optimal relay nodes to ensure that nodes that honestly report their encounter probability
and transmission cost can maximize their rewards.

New method to select relay nodes for multicopy transmissions is given. To ensure that the
selected relay nodes can receive their rewards securely, a signature scheme based has
been developed to prevent the malicious nodes from interferring.

The paper[4]ncentive Driven Information Sharing in Delay Tolerant Mobile Networks

,Multi-Receiver Incentive- Based Dissemination (MuRIS) scheme is allowed such that
nodes cooperate and deliver information of interest to one another via chosen delivery
paths that utilize few transmissions. MuRIS scheme utilizes local historical path and
tracks users’ interests information maintained by each node. Fewer delivery hops are
charge and reward functions.

2.2 Proposed Work

The field chosen for the work is Routing.Under routing incentive based routing is
chosen to improve network performance in the parameters of simulation.For this
the simulation was run on THE ONE application to compare the results with the
other routing algorithms.

In prophet routing social and non social incentive based credits have been
introduced to enhance delivery ratio,reduce overhead ratio and reduce delay too.In
the update delivery predictability for a host the update has been done where the
update shows there is a fair increase of delivery ratio with increase of n the direct
delivery part where two nodes are directly in contact with each other
time.Overhead ratio decreases with time and latency also reduces
considerably.Changes have been done The Proposed algorithm is as follows:-

1:// When nodeM creates a message

2: if n_cur> s_min and s_cur > s_min then
3: Cn=(n_cur/(n_cur+s_cur))× Cmax
4: Cs = (S_cur/(n_cur + s_cur)) × Cmax
5: n_cur− = Cn × α
6: s_cur = Cs × α
7: else if n_cur > n_min then
8: Cn = CPNmax
9: Cs = 0
10: n_cur− = Cmax × α
11: else if s_cur > s_min then
12: Cs = Cmax
13: Cn = 0
14: s_cur− = Cmax × α
15: else if n_cur ≤ n_min and s_cur ≤s_min then
16: Cs = 0
17: Cn = 0
18: end if
 Chapter 3
3.1 Performance Evaluation
Network and Protocol Setup
The network consists of vehicles and pedestrians moving around a city. We used the ONE
simulator to generate the movement scenario. We set the mobility model as map based
movement, where vehicles and pedestrians are restricted to move in predefined paths and
routes derived from realmap data. We used the map data of the Helsinki downtown area
(roads and pedestrian walkways) provided with the simulator.We conducted the following
experiments to study the impact of the following parameters:
• Node density by changing the number of nodes in the network.
• Changing the simulation time in terms of hours.
In the reports section of ONE simulator we add messages statistics report in the default
settings.Statistics keeps record of no.of messages created ,delayed,aborted and also the
parameters we have defined and many more information.We keep changing the time for
the new algorithm at a time and note down the parameters results.The map in which the
nodes move is Helinski map.The minute changes insettings done in the ONE simulator :-
# "Bluetooth" interface for all nodes
btInterface.type = SimpleBroadcastInterface
# Transmit speed of 2 Mbps = 250kBps
btInterface.transmitSpeed = 250k
btInterface.transmitRange = 10
Group.movementModel = ShortestPathMapBasedMovement
Group.bufferSize = 5M
Group.waitTime = 0, 12
# All nodes have the bluetooth interface
Group.nrofInterfaces = 1
Group.interface1 = btInterface
# Walking speeds
Group.speed = 0.5, 1.5
# Message TTL of 30 minutes (5 hours)
Group.msgTtl = 30
Group.nrofHosts = 10
# group1 (pedestrians) specific settings
Group1.groupID = p
# group2 specific settings
Group2.groupID = c
# cars can drive only on roads
Group2.okMaps = 1
# 10-50 km/h
Group2.speed = 2.7, 13.9
Report.report1 = MessageStatsReport

3.2 Results

Table:1 Simulation results of New router

3.3 Parameters

We consider three metrics to measure the performance of the different protocols

Delivery Ratio (DR):
DR = Σ(Pdv )n / Σ(Pg )n
n∈N n∈N
where (Pdv)n is the number of packets delivered to their destination node n, and (Pg)n is
the number of packets generated at their source node n. The delivery ratio is simply the
ratio ofthe packets delivered to those generated in the network during the simulation time.
Packet Delivery Cost (DVC):
DVC = (Σ(Pr )n − Σ(Pdv )n ) / Σ(Pdv )n
n∈N n∈N n∈N
where (Pr)n is the number of packets received by node n. DVC represents the cost paid
using the routing protocol, in terms of redundant packets, to deliver one packet.
Average Packet Delay (Del):
Del = Σ Σ dp / Σ(Pdv )n
 n∈N p∈DVn n∈N

where dp is the delay encountered by packet p delivered to its destination node n and
DVn is the set of packets delivered totheir destination n. The metric is simply the ratio of
the sumof all delivered packets’ delays to the number of deliveredpackets.

3.4 Result Comparison

Simulation time:6hrs Epidemic Prophet Maxprop Spray and New router
Wait
Delivery ratio 0.0397 0.0424 0.0424 0.0410 0.0438
Overhead ratio 9.1379 6.1613 8.4516 8.8000 5.9375
Average Latency 971.9967 1001.5387 981.6903 969.5966 1012.9500
Table:2
Simulation time:9hrs Epidemic Prophet Maxprop Spray and New router
Wait
Delivery ratio 0.0529 0.0510 0.0529 0.0520 0.0529
Overhead ratio 7.01721 5.1786 6.5517 7.0526 4.9655
Average Latency 866.0828 920.4209 898.1138 843.8474 903.1000
Table:3
Simulation Epidemic Prophet Maxprop Spray and New router
time:12hrs Wait
Delivery ratio 0.0529 0.0510 0.0529 0.0520 0.0601
Overhead ratio 7.01721 5.1786 6.5517 7.0526 4.4432
Average Latency 866.0828 920.4209 898.1138 843.8474 929.2341
Table:4
Simulation Epidemic Prophet Maxprop Spray and New router
time:18hrs Wait
Delivery ratio 0.0625 0.0638 0.0643 0.0634 0.0648
Overhead ratio 5.4818 4.0714 5.0922 5.3309 4.0070
Average Latency 859.6599 891.1500 882.8645 866.4679 894.2400
Table:5
Simulation Epidemic Prophet Maxprop Spray and New router
time:21hrs Wait
Delivery ratio 0.0637 0.0645 0.0653 0.0645 0.0653
Overhead ratio 5.3006 4.0714 4.9162 5.1697 3.9281
Average Latency 862.9031 885.0642 878.3200 868.3800 895.0400
Table:6
Simulation Epidemic Prophet Maxprop Spray and New router
time:24hrs Wait
Delivery ratio 0.0629 0.0636 0.0643 0.0632 0.0646
Overhead ratio 5.2989 3.9301 4.9162 5.2050 3.8889
Average Latency 847.9185 861.9194 856.4400 849.1049 868.5400
Table:7

Graphs

Graph 1:Delivery ratio with increasing simulation time

Conclusion
 Graph 2:Overhead Ratio with increasing simulation time
Future Scope:
Conclusion
References