Outline

• Course Work : Completed

• Introduction to VDTN
• Overview of VDTN
• Literature Survey
• Research Gap Analysis
• Motivation
• Objectives and Problem Statement
• Research Plan
• Research Outcome
• Gantt Chart for Planned Research
• References

1
Subjects Studied and Credit earned as per
Ph.D Ordinance
S/No. Subject Name No. of Mode of Study
Credits
1. Research Methodology and Scientific 4 credits Regular course
Applications

2. Soft Computing Techniques 4 credits Regular course

3. Next Generation Wireless Networks 4 credits Self study

2
Research Methodology and Scientific
Applications
• Research is a logical and systematic search for new and useful information on a
particular topic.
• The major outcome of studying this subject are:
• Which kind of research problem we have to choose.
• What type of planning we require to solve it.

3
Soft Computing Techniques
• The major outcome of studying this subject are:
• It provides an overview of techniques that can be applied to achieve
optimized routing decision.
• Routing algorithms can be made intelligent by incorporating self-learning
ability in nodes.
• It also gives idea about genetic algorithms, fuzzy logic, hybrid intelligent
systems, artificial neural network.

4
Next Generation Wireless Networks
• The major outcome of studying this subject are:
• It gives an idea about various wireless communication technologies, their
architecture, model that are currently in use, used in past and useful for
future also.
• Performance analysis of networks, its analytical modelling and
measurement.
• It gives knowledge about design guidelines for mobile applications like
crowd sourcing, code offloading, energy efficiency, concurrency.

5
Introduction to VDTNs
• Vehicular Delay Tolerant Networks (VDTNs):
• Evolved from Delay Tolerant Networks (DTN) and Vehicular Networks [1]
• Highly dynamic network topology
• No end-to-end connectivity can be assumed
• Store-Carry-Forward (SCF) paradigm
• High latency and variable delays
• Frequent disconnections
• Mobile nodes
• Bundles are relayed in opportunistic manner [2]

6
Example Scenario of VDTNs

Figure 1: Vehicular Delay Tolerant Network Scenario [1] 7

VDTNs layered Architecture

8
Figure 2: DTN and VDTN layered Architecture [2]
Applications of VDTNs [3,4,5,6]
• Active road safety applications:
• Overtaking Vehicle warning
• Head on collision warning
• Emergency vehicle warning
• Co-operative forward collision warning
• Traffic condition warning
• Stationary vehicle warning
• Traffic efficiency and management warning:
• Traffic flow
• Traffic assistance
• Co-operative navigation
• Infotainment Application:
• Co-operative local services
• Global internet services

9
Critical Issues
There are several critical issues in VDTN as follows:
 Lack of general framework [1]
 Optimized routing or data dissemination [7]
 Efficient buffer management [8]
 Relay node deployment [9]
 Congestion control [10]
 Trusted communication [11, 12]

10
Routing
• Routing or data dissemination are critical to the operation in VDTNs.
• Internet protocols do not work well for VDTNs environment, due to the
fundamental assumptions built in its architecture [13]:
 Unavailability of complete path between source and destination.
 Dynamic and sparse topology.
 Message delivery can be delayed for uncertain time.
 Real time location of destination is not always available.

11
Classification of Routing Protocols

Figure 3: Classification of routing protocol in VDTN

12
Challenges
Issue Challenges
Routing [23]  Estimating real time-location of destination
 Buffer capacity and management
 Incorporating new technologies for optimizing routing
decisions
 Quality of Service (QoS)
 Developing application dependent intelligent protocols
 
Buffer management  Queuing and Scheduling Policy
[8, 25]  Dropping Policy
 

Relay node deployment  It should create greater number of connectivity opportunities.

[9, 26]  Depending on the traffic volume, the capacity of relay nodes
should be adjusted.
 
Trusted communication  The speed of vehicles which changes the topology constantly
[11, 12, 27] and minimizes the contact times between the nodes.
 The lack of a centralized third party to evaluate and maintain
