Professional Documents
Culture Documents
Virendra S Shekhawat
Department of Computer Science and Information Systems
BITS Pilani
Pilani Campus
Agenda
Routing in DTNs: Taxonomy and Design
[CH-27]
Reading
Routing in Delay Tolerant Networks by Sushant Jain, 2004
conferences.sigcomm.org/sigcomm/2004/papers/p299-jain111111.pdf
[CH-28]
Reading
Routing in Delay/Disruption Tolerant Networks: A taxonomy, Survey and
Challenges by Yue Cao, 2012
ukchinab4g.ac.uk/sites/default/files/5_Achievements/journal/routing_de
lay.pdf
3
First Sem 2015-16
Routing Taxonomy
4
First Sem 2015-16
Opportunistic Routing
Basic Primitives of
Opportunistic Routing
Message Replication
Greedy Replication
Controlled Replication
Utility based Replication
Message Forwarding
Based on absolute utility criterion
Based on relative utility criterion
Message Coding
Source Coding
Network Coding
8
First Sem 2015-16
Message Replication[1]
Message Replication- A relay X carrying a copy of msg m
can decide to spawn a new copy of m and forward it to
the newly encountered node, Y
1. If the new neighbor does not have a copy of this msg
2. If node have buffer space available
3. If the context of the two nodes allows
Epidemic Routing[1]
Give a message copy to every node encountered
essentially: flooding in a disconnected context
D
E
D
C
11
First Sem 2015-16
Epidemic Routing[2]
How many transmissions (per message)?
At least N
All nodes receive the message
12
First Sem 2015-16
Delay?
Finite if each node meets every other nodeeventually
15
First Sem 2015-16
E
Relay C cannot FWD to B
B
D
Src
Dst
16
BITS Pilani, Pilani Campus
E
L=1
L=1
L=1
B
L=4
D
Src
D
D
L=2
L=2
Dst
C
17
First Sem 2015-16
Message Replication[3]
Utility based replication- the forwarding decision
depends on the context of the current custodian and
that of the candidate relay node
Uncontrolled utility based replication: e.g. A node forwards a
new copy to a new neighbor only if the neighbor has a high
enough probability of the future encounter with the
destination (used to improve epidemic routing)
Controlled utility based replication: e.g. Number of replicas of
a message delivered to a relay node can be decided based
upon the ratio of encounter value that the relay advertises
19
First Sem 2015-16
Utility Functions
Destination Dependent
Destination Independent
Amount of mobility
Node resources
Cooperative behavior
Trustworthiness
20
BITS Pilani, Pilani Campus
Prophet Routing
Like Epidemic routing, but maintains a probability of
delivery for each node pair p(i,D)
Node i copies message to j only if p(j,D) > p(i,D)
Algorithm:
Path Probability
D
p(i,D) = 1
Contact with j
D
i
p(i,D) * t, ( < 1)
D
i
p(i,D) = f(p(i,D),p(j,D))
21
22
BITS Pilani, Pilani Campus
Message Forwarding
By message forwarding, a node relinquishes its copy
of msg and ceases to be one of its custodians
Forwarding can be done based on a utility function or in
a probabilistic manner
If a node i carrying a msg copy for a destination d
encounters a node j with no copy of the msg then
Uj(d) >Uth (Absolute utility criterion)
Uj(d) > Ui(d) (Relative utility criterion)
e.g. If utility function is lower than a certain threshold, nodes
with highest mobility to move farthest in the network are
chosen as relays
23
First Sem 2015-16
Message Coding
Message can be coded at the source (aka source coding)
or in the network (aka network coding)
Source coding- Increases delivery reliability and
reducing worst case delay
Network Coding-A way to increase the capacity of the
wireless networks
24
First Sem 2015-16
x1
Incoming links
x2
x3
x2
x1
x3
x2
x1
Outgoing links
x3
Store-and-forward
First Sem 2015-16
25
BITS Pilani, Pilani Campus
Incoming links
x3
x2
x1
f(x1,x2,x3)
Outgoing links
Network Coding
First Sem 2015-16
26
BITS Pilani, Pilani Campus
msg x1:
f(x 1 , x 2 ) x1 x 2
msg x2:
f(x1,x2):
27
First Sem 2015-16
msg x1:
f(x 1 , x 2 ) x1 x 2
msg x2:
f(x1,x2):
28
First Sem 2015-16
msg x1:
f(x1,x2):
msg x2:
29
First Sem 2015-16
A x2
B x1
B x1
A x2
No coding: delay = 4
First Sem 2015-16
30
BITS Pilani, Pilani Campus
B x1
x1 x 2
A x2
B x1
A x2
x1 x 2
Coding: delay = 3
First Sem 2015-16
31
BITS Pilani, Pilani Campus
MAXPROP (1/2)
Motivated by pedestrian mobility and city vehicles (busses)
Addressed resources issues considering vehicles
Bulky equipment
energy
Assumes
Unlimited buffer for own messages per node
Fixed size buffer for relaying messages
No topology knowledge/control
32
First Sem 2015-16
MAXPROP (2/2)
Communication steps (flooding-based!):
1. Neighbor Discovery
(no knowledge of when the next opportunity to communicate will be)
2. Data Transfer
a)
b)
c)
d)
e)
f)
3. Storage Management
(expunge packets to accommodate the relay buffers)
33
First Sem 2015-16
RAPID Protocol
RAPID: Resource Allocation Protocol for Intentional DTN
Routing
Goal: Intentionally affect a single routing metric (e.g.
average delay, missed deadlines, and maximum delay)
Method: Utility function (Ui) based replication(Ui is
defined as expected contribution of packet i to this
metric)
Average Delay Optimization: Ui = - D(i)
The protocol replicates the packet that results in the greatest
decrease in delay among all packets in its buffer
34
First Sem 2015-16
Thank You !
36
First Sem 2015-16