Evaluation and Comparative Study of the Both Algorithm LEACH and PEGASIS Based on Energy Consumption

Abstract

The main purpose of hierarchical routing is to effectively maintain the energy consumption of sensor nodes by involving them in multi-hop communication within a cluster and by aggregating and merging data to reduce the number of messages sent to the destination. Cluster formation is usually based on the energy reserve of sensors and on sensors that are close to the cluster head. LEACH (Low Energy Adaptive Clustering Hierarchy) is one of the first routing approaches for sensor networks. The principle of LEACH consists of dividing the network into distributed clusters at one pop to faster data delivery. An improved version of the LEACH protocol is proposed; it is called PEGASIS (Power-Efficient Gathering in Sensor Information Systems). PEGASIS forms chains of sensor nodes rather than clusters so that each node transmits and receives only data from a neighbor. The aims of this paper are first to study both protocols LEACH and PEGASIS. Secondly, to estimate the energy consumption by both protocols in Wireless Sensor Networks, Finally to show the results of comparative study between the LEACH and PEGASIS.