the trust values. 13
 
 Literature Review
S/ Paper Title and Description Limitation
No. Publisher
1. Speed-adaptive multi- A novel-multi-copy routing algorithm is proposed, that Energy
copy routing for uses only the information about relative speed for consumption
vehicular delay tolerant relaying data. The overall routing performance considers and relay node
networks (2019, Future only the relative speed between nodes and adjusting the factors are not
Generation Computer number of copies being relayed. Very little computation considered.
System) ] [28] is required for selecting candidate node as only one
parameter is considered.

2. TBRS: A Trust based In this paper, a trust-based scheme is proposed for Time efficiency
Recommendation vehicular cyber physical network (CPS). The trust is of node is not
Scheme for evaluated by observing the difference of mobility considered.
Vehicular CPS between mobility of normal nodes and malicious nodes.
Network (2019, Future Based on this a trust-model is designed for delivery
Generation Computer credibility and position intimacy of nodes.
Systems)[29]

3. Quality of service in The influence of QoS parameters are analysed on DTN. Issue of fairness
delay tolerant It is found that congestion, selfishness, fairness, queuing in message
networks: A survey delay and jitter are the predominant issues which delivery is not
(2018, Computer influence QoS metrics such as delivery ratio, packet well
Networks) [30] drop, message overhead and delay in DTNs. investigated. 14
 Literature Review
S/No. Paper Title and Description Limitation
Publisher
4. Enhanced buffer The enhancement of buffer management technique is Average latency
management scheme being done in order to increase the efficiency of network is untouched.
to avoid and also minimize the congestion in the network. The
congestion in delay variable TTL will be used for deleting the data if the
tolerant social network buffer of nodes gets full. The data with less TTL will be
(2018, IEEE) [31] deleted first and the threshold for deleting the data is
120 minutes max.

5. Deploying Throw A throwbox deployment strategy (CO2)is proposed in Complexity of

boxes to Enhance this paper to improve the fault tolerance in DTN, network
Fault-Tolerance Different from existing relay node deployment increases.
Performance in Delay strategies, such as the contact-oblivious deployment and
Tolerant Networks the contact-based deployment. By choosing relay
(2018, Wireless throwbox locations from the possible location set, a 2-
Personal connected graph is constructed according to CO2
Communication) [32] strategy. CO2 requires a relatively small amount of
throwboxes.
6. Exploiting Active An Active Area Routing method is proposed in this Buffer
Subareas for Multi- paper. It is based on the vehicle network trace that each management of
copy vehicle has only few active area, where it visits vehicles is not
Routing in VDTNs frequently and two frequently encountering vehicle discussed.
(2018, IEEE encounters in their active area only. a traffic aware
TRANSACTIONS shortest path algorithm is used to distribute packets in 15
ON VEHICULAR active sub area of destination vehicle.
TECHNOLOGY) [33]
 Literature Review
S/No. Paper Title and Description Limitation
Publisher
7. Geo-routing with angle This scheme works on the angle based policy Applicable only
based decision in delay where the relay nodes can be selected in the where historical
tolerant networks (2017, geo-proximity of destination and after limited information is
Ubi-media Computing and number of relays message will be delivered to available about relay
Workshops) [34] destination node and destination

8. MobiT: A Distributed and This is a distributed trajectory-based routing Relationship

Congestion-Resilient algorithm for VDTNs. MobiT aims to let the between vehicle’s is
Trajectory Based packet arrive at an RSU prior to the not clearly defined.
Routing Algorithm for destination vehicle by scheduling based on
Vehicular Delay Tolerant vehicle short term trajectory and long-term
Networks (2017 ACM.) mobility patterns including the routines routes
[35] of itself and its common-route vehicles.

16
 Literature Review
S/No. Paper Title and
Publisher
8. NTR: an Efficient
Trajectory-based Routing
Protocol for the Vehicular
Delay Tolerant Networks
(2017 IEEE International
Conference on Systems,
Man, and Cybernetics)
[36]
Description Limitation
A novel trajectory-based protocol is Only three metrics are
proposed to improve packet replication considered for
efficiency of vehicles. Data mining performance
technique is integrated in this approach to evaluation.
establish the trajectory tree of each
mobile node then future location of each
vehicle is predicted with their contact
opportunities.

