Professional Documents
Culture Documents
Delay Tolerant Network
Delay Tolerant Network
Network
Learning Objective
Delay Tolerant Network (DTNs)
DTN Architecture
Bundle Protocol (BP)
Functions of BP
Routing in DTN
Categories of DTN Routing Schemes
Vehicle Traffic Model
Vehicle–Roadside Data Access
Delay-Tolerant Routing in VANETs
Vehicle-assisted data delivery (VADD)
Performance Metrics 2
Delay Tolerant Network (DTN)
Definition
DTN is an intermittent and also a heterogeneous network, in which
same and different protocols are used for sending and receiving
messages between nodes [2].
DTN Characteristics:
Intermittent Connection
Long/High Delays
Asymmetric data rate
High Error Rates
Lack of End-to-End
connectivity
4
Layered Architecture of DTN
5
Bundle Layer
Custody Transfer
Bundle Prioritization
Bundle Fragmentation
Bundle Reassembly
Custody Transfer
[6]
Routing in DTN
11
Categories of DTNs routing protocols
2. Multicast scheme:
Used to deliver message from one source to a group of their
interested destinations.
3. Any cast scheme:
It is like multicast scheme but the any cast destination is
Any one of the node within the group.
14
Vehicle Traffic Model
1. The performance of DTN routing protocols are closely related to the
mobility model of the network.
2. The car-following model is used in civil engineering to describe traffic
behavior on a single lane under both free-flow and congested traffic
conditions.
3. This model assumes that each driver in the following vehicle maintains a
safe distance from the leading vehicle and the deceleration factor is also
considered for braking performance and drivers’ behavior. Th e complete
mathematical model is given by
Vehicle–Roadside Data Access
1. Vehicle– roadside data access is also an important issue in
vehicle DTN network.
2. In vehicle–roadside data access,30 the roadside unit (RSU)
can act as a router in a delay-tolerant network or as an access
point for vehicles to access the Internet.
3. The deployment cost and maintenance cost are very high.
4. Another option, RSU can also be used as a buff er point (or
data island) between vehicles.
Roadside Unit(RSU)
1. All data on the RSUs are uploaded or downloaded by vehicles in this
paradigm. For example, some data, especially those with special/temporal
constraints, only need to be stored and used locally.
2. Applications that also belong to this case where the data is buffered at the
RSUs and will not be sent to the Internet include the following:
a) Real-time traffic
b) Value-added advertisement
c) Digital map downloading
A Model for Vehicle–Roadside Data Access
Delay-Tolerant Routing in VANETs
1. Vehicle delay-tolerant networks have many applications
Delivering advertisements
Announcements regarding sale information
Remaining stocks at a department store
Information such as the available parking spaces in a parking lot
The meeting schedule at a conference room
The estimated bus arrival time at a bus stop can also be delivered by
vehicle delay-tolerant networks
Vehicle-assisted data delivery (VADD)
1. Multihop data delivery through vehicular ad hoc networks is
complicated by the fact that vehicular networks are highly mobile and
frequently disconnected.
2. To address this issue, the idea of carry and forward is used, where a
moving vehicle carries a packet until a new vehicle moves into its
vicinity and forwards the packet.
3. It is different from existing carry and forward solutions, they consider
the use of predictable vehicle mobility, which is limited by traffic
pattern and road layout.
4. Based on the existing traffic pattern, a vehicle can find the next road
to forward the packet to reduce the delay. We propose several vehicle-
assisted data delivery (VADD) protocols to forward the packet to the
best road with the lowest data-delivery delay.
VADD follows the following basic
principles
1. If the packet must be carried through certain roads, the road with higher
speed should be chosen.
2. Transmit through wireless channels as much as possible.
3. Owing to the unpredictable nature of VANETs, the packet cannot be
expected to be successfully routed along the precomputed optimal path, so
dynamic path selection should continuously be executed throughout the
packet-forwarding process
Performance Metrics
Delivery Ratio:
It represents the number of successful message transfers.
Overhead Ratio:
The number of message transmissions performed for each created
message is called overhead ratio.
Average latency:
The amount of time taken by the message from source
to destination is called latency.
Number of hops utilizes / Hop count:
It shows that how many hops are utilized by the
protocol.
33