Part I - DSR vs. Power-Aware Routing
Consider route discovery using the DSR algorithm in MANETs.
(a) Detail the steps for finding the best route from S to D, as was explained in the lecture (using hop count as the cost metric).
E
F
B
C
M
A
G
H
D
K
N
(b) Now consider power-aware routing. In part (a), DSR worked on hop count, assuming each link had a weight of 1. With power-aware routing, the weights correspond to the power consumed to transmit data on each link. Starting from the figure below, find now the minimum cost path from S to D using power-aware routing.
0.5
0.5 E
S
0.2
0.3
0.1 C 0.2 0.2
F 1.0
B
0.6
0.3 0.5 M L
0.3
R T0.2
0.2
A
G
0.5
H
0.1
D /0.3
K
0.2
0.1
0.5
N