9. Throwboxes in delay A comprehensive survey is presented to Energy consumption is

tolerant networks: A show the effect of throwbox deployment overlooked.
survey of placement in DTNs. Here, various application
strategies, buffering scenarios are discussed where
capacity, and mobility throwboxes can be used. In order to
models (2017, Journal of maximize the network performance
Network and Computer buffer management, placement criteria,
Applications) [37] network topology etc. need to be taken
into consideration.

17
 Literature Review
S/No. Paper Title and Description Limitation
Publisher
10. Trust based Intelligent a Trust based Intelligent Routing Algorithm -
Routing Algorithm for is proposed, which exploits the Call Data
Delay Tolerant Record from Call Detail Record. The
Network using Artificial function of Artificial Neural Network is to
Neural Network (2017, calculate and learn, trust value that can be
Wireless Networks) [38] shared among network devices. Our
algorithm lowers the need of nodes
resources like energy consumption,
computation time and space overheads. The
proposed algorithm enhances the routing
performance in DTN.
11. LDAOR: Location and LDAOR is based on selecting the best Scalability is not
Direction Aware neighbour node by selecting vehicle’s considered during
Opportunistic Routing in position, direction, and priority of message simulation.
Vehicular Ad hoc Networks in buffer. If multiple nodes make contact
(2016, Journal of with carrier node nearest node to
Telecommunications and destination is selected..
Information Technology.)
[39]
18
 Literature Review
S/No. Paper Title and Description Limitation
Publisher
12. A multi-objective optimization A probabilistic data dissemination Only three performance
of data dissemination in delay algorithm is proposed to establish metrics are considered
tolerant networks (2016, Expert a compromise between various for multi –objective
Systems with Applications) performance metrics. Further a optimization.
[40] decision tree based algorithm is
proposed to obtain the decision
variables that can set the target
performance.

13. Vehicular Delay Tolerant This paper provides a detailed -

Network (VDTN): Routing survey of VDTN routing protocols.
perspectives (2015 12th Annual The performance of protocols are
IEEE Consumer compared on the basis of
Communications and infrastructure, implementation etc.
Networking Conference) [41] also, a number of open issues are
discussed in the paper.

19
 Literature Review
S/ Paper Title and Description Limitation
No. Publisher

14. A Cooperative Watchdog This paper proposes a cooperative watchdog High network
System to Detect system to detect and act against mis behavior overhead.
Misbehavior Nodes in nodes in order to reduce their impact in the overall
Vehicular Delay-Tolerant network performance. Its operation relies on a
Networks (2015, IEEE cooperative exchange of nodes reputation along
Transaction on Industrial the network. By detecting selfish or misbehaving
Electronics) [42] nodes, it is possible to improve the overall
network performance.

15. Approach-and-Roam This protocol works in two phases: approach Does not work in
(AaR): A Geographic phase is applicable when carrier is not in estimated the absence of
Routing range of destination and roam phase is applied historical
Scheme for when carrier node is in estimated range for geographical
Delay/Disruption (2014, destination. information of
IEEE transactions on destination node
Vehicular Technology)
[43]

20
 Literature Review
S/No. Paper Title and
Publisher
16. Geo-Spray: A geographic
routing protocol for vehicular
delay-tolerant networks (2014,
Information Fusion)[44]
Description Limitation
Geo-Spray takes the routing decision Node density and
based on the geographical location of data. scalability is not
This also combines the single and multiple considered during
copy schemes to relay limited number of implementation.
bundles.

17. Converge-and-Diverge: A In this protocol message is replicated to GPS error is

Geographic Routing for the estimated movement range of overlooked
Delay/Disruption-Tolerant destination to ensure delivery. CaD utilizes
Networks Using DR to overcome routing decision and local
a Delegation Replication maximum problem.
Approach(2013, IEEE
Transactions on Vehicular
Technology) [45]

