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 261
- Downloads 9
Secure Sharing and Searching of Video Data
Social networking has become a part of daily life of every smart phone user. Sharing real time images and videos produces huge amount of traffic as well as data every day. Tremendous amount of video data is stored and s...
Efficient Processing of Top-K Preference Queries on Incomplete Information
Incomplete data is general, finding and scrutinizing these kind of data is basic starting late. The top k overwhelming (TKD) queries return k challenges that supersedes most extraordinary number of things in a given dat...
Automatic Engagement and Disengagement of Handbrake System Using Pneumatic system
One of the most important safety features in an automobile is brake. A typical automobile consists of two types of brakes, one for retarding the speed of vehicle while it is in motion and other is to hold the vehicle in...
LED Based Energy Efficient Wireless Street Light Control and Monitoring System
Lighting systems, particularly within the public sector, are still designed per the previous standards of reliability and that they don't usually profit of latest technological developments. Use of renewable energy sour...
Vibration Analysis of Cantilever Beam: An Experimental Study
The purpose of this study is to investigate the natural frequencies of a cantilever beam experimentally and validate the result with finite element analysis of the beam. The finite element analysis is performed in MATLA...