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 269
- Downloads 9
Improved Performance by Trusted Path Under Various Attacks in Mobile Ad Hoc Network
MANET is self-configuring, autonomous and dynamic infrastructure in which the nodes can acts as hosts as well as router in the network. MANET is having an open-source, decentralized, and dynamic infrastructure which mea...
slugA Survey- Qr Code Based Navigation System for Closed Building Using Smart Phones
Smart phone is essential part of our day - to - day life . The main feature of Smart phone is mobility in other words move from one place to other place i.e. n avigation . Many of the Smart...
Brain Computer Interface
A BRAIN COMPUTER INTERFACE (BCI) is a direct communication pathway between the brain and an external device. The concept of BCI had coined in 1970s at the University of California Los Angeles (UCLA). Growth in neurosci...
A Three Level Ac-Dc Conversion with Boost Converter
A new three level AC-DC conversion along with boost converter is proposed. The proposed converter integrates the operation of the boost power factor correction and the three level dc-dc converters. The converter is made...
ew Machine Learning Crawling Algorithm For Web Forums
In this paper, we present FoCUS (Forum Crawler Under Supervision), a supervised web-scale forum crawler. The goal of FoCUS is to only trawl relevant forum content from the web with minimal overhead. Forum threads contai...