18. A Reliable and Efficient The property of DF is exploited in addition If the destination is
Geographic Routing Scheme to calculate the pairwise encountered mobile than
for Delay/Disruption Tolerant nodes in the direction of destination. delivery ratio
Networks (2013, IEEE decreases
Wireless Communications significantly. 21
Letters) [46]
 Literature Review
S/ Paper Title and
No. Publisher
19. Distance-aware routing with
copy control in vehicle-based
DTNs (2012, In Vehicular
Technology Conference) [47]
20. Connectivity-aware
minimum-delay geographic
routing with vehicle tracking
in VANETs (2011, Ad Hoc
Networks ) [48]
21. Delegation Forwarding in
Delay Tolerant Networks
Multicasting (2011,
JOURNAL OF
COMMUNICATIONS) [49]
Description Limitation
This approach uses the contact behaviour Data aggregation is
among vehicles to disseminate the required to reduce
destination location all over the network. the network
Centralized location server is used to keep overhead.
track of the location.
This approach selects the route on logic to Target tracking is
adapt vehicles based on density in network. not accurate for
A target tracking mechanism is applied to mobile destination
track the destination vehicle.
Three multicast models has been proposed In DF multicast it is
in this paper viz. single-copy multicast, not guaranteed that
multi-copy multicast and, DF multicast message will
model. It was observed that although single always be
copy has least forwarding but have high forwarded to higher
latency than multicast models. quality node
22
Literature Review
S/ Paper Title and Description Limitation
No. Publisher

22. Fuzzy Closeness-based A fuzzy-weight-based delegation The closeness

Delegation Forwarding in forwarding scheme is proposed to calculation is not
Delay Tolerant Networks propagate the messages into dynamic.
(2010, Fifth IEEE all communities while avoiding
International Conference on repeated forwarding in the same
Networking, Architecture) community. The method utilizes
[50] a fuzzy trust evaluation system for
nodes to summarize their
Relationships to other nodes, in
terms of closeness.

23. Probability Delegation The probability delegation Message is not always

Forwarding in Delay forwarding scheme is proposed to forwarded to higher
Tolerant Networks (2009. reduce the cost of DF by putting quality node because of
Proceedings of 18th probability in forwarding message probability
International Conference on to higher quality node while
IEEE.) [51] maintaining same delivery ratio.

23
Research Gap Analysis
• The main focus of VDTN data dissemination design is on delay [27].
However, other quality of service (QoS) parameters such as throughput and
jitter can also be considered [30].

• In VDTN, mobile nodes can also exchange data using relay nodes.
Therefore, the optimal placement of relay nodes is an important issue while
maintaining connectivity at minimum cost [8, 9].

• There are several algorithms look at a certain metric such as contact

probability or some social based metric for forwarding bundle. However,
other multiple metrics can also be considered with different weightage or
application dependent [30].

24
• Fairness of nodes should be considered as nodes have different levels of
reachability and nodes should deliver the data to destination without getting
biased [27, 29, 32].

• The traditional routing approaches result in sub-optimal performance in

packet transmission rates. Further research would be needed to optimize the
packet transmission such that the total benefit of all traffic sources is
maximized [10].

25
Motivation
• The research on improving the data dissemination techniques to enhance the
delivery probability is still the focus at present and in future .
• Optimal relay node deployment is a very challenging problem for most of
the node deployment formulations in such network.
• Optimization in bundle transmission rate is required in order to minimize the
network overload.
• Further research is needed to detect the misbehaving nodes in the network
that consumes the network resources and

26
Objectives
• To develop an efficient data dissemination routing protocol in VDTNs.

• To develop an efficient and optimized strategy for relay node deployment.

• Providing efficient solution by resolving the trade-off between data delivery

ratio, latency, and network overhead etc. using multi-objective optimization.

• To develop an optimized routing protocol to improve transmission rate using

