|
Algorithm 2 Pseudocode of the MST-Based System |
-
1:
Initialize: Problem settings including , , , , , , (N), (T), (t)
-
2:
Randomly initialize the locations of the network node group
-
3:
for to T do
-
4:
for to N do
-
5:
Update the position of the ith candidate solution through the movement rules of a swarm intelligence optimization algorithm
-
6:
Substitute the ith candidate solution into the minimum spanning tree algorithm to obtain the fitness value
-
7:
end for
-
8:
Update the network node group to determine
-
9:
end for
-
10:
Output: All potential sensor node deployment locations around the shortest path return Best solution
|