傳統(tǒng)無線傳感網一般由大量密集的傳感器節(jié)點構成，存在節(jié)點計算能力、能源和帶寬都非常有限的缺點，為了有效節(jié)能、延長網絡壽命，介紹了基于聚類的K均值算法。該算法通過生成的簇頭節(jié)點散播到網絡的各個區(qū)域中，減少了每個區(qū)域內通信的能耗和可能會出現(xiàn)的一般節(jié)點過早死亡的情況，從而避免了網絡對該區(qū)域提早失去監(jiān)控。實驗證明，該算法對各節(jié)點位置確定的無線傳感器網絡有低能耗、高穩(wěn)定性特點，能較好的對無線傳感器網絡節(jié)點拓撲結構進行優(yōu)化，達到能量均衡的目的。

　　Abstract:

　　Traditional wireless sensor network was consisted of a large number of dense sensor nodes generally， which has the disadvantage that the node’s computing power， energy and bandwidth are very limited. In order to save energy effectively and prolong the network lifetime， the K-means algorithm based on clustering was introduced. By interspersing generated cluster head nodes to each area of network， the algorithm reduced the communication consumption of each area and the possible condition of common nodes’ premature death. Thus it avoid the network prematurely losing control to the region. The experiment results show that for the wireless sensor networks that each node has determinate location， the algorithm has the features of low energy consumption and high stability. It can preferably optimize the topology of wireless sensor network nodes， and achieve the purpose of energy equilibrium.