state-of-the-art optimization techniques.

• Establishing trust factor on the routing algorithm to maintain the fairness in

data forwarding.

27
Problem Statement
• To obtain solution for better buffer management, improved throughput, and
reliable system for VDTN owing N number of nodes (terminal, relay, and
mobile) having intermittent environment, limited bandwidth and buffer.

28
Research Plan
Tentative research plan is divided and grouped into five phases :
• Phase-A: To develop an efficient data dissemination routing
protocol.
• Phase-B: To develop an efficient and optimized strategy for relay
node deployment.
• Phase-C: To develop an algorithm using multi objective
optimization to solve the trade-off between various performance
metrics.
• Phase-D: To develop an optimized algorithm to improve
transmission rate using state-of-the-art optimization techniques.
• Phase-E: To develop an algorithm to establish trust-factor between
source and destination for data forwarding.

29
Phase-A
A : To design and develop an efficient data dissemination routing
protocol.
A1: Strategy for efficient data dissemination:
Data will be forwarded to nodes that are more prone to meet destination.
Various strategies for data dissemination are to be examined and best
strategy will be identified and implemented.

A2: Development of a novel algorithm:

In this step, a novel algorithm for data dissemination is to be developed.

A3: Validation of proposed work:

Comparative study of the existing algorithm and the proposed algorithm
will be performed. The comparison will be on the basis of identified
performance metrics.

30
Phase-B
B : To design and develop an efficient and optimized strategy for
relay node deployment.
B1: Strategy for relay node deployment.
For covering the maximum area, relay nodes are to be deployed manually.
Strategies for node deployment are to be examined and best strategy will be
identified and implemented.

B2: Development of novel algorithm.

In this phase, a novel algorithm for relay node deployment is to be
developed.

B3: Validation of proposed algorithm:

The comparison is being made with existing algorithms.

31
Phase-C
C : To design and develop an algorithm using multi-objective
optimization to solve the trade-off between various performance
metrics.
C1: Study of various performance metrics is to be conducted in order to
find their correlation.

C2: Development of novel algorithm

An algorithm will be developed using methods of multi-objective
optimization, in order to provide a trade-off between interrelated metrics to
improve network performance.

C3: Validation of proposed algorithm:

The comparison is being made with existing algorithms.

32
Phase-D
D : To design and develop an optimized algorithm to improve
transmission rate using state-of-the-art optimization technique:
D1: Identification of an optimization technique.
In this phase, various optimization techniques will be investigated like
genetic algorithms, ant colony optimization etc. Best technique will be
applied to optimize the data transmission rate.

D2: development of optimized algorithm.

Here, an optimized algorithm will be developed using best technique to
improve transmission rate.

D3: Validation of developed algorithm:

The comparison is being made with existing algorithms.

33
Phase-E
E : To design and develop an algorithm to establish trust-factor
between source-to-destination for data forwarding:
E1: Strategies for detecting malicious or biased node will be conducted.
Best strategy will be identified and implemented.

E2: Using best strategy, an algorithm will be developed to establish trust

factor and fairness in data forwarding.

E3: Validation of proposed algorithm:

The comparison is being made with existing algorithm to examine the
improvement in performance of proposed algorithm.

34
Expected Research Outcomes
• Data dissemination is one of the key problem in VDTNs. An efficient
algorithm for data dissemination will be developed to achieve low
latency and high delivery predictability.

• An optimal relay node deployment strategy will be developed to

ensure proper coverage. This enhances the delivery ratio and
decreases the average delay in the network.

• Major performance metrics and their correlation will be identified.

Then a multi-objective algorithm will be developed to establish
trade-off between correlated metrics.

• Malicious and biased nodes results in degraded network

performance. This will be solved with a fairness algorithm by
establishing trust factor. 35
Gantt Chart for Proposed Research Plan

