Answer Happy

A2 45 4 LQ 5 3 A1 1 1 A6 1 1 10 A3 A4

Consider a routing protocol is used with the shortest path metric for the following WSN in the previous question graph: Ai is the label of the node and the number on the line connecting nodes denotes the distance weight between nodes (SAiAj). For example the distance weight between Al and A2 is 8A1A2=5. Node 1 is the destination node. The shortest path from node Ai to node 1 that travel at most h lines and goes through node 1 only once is called a shortest (≤ h ) walk, and its length is denoted by Dhi Therefor D₁ = 0 for any h and Dá = ∞, if the distance between Ai and Al has more than h lines. A) Find Do¡ for i = 1,2,3,4,5, and 6. Determine §Ã¡Ã¡ for all possible i and j between 1 and 6. B) The following iteration is used to generate the subsequent shortest distance weight C) Dh+¹ = min¡(Dh¡ + §µiªj) and i ‡ 1. Determine DA¡ for i = 2,3,4,5,6 Ai = D) Use the iteration equation in (b) to compute D², D³i, Di....... Stop when Dh+1 D. The minimum distance from nodeAi to node 1 is . DA in the last iteration.