P-leach Protocol for Wireless Sensor Network
Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2014, Vol 2, Issue 9
Abstract
Reducing the energy consumption of available resources is still a problem to be solved in Wireless Sensor Networks (WSNs). Many types of existing routing protocols are developed to save power consumption. In these protocols, cluster-based routing protocols are found to be more energy efficient. A cluster head is selected to aggregate the data received from root nodes and forwards these data to the base station in cluster-based routing. The selection of cluster heads should be efficient to save energy. In P-LEACH protocol, dynamic clustering for the efficient selection of cluster heads has been used. The routing protocol works efficiently in large as well as small areas. For an optimal number of cluster head selection it divided a large sensor field into rectangular clusters. Then these rectangular clusters are further grouped into zones for efficient communication between cluster heads and a base station. It performed NS2 simulations to observe the network stability, throughput, energy consumption, network lifetime and the number of cluster heads. In P-LEACH routing protocol out-performs in large areas in comparison with the LEACH, I-LEACH. It has been done in P-LEACH, which residual energy and distance of node from BS are used as parameters for CH selection. To save energy, start the steady state operation of a node only if the value sensed by a node is greater than the set threshold value. The threshold value will be set by the end user at the application layer. P-LEACH is then qualitatively and quantitatively analyzed. It has been done that the P-LEACH in terms of network lifetime and took less energy consumed when the amount of data to transfer to BS. If maximum number of nodes is alive with time, shows the network lifetime. In P-LEACH, 90 nodes are alive for 50 sec. If maximumnumbers of nodes are alive for long time, the network life time increased. It has been found that first node dies at 35 round and half of the node alive =250, last node dies at 1000, network settling time =1.9 sec and protocol overhead (bytes) =16. The result is that the network settling time is increased due to the maximum number of nodes alive and low energy consumption.
Authors and Affiliations
Alka Chandra, Parul Kansal
Keywords
Related Articles
- EP ID EP18727
- DOI -
- Views 287
- Downloads 9
Development Of An Optimized Hybrid System Based On PV And Biomass
enewable energy can be seen as one of the important prospect of today’s research, as it enlightens the lives of millions of people by fulfilling multiple necessities of their daily life and simultaneously overcomes the...
An Efficient Approach for Secure Hash Algorithm
Hash functions are the most widespread among all cryptographic primitives, and are currently used in multiple cryptographic schemes and in security protocols. A famous secure hash algorithm given by the National Institu...
FOODIE: An Android Application
In today’s hectic world of work loaded life, there is no time for an individual to give a dedicated schedule for making his daily meals. You just want to relax after returning from work, either by ordering in a takeaway...
Impact of Information Technology on Global management
Information technology is playing a very important role in the improvement of technology and its organizations. This paper describes us an very important role of technology in global management. IT also plays a role in...
Design and Quantization of FIR and IIR Filter for OFDM Signal
In Digital Signal Processing (DSP) applications, digital filter coefficients are an essential part. The principle goal is to design the FIR Filter using different windowing strategies such as Hamming, Hanning, Blackman...