Clustering Algorithm for Energy- Efficient Wireless Sensor Network

Wireless networks data aggregation allows in-network processing, reduces packet transmission and data redundancy, and thus helps extend wireless sensor systems to the full duration of their lives. There have been many ways of dividing the network into clusters, collecting information from nodes and adding it to the base station, to extend wireless sensor network life. Certain cluster algorithms consider the residual energy of the nodes when selecting clusterheads and others regularly rotate the selection head of the cluster. However, we seldom investigate the network density or local distance. In this report we present an energy-efficient clustering algorithm that selects the best cluster heads of the system after dividing the network into clusters. The cluster head selection depends on the distance between the base station nodes and the remaining power of this approach.Each node's residual energy is compared to the node count. Our results show that the solution proposed more efficiently extends the life of the wireless sensor network. The algorithm prolongs the life and effectiveness of the Wireless Sensor Network.

this paper we propose the LEACH (RCH-LEACH) algorithm for residual energy-based cluster management to stabilize the formation of a network cluster. This algorithm employed few additional parameters for the selection of CHs, for example threshold energy, node residual energy, and optimal cluster number [19].

Literature Review
We propose in this document an energy efficient multi-hop transmission strategy with the cluster phase of the organization. Our main goal is to develop a new transmission technology that minimizes power consumption. It is a multi-hop transmission technique where the selected transmission relays offer the lowest transmission power while maintaining the SNR level equal to the Ś th threshold. Therefore, in comparison to the direct transmission and transmission the proposed transmission technique can significantly reduce energy consumption when the CH node is selected randomly inside the cluster. Simulation results show that a significant increase in energy saving is the addition of an organization cluster phase before data transmission. This study [1] broadly examines and speaks of the algorithms that have been developed to deal with the problems and systems that have inspired time synchronization over WSN and the transmission condition properties of deafness and packet collider by integrating energy-efficient fires. In particular, it is an exhaustive examination incorporating the transmission state instrument, points of interest and detrimental effects of past related work. The report helps scientists to (1) avoid the uncertainty that occur in the transmission state of WSNs, (2) to prevent the packet collision during the transmission in WSNs, and (3). It also contains the recommendation for future research of several relevant, open-ended issues. In this paper [2] we propose a multi-hop transmission technology based on the Dijkstra algorithm for the Wireless Sensor Networks (WSN). A WSN of N sensor nodes is considered. Firstly, we group the sensor nodes to clusters based on their position in the area of monitoring, then arrange the nodes for each cluster, choose the appropriate node as a cluster head and classify the remaining nodes into active nodes and sleeping nodes. We then choose the set of reliable relays to transmit data with the least transmission power. Our proposed algorithm for relay selection is based on Dijkstra. The paper is mainly aiming at defining a new transmission strategy which improves the results of our previous work [2] by reducing power consumption more effectively. This paper [3] examines WSNs' energy-efficient cooperative communication across frequency-selective fading channels. For systems over frequency-selective fading channels, the closed-form bit error rate expressions are derived. The optimum transmission power allocation solutions and the selection of the Partner Node will be provided to explore fully the energy conservation potential of cooperative communications. Moreover, it is proved that chip-interleaving techniques in WSN's with flat fading channels can be used to significantly improve communication quality. Thus this paper examines the energy saving potential in frequency selective decomposition of chip-interleaved transceivers in WSN. This article [4] proposes a new energy-efficient routing technology scheme for the remote monitoring of agriculture in WSN. In this system, a crop field has various sensor node types with limited source of power, randomly positioned for sensing different soil characteristics like salinity, humidity, temperature and PH. In addition to grid-shaped clusters, this system includes a tolerance of sensory data of the above-mentioned parameters to offer efficient clustering and percentage tolerance. The efficiency of the proposed system was assessed by the number of live nodes and the number of data packets transmitted and received. In the case of MECA and PEGASIS, [5] we propose an energy-efficient lifetime improvement Strategy for WSNs. The objective of this algorithm is to minimise and balance the use of energy for all sensor nodes and cluster heads. We split the network into a series of equal groups and multi-hop routing is used to save energy in the intra-cluster routing. A chain such as PEGASIS is connected to the cluster heads so that a distant cluster head can not be sent to the sink node. Results of simulation show that the routing algorithm proposed is less consumed than traditional routing algorithms such as LEACH. This Paper [6] aims mainly at finding ways of improving WSNs and increasing their lives. In this paper, we propose a compressive sensing clustering algorithm, using certain clustering algorithms to significantly save WSN energy. Furthermore, in various sensing conditions we show the optimal number of clusters and optimize energy consumption for WSNs. The papers proposed [7] that the energy consumption should be deduced and that the lifetime of the Wireless Sensor Network (WSN) connection set be improved. The data is transferred throughout the system via each sensor to a single process center that uses all communicated data to view or find the occasion for individual settings. To reduce the sensors' restricted energy capability, the message travel method should be premeditated. Cluster sensors were strongly grouped into teams so that sensors would only be available with contact information to cluster heads so that the cluster heads could exchange information to the process center, saving energy. The primary aim of this paper is to begin an examination in the literature of Wireless Sensor Networks of cluster Algorithms and cluster parameters. Additionally, WSNs propose energy-efficient cluster algorithms. This paper [8] produces an overall energy efficient mathematical optimisation model in hybrid SDWRSNs that provides a sketch and paradigm for hybrid SDWRSN energy savings issues. We subsequently presented the hybrid SDWRSN energy-saving traffic planning (ETS). The ETS algorithm takes account of the losses of charging and new requirements of energy efficiency and calculates the flows from both (direct) and (indirect) SDN nodes. The results of the simulation show that the energy efficiency of hybrid SDWRSNs can be significantly improved by up to 20-40% on traditional routes. For this reason, ETS can make the network work much longer-term more consistently and efficiently. This paper proposes [9] a new energy efficient routing system in WSN for remote monitoring of agriculture. In this system, a crop field has various sensor node types with limited source of power, randomly positioned for sensing different soil characteristics like salinity, humidity, temperature and PH. In addition to grid-shaped clusters, this system includes a tolerance of sensory data of the above-mentioned parameters to offer efficient clustering and percentage tolerance. Leach is a protocol for the hierarchy of less energy adaptive clustering. The primary objective of cluster-based sensor networks is to reduce system delay and energy consumption. Leach is an energy-efficient and scalable routing and fair media accès cluster-based protocol for micrometric sensor networks. In the network of wireless sensors, many improvements are made. In the network of wireless sensors, safety is very important. The main issue in this paper [11] is energy efficiency in developing WSN (Wireless Sensor Network) clusterbased routing protocols, since sensor nodes have low power levels. During data diffusion and receipt, sensor nodes mainly consume energy. The Wireless Sensor Network routing protocols should be energy-efficient, so that the lifetime of the individual node is not only increased, but that all wireless sensor networks can last longer. There are different routing protocols, but we selected LEACH because both the energy efficiency and the lifetime of the network are better performed. A distributed, independent energy system (DAEMS) is introduced in this paper [12]. The DAEMS is intended to be autonomous, scalable and reliable in energy trading, customer usage optimization and DER management. The aim of this paper will therefore be to create a technical platform to facilitate energy trade, thereby creating an energy market and enabling consumers to become involved in the green economy. This type of technical platform can be achieved with the formulation of energy efficiency algorithms for customers and the finding of suitable DER management methods in terms of energy consumption, generation and connectivity in real time.

