Research Article

Combinatorial Optimization-Based Clustering Algorithm for Wireless Sensor Networks

Algorithm 2

Clustering process.
CH Cluster head
PB Personal best value
GB Global best value
FFV Fitness function value
Update velocity vector
if random number < value of Sigmoid function
 Node is elected as CH
else
 Node acts as member
end if
 Update position vector
for each (member node)
 Calculate distance to every CH
 Join the nearest CH’s cluster
end for
Calculate FFV
if FFV < PB then
 PB ⟵ FFV
end if
if PB < GB then
 GB ⟵ PB
end if
Get best position vector according to GB