36
References
1. Ahmed, S. H., Kang, H., & Kim, D. (2015, January). Vehicular delay tolerant network (VDTN): Routing perspectives. In Consumer
Communications and Networking Conference (CCNC), 2015 12th Annual IEEE (pp. 898-903). IEEE.
2. Soares, V. N., Farahmand, F., & Rodrigues, J. J. (2010, December). VDTNsim: a simulation tool for vehicular delay-tolerant networks. In
Computer Aided Modeling, Analysis and Design of Communication Links and Networks (CAMAD), 2010 15th IEEE International Workshop on
(pp. 101-105). IEEE.
3. Karagiannis, G., Altintas, O., Ekici, E., Heijenk, G., Jarupan, B., Lin, K., & Weil, T. (2011). Vehicular networking: A survey and tutorial on
requirements, architectures, challenges, standards and solutions. IEEE communications surveys & tutorials, 13(4), 584-616.
4. Sichitiu, M. L., & Kihl, M. (2008). Inter-vehicle communication systems: a survey. IEEE Communications Surveys & Tutorials, 10(2).
5. ETSI, T. (2009). Intelligent transport systems (ITS); vehicular communications; basic set of applications; definitions (Vol. 1). Tech. Rep.
ETSI TR 102 638.
5. Karagiannis, G., Altintas, O., Ekici, E., Heijenk, G., Jarupan, B., Lin, K., & Weil, T. (2011). Vehicular networking: A survey and tutorial on
requirements, architectures, challenges, standards and solutions. IEEE communications surveys & tutorials, 13(4), 584-616
6. Chen, W., Guha, R. K., Kwon, T. J., Lee, J., & Hsu, Y. Y. (2011). A survey and challenges in routing and data dissemination in vehicular ad
hoc networks. Wireless Communications and Mobile Computing, 11(7), 787-795
7. Jain, S., & Chawla, M. (2014). Survey of buffer management policies for delay tolerant networks. The Journal of Engineering, 2014(3), 117-
123
8. Farahmand, F., Cerutti, I., Patel, A. N., Zhang, Q., & Jue, J. P. (2008, November). Relay node placement in vehicular delay-tolerant
networks. In Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE (pp. 1-5). IEEE.
9. Cao, Y., & Sun, Z. (2013). Routing in delay/disruption tolerant networks: A taxonomy, survey and challenges. IEEE Communications surveys
& tutorials, 15(2), 654-677
10. Rostamzadeh, K., Nicanfar, H., Torabi, N., Gopalakrishnan, S., & Leung, V. C. (2015). A context-aware trust-based information
dissemination framework for vehicular networks. IEEE Internet of Things Journal, 2(2), 121-132.
11. Teler, M., & Cristea, V. (2012, September). Securing vehicular networks using deterministic schemes for computing trust. In Intelligent
Networking and Collaborative Systems (INCoS), 2012 4th International Conference on (pp. 214-221). IEEE.
12. Kang, H., Ahmed, S. H., Kim, D., & Chung, Y. S. (2015). Routing protocols for vehicular delay tolerant networks: a survey. International
Journal of Distributed Sensor Networks, 11(3), 325027.
13. Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network (Vol. 34, No. 4, pp. 145-158). ACM.
14. Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006, April). Maxprop: Routing for vehicle-based disruption-tolerant networks. In
INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings (pp. 1-11). IEEE.
37
15. Lindgren, A., Doria, A., Davies, E., & Grasic, S. (2012). Probabilistic routing protocol for intermittently connected networks (No. RFC
6693).
References
16. Daly, E. M., & Haahr, M. (2007, September). Social network analysis for routing in disconnected delay-tolerant manets. In
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing (pp. 32-40). ACM.
17. Daly, E. M., & Haahr, M. (2007, September). Social network analysis for routing in disconnected delay-tolerant manets. In
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing (pp. 32-40). ACM
18. Mtibaa, A., May, M., Diot, C., & Ammar, M. (2010, March). Peoplerank: Social opportunistic forwarding. In Infocom, 2010
Proceedings IEEE (pp. 1-5). IEEE.
19. Hui, P., Crowcroft, J., & Yoneki, E. (2011). Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE Transactions on
Mobile Computing, 10(11), 1576-1589.
20. Leontiadis, I., & Mascolo, C. (2007). GeOpps: Geographical opportunistic routing for vehicular networks.
21. Link, J. A. B., Schmitz, D., & Wehrle, K. (2011, December). GeoDTN: Geographic routing in disruption tolerant networks. In
Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE (pp. 1-5). IEEE.
22. Chen, K., & Shen, H. (2015). DTN-FLOW: Inter-landmark data flow for high-throughput routing in DTNs. IEEE/ACM Transactions
on Networking (TON), 23(1), 212-226.
23. Benamar, N., Singh, K. D., Benamar, M., El Ouadghiri, D., & Bonnin, J. M. (2014). Routing protocols in vehicular delay tolerant
networks: A comprehensive survey. Computer Communications, 48, 141-158
24. Majeed, M. R., Khan, W. U., Naeem, F., Irfanullah, S., & Salam, A. (2018, November). Enhanced Buffer Management Scheme to
Avoid Congestion in Delay Tolerant Social Network. In 2018 IEEE 21st International Multi-Topic Conference (INMIC) (pp. 1-7). IEEE.
25. Mu, D., Ahmed, S. H., Lee, S., Guizani, N., & Kim, D. (2017, December). An Adaptive Multiple-Relay Selection in Vehicular Delay
Tolerant Networks. In GLOBECOM 2017-2017 IEEE Global Communications Conference (pp. 1-6). IEEE.
26. Soares, V. N., Farahmand, F., & Rodrigues, J. J. (2009, July). Improving vehicular delay-tolerant network performance with relay
nodes. In Next Generation Internet Networks, 2009. NGI'09 (pp. 1-5). IEEE.
27. Teler, M., & Cristea, V. (2012, September). Securing vehicular networks using deterministic schemes for computing trust. In
Intelligent Networking and Collaborative Systems (INCoS), 2012 4th International Conference on (pp. 214-221). IEEE.
28. Zhang, F., Thiyagalingam, J., Kirubarajan, T., & Xu, S. (2019). Speed-adaptive multi-copy routing for vehicular delay tolerant
networks. Future Generation Computer Systems, 94, 392-407.
29. Liang, W., Long, J., Weng, T. H., Chen, X., Li, K. C., & Zomaya, A. Y. (2019). TBRS: A trust based recommendation scheme for
vehicular CPS network. Future Generation Computer Systems, 92, 383-398.
30. Roy, A., Acharya, T., & DasBit, S. (2018). Quality of service in delay tolerant networks: A survey. Computer Networks, 130, 121- 38
133.
References
31. Majeed, M. R., Khan, W. U., Naeem, F., Irfanullah, S., & Salam, A. (2018, November). Enhanced Buffer Management Scheme to
Avoid Congestion in Delay Tolerant Social Network. In 2018 IEEE 21st International Multi-Topic Conference (INMIC) (pp. 1-7). IEEE
32. Han, W., & Xiao, Y. (2018). Deploying Throwboxes to Enhance Fault-Tolerance Performance in Delay Tolerant Networks. Wireless
Personal Communications, 99(3), 1247-1278.
33. Wu, B., Shen, H., & Chen, K. (2018). Exploiting active subareas for multicopy routing in VDTNs. IEEE Transactions on Vehicular
Technology, 67(5), 4374-4388.
34. Lin, C. Y., Chung, J. Y., Li, C. T., Hu, C. L., & Lien, Y. N. (2017, August). Geo-Routing with angle-based decision in delay-tolerant
networks. In Ubi-media Computing and Workshops (Ubi-Media), 2017 10th International Conference on (pp. 1-5). IEEE.
35. Yan, L., Shen, H., & Chen, K. (2017, April). MobiT: A distributed and congestion-resilient trajectory based routing algorithm for
vehicular delay tolerant networks. In Proceedings of the Second International Conference on Internet-of-Things Design and
Implementation (pp. 209-214). ACM.
36. Chang, C., Hung, M. H., Chang, C. R., & Yen, C. E. (2017, October). NTR: An efficient trajectory-based routing protocol for the
vehicular delay tolerant networks. In Systems, Man, and Cybernetics (SMC), 2017 IEEE International Conference on (pp. 389-394).
IEEE.
37. Qirtas, M. M., Faheem, Y., & Rehmani, M. H. (2017). Throwboxes in delay tolerant networks: A survey of placement strategies,
buffering capacity, and mobility models. Journal of Network and Computer Applications, 91, 89-103.
38. Singh, A. V., Juyal, V., & Saggar, R. (2017). Trust based Intelligent Routing Algorithm for Delay Tolerant Network using Artificial
Neural Network. Wireless Networks, 23(3), 693-702.
39. Barootkar, M., Rahbar, A. G., & Sabaei, M. (2016). LDAOR-Location and Direction Aware Opportunistic Routing in Vehicular Ad
hoc Networks. Journal of Telecommunications and Information Technology.
40. Reina, D. G., Ciobanu, R. I., Toral, S. L., & Dobre, C. (2016). A multi-objective optimization of data dissemination in delay tolerant
networks. Expert Systems with Applications, 57, 178-191.
41. Ahmed, S. H., Kang, H., & Kim, D. (2015, January). Vehicular delay tolerant network (VDTN): Routing perspectives. In Consumer
Communications and Networking Conference (CCNC), 2015 12th Annual IEEE (pp. 898-903). IEEE.
42. Dias, J. A., Rodrigues, J. J., Xia, F., & Mavromoustakis, C. X. (2015). A cooperative watchdog system to detect misbehavior nodes
in vehicular delay-tolerant networks. IEEE Transactions on Industrial Electronics, 62(12), 7929-7937.
. 39
References
43. Cao, Y., Sun, Z., Cruickshank, H., & Yao, F. (2014). Approach-and-Roam (AaR): a geographic routing scheme for
delay/disruption tolerant networks. IEEE transactions on Vehicular Technology, 63(1), 266-281.
44. Soares, V. N., Rodrigues, J. J., & Farahmand, F. (2014). GeoSpray: A geographic routing protocol for vehicular
delay-tolerant networks. Information Fusion, 15, 102-113
45. Cao, Y., Sun, Z., Wang, N., Yao, F., & Cruickshank, H. (2013). Converge-and-diverge: A geographic routing for
delay/disruption-tolerant networks using a delegation replication approach. IEEE Transactions on Vehicular
Technology, 62(5), 2339-2343.
46. Cao, Y., Sun, Z., Wang, N., Cruickshank, H., & Ahmad, N. (2013). A reliable and efficient geographic routing
scheme for delay/disruption tolerant networks. IEEE Wireless Communications Letters, 2(6), 603-606.
47. Lo, W. Z., Gao, J. S., & Lo, S. C. (2012, May). Distance-aware routing with copy control in vehicle-based DTNs. In
Vehicular Technology Conference (VTC Spring), 2012 IEEE 75th (pp. 1-5). IEEE.
48. Shafiee, K., & Leung, V. C. (2011). Connectivity-aware minimum-delay geographic routing with vehicle tracking in
VANETs. Ad Hoc Networks, 9(2), 131-141.
49. Wang, Y., Li, X., & Wu, J. (2011). Delegation forwarding in delay tolerant networks multicasting. JCM, 6(5), 384-
392.
50. Li, F., Yang, Y., Wu, J., & Zou, X. (2010, July). Fuzzy closeness-based delegation forwarding in delay tolerant
networks. In Networking, Architecture and Storage (NAS), 2010 IEEE Fifth International Conference on (pp. 333-340).
IEEE.
51. Chen, X., Shen, J., Groves, T., & Wu, J. (2009, August). Probability delegation forwarding in delay tolerant
networks. In Computer Communications and Networks, 2009. ICCCN 2009. Proceedings of 18th International
Conference on (pp. 1-6). IEEE.

40
41