Abstract: A novel cluster selection algorithm is proposed in view of network security in this paper. The algorithm capability is enhanced by means of load-balancing. The algorithm is based on graph theory and use Kruskal algorithm to calculate the minimum spanning tree of topological structure of wireless Ad Hoc networks. The group on the minimum spanning tree is then generated and the cost of communication among nodes of the group keeps in a low level. The measure of load-balancing taken by the algorithm can prolong the lifecycle of the group head to maximum and keep stability of the whole network while the new and old Cluster are alternating.