ABSTRACT

To achieve efficiency in prolonging the lifetime of sensor networks many schemes

have been proposed. Among these schemes, a clustering protocol is an efficient
method that prolongs the lifetime of a network. However, in applying this method,
some nodes consume energy unnecessarily because of an environment in which the
collected data of the sensor nodes easily overlap. In this paper we propose a
Clustered Multi-hop Routing Algorithm which reduces unnecessary data transmission
among nodes by excluding the duplication of data. This method prevents data loss
caused by link failure problem and thus the data is collected reliably. According to
the results of the performance analysis, our method reduces the energy consumption,
increases the transmission efficiency, and prolongs network lifetime when compared
to the existing clustering methods.
objectives

Main objectives of the proposed method is to reduces the energy consumption,

increases the transmission efficiency, and prolongs network lifetime
Literature review
 Grid Block Energy Based Data Gathering Algorithms for Wireless Sensor Networks

In this paper Grid Block Energy based hierarchical Data Gathering (GBE-DG) algorithms for wireless sensor networks. We
divide the whole sensor network into grid blocks of equal size. The energy level of a grid block is the sum of the energy levels
of the sensor nodes located in it. Simulation results show the GBE-Chain-DG trees to be relatively better than GBE-Cluster-DG
trees and both these algorithms perform considerably better than the well-known LEACH and PEGASIS data gathering
algorithms.

 A Stable Election Protocol for clustered heterogeneous wireless sensor networks

propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as
stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is
based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node.
We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater
than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to
heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for
higher values of extra energy brought by more powerful node
Literature review
 Energy-Efficient Communication Protocol for Wireless Micro sensor Networks

In this paper LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized

rotation of local cluster base stations(cluster-heads) to evenly distribute the energy load among the sensors in the network.

LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion

into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show that

LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional routing protocols. In

addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for

the networks we simulated

 HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks

We present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according

to a hybrid of the node residual energy and a secondary parameter, such as node proximity to its neighbors or node degree.

HEED terminates in Oð1Þ iterations, incurs low message overhead, and achieves fairly uniform cluster head distribution across

the network. We prove that, with appropriate bounds on node density and intra cluster and inter cluster transmission ranges,

HEED can asymptotically almost surely guarantee connectivity of clustered networks. Simulation results demonstrate that our

proposed approach is effective in prolonging the network lifetime and supporting scalable data aggregation.
Existing system
This paper proposes a new regional energy aware clustering method using isolated nodes for
WSNs, called Regional Energy Aware Clustering with Isolated Nodes (REAC-IN). In REAC-IN,
CHs are selected based on weight. Weight is determined according to the residual energy of each
sensor and the regional average energy of all sensors in each cluster. Improperly designed
distributed clustering algorithms can cause nodes to become isolated from CHs. Such isolated
nodes communicate with the sink by consuming excess amount of energy. To prolong network
lifetime, the regional average energy and the distance between sensors and the sink are used to
determine whether the isolated node sends its data to a CH node in the previous round or to the
sink. The simulation results of the current study revealed that REAC-IN outperforms other
clustering algorithms.
Proposed system
In this paper we propose a Clustered Multi-hop Routing Algorithm which reduces
unnecessary data transmission. This method prevents data loss caused by link
failure problem and thus the data is collected reliably. According to the results
of the performance analysis, our method reduces the energy consumption,
increases the transmission efficiency, and prolongs network lifetime when
compared to the existing clustering methods.
Block diagram