무선 센서 네트워크에서 네트워크 수명 연장을 위한 에너지 효율적인 클러스터링 알고리즘

Abstract

In oder to operate sensor networks effectively, it is very important to use the energy in the individual nodes efficiently and so increase their lifetime. Currently, cluster-based routing protocol algorithms which is widely applied in sensor network make it possible to improve energy efficiency of sensor network as much as possible by minimizing data transfer between cluster head and cluster nodes. For example, cluster-based routing algorithms such as LEACH and HEED obtain the efficiency of energy using data transfer between cluster heads and its members. In this thesis, we analyze the typical cluster-based routing algorithms and suggest a new energy efficient method of electing the cluster heads with the maximum delay of dead nodes occurrence. Also the new algorithm was combined with K-means clustering. The efficiency of the proposed algorithm is verified through MATLAB simulation.