ExistingSystem
A multihop transmission strategy with an organizational cluster phase is proposed by the existing system. Two steps are taken to implement this communication strategy. The first phase attempts to select the CH node and classify the other nodes into sleeping and active nodes within the cluster. The second step consists in selecting the set of reliable relays that offer the least power to transmit while keeping the SNR equal to the αth threshold. This set of nodes is used to transmit to facilitate communication with the source destination. The system first developed the cluster organization phase, and then the algorithm for relay selection. Our proposed multi-hop transfer strategy based on SNR threshold criteria is comprehensive.

A. Cluster Organization Phase
We have carried out a process before data transmission that allows the cluster to organize the nodes. This process takes two steps: first, we choose a node in the cluster as the head of the cluster. With possible minimal energy this node can communicate with any other node. The main function of the chosen CH node is to transmit data from the source node to a maintenance center to take the appropriate response. We suggest two methods based on the distance criteria in order to choose the CH node. So first of all, we calculate the distance of the matrix between all the cluster nodes. The first method is to choose the node with the lowest average distances from all nodes as CH. In the second method, the node with the maximum distance from all nodes is chosen as CH. The second step is the classification of the nodes in the cluster organization.

B. Relay selection algorithm
Our proposed technology aims at maintaining at the receiver a minimum SNR equal to αth and minimizing the total power consumption. In order to transmit the detected data to the cluster head with minimum power, we select a set of reliable transmissions to help source node.

C. Transmission Strategy
A cluster organization phase precedes the proposed transmission strategy. This enables the CH node to be chosen and two sleeping and active nodes classified into two groups. As cooperation is not always more energized than direct transmission, we did not restrict ourselves to co-operative transmission in our transmission strategy, but used both systems of transmission.

Implementation Details
The network and energy consumption model are defined below before detailing our proposed algorithm.  The WSN is shown as an undirected graph G (V, E), which contains nodes and borders G and E respectively.  The Base Station can be located anywhere in the area and after deployment the nodes are placed stationary.  A 2D matrix consisting of the unique IDs in every node is deployed in the graph and the Xi and Yi values are mentioned in TABLE I.  When initially deployed, all sensor nodes have variable energy levels, equivalent to one 1 Joule (J).  The sensor nodes are assumed to be of the same communications range and indicated by R.  A sub-set of the neighboring nodes denoted as N (v), which can be reached by v in R is each node v.  In each BS round, the IDs and the distances between nodes and their neighbours are sent for each node.  Sensor nodes transmit their data in a single-hop way to their respective CHs.

