Reseracher On Clustering Algorithms In Wireless Sensror Networks

Owing to the advances and growth in Micro-Electro-Mechanical System (MEMS) technology and wireless communication technology, wireless sensor networks (WSNs) are becoming increasingly attractive for numerous application areas, such as military reconnaissance, disaster management, security surveillance, habitat monitoring, medical and health, logistics management. In a wireless sensor network, clustering sensors into groups can balance load on sensor nodes and extend network lifetime compared with the falt structure. In the last few years, a relatively large number of clustering algorithms has been developed.In this paper we analyze some existing clustering algorithms, then proposes a improved PLEACH algorithm and a new clustering algorithm which base on the Multiple Attribute Decision Making Theory. The main work of this paper is as follow:1) Based on the PLEACH algorithm, this paper present an improved PLEACH algorithm. In the PLEACH if the Sink node is not in the center of the network, the clusters will distribute unevenly. Especially the Sink node is outside the network, the algorithm cann’t work. In this paper we will find the center position of the network or the position which is near the center. Base on this center location, the clusters can distribute evenly.2) Intriducing the Multiple Attribute Decision Making Theory into cluster-head election. This will get rid of the disadvantages of some clustering algorithms which only take consideration of the residual energy or the distance between the clusters and the Sink node. Although some clustering algorithms consider serval attribute of the node, not at the same time, so the elected clusters are not the optimal ones. Compared with the improved PLEACH, the new algorithm can futher extend the network lifetime and the network stabile time.