Information Technology Reference
In-Depth Information
Localized Greedy Algorithm in an area of 200 × 200 metre square
200
1 20
1 0
Nodes
Paths b/w nodes
3 4
4 5
4 8
180
2 6
4 7
160
1 8
3
4 2
7
2 4
4 9
1 1
3 2
140
1 5
4 4 1
1 7
2 5
120
3 3
4 3
5
3 1
100
3 7
1 6
2 1
50
80
1 3
1
4
1 2
60
9
2 8 23 0
8
40
3 36
33 9
1 4
2 3
6
20
2 2
4 6
2 7
4 4
0
0
20 0 0 0
100
120
140
160
180
200
Distance in X-axis in metres
Fig. 7.8 UDG model showing ideal path in an area of 200 × 200 m 2
Scattering of nodes in an area of 200 × 200 in metre square
200
1 9
20
1 0
3 4
4 5
4 8
180
2
2 6
4 7
160
1 8
3
4 2
7
2 4
49
1 1
3 2
140
4 1
1 5
1 7
2 5
40
120
3 3
4 3
100
5
3 1
3 7
50
1 6
2 1
80
1 3
1
4
60
1 2
9
2 8 2 30
8
40
3 5
36
3 9
1 4
38
2 3
6
20
2 2
4 6
2 7
4 4
0
0
20
40
60
80
100
120
140
160
180
200
Distance in X-axis in metres
Fig. 7.9 Transmission radius of optimum path of Localized Greedy Algorithm in an area of 200
× 200 m 2
In Fig. 7.9 , the source node is “1” and the transmission radius of node “1” is
represented with the black circle and the farthest neighbor from node “1” is node
“16” which is chosen as the next forwarding hop. Node 16 (transmission radius
Search WWH ::




Custom Search