Skip to main content
. 2022 Feb 28;22(5):1894. doi: 10.3390/s22051894
Algorithm 2 Testing procedure on the Raspberry boards.
N={6,9,12,15} ▹ Number of sensors
V={80,75,70,65,60,55} ▹ Noise variances
I={Random,Intelligent} ▹ Types of swarm initialization
A={CS,GWO,EEHO,MFO,WOA,SSA,TGA,COA,SDO,MFO}
for all(n,v,i,a)N×V×I×Ado
    data=LoadDataset(n,v) ▹ Energies, sensors’ positions, etc.
    results=[]
    for m=1,2,3,,10.000 do
        startTime= Clock()
        X^ = Execute(a,n,i, data[m]) ▹ Location estimation by algorithm a. X^ contains
the best solutions found so far at each iteration of the algorithm
        executionTime=Clock() − startTime
        results=[results;X^executionTime]
    end for
    SaveToFile(results)
end for