Evidence-Efficient Multihop Clustering Routing Scheme for Large-Scale Wireless Sensor Networks

Algorithm 2

Backbone construction.

Q←∅//  Initialization, Q is the set of the minimum aggregation tree

for each path   //G represents the node set of the candidate cluster heads

Sort the path into an increasing order by weight ;

end

for each , taken in an ascending order by weight ;

if  &&No loop then

Q←;

end

end

return  Q