International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 11 | Nov 2019 www.irjet.net p-ISSN: 2395-0072 © 2019, IRJET | Impact Factor value: 7.34 | ISO 9001:2008 Certified Journal | Page 2405 Energy Efficient Enhanced K-Means Cluster-based Routing Protocol for WSN R. Renuga Devi and Dr. T. Sethukarasi 1 Research Scholar, Dept of Information and Communication Engineering, Anna University, Chennai, Tamil Nadu, India. 2 Professor, Department of CSE, RMK Engg College, Chennai, Tamil Nadu, India. ----------------------------------------------------------------------***--------------------------------------------------------------------- Abstract - In recent years Wireless Sensor Networks (WSN) is getting popular in wide range of applications. WSN consist of many sensor nodes which are capable of sensing, computing and communicating facility. The main challenge in WSN is the energy constraint, which is still being addressed by many works. Due to their limited power, they need to be utilized carefully. The proposed algorithm is an energy efficient K-means clustering-based routing protocol that considers an optimal fixed packet size based on radio parameters and channel conditions of the transceiver. This protocol can minimize the energy consumption of each node thus maximizes the network lifetime as a whole. In addition to that varying power levels are considered during data transmission from cluster head (CH) to cluster member. Simulation results prove that our algorithm performs better than conventional K-means based energy aware clustering (KEAC) in terms of network lifetime and increases the overall throughput of the network. Key Words: Wireless Sensor Network, Routing, Clustering, Energy efficiency, Network lifetime. 1. INTRODUCTION A wireless sensor network (WSN) consists of thousands of small size, low-power and energy-constrained sensor nodes. These nodes are deployed randomly in a field to sense the environment and transmit the required information to the sink node from where it reaches the end user. Sensor nodes are operated by batteries and deployed in remote areas which make it difficult to manually recharge and replace their batteries. Limited power of sensor node is one of the major concerns in wireless sensor networks. Sensor nodes in WSNs consume most of its energy in transmission and reception of packets from nearby nodes. Therefore, the design of an energy efficient scheme is a challenging issue for researchers. WSN use distributed sensor nodes to monitor various conditions of remote locations such as temperature, sound, vibration, pressure, motion and pollutants. A WSN is configured by sensor nodes equipped with sensing, computing and wireless communication capabilities. WSNs have many variants depending on applications and environments. Maintaining a long lifetime in WSN is important as limited and non-refilled battery are equipped in sensor nodes. 2. RELATED WORK Low Energy Adaptive Clustering Hierarchy (LEACH) is the first and most popular cluster based routing protocol. Based on this, several routing protocols have been developed, each of them having different attributes and improvements primarily in the network setup phase. Among several routing protocols clustering schemes have been proved to be more efficient [1-2]. Based on previous works, a new routing protocol has been proposed in this paper to increase the energy efficiency of the WSN. Firstly, K-means clustering algorithm has been used to divide the nodes in the form of clusters. Secondly, unlike other routing protocols, optimal fixed packet size is considered according to the radio parameters and channel conditions of the transmitter and receiver [3], to decrease energy consumption of nodes. Then the total amount of energy required to transceiver the packet is calculated. The standard weight of the cluster is defined by the total calculated energy and the average distance of the corresponding cluster nodes toward its cluster center. Finally, the node with weight almost equal to the standard weight within a cluster becomes the cluster head for that particular round. Moreover, two different transmission levels are considered for the communication from cluster head to the base station and cluster members [4]. This increases the energy efficiency of the system. Many cluster based routing algorithm have been presented in [5], and [6] provides solutions to the Energy efficient and Energy- balanced routing. In K-Hop Overlapping Clustering Algorithm (KOCA) [7], author deals with the idea of how to overcome overlapping in multi-hop clustering for WSN. The authors propose an algorithm to generate overlapping clusters which can cover the entire network field with a specific degree of average overlapping. 3. PROPOSED ALGORITHM Here the system model includes a Base Station (BS) and several sensor nodes within sensing, computing and communicating abilities. Nodes in WSN are classified into cluster heads (CH) and cluster members (CM). CMs sense the environment and transmit data to the CH. CHs aggregate the information and transmit it to the BS. It is the common and centralized approach of clustering protocol in which CH selection takes place in base station and the