00:01
Hello students, in this question given as a topology network in the first part of the question we have to calculate the minimum number of hops.
00:08
So for this the minimum number of for this hops the path is from a to e, g, j and m.
00:26
So to reach from the source a to the sink m there are there are minimum number of hops is equal to the 4.
00:50
In the next part of the question we have to calculate the minimum energy consumed per packet.
00:55
Since in this question each links represents represents y by x where x represents the latency and y represents the energy cost.
01:16
Now there are many paths like the first path is a to b, d, g, h, a.
01:31
So for this path the energy cost will be equal to the 1 plus 5 plus 2 plus 2 plus 1 plus 2 is equal to 13.
01:48
And the next is path is a, e, g, j for this the energy is equals to 2 plus 3 plus 3 plus 5, 3, 3 and 3 and this is the 3 is equal to 13.
02:12
The third path is a to c, e, f, g, i, j, l, m.
02:29
Now the energy is 1 plus 1 plus 1 plus 1 plus 2 plus 1 plus 2 plus 1 is equals to 10.
02:44
The fourth path is a, e, f, g, h, a, m.
02:55
Now the energy is 2 plus 1 plus 1 plus 2 plus 1 plus 2 is equals to 9.
03:04
And the fifth path is a, e, g, i, j, l, m and energy is 2 plus 3 plus 2 plus 1 plus 2 plus 1 is equals to 11.
03:25
Now the minimum energy consumed per packet will be equal to the in all the energy that minimum energy is 9.
03:32
So the answer will be 9.
03:35
In the next part of the question we have to calculate the shortest latency...