A wireless sensor network (WSN) consists of large number of autonomous sensors nodes; these nodes communicate with each other in dispersed manner to observe the environment. WSNs become one of the most important researches in modern communication systems. The energy source of nodes is limited and practically it is impossible to change or charge the battery. In order to save energy and increases the life time of battery in WSNs. Many energy routing protocols using the clustering were proposed in the literature. Low Energy Adaptive Clustering Hierarchy (LEACH) is the most famous routing protocol. In this paper we propose a new algorithm to choose the cluster head which has the highest energy. We shared the network to four regions, between them 90° for each part we find the powerful sensor between the sensors groups, and this last will be the cluster head of this round. Each sensor sends its data to the nearest cluster head and this last will send it to the sink. The same work for five and six clusters heads with sink in the center and in the corner (100, 0) is done.
A Low Energy Consumption Clustering Routing Protocol Based on K-Means
