Information Technology Reference
In-Depth Information
100
100
19
19
25
25
34
34
10
10
30
30
80
80
28
27
28
14
27
14
35
35
20
31
20
31
33
33
2
2
12
12
36
36
21
23
23
5
5
21
60
60
4
4
7
39
7
26
39
26
1
37
1
37
6
6
40
24
40
8
8
32
24
32
11
11
17
17
13
13
9
9
16
16
38
29
38
29
20
40
20
15
40
15
18
18
3
3
22
22
0
0
0
20
40
60
80
100
0
20
40
60
80
100
Distance(m)
Distance(m)
Fig. 5.
Tree topology model
Fig. 6.
Results of ACRA
Tabl e 1.
Example of Routing
Source node Destination node Relay/Center nodes
1
5
7-20
1
9
37-24
1
22
11-15
tree topology. The ACRA is reliable and strong enough to reduce the network
reconfiguration frequency significantly.
3 Routing Maintenance and Reconstruction Algorithm
3.1 Routing Maintenance Principle
By the reasons of openness and time variability of the low-voltage power line
network, bad nodes will appear in the operation of the network. In order to
ensure the success rate of the data collection for BS, two principles to maintain
the route are proposed:
1) After bad nodes caused by routing interrupt in the completed networking,
the reconstruction process of local routing for the bad node is to start.
2) During the idle periods of the network, BS initiates the routing detection
instructions. If any bad node is found, the principle 1) is in implementation to
establish new communication routes.
3.2 Routing Reconstruction Algorithm
As shown in Fig.2, we assume that central node 13 in logical layer 2 has not
received any information sent by node 11, so that it is confirmed to be a bad
node, node 13 initiates the reconstruction process of local routing:
Search WWH ::
Custom Search