Paper Title
Energy Efficient Search Protocol

A semi-centralized stochastic election approach named SEARCH is studied in this paper and some changes to it are proposed. The main advantage of this protocol is that it boosts the cluster head threshold of sensor nodes in a favorable position while deteriorating it otherwise. Further, the SEARCH protocol assures an optimal number of cluster heads and a low time cost. It further prolongs the stable period by prolonging the round of half alive nodes surviving. We aim to extend this to include energy efficiency. Using SEARCH, the performance of the wireless sensor network by eliminating the scenario in which no cluster head emerges. By making this stochastic election protocol energy efficient the gains are namely, the number of dead nodes would drastically reduce which increases the probability of a node to be elected as a cluster head. This would assure the presence of a cluster head in every round and therefore ensure that the data collected by the sensor nodes would reach the base station. One of the parameters being judged is the number of packets to the base station. This helps us in determining effectiveness of the WSN topology thus created. The base station is the end destination of the data collected by the network and a greater number of packets being sent to the base station indicates that the WSN is operational. Another parameter we judge is the count of cluster heads being elected per round which is also reflected in the preceding graph. A round in which a lower number of cluster heads are elected would send fewer packets of data to the base station. Further, we try to find the number of dead nodes as the rounds progress which would help in the determination of the network lifetime.