Adaptive Freeshape Clustering for Balanced Energy Saving in the WirelessHART Networks

Algorithm 1

The adaptive subdividing at node .

Search the neighors in the cluster, and collect the information such as the centre point, radius, etc.

if the circumference is a FCC then

//Check the cross point

for Each neighbor in the cluster do

Calculate the cross points at the circumference of node and ;

//Explore the blind zone

for Each cross point at the circumference do

if the cross point is covered by two nodes

then

The cross pint belongs to a blind zone;

else

The cross pint is a general vertex;

//Adjust the radius

if There exists a blind zone then

Set the radius to cover the farthest vertex of the blind zone;

else

Set the radius as 0;