Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s
lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period
The document presents an improved clustering algorithm for load balancing in wireless sensor networks. The algorithm aims to address uneven cluster sizes that can negatively impact load balancing. It does this by selecting master and vice master nodes to partition regions and subregions, aiming to make cluster sizes more balanced. The algorithm has setup and steady state phases. In the setup phase, regions are partitioned recursively if needed to select balanced cluster heads. In the steady state phase, nodes send data to their cluster heads, which then send aggregated data to the base station. Simulation results show the improved algorithm increases network lifetime and energy efficiency compared to LEACH and E-LEACH algorithms.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Magnify Network Lifetime in WSN by Reducing Data Aggregation Distance of Weak...ijwmn
Energy efficient protocols have always played a vital role in conservation of energy in Wireless Sensor
Network. One of the major introduced protocols is LEACH a cluster based protocol. To improve its
performance, an algorithm named as Maximizing the Network Lifetime of Clustered-based WSN Using
Probability of Residual Energy is introduced. This protocol improved the Cluster Head selection process of
LEACH by using the concept of residual energy. In the proposed paper, further improvement is done by
enhancing the data transmission process. This process heightens the lifetime of the nodes having very less
energy left by reducing their data transmission distance. Implemented results in MATLAB shows increase
in the stability and lifetime of the network..
The document describes the Heteroleach protocol, which aims to improve the stable operation of wireless sensor networks. It does this by using heterogeneous nodes, where some nodes called "advanced nodes" have higher initial energy than normal nodes. These advanced nodes have a higher probability of becoming cluster heads. This allows cluster heads to operate for longer without needing to rerun the setup phase, saving the overhead energy required for setup. According to simulations, the Heteroleach protocol was able to double the lifetime of the network compared to LEACH and SEP protocols by reducing the frequency of running the setup phase through the use of heterogeneous nodes.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s
lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period
The document presents an improved clustering algorithm for load balancing in wireless sensor networks. The algorithm aims to address uneven cluster sizes that can negatively impact load balancing. It does this by selecting master and vice master nodes to partition regions and subregions, aiming to make cluster sizes more balanced. The algorithm has setup and steady state phases. In the setup phase, regions are partitioned recursively if needed to select balanced cluster heads. In the steady state phase, nodes send data to their cluster heads, which then send aggregated data to the base station. Simulation results show the improved algorithm increases network lifetime and energy efficiency compared to LEACH and E-LEACH algorithms.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Magnify Network Lifetime in WSN by Reducing Data Aggregation Distance of Weak...ijwmn
Energy efficient protocols have always played a vital role in conservation of energy in Wireless Sensor
Network. One of the major introduced protocols is LEACH a cluster based protocol. To improve its
performance, an algorithm named as Maximizing the Network Lifetime of Clustered-based WSN Using
Probability of Residual Energy is introduced. This protocol improved the Cluster Head selection process of
LEACH by using the concept of residual energy. In the proposed paper, further improvement is done by
enhancing the data transmission process. This process heightens the lifetime of the nodes having very less
energy left by reducing their data transmission distance. Implemented results in MATLAB shows increase
in the stability and lifetime of the network..
The document describes the Heteroleach protocol, which aims to improve the stable operation of wireless sensor networks. It does this by using heterogeneous nodes, where some nodes called "advanced nodes" have higher initial energy than normal nodes. These advanced nodes have a higher probability of becoming cluster heads. This allows cluster heads to operate for longer without needing to rerun the setup phase, saving the overhead energy required for setup. According to simulations, the Heteroleach protocol was able to double the lifetime of the network compared to LEACH and SEP protocols by reducing the frequency of running the setup phase through the use of heterogeneous nodes.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
DYNAMIC RE-CLUSTERING LEACH-BASED (DR-LEACH) PROTOCOL FOR WIRELESS SENSOR NET...IJCNCJournal
A Wireless Sensor Network (WSN) contains a large number of sensor nodes equipped with limited energy supplies. In most applications, sensor nodes are deployed in a random fashion. Therefore, battery replacement or charging is considered not practical. As a result, routing protocols must be energy-efficient to prolong the network’s lifetime. In this paper, we propose a new Dynamic Re-clustering LEACH-Based protocol (DR-LEACH) which aims to reduce the energy consumption and extending the network’s lifetime. The idea is to balance energy consumption of Cluster Heads (CHs) by generating clusters with almost equal number of nodes during each round of the network life time. To perform this, we first calculate the optimal number of CHs in each round, and based on that we calculate the optimal size of each cluster. Results show that the proposed protocol improves network lifetime and reduces overall energy consumption compared to LEACH and BCDCP protocols.
The comparison between routing protocols based on lifetime of wireless sensor...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Erca energy efficient routing and reclusteringaciijournal
The pervasive application of wireless sensor networks (WNSs) is challenged by the scarce energy constraints of sensor nodes. En-route filtering schemes, especially commutative cipher based en-route filtering (CCEF) can saves energy with better filtering capacity. However, this approach suffer from fixed paths and inefficient underlying routing designed for ad-hoc networks. Moreover, with decrease in remaining sensor nodes, the probability of network partition increases. In this paper, we propose energy-efficient routing and re-clustering algorithm (ERCA) to address these limitations. In proposed scheme with reduction in the number of sensor nodes to certain thresh-hold the cluster size and transmission range dynamically maintain cluster node-density. Performance results show that our approach demonstrate filtering-power, better energy-efficiency, and an average gain over 285% in network lifetime.
This document discusses clustering techniques to analyze communication overhead in wireless sensor networks. It describes how clustering can help reduce energy consumption and traffic load by limiting redundant data transmission. The document compares the K-means and fuzzy clustering algorithms. The K-means algorithm partitions nodes into K clusters based on distance from cluster centers, while fuzzy clustering allows nodes to belong to multiple clusters. A simulation found that fuzzy clustering results in lower communication overhead than K-means as node velocity increases, helping to increase network lifetime.
A study of localized algorithm for self organized wireless sensor network and...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
One of Machine Type Communication (MTC) applications is Wireless Sensor Network
(WSN). WSN is an intelligent network application system to collect, integrate, and transmit data
autonomously. Sensor nodes in WSN, communicate over short distance via a wireless medium
and collaborate to accomplish a common task, such as enviroment monitoring, military
surveillance and industrial process control. The constraining aspect of WSN usage is the
limited power of each sensor node, so energy efficiency becomes an important issue in WSN.
Routing is a function in WSN, which consumes a substantial amount of energy. One of the
routing protocols that can increase the energy efficiency of WSN is Low Energy Adaptive
Clustering Hierarchy (LEACH). In this paper, High Altitude Platform (HAP) is used to replace
Base Station (BS) as sink node in WSN. HAP is designed at altitudes of 17, 20 and 22 km. Then
WSN over HAP using the LEACH routing protocol evaluated its performance. Performance
indicators that we evaluated are engergy consumption, number of dead nodes and total average
packets which is sent to HAP. From a series of simulations conducted, the results obtained that
the higher the laying of HAP, then the coverage area will be greater. So that the energy
consumption will be smaller, the number of dead node less and the avarage of total packet
delivered to the HAP will be greater.
Prolong Lifetime Analysis and Efficient Utilization of Energy in Heterogeneou...IJTET Journal
Abstract - The clustering-based protocols are believed to be the best for heterogeneous wireless sensor networks (WSNs). The evaluation is based on two new clustering-based protocols, which are called single-hop energy-efficient clustering protocol (S-EECP) and multi-hop energy-efficient clustering protocol (M-EECP) [1]. In S-EECP, the cluster heads (CHs) are elected by a weighted probability [2] based on the ratio between average energy of the network and residual energy of each node. The nodes having more initial energy and residual energy will have more chances to be elected as CHs than nodes with low energy. In M-EECP, the election of CHs is same as S-EECP, but the elected CHs communicate the data packets to the base station via multi-hop communication approach. To analyze the network lifetime three types of sensor nodes equipped with different battery energy are assumed. By analyzing these parameters, M-EECP achieves load balance among the CHs better than the existing clustering protocols and gives prolong network lifetime. Here the simulation is based on ns-2 simulator.
Maximizing Network Lifetime by Using Smart Cluster Head Selectioniosrjce
This document summarizes a research paper that proposes a smart cluster head selection technique to maximize the lifetime of wireless sensor networks. The paper first describes how wireless sensor networks use clustering to improve energy efficiency. It then discusses the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol and its limitations. Specifically, LEACH does not distribute cluster heads uniformly, which can lead to long communication distances. The paper proposes selecting cluster heads only from inner sensor nodes to reduce intra-cluster communication distances. Simulation results show that the smart cluster head selection approach reduces node death rate, energy consumption rate, and increases data received at the base station and overall network lifetime compared to the basic LEACH protocol.
9.distributive energy efficient adaptive clustering protocol for wireless sen...Chính Cao
The document proposes a new clustering protocol called DEEAC for wireless sensor networks. DEEAC is adaptive based on the data reporting rates and residual energy levels of nodes. It aims to distribute energy consumption more evenly across the network by selecting cluster heads that have high residual energy and are located in "hot regions" with high data generation rates. This is intended to prolong the lifetime of sensor networks compared to the original LEACH protocol.
This document summarizes an energy efficient clustering algorithm proposed for wireless sensor networks. It discusses the objectives, existing system, proposed system, simulation results and conclusions. The existing system uses a distributed self-organization balanced clustering algorithm (DSBCA) that has uniform cluster sizes and issues with node dropout. The proposed energy efficient clustering algorithm (EECA) forms unequal cluster sizes based on average neighbor energy and selects cluster heads through uneven competition ranges. Simulation results show the heterogeneous EECA provides longer network lifetime, higher efficiency and throughput than the homogeneous EECA.
Faulty node recovery and replacement algorithm for wireless sensor networkprjpublications
This document describes a Fault Node Recovery and Replacement algorithm for wireless sensor networks that combines grade diffusion and genetic algorithms. It begins by explaining grade diffusion and genetic algorithms, as well as existing fault recovery techniques. It then introduces the Fault Node Recovery and Replacement algorithm, which uses grade diffusion to create routing tables and genetic algorithms to replace sensor nodes when they fail. The algorithm aims to reuse existing routing paths and replace fewer sensor nodes to extend the lifetime of the wireless sensor network while reducing replacement costs.
Power saving mechanism for hybrid routing protocol using scheduling techniqueeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Sensor Energy Optimization Using Fuzzy Logic in Wireless Sensor NetworkingVIT-AP University
Wireless sensor networks is challenging in that it requires an enormous breadth of knowledge from an enormous variety of disciplines. A lot of study has been done to minimize the energy used in routing and number of protocols has been developed. These protocols can be classified as - Hierarchical, data centric, location based and Network flow protocols. In this paper, we are particularly focusing on hierarchical protocols. In such types of protocols, the energy efficient clusters are formed with a hierarchy of cluster heads. Each cluster has its representative cluster head which is responsible for collecting and aggregating the data from its respective cluster and then transmitting this data to the Base Station either directly or through the hierarchy of other cluster heads. Fuzzy logic has been successfully applied in various areas including communication and has shown promising results. However, the potentials of fuzzy logic in wireless sensor networks still need to be explored. Optimization of wireless sensor networks involve various tradeoffs, for example, lower transmission power vs. longer transmission duration, multi-hop vs. direct communication, computation vs. communication etc. Fuzzy logic is well suited for application having conflicting requirements. Moreover, in WSN, as the energy metrics vary widely with the type of sensor node implementation platform, using fuzzy logic has the advantage of being easily adaptable to such changes.
The document proposes a new clustering protocol called Enhanced Threshold Sensitive Stable Election Protocol (ETSEP) for heterogeneous wireless sensor networks. ETSEP aims to improve network lifetime, stability, and throughput compared to other clustering protocols like Stable Election Protocol (SEP), Threshold Sensitive Stable Election protocol (TSEP), and Zonal Stable Election Protocol (ZSEP). In ETSEP, cluster head election probability dynamically changes based on three levels of node energy: normal nodes, intermediate nodes with half the energy of advance nodes, and advance nodes with the most energy. Simulation results show that ETSEP performs better than SEP, TSEP, and ZSEP in terms of stability and network lifetime.
ENERGY CONSUMPTION IMPROVEMENT OF TRADITIONAL CLUSTERING METHOD IN WIRELESS S...IJCNCJournal
In the traditional clustering routing protocol of wireless sensor network, LEACH protocol (Low Energy
Adaptive Clustering Hierarchy) is considered to have many outstanding advantages in the implementation
of the hierarchy according to low energy adaptive cluster to collect and distribute the data to the base
station. The main objective of LEACH is: To prolong life time of the network, reduce the energy
consumption by each node, using the data concentration to reduce bulletins in the network. However, in the
case of large network, the distance from the nodes to the base station is very different. Therefore, the
energy consumption when becoming the host node is very different but LEACH is not based on the
remaining energy to choose the host node, which is based on the number of times to become the host node
in the previous rounds. This makes the nodes far away from the base station lose power sooner.
In this paper, we give a new routing protocol based on the LEACH protocol in order to improve operating
time of sensor network by considering energy issues and distance in selecting the cluster-head (CH), at that
time the nodes with high energy and near the base station (BS) will have a greater probability of becoming
the cluster-head than the those in far and with lower energy.
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And
from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period.
Energy aware clustering protocol (eacp)IJCNCJournal
The document summarizes an Energy Aware Clustering Protocol (EACP) proposed for heterogeneous wireless sensor networks. EACP introduces heterogeneity by using two types of nodes: normal and advanced. Normal nodes elect cluster heads using a probability scheme based on residual and average energy. Advanced nodes use a separate probability scheme and act as gateways for normal cluster heads, transmitting their data to the base station. The performance of EACP is compared to SEP through simulations, showing better results for stability period, network life and energy savings.
Energy Efficient Cluster Routing Protocols in Wireless Sensor Network – A Sur...IJEEE
This document summarizes and compares several energy efficient cluster-based routing protocols for wireless sensor networks. It first provides an overview of cluster-based routing and some common protocols like LEACH. It then summarizes the key aspects of several improved protocols, including ERA, I-LEACH, E-LEACH, CELL-LEACH, ID-LEACH, and VLEACH. These protocols aim to increase network lifetime by modifying how cluster heads are selected based on factors like remaining energy. The document concludes by comparing these protocols and finding that some like I-LEACH and E-LEACH significantly increase network lifetime over the basic LEACH protocol.
A survey on Energy Efficient ProtocolsLEACH, Fuzzy-based approach and Neural ...IJEEE
Wireless Sensor Networks (WSN) plays a very important role in transmitting the data from source to destination but energy consumption is one of the major challenges in these networks. WSN consists of hundreds to thousands of nodes which consume energy while transmitting the information and with a span of time whole energy get consumed and network life time gets reduced. Clustering and Cluster head (CH) selection are important parameters used to enhance the lifetime of the WSN. Clustering use two methods: rotating CH periodically in every round to distribute the energy consumption among nodes and the node with more residual energy becomes CH.This research paper is focused on the performance of the techniques used to enhance the energy efficiency in Wireless Sensor Networks (WSNs). Low- Energy Adaptive Clustering Hierarchy (LEACH), Fuzzy- Based and Neural Network are some of the important techniques used. MATLAB simulation tool is considered in this paper.
Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...acijjournal
This paper gives a brief description about some routing protocols like EEE LEACH, LEACH and Direct
Transmission protocol (DTx) in Wireless Sensor Network (WSN) and a comparison study of these
protocols based on some performance matrices. Addition to this an attempt is done to calculate their
transmission time and throughput. To calculate these, MATLAB environment is used. Finally, on the basis
of the obtained results from the simulation, the above mentioned three protocols are compared. The
comparison results show that, the EEE LEACH routing protocol has a greater transmission time than
LEACH and DTx protocol and with smaller throughput.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
DYNAMIC RE-CLUSTERING LEACH-BASED (DR-LEACH) PROTOCOL FOR WIRELESS SENSOR NET...IJCNCJournal
A Wireless Sensor Network (WSN) contains a large number of sensor nodes equipped with limited energy supplies. In most applications, sensor nodes are deployed in a random fashion. Therefore, battery replacement or charging is considered not practical. As a result, routing protocols must be energy-efficient to prolong the network’s lifetime. In this paper, we propose a new Dynamic Re-clustering LEACH-Based protocol (DR-LEACH) which aims to reduce the energy consumption and extending the network’s lifetime. The idea is to balance energy consumption of Cluster Heads (CHs) by generating clusters with almost equal number of nodes during each round of the network life time. To perform this, we first calculate the optimal number of CHs in each round, and based on that we calculate the optimal size of each cluster. Results show that the proposed protocol improves network lifetime and reduces overall energy consumption compared to LEACH and BCDCP protocols.
The comparison between routing protocols based on lifetime of wireless sensor...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Erca energy efficient routing and reclusteringaciijournal
The pervasive application of wireless sensor networks (WNSs) is challenged by the scarce energy constraints of sensor nodes. En-route filtering schemes, especially commutative cipher based en-route filtering (CCEF) can saves energy with better filtering capacity. However, this approach suffer from fixed paths and inefficient underlying routing designed for ad-hoc networks. Moreover, with decrease in remaining sensor nodes, the probability of network partition increases. In this paper, we propose energy-efficient routing and re-clustering algorithm (ERCA) to address these limitations. In proposed scheme with reduction in the number of sensor nodes to certain thresh-hold the cluster size and transmission range dynamically maintain cluster node-density. Performance results show that our approach demonstrate filtering-power, better energy-efficiency, and an average gain over 285% in network lifetime.
This document discusses clustering techniques to analyze communication overhead in wireless sensor networks. It describes how clustering can help reduce energy consumption and traffic load by limiting redundant data transmission. The document compares the K-means and fuzzy clustering algorithms. The K-means algorithm partitions nodes into K clusters based on distance from cluster centers, while fuzzy clustering allows nodes to belong to multiple clusters. A simulation found that fuzzy clustering results in lower communication overhead than K-means as node velocity increases, helping to increase network lifetime.
A study of localized algorithm for self organized wireless sensor network and...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
One of Machine Type Communication (MTC) applications is Wireless Sensor Network
(WSN). WSN is an intelligent network application system to collect, integrate, and transmit data
autonomously. Sensor nodes in WSN, communicate over short distance via a wireless medium
and collaborate to accomplish a common task, such as enviroment monitoring, military
surveillance and industrial process control. The constraining aspect of WSN usage is the
limited power of each sensor node, so energy efficiency becomes an important issue in WSN.
Routing is a function in WSN, which consumes a substantial amount of energy. One of the
routing protocols that can increase the energy efficiency of WSN is Low Energy Adaptive
Clustering Hierarchy (LEACH). In this paper, High Altitude Platform (HAP) is used to replace
Base Station (BS) as sink node in WSN. HAP is designed at altitudes of 17, 20 and 22 km. Then
WSN over HAP using the LEACH routing protocol evaluated its performance. Performance
indicators that we evaluated are engergy consumption, number of dead nodes and total average
packets which is sent to HAP. From a series of simulations conducted, the results obtained that
the higher the laying of HAP, then the coverage area will be greater. So that the energy
consumption will be smaller, the number of dead node less and the avarage of total packet
delivered to the HAP will be greater.
Prolong Lifetime Analysis and Efficient Utilization of Energy in Heterogeneou...IJTET Journal
Abstract - The clustering-based protocols are believed to be the best for heterogeneous wireless sensor networks (WSNs). The evaluation is based on two new clustering-based protocols, which are called single-hop energy-efficient clustering protocol (S-EECP) and multi-hop energy-efficient clustering protocol (M-EECP) [1]. In S-EECP, the cluster heads (CHs) are elected by a weighted probability [2] based on the ratio between average energy of the network and residual energy of each node. The nodes having more initial energy and residual energy will have more chances to be elected as CHs than nodes with low energy. In M-EECP, the election of CHs is same as S-EECP, but the elected CHs communicate the data packets to the base station via multi-hop communication approach. To analyze the network lifetime three types of sensor nodes equipped with different battery energy are assumed. By analyzing these parameters, M-EECP achieves load balance among the CHs better than the existing clustering protocols and gives prolong network lifetime. Here the simulation is based on ns-2 simulator.
Maximizing Network Lifetime by Using Smart Cluster Head Selectioniosrjce
This document summarizes a research paper that proposes a smart cluster head selection technique to maximize the lifetime of wireless sensor networks. The paper first describes how wireless sensor networks use clustering to improve energy efficiency. It then discusses the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol and its limitations. Specifically, LEACH does not distribute cluster heads uniformly, which can lead to long communication distances. The paper proposes selecting cluster heads only from inner sensor nodes to reduce intra-cluster communication distances. Simulation results show that the smart cluster head selection approach reduces node death rate, energy consumption rate, and increases data received at the base station and overall network lifetime compared to the basic LEACH protocol.
9.distributive energy efficient adaptive clustering protocol for wireless sen...Chính Cao
The document proposes a new clustering protocol called DEEAC for wireless sensor networks. DEEAC is adaptive based on the data reporting rates and residual energy levels of nodes. It aims to distribute energy consumption more evenly across the network by selecting cluster heads that have high residual energy and are located in "hot regions" with high data generation rates. This is intended to prolong the lifetime of sensor networks compared to the original LEACH protocol.
This document summarizes an energy efficient clustering algorithm proposed for wireless sensor networks. It discusses the objectives, existing system, proposed system, simulation results and conclusions. The existing system uses a distributed self-organization balanced clustering algorithm (DSBCA) that has uniform cluster sizes and issues with node dropout. The proposed energy efficient clustering algorithm (EECA) forms unequal cluster sizes based on average neighbor energy and selects cluster heads through uneven competition ranges. Simulation results show the heterogeneous EECA provides longer network lifetime, higher efficiency and throughput than the homogeneous EECA.
Faulty node recovery and replacement algorithm for wireless sensor networkprjpublications
This document describes a Fault Node Recovery and Replacement algorithm for wireless sensor networks that combines grade diffusion and genetic algorithms. It begins by explaining grade diffusion and genetic algorithms, as well as existing fault recovery techniques. It then introduces the Fault Node Recovery and Replacement algorithm, which uses grade diffusion to create routing tables and genetic algorithms to replace sensor nodes when they fail. The algorithm aims to reuse existing routing paths and replace fewer sensor nodes to extend the lifetime of the wireless sensor network while reducing replacement costs.
Power saving mechanism for hybrid routing protocol using scheduling techniqueeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Sensor Energy Optimization Using Fuzzy Logic in Wireless Sensor NetworkingVIT-AP University
Wireless sensor networks is challenging in that it requires an enormous breadth of knowledge from an enormous variety of disciplines. A lot of study has been done to minimize the energy used in routing and number of protocols has been developed. These protocols can be classified as - Hierarchical, data centric, location based and Network flow protocols. In this paper, we are particularly focusing on hierarchical protocols. In such types of protocols, the energy efficient clusters are formed with a hierarchy of cluster heads. Each cluster has its representative cluster head which is responsible for collecting and aggregating the data from its respective cluster and then transmitting this data to the Base Station either directly or through the hierarchy of other cluster heads. Fuzzy logic has been successfully applied in various areas including communication and has shown promising results. However, the potentials of fuzzy logic in wireless sensor networks still need to be explored. Optimization of wireless sensor networks involve various tradeoffs, for example, lower transmission power vs. longer transmission duration, multi-hop vs. direct communication, computation vs. communication etc. Fuzzy logic is well suited for application having conflicting requirements. Moreover, in WSN, as the energy metrics vary widely with the type of sensor node implementation platform, using fuzzy logic has the advantage of being easily adaptable to such changes.
The document proposes a new clustering protocol called Enhanced Threshold Sensitive Stable Election Protocol (ETSEP) for heterogeneous wireless sensor networks. ETSEP aims to improve network lifetime, stability, and throughput compared to other clustering protocols like Stable Election Protocol (SEP), Threshold Sensitive Stable Election protocol (TSEP), and Zonal Stable Election Protocol (ZSEP). In ETSEP, cluster head election probability dynamically changes based on three levels of node energy: normal nodes, intermediate nodes with half the energy of advance nodes, and advance nodes with the most energy. Simulation results show that ETSEP performs better than SEP, TSEP, and ZSEP in terms of stability and network lifetime.
ENERGY CONSUMPTION IMPROVEMENT OF TRADITIONAL CLUSTERING METHOD IN WIRELESS S...IJCNCJournal
In the traditional clustering routing protocol of wireless sensor network, LEACH protocol (Low Energy
Adaptive Clustering Hierarchy) is considered to have many outstanding advantages in the implementation
of the hierarchy according to low energy adaptive cluster to collect and distribute the data to the base
station. The main objective of LEACH is: To prolong life time of the network, reduce the energy
consumption by each node, using the data concentration to reduce bulletins in the network. However, in the
case of large network, the distance from the nodes to the base station is very different. Therefore, the
energy consumption when becoming the host node is very different but LEACH is not based on the
remaining energy to choose the host node, which is based on the number of times to become the host node
in the previous rounds. This makes the nodes far away from the base station lose power sooner.
In this paper, we give a new routing protocol based on the LEACH protocol in order to improve operating
time of sensor network by considering energy issues and distance in selecting the cluster-head (CH), at that
time the nodes with high energy and near the base station (BS) will have a greater probability of becoming
the cluster-head than the those in far and with lower energy.
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And
from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period.
Energy aware clustering protocol (eacp)IJCNCJournal
The document summarizes an Energy Aware Clustering Protocol (EACP) proposed for heterogeneous wireless sensor networks. EACP introduces heterogeneity by using two types of nodes: normal and advanced. Normal nodes elect cluster heads using a probability scheme based on residual and average energy. Advanced nodes use a separate probability scheme and act as gateways for normal cluster heads, transmitting their data to the base station. The performance of EACP is compared to SEP through simulations, showing better results for stability period, network life and energy savings.
Energy Efficient Cluster Routing Protocols in Wireless Sensor Network – A Sur...IJEEE
This document summarizes and compares several energy efficient cluster-based routing protocols for wireless sensor networks. It first provides an overview of cluster-based routing and some common protocols like LEACH. It then summarizes the key aspects of several improved protocols, including ERA, I-LEACH, E-LEACH, CELL-LEACH, ID-LEACH, and VLEACH. These protocols aim to increase network lifetime by modifying how cluster heads are selected based on factors like remaining energy. The document concludes by comparing these protocols and finding that some like I-LEACH and E-LEACH significantly increase network lifetime over the basic LEACH protocol.
A survey on Energy Efficient ProtocolsLEACH, Fuzzy-based approach and Neural ...IJEEE
Wireless Sensor Networks (WSN) plays a very important role in transmitting the data from source to destination but energy consumption is one of the major challenges in these networks. WSN consists of hundreds to thousands of nodes which consume energy while transmitting the information and with a span of time whole energy get consumed and network life time gets reduced. Clustering and Cluster head (CH) selection are important parameters used to enhance the lifetime of the WSN. Clustering use two methods: rotating CH periodically in every round to distribute the energy consumption among nodes and the node with more residual energy becomes CH.This research paper is focused on the performance of the techniques used to enhance the energy efficiency in Wireless Sensor Networks (WSNs). Low- Energy Adaptive Clustering Hierarchy (LEACH), Fuzzy- Based and Neural Network are some of the important techniques used. MATLAB simulation tool is considered in this paper.
Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...acijjournal
This paper gives a brief description about some routing protocols like EEE LEACH, LEACH and Direct
Transmission protocol (DTx) in Wireless Sensor Network (WSN) and a comparison study of these
protocols based on some performance matrices. Addition to this an attempt is done to calculate their
transmission time and throughput. To calculate these, MATLAB environment is used. Finally, on the basis
of the obtained results from the simulation, the above mentioned three protocols are compared. The
comparison results show that, the EEE LEACH routing protocol has a greater transmission time than
LEACH and DTx protocol and with smaller throughput.
Modified leach protocol in wireless sensor network a surveyIAEME Publication
This document summarizes a survey of modified LEACH protocols in wireless sensor networks. It begins with an introduction to wireless sensor networks and discusses how the limited battery life of sensor nodes makes energy efficiency critical. It then provides an overview of the original LEACH protocol and its operation. The main part of the document surveys various modifications made to LEACH to improve its energy efficiency, such as using multi-hop routing, selecting cluster heads based on remaining energy levels, and implementing unequal clustering where clusters closer to the base station are smaller. It concludes that incorporating improvements to cluster head selection and multi-hop techniques into LEACH can significantly increase network lifetime by reducing energy consumption.
Wireless sensor networks (WSN) have been widely used in various applications.
In these networks nodes collect data from the attached sensors and send their data to a base
station. However, nodes in WSN have limited power supply in form of battery so the nodes
are expected to minimize energy consumption in order to maximize the lifetime of WSN. A
number of techniques have been proposed in the literature to reduce the energy
consumption significantly. In this paper, we propose a new clustering based technique
which is a modification of the popular LEACH algorithm. In this technique, first cluster
heads are elected using the improved LEACH algorithm as usual, and then a cluster of
nodes is formed based on the distance between node and cluster head. Finally, data from
node is transferred to cluster head. Cluster heads forward data, after applying aggregation,
to the cluster head that is closer to it than sink in forward direction or directly to the sink.
This reduction in distance travelled improves the performance over LEACH algorithm
significantly.
Efficient use of Energy in WSN using H-LEACHdbpublications
Wireless sensor networks are fast developing technologies in communication area, because WSN works in rough condition where human is out of reach. This paper discuss about H-LEACH, using H-LEACH energy consideration problems can be solved by selecting a cluster head (CH). H-LEACH uses remaining energy and maximum energy of the nodes to select a cluster head using some threshold constrain.
Performance evaluation of various routing techniques in wireless multimediaIAEME Publication
This document evaluates the performance of various routing techniques for wireless multimedia sensor networks (WMSNs). It proposes a new technique called RALEACH that decides a threshold value for cluster head election based on the ratio of current packet length to control packet length, as well as general and current state probabilities. Simulation results show that RALEACH improves network lifetime, data traffic sent, time until first node death, total rounds, and residual energy consumption compared to LEACH, ALEACH, and WALEACH routing protocols.
An enhanced energy-efficient routing protocol for wireless sensor networkIJECEIAES
The document summarizes an enhanced energy-efficient routing protocol proposed for wireless sensor networks. The proposed protocol selects cluster heads based on current energy levels to avoid nodes with low energy from being selected. It also chooses a root cluster head with high residual energy and short distance to the sink to aggregate and transmit all cluster data. Simulations show the proposed protocol performs better than LEACH in increasing network lifetime by balancing energy consumption and extending stability periods.
Energy Efficient Stable Election Protocol for Clustered Heterogeneous Wireles...IOSR Journals
This document summarizes an energy efficient stable election protocol (EE-SEP) for clustered heterogeneous wireless sensor networks. EE-SEP modifies the existing SEP protocol to improve energy efficiency, stability period, and network lifetime. It does this by calculating the optimal threshold value for selecting cluster heads based on the initial energy of sensor nodes, rather than the weighted election probability used in SEP. Simulations show EE-SEP performs better than SEP by increasing the number of alive nodes over time, reducing energy consumption, and prolonging network lifetime.
Design Optimization of Energy and Delay Efficient Wireless Sensor Network wit...IOSR Journals
This document describes a proposed approach to optimize energy efficiency and delay in wireless sensor networks using a combination of particle swarm optimization and cluster-based least spanning tree algorithms. It begins with background on challenges in wireless sensor networks related to limited energy resources. It then presents the system model, including the network and radio power models. The document goes on to describe particle swarm optimization and how it can be applied to set up energy-efficient clusters in each round. The goal is to select cluster heads that minimize a cost function balancing energy usage and delay.
E NERGY D EGREE D ISTANCE C LUSTERING A LGORITHM FOR W Snsijwmn
This document summarizes a new Energy-Degree Distance (EDD) Clustering Algorithm for wireless sensor networks. The algorithm aims to minimize energy consumption and balance energy usage among nodes. Key aspects of the EDD algorithm include electing cluster heads based on a node's remaining energy, degree, and distance to the base station. Simulation results show the EDD algorithm outperforms the LEACH algorithm in terms of network lifetime and energy efficiency. Both dynamic and static clustering methods are evaluated, with dynamic clustering showing better performance overall.
Performance Analysis on Energy Efficient and Scalable Routing Protocols of Wi...ijtsrd
This paper focuses on energy efficient routing protocols of wireless sensor network for the crop monitoring of precision agriculture. Precision agriculture can be defined as the advanced technology which is used the art and science to enhance crop production. In order to develop the precision agriculture, wireless sensor network technology becomes main issues in crop monitoring system. In this paper, two energy efficient and scalable routing protocols, Low Energy Adaptive Clustering Hierarchy LEACH and Distributed Energy Efficient Clustering DEEC protocols are analyzed in 100 square meters area with 100 sensor nodes. This paper mainly presents the dead nodes, alive nodes and amount of data received of routing protocols which will become main issues of crop monitoring system in precision agriculture. MATLAB software is utilized as core simulator for this research. Than Htike Aung | Kyaw Zin Latt "Performance Analysis on Energy Efficient and Scalable Routing Protocols of Wireless Sensor Network for Precision Agriculture" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd27989.pdfPaper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/27989/performance-analysis-on-energy-efficient-and-scalable-routing-protocols-of-wireless-sensor-network-for-precision-agriculture/than-htike-aung
A clustering protocol using multiple chainambitlick
This document proposes two schemes for clustering protocols based on chain routing in wireless sensor networks. It then describes in detail the Chain Routing Based on Coordinates-oriented Clustering Strategy (CRBCC) protocol. CRBCC forms balanced clusters based on node coordinates, constructs intra-cluster chains using simulated annealing, elects chain leaders, and then constructs an inter-cluster chain among leaders also using simulated annealing. Simulation results show CRBCC performs better than PEGASIS in terms of energy efficiency and network delay.
Energy-Efficient Hybrid K-Means Algorithm for Clustered Wireless Sensor Netw...IJECEIAES
Energy efficiency is the most critical challenge in wireless sensor network. The transmission energy is the most consuming task in sensor nodes, specifically in large distances. Clustered routing techniques are efficient approaches used to lower the transmission energy and maximize the network’s lifetime. In this paper, a hybrid clustered routing approach is proposed for energy optimization in WSN. This approach is based on KMeans clustering algorithm and LEACH protocol. The simulation results using MATLAB tool have shown that the proposed hybrid approach outperforms LEACH protocol and optimizes the nodes energy and the network lifetime.
This document summarizes a research paper that proposes a technique called Smart Cluster Head Selection (SCHS) to improve the performance of the LEACH routing protocol in wireless sensor networks. LEACH randomly selects cluster heads, which can lead to non-uniform distributions and long communication distances. SCHS modifies LEACH by only allowing inner nodes to become cluster heads, which reduces intra-cluster communication distances and energy consumption. The document compares the performance of LEACH and SCHS through simulations, finding that SCHS has a lower node death rate, energy consumption rate, and extends network lifetime by receiving more data at the base station compared to the basic LEACH protocol.
Similar to PERFORMANCE EVALUATION OF ENERGY EFFICIENT CLUSTERING PROTOCOL FOR CLUSTER HEAD SELECTION IN WIRELESS SENSOR NETWORK (20)
5th International Conference on Natural Language Computing Advances (NLCA 2024)ijp2p
5th International Conference on Natural Language Computing Advances (NLCA 2024)
September 28 ~ 29, 2024, Toronto, Canada
https://itcse2024.org/nlca/index
Scope &Topics
5th International Conference on Natural Language Computing Advances (NLCA 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology, and applications of Natural Language Computing and its advances.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works, and industrial experiences that describe significant advances in NLP.
Topics of interest include but are not limited to, the following
Chunking/Shallow Parsing Dialog Systems Discourse Information Extraction Information Retrieval Lexical Semantics Linguistic Resources Machine Translation Ontology Paraphrasing/Entailment/Generation Parsing/Grammatical Formalisms Phonology, Morphology POS Tagging Question Answering Semantic Processing Speech Recognition and Synthesis Spoken Language Processing Statistical and Knowledge-based Methods Text Mining NLP and Machine Learning NLP and Computational Linguistics NLP and Information Retrieval NLP and AI
Paper Submission Authors are invited to submit papers through the conference Submission System by June 22, 2024. Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this conference. The proceedings of the conference will be published by Computer Science Conference Proceedings in Computer Science & Information Technology (CS & IT) series (Confirmed).
Important Dates:
Submission Deadline: June 22, 2024 Authors Notification: August 03, 2024 Registration & Camera-Ready Paper Due: August 10, 2024
Contact Us:
Here's where you can reach us: nlca@itcse2024.org or nlcaconference@yahoo.com
Submission Link: https://itcse2024.org/submission/index.php
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTSijp2p
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct
communication and collaboration between nodes. There are three main families of P2P networks: the
centralized architecture, the decentralized architecture that can be structured or unstructured and the
hybrid architecture. Today, there are several implementations for structured decentralized architectures.
This implies that the insertion and search algorithms are different. Among them we have; Chord, Pastry,
Kademlia, CAN(Content Addressable Network) . The choice of these DHTs (Distributed Hash Table) for an
application is made on the basis of their performances. Studies of each of these DHTs mentioned have been
done, proving their performance. But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia
has not been clearly addressed by previous works. In this paper, we have conducted a comparative
theoretical study of the DHTs Chord, Pastry, CAN, Kademlia. Then, by simulation, we have evaluated the
performances in terms of latency, number of hops and number of transmitted messages. Our study clearly
shows the differences between mathematically established performance and actual performance in an
environment with less restriction. This analysis was made from the data obtained by using the simple
network layer of the PeerfactSim simulator. This simulator abstracts the different network layers, which
gives the advantage of testing the performances with reasonable accuracy. The use of the single network
layer can be considered an ideal case because the node searches are done locally.
International Journal of Peer to Peer Networks .docxijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
Authors are solicited to contribute to the journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of P2P networks.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results
in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best
practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems,
large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety
of fields can exchange ideas to further research and improve practices in all areas of P2P.
2nd International Conference on Big Data, IoT and Machine Learning (BIOM 2022)ijp2p
2nd International Conference on Big Data, IoT and Machine Learning (BIOM 2022) will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the areas of Big Data, Internet of Things (IoT) and Machine Learning. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of Big Data, IoT and Machine Learning.
7th International Conference on Networks, Communications, Wireless and Mobile...ijp2p
7th International Conference on Networks, Communications, Wireless and Mobile Computing (NCWMC 2022) looks for significant contributions to the Computer Networks, Communications, wireless and mobile computing for wired and wireless networks in theoretical and practical aspects. Original papers are invited on computer Networks, network protocols and wireless networks, Data communication Technologies, network security and mobile computing. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
4th International Conference on Internet of Things (CIoT 2022)ijp2p
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
11th International conference on Parallel, Distributed Computing and Applicat...ijp2p
11th International conference on Parallel, Distributed Computing and Applications (IPDCA 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Parallel, Distributed Computing. Original papers are invited on Algorithms and Applications, computer Networks, Cyber trust and security, Wireless networks and mobile Computing and Bioinformatics. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
3rd International Conference on Machine learning and Cloud Computing (MLCL 2022)ijp2p
3rd International Conference on Machine learning and Cloud Computing (MLCL 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Cloud computing. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
4th International Conference on Internet of Things (CIoT 2022) ijp2p
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
3rd International Conference on Networks, Blockchain and Internet of Things (...ijp2p
3rd International Conference on Networks, Blockchain and Internet of Things (NBIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Networks, Blockchain and Internet of Things. The Conference looks for significant contributions to all major fields of the Networks, Blockchain and Internet of Things in theoretical and practical aspects.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas but are not limited to:
3rd International Conference on NLP & Information Retrieval (NLPI 2022)ijp2p
3rd International Conference on NLP & Information Retrieval (NLPI 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Natural Language Computing and Information Retrieval.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to.
CALL FOR PAPERS - 14th International Conference on Wireless & Mobile Networks...ijp2p
14th International Conference on Wireless & Mobile Networks (WiMoNe 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Wireless & Mobile computing Environment. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Wireless, Mobile Networks & its applications had received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
PUBLISH YOUR PAPER - INTERNATIONAL JOURNAL OF PEER-TO-PEER NETWORKS (IJP2P)ijp2p
Authors are solicited to contribute to the journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of P2P networks.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
3rd International Conference on Blockchain and Internet of Things (BIoT 2022)ijp2p
3rd International Conference on Blockchain and Internet of Things (BIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and
applications of Blockchain and Internet of Things. The Conference looks for significant contributions to all major fields of the Blockchain and Internet of Things in theoretical and
practical aspects. Authors are solicited to contribute to the conference by submitting articles that illustrate research
results, projects, surveying works and industrial experiences that describe significant advances in the areas of Blockchain and Internet of Things.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
HijackLoader Evolution: Interactive Process HollowingDonato Onofri
CrowdStrike researchers have identified a HijackLoader (aka IDAT Loader) sample that employs sophisticated evasion techniques to enhance the complexity of the threat. HijackLoader, an increasingly popular tool among adversaries for deploying additional payloads and tooling, continues to evolve as its developers experiment and enhance its capabilities.
In their analysis of a recent HijackLoader sample, CrowdStrike researchers discovered new techniques designed to increase the defense evasion capabilities of the loader. The malware developer used a standard process hollowing technique coupled with an additional trigger that was activated by the parent process writing to a pipe. This new approach, called "Interactive Process Hollowing", has the potential to make defense evasion stealthier.
Securing BGP: Operational Strategies and Best Practices for Network Defenders...APNIC
Md. Zobair Khan,
Network Analyst and Technical Trainer at APNIC, presented 'Securing BGP: Operational Strategies and Best Practices for Network Defenders' at the Phoenix Summit held in Dhaka, Bangladesh from 23 to 24 May 2024.
Honeypots Unveiled: Proactive Defense Tactics for Cyber Security, Phoenix Sum...APNIC
Adli Wahid, Senior Internet Security Specialist at APNIC, delivered a presentation titled 'Honeypots Unveiled: Proactive Defense Tactics for Cyber Security' at the Phoenix Summit held in Dhaka, Bangladesh from 23 to 24 May 2024.
PERFORMANCE EVALUATION OF ENERGY EFFICIENT CLUSTERING PROTOCOL FOR CLUSTER HEAD SELECTION IN WIRELESS SENSOR NETWORK
1. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
DOI : 10.5121/ijp2p.2014.5301 1
PERFORMANCE EVALUATION OF ENERGY
EFFICIENT CLUSTERING PROTOCOL FOR
CLUSTER HEAD SELECTION IN WIRELESS
SENSOR NETWORK
Harpreet Kaur1
and Prof Ameeta Seehra 2
1
Department of Electronics and Communication Engineering, GNDEC, Ludhiana, India
2
Department of Electronics and Communication Engineering, GNDEC, Ludhiana, India
ABSTRACT
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
Keywords
Wireless sensor network, Leach, Leach C, Leach CC, Cluster Head Selection, Network life time, residual
energy.
1. INTRODUCTION
Wireless Sensor Networks are usually self-organized wireless ad hoc networks comprising of a
large number of resource constrained sensor nodes. The vital role of these sensors nodes is
systematic collection of data. After that sensor nodes transmit aggregated data to BS. Wireless
sensor network has spacious application in military recce, medical assistance, agriculture,
environmental monitoring and other infomercial areas.Wireless Sensor Network [1] produce large
number of data which is aggregated at numerous levels. A multidimensional aggregation
approach [13] is considered for exhibiting the node parameters for each network. The
performance of sensor network is determined by memory, battery power, bandwidth etc.
Life span of sensor network is an important parameter for efficient design of data aggregating
schemes in sensor network. Energy organization plays important role in the deployment of sensor
networks. The available energy is considered a major factor when designing protocols in a sensor
network. Hence existing energy plays important role in designing of protocol in wireless sensor
network.Low-Energy Adaptive Clustering Hierarchy (LEACH) is a clustering routing algorithm
in WSN.In LEACH cluster head is determined randomely,it is not based on remaining energy of
2. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
2
sensor nodes and which results that less energy nodes come to an end of energy in advance. It
decrease in life time of sensor network. Our research analysis the significance of Leach protocol
in cluster head selection and energy saving of sensor network.
2. INTRODUCTION TO LEACH PROTOCOL
W. R Heinzelman proposed LEACH protocol, which based on cluster structure and hierarchical
technology. Relative to the traditional protocol, LEACH could save a greater degree of energy.
LEACH is the most commonly used clustering algorithm in wireless sensor network .In LEACH,
the nodes are deployed in specific area and organized into clusters. The communication process is
divided into rounds .Each round having two phases namely set-up and steady-state phases. Each
cluster has a cluster head which is accountable for creating a TDMA (time division multiple
access) table. It intimate its member sensor nodes when to get transmit data packets The main
function of cluster head is to collect data which is coming from different sensor member nodes
and transmit data packets to BS.Cluster head serve as a relay node to provide assistance to senor
nodes to shorten the transmission distance also it saves energy.
2.1 Setup Phase
Each node in the monitoring field decides self-governing of other sensor nodes whether selected
node can be cluster head in current round .In this phase, each sensor node generate a random
number between 0 and 1.If the number is larger than threshold value then node become a cluster
head for current round and send availability message to its neighboring sensor nodes .In the set-
up phase, the node becomes a cluster head with a probability P. and send its data packets. On the
other side, the regular nodes choose their cluster-head based on the least communication energy
to reach the cluster-head. The threshold is set as
ܶሺ݊ሻ = ൞
1 − ∗ ቀ ݀݉ ݎ
1
ቁ
0
݂݅ ݊ ߳ ɢ
݂݅ ݊ ̸߳ ɢ
Where P denotes the percentage of cluster head, r denotes the current round and G denotes as set
of nodes that are not become cluster heads. According to this threshold value, each node in the
sensor network have chance to become a cluster head at 1/P round. When the first round occur
each node has probability to become a cluster head and the nodes which are chosen to become
cluster head in first round, they can’t participate for cluster head selection in next round Once the
cluster-heads have been chosen, the cluster-heads use CSMA MAC protocol to broadcast
advertisement messages to the remaining sensor nodes. The regular nodes must keep their
receivers on during this phase to hear the advertisements of all the cluster-heads. After this phase,
each regular node decides which cluster to join for the current round. The other sensor node will
inform the cluster-head that it will become a member of the cluster. Each regular node transmits
this information back to the cluster-head again using a CSMA MAC protocol. The cluster-head
receives all the messages for sensor nodes and would interested to intersect the clusters. Based on
the number of regular nodes in the cluster, the cluster-head creates a TDMA schedule telling each
regular node when it can transmit. This schedule is broadcast back to the regular nodes in the
cluster.
3. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
3
2.2 Steady State Phase
The cluster head selection in each cluster during the setup phase ensures the data transmission in
steady state phase when there is need to transmit data, first they will send data to Ch. during idle
slot canned in TDMA schedule table. Cluster heads should maintain communication status at all
times and it will help to receive data from different sensor nodes. After receiving all the data sent
by their members, CHs will aggregate them firstly and then send them to BS. When some sensor
nodes may detect similar data them data reduce unwanted bandwidth cost, energy consumption is
less. To overcome the problem of Cluster head dies early, a new round starts and new clusters
formation will be done in the sensor network.
3. SYSTEM MODEL
3.1 A Radio Energy Model
We consider a wireless sensor network which consist of 100 sensor nodes, area used is
100x100 square meters.
Figure 1 Radio energy model
We use a simplified model shown in figure 1 for the communication energy dissipation. In
accordance with the distance between the source node and the destination node, we used the free
space (d2
power loss) and the multi-path fading (d4
power loss) channel models. Thus, the energy
spent for transmission of an l-bit packet over distanced d is:
ETX (l,d) = E TX_elec *l +Eamp (d) *l (1)
L Eelec + l Ɛ FS *d 2
d˂ d crossover (2)
ETX (l,d ) = L Eelec + l ƐTR *d4
d ≥ do (3)
Eelec is the energy being dissipated to run the transmitter or receiver circuitry. The parameters
Ɛ TR and Ɛ FS is the amount of energy dissipates per bit in the radio frequency amplifier according
to the crossover distance d0,
4. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
4
do = ට
Ɛೞ
Ɛ ౪ೝ
(4)
to receive l message bit , the radio apply energy
ERX (l) = ERX_elec(l) = l E elec (5)
3.2 Optimal Clustering
In WSN the optimal probability of any node to become a cluster head is very important. In
optimal clustering energy consumption is properly distributed along with all sensor nodes In this
radio model area is assumed A =M X M square meter. Let there be n Nodes are randomly
distributed .Assume that base station is located on fix place.
If there are K cluster in sensor network, then average node per cluster is noticed as n/k.. So there
will be one cluster head and remaining (n / k -1) are non-cluster head nodes.
.ENON_ch =L.EELEC +EAMP (L, d) (6)
Now energy dissipated by cluster head is given by
ECH =L EELEC (n /k -1) +L EDA n / k +L EELEC +L EAMP d4
to BS (7)
Where k is the number of Cluster, ,EDA is the data aggregation and dto BS is the average distance
between a CH and BS which is given by
d2
BS = ʃඥݔଶ + ݕଶ ܺ
ଵ
= 0.765 ܺ
ெ
ଶ
(8)
Hence, energy dissipated by a non CH node is given by
ENON CH = L × ( EELEC + Ɛ FS x d2
CH ) (9)
Where d CH is the average distance between a non CH node and its associated CH, which is given
by equation
d2
CH = ʃ ʃ ( x2
+ y2
) x ρ ( x , y) dx dy =
ெ
ଶగ
ଶ
(10)
Where ρ ( x , y) is the node distribution and M is the area of monitoring field.
Now, the total energy dissipated is
ET = E CH +E NON CH (11)
Now,
ET = L × (2 n × EELEC + n × EDA + Ɛ F S × (k × d2
to BS + n ×
ெ
ଶగ
ଶ
ሻ (12)
5. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
5
Now we can find the minimum no of cluster by setting the derivative of ET with respect to 0
K opt = ට
ଶగ
× ට
ఌ ೞ
ఌ
×
ெ
ௗమ
್ೞ
(13)
Average energy is estimated as
Eaverage =
ଵ
ே
× ܧ் × ሺ1 −
ோ
ሻ (14)
Where R denotes the total rounds of network lifetime whereas r denotes the round of sensor
network.
4 SIMULATION ANALYSIS
To evaluate the performance our proposed protocol we use matlab .
4.1. Network Model
1. The Base station is immovable at far away from the sensor nodes
2. The sensor nodes are homogeneous and energy constrained with even energy.
3. The energy rate for transmitting a data packet depends on the distance of transmission.
4. The communication channel is symmetric.
4.2 .Parameters For Simulation
We simulate leach, leach c, leach cc, proposed algorithm for wireless sensor network. The basic
parameters are listed in Table 1.
Table 1 Summary of the parameters
S.NO PARAMETERS VALUE
1 No of Nodes 100
2 Network Size (100 x 100) m2
3 Initial Energy(Eo) 2 J
4 Energy for Transmission (ETX) 50nJ/bit
5 For Energy Reception (ERX) 50nJ/bit
6 Free Space Energy Loss (Efs) 10 pJ / bit /m2
7 Multi path Energy Loss (Emp) 0.0013pJ / bit /m4
8 Maximum no. of Rounds (rmax) 700
9 Location of BS(Sink) (50,175)
10 Adaptive Energy(EDA) 5n J/bit
6. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
Fig
Figure shows the deployment of sensor
100x 100 meter square. Base station is located at (50,175)
5. FUZZY LOGIC CONTROL
In Fuzzy inference system, the rules are
called as linguistic variable, Rules are simply
rule is called antecedent and THEN
are AND, OR etc. The combined truth of the predicate is determined by implication rules such as
MIN-MAX ( Zadeh) and bounded arithmetic sum.
In FIS, there are four important steps as shown below:
1. Fuzzification: It convert the system inputs which are crisp values into fuzzy sets.
2. Rule evaluation: It fuzzified inputs
rules.
3. Aggregate conclusions: It conclude the
4. Defuzzication: It convert the fuzzy set obta
value.
The input and output variable used in our work as stated as below;
International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
Figure 2 Node deployment of sensor nodes
shows the deployment of sensor nodes. All nodes are deployed randomly in the area of
station is located at (50,175).
CONTROL
the rules are generated based on input variable and output variable
Rules are simply based on IF-THEN technique. The IF part of fuzzy
and THEN part is known as consequent .Fuzzy implication operators
The combined truth of the predicate is determined by implication rules such as
bounded arithmetic sum.
In FIS, there are four important steps as shown below:
the system inputs which are crisp values into fuzzy sets.
fuzzified inputs variables and evaluate them to the antecedents
conclude the outputs of all rules.
the fuzzy set obtained by the inference system into a single crisp
The input and output variable used in our work as stated as below;
International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
6
in the area of
on input variable and output variable,
The IF part of fuzzy
consequent .Fuzzy implication operators
The combined truth of the predicate is determined by implication rules such as
evaluate them to the antecedents of the fuzzy
a single crisp
7. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
1. Node Energy: It shows the
variable energy. Linguistic values are
2. Distance to BS: It is the distance between node and base station .The linguistic variable for
Distance to BS is far,medium ,close.
3. Chance: it is the chance to become a cluster head .The linguistic variable are us
weak , low weak, weak ,low medium, high medium, medium, low strong, strong, very strong.
The linguistic variable used to represent th
high,medium,low for energy as in fig
figure 4.The output of node to become a cluster head is represented by chance is divided into nine
levels are very weak ,low weak, wea
very strong.
We have used 32
= 9 rules for fuzzy base rule.
corresponding linguistic states are shown in following
Figure
Figure 4 Membership function plot for Distance to BS
International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
It shows the energy level available in each node, designated by
values are low, medium, high.
It is the distance between node and base station .The linguistic variable for
o BS is far,medium ,close.
it is the chance to become a cluster head .The linguistic variable are us
k ,low medium, high medium, medium, low strong, strong, very strong.
The linguistic variable used to represent the node energy and distance are divided into three levels
high,medium,low for energy as in figure 3; and close ,medium ,far for distance to BS as in
4.The output of node to become a cluster head is represented by chance is divided into nine
are very weak ,low weak, weak ,low medium, high medium, medium, low strong, strong,
for fuzzy base rule. The membership function developed and their
corresponding linguistic states are shown in following figures.
ure 3 Membership function plot for Energy
4 Membership function plot for Distance to BS
International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
7
energy level available in each node, designated by the fuzzy
It is the distance between node and base station .The linguistic variable for
it is the chance to become a cluster head .The linguistic variable are used are very
k ,low medium, high medium, medium, low strong, strong, very strong.
e node energy and distance are divided into three levels
3; and close ,medium ,far for distance to BS as in
4.The output of node to become a cluster head is represented by chance is divided into nine
k ,low medium, high medium, medium, low strong, strong,
The membership function developed and their
8. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
Figure 5 Surface diagram of Energy, Distance to BS, chance
S.NO ENERGY
1. LOW
2. LOW
3. LOW
4. MEDIUM
5. MEDIUM
6. MEDIUM
7. HIGH
8. HIGH
9. HIGH
International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
Surface diagram of Energy, Distance to BS, chance
TABLE 2. FUZZY RULES
ENERGY DISTANCE TO BS CHANCE
FAR V WEAK
MEDIUM L WEAK
CLOSE WEAK
FAR L MEDIUM
MEDIUM H MEDIUM
CLOSE MEDIUM
FAR L STRONG
MEDIUM STRONG
CLOSE V STRONG
International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
8
9. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
9
6. RESULTS AND DISCUSSIONS
Figure 6. Comparative analysis of alive node
Table 3. Simulation results shows the no of alive node.
SNO ALGORITHM First node
dead
HND % Improvement
FND
% Improvement
HND
1. LEACH 28 43 460.7 553.4
2. LEACH C 148 259 6.08 8.49
3. LEACH CC 28 37 460.7 659.45
4. NOVEL 157 281 560.7 553.488
A comparison is drawn between the performance of proposed leach with LEACH, LEACH C,
LEACH CC Protocol in terms of network lifetime and in terms of FND, HND.Performance.
Comparison results for network lifetime of proposed leach with that Leach,leach c,leach cc
protocol shown in figure 6.The network lifetime of proposed algorithm has improved further from
other existing protocols. Proposed algorithm improves the network life time by 84.69 %
0 100 200 300 400 500 600 700
0
10
20
30
40
50
60
70
80
90
100
Alive Node in WSN
No of Rounds (seconds)
NoofAliveNodes NOVEL Leach
LeachC
LeachCC
Leach
10. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
10
.
Figure 7. Comparative analysis of packets transmitted to BS
Table 4 PACKET TRANSMITTED TO BS
SNO ALGORITHM PACKETS SEND TO BS
1. LEACH 69,100
2. LEACH C 82,200
s3. LEACH CC 1,24,736
4. NOVEL 2,83,076
The comparative analysis of packets transmitted to Base Station shows that proposed algorithm
transmit more data packets to Base Station .The comparative analysis of Novel leach is done with
Leach, leach c, leach cc respectively.
0 100 200 300 400 500 600 700
0
0.5
1
1.5
2
2.5
3
x 10
5 Packets Transmitted in WSN
No of Rounds (seconds)
NoofPacketsreceivedatBaseStation
Novel Leach
LeachC
LeachCC
Leach
11. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
11
Figure 8.Comparative analysis of Energy Consumption
Table 5 Energy Consumption Results at 700 rounds
S no Protocol Name Total energy remaining
1. LEACH 0.3587 joule/second
2. LEACH C 0.7938 joule/second
3. LEACH CC 3.8920 joule/second
4. NOVEL LEACH 8.2194 joule/second
The comparative analysis of energy consumption in the sensor network. Leach has very less
remaining energy as compare to Novel LEACH. Novel Leach consume less energy as compare to
Leach c,leach cc.
7. CONCLUSION
To increase Network life time is a challenging issue in WSN .In our proposed protocol, We use
two parameter energy, distance to Base Station for cluster head selection. The proposed
0 100 200 300 400 500 600 700
0
10
20
30
40
50
60
70
80
90
100
Energy consumption in WSN
No of Rounds (seconds)
TotalEnergy(Joule)
Novel Leach
LeachC
LeachCC
Leach
12. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
12
algorithm results conclude that it is better than Leach, Leach C, and Leach CC. It prolongs
network life time by 84 % and less energy consumption as compare to basic LEACH.
REFERENCES
[1] Adrian Perrig , John Stankovic and David Wagner,” Security in wireless sensor network”,. Vol. 47,
pp.6-9 ,June 2004.
[2] Bolian Yin, Hongchi Shi, and Yi Shang ,”Analysis of Energy Consumption in Clustered Wireless
sensor Networks” IEEE Transactions on Mobile Computing, vol. 3, pp. 272–285, July 2007
[3] Curt Schurgers and Mani B. Srivastava “Energy efficient routing in Wireless Sensor Networks”,
IEEE Personal Communications Mag., Vol.7, No.5, pp.16-27, Oct. 2000
[4] Fan Xiangning and Song Yulin, “Improvement on LEACH Protocol of Wireless Sensor Network”,
IEEE Communications Magazine,, 40(8), pp.102-114, Mar.2002.
[5] Hiren Kumar Deva Sarma and Avijit Kar, “Security Threats in Wireless Sensor Networks” IEEE
Communications Magazine, 42(4): 122-134, August 2002.
[6] Ioan Raicu ,”Routing Algorithms for Wireless Sensor Networks”, IEEE Wireless Communications,
vol.46, pp.110-119,Sept.2002.
[7] Jan Steffan ,Ludger Fiege, Mariano Cilia and Alejandro Buchmann, “Scoping in Wireless Sensor
Networks”, IEEE Network, 18(1), pp.15–21, May 2004.
[8] John Buckley, Kevin Aherne and Cian O'Mathuna, “Antenna Performance Measurements Using
Wireless Sensor Networks”, Proceedings of the IEEE, VOL. 91, pp. 1247-1256, August 2003.
[9] Kay Romer and Friedemann Mattern, Eth Zurich,”The design space of wireless sensor network”,
CACM, vol. 43, pp. 74–82,Mar. 2000.
[10] Kun Zhang and Cong Wang, “A Secure Routing Protocol for Cluster-Based Wireless Sensor
Networks Using Group Key Management,” IEEE Xplore,vol.37, pp. 178-185, jan.-2008.
[11] L.Li, and J.Y. Halpern, “Minimum-Energy Mobile Wireless Networks Revisited,”, IEEE International
Conference on Communications (ICC). Vol. 1, pp. 278-283, 2001.
[12] L. Subramanian and R. H. Katz “An Architecture for Building Self Configurable Systems”, in the
Proceedings of IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing, Boston, MA,
August 2000.
[13] M. Ibrahim Channa and Irum Memon, “Real Time Traffic Support in Wireless Sensor Networks”
IEEE Comm. Magazine, pp.119-133, June 2001.
[14] Mihaela Cardei , Jie Wu and Mohammad O. Pervaiz,”Maximum Network Lifetime in Wireless
Sensor Networks with Adjustable Sensing Ranges”, IEEE Communications Magazine, pp 102-114,
Aug.2002.
[15] Peng-Jun Wan, Member and Chih-Wei Yi, “Coverage by Randomly Deployed Wireless Sensor
Networks”, IEEE Wireless Communications and Networking Conference, pp.16–20, Mar. 2003.
[16] Q. Li and J. Aslam and D. Rus, “HPAR: Hierarchical Power-aware Routing in Sensor Networks”, In
Proceedings of the DIMACS Workshop on Pervasive Networking, May, 2001.
[17] Qi YAO, Seng- Kee TAN, Yu GE, Boon-Sain YEO and Qinghe YIN, “An Area Localization Scheme
for Large W ireless Sensor Networks” MOBICOM, pp269- 286, July 2001.
[18] Sang-Sik Kim and Ae-Soon Park, ”Mobility Support for Users in Wireless Sensor Networks”, IEEE
Communications Magazine, vol. 40, pp.124-156 Aug. 2002
[19] Shafiq Hashmi and Hussien T. Moufth, “A New Transport Layer Sensor network protocol”, IEEE
Transactions, vol. 5,pp.118-156,Mar.2003
[20] Shangwei Duan and Xiaobu Yuan, ”Exploring Hierarchy Architecture for Wireless Sensor Networks
Management”, IEEE Communications Magazine, 40(8), pp.102-114, Aug. 2002.
[21] Rogaia Mhemed et al.,”An Energy Efficient Fuzzy Logic Cluster Formation Protocol in wireless
Sensor Networks,” The 3rd International Conference on Ambient Systems, Networks and
Technologies,Niagara Falls, Ontario, Canada. 27-29 August 2012.
http://nrl.northumbria.ac.uk/7042/
13. International Journal of Peer to Peer Networks (IJP2P) Vol.5, No.3, August 2014
13
Authors
Harpreet Kaur is the mtech student in Department of Electronics and Communication
Engineering , Guru Nanak Dev Engineering College Ludhiana. She has published several
research papers in wireless communication .Her area of research interest is Wireless
communication systems.
Prof. Ameeta Seehra is presently working as associate professor in Department of
Electronics and communication engineering , Guru Nanak Dev Engineering college
,Ludhiana. She has received her B.E. in Electronics and Comm. engg in 1986 and M.Tech.
Electronics and Comm. engg in 1997.She has guided more than 20 students for Mtech
Thesis .She is a member of ISTE. Her area of research interest is advanced
communications.