【摘要】 从网络安全的角度出发提出了一种新的群头选择算法,并结合相应的负载平衡措施改善该算法的性能。该算法以图论为理论背景,使用Kruskal算法求出无线Adhoc网络拓扑结构的最小生成树,在最小生成树上生成群,确保群内结点间通讯的代价保持在一个较低的水平。该算法采取的负载平衡措施最大限度地延长了群头的生命周期,并可在新老群头交替时保持整个网络的稳定性。更多还原

【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.更多还原