…….. (1)
ERx(l)= l Eelec …… (2) ………. (3) The LEACH algorithm is used to have the same energy model. The energy consumption per bit of the transmitter and receiver model is displayed as the energy used to transfer the l-bit packet over distance d in Equation (1) and in Equation (2) with Eelec for receipt. The parameters ∈fs and ∈mpare the power amps in the free space (2 loss), and the multipath (4 loss) as per the distance from the equation (3). Table 1. Node Representation In this section, we introduce our new Improved Energy Efficient Clustering Algorithm. IEECA is a distributed clustering approach involving local decision making for the choice of CHs and residual energy consideration in nodes. At the beginning of each clustering round, the base station provides all sensing nodes with information on each neighbours. This means that every node knows both the position and the residual energy of each node within its range before CH's are elected. The two important steps are our main idea: 1. In view of the above parameters, each node will choose itself as the candidate and update its position. This means that each sensor is either a CH or a member at the end of this step. 2. Based on the distance between nodes and CHs clusters will be formed. First, every sensor becomes a candidate and this status will be changed or not depending on the comparison. If I find a node that has greater energy than its own, it will change its status as a member, otherwise the density is compared, and if the sensor node has a higher density, the sensor node I will be regarded as more eligible to be CH. Every node will send a broadcast message to inform other nodes about their status if all nodes configure their status. The IEECA algorithm uses a probabilistic method for selecting CHs, comparing all of the sensor nodes and then we are sure that only one CH has been selected in the field R. The number of CHs is based on the range chosen. If the range is reduced, this number will increase.

Algorithm 1: Energy Efficient Clustering Algorithm
After this algorithm of clustering and division of nodes into numbers of clusters is implemented, the cluster head is chosen on the basis of distance, the key distribution is carried out in each node via the base station, and the route is generated from each node to the base station. Encrypt data using the private key's Paillier Cryptosystem algorithm.
Send all the data to the base station afterwards. Send all the data to the base station afterwards. When the data cluster head is sent to the cache, the data is first sent from the cache and then the data is sent from CH. The dataset with the appropriate keys decrypts the data.

1.
Generate the network diagram as diagram G(v, e), V is the vertical / node and E the edges.

2.
Implement the clustering algorithm over the nodes and divide the nodes into a cluster number.

3.
Select the Efficient Cluster Head based on energy, number of neighbours and distance from the base station.

4.
Execute the key distribution through the base station at each node. 5.
Execute from each node to the base station the route generations. 6.
Create data in each node and encrypt the data with the base station's public key. 7.
Calculate the encrypted data hash value and record the time stamp. 8.
Send the individual data from every member of the cluster to the cluster head. Also save data in cache memory when the cluster head capacity exceeds the limit. 9.
Collect all the information at the head of the cluster. 10.
Send data to the base station and aggregate all data. The base station accepts the cluster head data.

Experimental Setup
The Experiment is conducted using JUNG Simulator on the Windows platform, the System constructs on Java framework (JDK version 8). The Netbeans tool (version 8.1) is used for development. System requires no specific hardware for the application to run any standard machine.

Simulation Result
Following are Results generated during the implementation of the system. The outcomes appeared in Figure 2 and Figure 3 gives the Energy and Time Consumption while sending the information. For better investigation of the outcomes we have demonstrated the consequences of 5 tries. Presently the Energy and Time expended amid the transmission incorporates the assets used in delays. We characterize that handling delay signifies the execution time part nodes require to create their ciphertexts and comparing marks. The aggregation delay is estimated by deciding the time spent checking the marks from part nodes, amassing ciphertexts and marks, and creating the mark of the accumulated outcome. Unscrambling delay shows the time spent on in the end picking up the first information for the BS by confirming the totaled marks and decoding accumulated ciphertexts. To further evaluate the results, the system has been evaluated for different set of nodes for both the existing system and proposed system. The System has been tested for 30 nodes, 50 nodes, 80 nodes and 100 nodes. The results obtained represented in following figure 4 and 5.

Conclusion
Energy is one of the most critical resources of wireless sensor networks. Energy conservation was the main objective of literature for optimization of algorithms clustering. The algorithm's main point is to allow the whole sensor nodes to compete at random in the network. In accordance with the residual energy and local distance, we proposed the EECA Algorithm to select the cluster head for the CH to be used. The simulation results have shown that the EECA algorithm enhances network life. The security mechanism raises a key question for future work, given the operation of sensor nodes and the need to collect information to guarantee confidentiality, integrity, effective and secure routing in order to avoid malicious node attacks. The security mechanism is also important for future work.