Summary of Related Work

NO Publication Year Author Title with Explanation

1 2016 C. C. Sobin “An Efficient Buffer Management Policy for DTN”
Proposed an efficient buffer management scheme for
DTN routing, particularly in the context of real DTN
deployment. It comprises of intelligent decisions for
message transfer and message drop for buffer
management, as well as a smart relay selection for
routing.
2 2015 C. M.Patel “Enhancement of Social based Routing Protocol in
and N.
Delay Tolerant Networks”
Gondaliya
Proposed SimBet multi-copy routing scheme that
transferred a number of copies of a message during
contact opportunity is proportional to the ratio of
SimBetUtility values of nodes.

3 2015 R. M and “Performance Evaluation of Joint Routing and

M. B. Shah
Scheduling in Opportunistic Sensor Networks”
Evaluated the performance of different dropping policies
such as MOFO, DF, DT and RTTL over PROPHET
routing protocol with different mobility model in the
area of opportunistic mobile network.
4 2015 C. Oham “Congestion Aware Spray and Wait Protocol: A
and M.
Congestion Control Mechanism for the Vehicular Delay
Radenkovic
Tolerant Network”
proposes Congestion Aware Spray and Wait (CASaW)
protocol to optimize the rate of message delivery to its
destination and so increase the awareness of drivers in
the vehicular environment to improve road safety.
5 2013 D.-G. “Congestion Control with Adjustable Fairness in
Akestoridis
Opportunistic Networks”
Proposed a new congestion control mechanism with
 adjustable fairness, which provides a trade-off between
efficiency and overhead. The proposed mechanism
achieves high delivery ratio and low delay.
6 2011 S. Rashid, “E-Drop Message drop control buffer management
Q. Ayub,
policy for DTN routing protocols”
M. S. M.
Zahid, and Proposed effective dropping policy called E-DROP for
A. H.
DTN application area where random message sizes
Abdullah
generated in the network. They compared E-DROP with
MOFO.
7 2007 X. Zhang, “Performance modeling of epidemic routing”
G. Neglia,
perform on the effect of buffer constraint on Epidemic
J. Kurose,
and D. routing protocol, the result shows that buffer constraints
Towsley
can severely affect the performance of Epidemic.
8 2006 A. “Evaluation of queueing policies and forwarding
Lindgren
strategies for routing in intermittently connected
and K. S.
Phanse networks”
Evaluated set of dropping policies over PROPHET
routing protocols. They compared most forwarded first
(MOFO), shortest Remaining time to live (RTTL) and
Drop Front (DF).