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.
This document presents a hierarchical clustering algorithm for wireless sensor networks. It begins with introductions to wireless sensor networks and their architecture. It then discusses routing protocols, applications, quality of service aspects, and types of clustering for wireless sensor networks. The main body of the document describes the evolution of hierarchical clustering, and presents the hierarchical clustering algorithm and a dynamic energy efficient hierarchical routing algorithm. It provides details on the simulation methods and concludes that hierarchical clustering and routing algorithms can efficiently reduce energy consumption in sensor nodes.
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.
Energy efficient communication techniques for wireless micro sensor networksPushpita Biswas
The document summarizes work done on improving the LEACH routing protocol for wireless sensor networks. It provides background on WSNs and discusses limitations of the original LEACH protocol. The work done section describes an algorithm that tracks "perfect clusters" based on distances between a cluster head and nodes, and adjusts node thresholds to promote repetition of such clusters while limiting energy depletion. Simulation conditions consider 100 homogeneous nodes randomly placed to transmit data to a base station.
SLGC: A New Cluster Routing Algorithm in Wireless Sensor Network for Decrease...IJCSEA Journal
Decrease energy consumption and maximizing network lifetime are important parameters in designing and protocols for wireless sensor network (WSN).Clustering is one of the efficient methods in energy consumption by Cluster-Head in WSN. Besides, CH can process and aggregate data sent by cluster members, thus reducing network traffic for sending data to sink. In this paper presents a new cluster routing algorithm by dividing network into grids. In each grid computes the center-gravity and threshold of energy for selecting the node that has the best condition base on these parameters in grid for selecting Cluster-Head in current round, also SLGC selecting Cluster-Heads for next rounds thereby this CHs reduce the volume of controlling messages for next rounds and inform nodes for sending data into CH of respective round. This algorithm prolong network lifetime and decrease energy consumption by selecting CH in grid and sending data of grid to sink by this CH. Result of simulation shows that SLGC algorithm in comparison with the previous clustering algorithm has maximizing network lifetime and decrease energy consumption in network.
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.
This document outlines various clustering protocols for heterogeneous wireless sensor networks (HWSN). It begins by defining keywords related to HWSN and challenges in these networks, such as limited energy and heterogeneous hardware. The goals of clustering protocols are then discussed, including load balancing, fault tolerance and energy efficiency. Various clustering methods, attributes and models are classified. Examples of heterogeneous resources, impacts and performance measures are provided. The document also lists relevant conferences, simulators and laboratories, and provides author details.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
in the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
A General Self Organized Tree Based Energy Balance Routing Protocol for WSN Sathish Silence
GSTEB is a self-organized tree-based energy-balance routing protocol for wireless sensor networks. It aims to prolong network lifetime by balancing energy consumption across nodes. In GSTEB, the base station selects a root node and broadcasts its ID. Then each node selects its parent in a way that minimizes its distance to the root while balancing energy levels. The network operates in rounds, where a routing tree is constructed and nodes transmit sensed data to the base station along the tree. GSTEB dynamically changes the root node between rounds to further balance energy usage among all nodes. Simulation results show GSTEB outperforms other protocols in balancing energy consumption and extending network lifetime.
This document presents a hierarchical clustering algorithm for wireless sensor networks. It begins with introductions to wireless sensor networks and their architecture. It then discusses routing protocols, applications, quality of service aspects, and types of clustering for wireless sensor networks. The main body of the document describes the evolution of hierarchical clustering, and presents the hierarchical clustering algorithm and a dynamic energy efficient hierarchical routing algorithm. It provides details on the simulation methods and concludes that hierarchical clustering and routing algorithms can efficiently reduce energy consumption in sensor nodes.
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.
Energy efficient communication techniques for wireless micro sensor networksPushpita Biswas
The document summarizes work done on improving the LEACH routing protocol for wireless sensor networks. It provides background on WSNs and discusses limitations of the original LEACH protocol. The work done section describes an algorithm that tracks "perfect clusters" based on distances between a cluster head and nodes, and adjusts node thresholds to promote repetition of such clusters while limiting energy depletion. Simulation conditions consider 100 homogeneous nodes randomly placed to transmit data to a base station.
SLGC: A New Cluster Routing Algorithm in Wireless Sensor Network for Decrease...IJCSEA Journal
Decrease energy consumption and maximizing network lifetime are important parameters in designing and protocols for wireless sensor network (WSN).Clustering is one of the efficient methods in energy consumption by Cluster-Head in WSN. Besides, CH can process and aggregate data sent by cluster members, thus reducing network traffic for sending data to sink. In this paper presents a new cluster routing algorithm by dividing network into grids. In each grid computes the center-gravity and threshold of energy for selecting the node that has the best condition base on these parameters in grid for selecting Cluster-Head in current round, also SLGC selecting Cluster-Heads for next rounds thereby this CHs reduce the volume of controlling messages for next rounds and inform nodes for sending data into CH of respective round. This algorithm prolong network lifetime and decrease energy consumption by selecting CH in grid and sending data of grid to sink by this CH. Result of simulation shows that SLGC algorithm in comparison with the previous clustering algorithm has maximizing network lifetime and decrease energy consumption in network.
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.
This document outlines various clustering protocols for heterogeneous wireless sensor networks (HWSN). It begins by defining keywords related to HWSN and challenges in these networks, such as limited energy and heterogeneous hardware. The goals of clustering protocols are then discussed, including load balancing, fault tolerance and energy efficiency. Various clustering methods, attributes and models are classified. Examples of heterogeneous resources, impacts and performance measures are provided. The document also lists relevant conferences, simulators and laboratories, and provides author details.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
in the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
A General Self Organized Tree Based Energy Balance Routing Protocol for WSN Sathish Silence
GSTEB is a self-organized tree-based energy-balance routing protocol for wireless sensor networks. It aims to prolong network lifetime by balancing energy consumption across nodes. In GSTEB, the base station selects a root node and broadcasts its ID. Then each node selects its parent in a way that minimizes its distance to the root while balancing energy levels. The network operates in rounds, where a routing tree is constructed and nodes transmit sensed data to the base station along the tree. GSTEB dynamically changes the root node between rounds to further balance energy usage among all nodes. Simulation results show GSTEB outperforms other protocols in balancing energy consumption and extending network lifetime.
Energy efficient cluster head selection in LEACH protocolARUNP116
This document presents a summary of an energy efficient cluster head selection method for the LEACH protocol in wireless sensor networks. It discusses the LEACH protocol and its phases/operations. It also identifies weaknesses in the standard LEACH approach. The authors then propose selecting two cluster heads based on residual energy to perform data gathering, aggregation, and transmission to the base station. Cluster heads would be selected considering residual energy and distance factors to balance energy consumption across the network. This proposed approach aims to improve system efficiency and prolong the network lifetime.
The document provides an overview of routing protocols in wireless sensor networks. It discusses several categories of routing protocols including data-centric, hierarchical, and location-based. For hierarchical routing protocols, it summarizes LEACH, PEGASIS, HEED, P-LEACH, H-LEACH, and other variants that aim to improve energy efficiency. It provides brief descriptions of how each protocol operates and highlights drawbacks. The document also summarizes several data-centric routing protocols including Directed Diffusion, Rumor Routing, and their limitations.
Protocols For Self Organisation Of A Wireless Sensor NetworkSaatviga Sudhahar
The document proposes protocols for self-organization of wireless sensor networks. It discusses challenges including energy consumption and localized algorithms. It presents SMACS for link layer organization, EAR for mobility management, and SAR for multihop routing. Cooperative signal processing algorithms like SWE and MWE are introduced to reduce data communication costs through local processing. The algorithms aim to address energy efficiency while allowing scalability in wireless sensor networks.
This document discusses generating sensor nodes and clustering for energy efficiency in wireless sensor networks (WSNs). It describes how sensor nodes are organized into clusters with a cluster head that communicates with the base station. The presentation proposes an algorithm for selecting the cluster head based on the node's distance to the base station and other nodes, with the goal of increasing network lifetime by optimizing energy consumption. Clustering helps reduce energy usage through data aggregation and limiting transmissions to cluster heads only.
34 9141 it ns2-tentative route selection approach for edit septianIAESIJEECS
Wireless Sensor Networks (WSNs) assume a crucial part in the field of mechanization and control where detecting of data is the initial step before any automated job could be performed. So as to encourage such perpetual assignments with less vitality utilization proportion, clustering is consolidated everywhere to upgrade the system lifetime. Unequal Cluster-based Routing (UCR) [7] is a standout amongst the most productive answers for draw out the system lifetime and to take care of the hotspot issue that is generally found in equivalent clustering method. In this paper, we propose Tentative Route (TRS) Selection approach for irregular Clustered Wireless Sensor Networks that facilitates in decision an efficient next relay to send the data cumulative by Cluster Heads to the Base Station. Simulation analysis is achieved using the network simulator to demonstrate the effectiveness of the TRS method.
This document summarizes and classifies various routing protocols for wireless sensor networks (WSN). It discusses protocols that are homogenous (all nodes are identical) and heterogeneous (nodes differ). It focuses on clustered protocols where nodes are grouped into clusters to aggregate and transmit data. Specific clustered protocols covered include LEACH (Low-Energy Adaptive Clustering Hierarchy), ALEACH, MR-LEACH, PEGASIS, TEEN, and Re-Cluster LEACH. Each protocol is summarized with its key features and advantages/disadvantages.
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...IJERD Editor
Wireless sensor network is an emerging field leading to the various applications worldwide. Small nodes being used are capable enough to sensing, computation, collection and forwarding the data to the Base Station. Battery source is one of the most prominent concerning issue in making the sensor network running for performing various assigned tasks. This battery source has all business with the routing strategies being employed. Here in this paper the routing protocol LEACH (Low-Energy Adaptive Clustering Hierarchy) is being reviewed to explore the advancements in clustering strategies. LEACH is being the first clustering protocol which selects the cluster head in each round and thereby balancing the energy consumption throughout the network. The work in the paper focus to discuss various variants of LEACH aiming to enhance the network life-time.
The document summarizes a research paper that proposes improvements to the LEACH (Low Energy Adaptive Clustering Hierarchy) routing protocol for wireless sensor networks. It begins by describing the basic LEACH protocol and some of its limitations, such as uneven energy consumption and long-distance transmissions from cluster heads to the base station. The proposed EE-LEACH modified protocol aims to make cluster head selection dependent on residual node energy and distance to other cluster heads, in order to balance energy usage and improve network lifetime. The protocol modifications and objectives are outlined, along with the simulation parameters that will be used to analyze energy efficiency improvements compared to the basic LEACH protocol.
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.
Performance evaluation of variants of particle swarm optimization algorithms ...Aayush Gupta
The document discusses wireless sensor networks (WSNs) and energy efficient routing protocols. It provides background on the challenges of WSNs including limited energy. It describes that communication is the most energy expensive activity and multihop transmission can help. It then discusses the LEACH routing protocol, a hierarchical clustering protocol, including its phases and stochastic threshold algorithm for selecting cluster heads. It proposes adapting k-means clustering for LEACH to select cluster heads more efficiently and compares performance of random LEACH versus adaptive k-means LEACH.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
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.
Energy efficient protocol with static clustering (eepsc) comparing with low e...Alexander Decker
This document summarizes a new routing protocol called Energy-Efficient Protocol with Static Clustering (EEPSC) that is proposed to improve energy efficiency in wireless sensor networks compared to the LEACH protocol. EEPSC partitions the network into static clusters during an initial setup phase to eliminate the overhead of dynamic clustering. It then selects high-energy sensor nodes within each cluster to serve as cluster heads and temporary cluster heads to distribute the energy load and extend the lifetime of the network. Simulation results showed that EEPSC outperforms LEACH in terms of network lifetime and power consumption.
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.
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.
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.
The document describes two wireless sensor network routing protocols: LEACH and PEGASIS. LEACH uses local processing to reduce global communication and randomly rotates cluster heads to distribute energy load. PEGASIS forms chains between nodes so that each node only communicates with a close neighbor, extending network lifetime compared to LEACH by up to 3 times. Both protocols aim to improve energy efficiency through data aggregation and minimizing transmission distances in wireless sensor networks.
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
In wireless sensor networks, sensor nodes play the most prominent role. These sensor nodes are mainly un-chargeable, so it
raises an issue regarding lifetime of the network. Mainly sensor nodes collect data and transmit it to the Base Station. So, most of the
energy is consumed in the communication process between sensor nodes and the Base Station. In this paper, we present an
improvement on LEACH protocol to enhance the network lifetime. Our goal is to reduce the transmissions between cluster heads and
the sink node. We will choose optimum number of Master Cluster Heads from variation cluster heads present in the network. The
simulation results show that our proposed algorithm enhances the network lifetime as compare to the LEACH protocol.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
In the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Energy efficient cluster head selection in LEACH protocolARUNP116
This document presents a summary of an energy efficient cluster head selection method for the LEACH protocol in wireless sensor networks. It discusses the LEACH protocol and its phases/operations. It also identifies weaknesses in the standard LEACH approach. The authors then propose selecting two cluster heads based on residual energy to perform data gathering, aggregation, and transmission to the base station. Cluster heads would be selected considering residual energy and distance factors to balance energy consumption across the network. This proposed approach aims to improve system efficiency and prolong the network lifetime.
The document provides an overview of routing protocols in wireless sensor networks. It discusses several categories of routing protocols including data-centric, hierarchical, and location-based. For hierarchical routing protocols, it summarizes LEACH, PEGASIS, HEED, P-LEACH, H-LEACH, and other variants that aim to improve energy efficiency. It provides brief descriptions of how each protocol operates and highlights drawbacks. The document also summarizes several data-centric routing protocols including Directed Diffusion, Rumor Routing, and their limitations.
Protocols For Self Organisation Of A Wireless Sensor NetworkSaatviga Sudhahar
The document proposes protocols for self-organization of wireless sensor networks. It discusses challenges including energy consumption and localized algorithms. It presents SMACS for link layer organization, EAR for mobility management, and SAR for multihop routing. Cooperative signal processing algorithms like SWE and MWE are introduced to reduce data communication costs through local processing. The algorithms aim to address energy efficiency while allowing scalability in wireless sensor networks.
This document discusses generating sensor nodes and clustering for energy efficiency in wireless sensor networks (WSNs). It describes how sensor nodes are organized into clusters with a cluster head that communicates with the base station. The presentation proposes an algorithm for selecting the cluster head based on the node's distance to the base station and other nodes, with the goal of increasing network lifetime by optimizing energy consumption. Clustering helps reduce energy usage through data aggregation and limiting transmissions to cluster heads only.
34 9141 it ns2-tentative route selection approach for edit septianIAESIJEECS
Wireless Sensor Networks (WSNs) assume a crucial part in the field of mechanization and control where detecting of data is the initial step before any automated job could be performed. So as to encourage such perpetual assignments with less vitality utilization proportion, clustering is consolidated everywhere to upgrade the system lifetime. Unequal Cluster-based Routing (UCR) [7] is a standout amongst the most productive answers for draw out the system lifetime and to take care of the hotspot issue that is generally found in equivalent clustering method. In this paper, we propose Tentative Route (TRS) Selection approach for irregular Clustered Wireless Sensor Networks that facilitates in decision an efficient next relay to send the data cumulative by Cluster Heads to the Base Station. Simulation analysis is achieved using the network simulator to demonstrate the effectiveness of the TRS method.
This document summarizes and classifies various routing protocols for wireless sensor networks (WSN). It discusses protocols that are homogenous (all nodes are identical) and heterogeneous (nodes differ). It focuses on clustered protocols where nodes are grouped into clusters to aggregate and transmit data. Specific clustered protocols covered include LEACH (Low-Energy Adaptive Clustering Hierarchy), ALEACH, MR-LEACH, PEGASIS, TEEN, and Re-Cluster LEACH. Each protocol is summarized with its key features and advantages/disadvantages.
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...IJERD Editor
Wireless sensor network is an emerging field leading to the various applications worldwide. Small nodes being used are capable enough to sensing, computation, collection and forwarding the data to the Base Station. Battery source is one of the most prominent concerning issue in making the sensor network running for performing various assigned tasks. This battery source has all business with the routing strategies being employed. Here in this paper the routing protocol LEACH (Low-Energy Adaptive Clustering Hierarchy) is being reviewed to explore the advancements in clustering strategies. LEACH is being the first clustering protocol which selects the cluster head in each round and thereby balancing the energy consumption throughout the network. The work in the paper focus to discuss various variants of LEACH aiming to enhance the network life-time.
The document summarizes a research paper that proposes improvements to the LEACH (Low Energy Adaptive Clustering Hierarchy) routing protocol for wireless sensor networks. It begins by describing the basic LEACH protocol and some of its limitations, such as uneven energy consumption and long-distance transmissions from cluster heads to the base station. The proposed EE-LEACH modified protocol aims to make cluster head selection dependent on residual node energy and distance to other cluster heads, in order to balance energy usage and improve network lifetime. The protocol modifications and objectives are outlined, along with the simulation parameters that will be used to analyze energy efficiency improvements compared to the basic LEACH protocol.
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.
Performance evaluation of variants of particle swarm optimization algorithms ...Aayush Gupta
The document discusses wireless sensor networks (WSNs) and energy efficient routing protocols. It provides background on the challenges of WSNs including limited energy. It describes that communication is the most energy expensive activity and multihop transmission can help. It then discusses the LEACH routing protocol, a hierarchical clustering protocol, including its phases and stochastic threshold algorithm for selecting cluster heads. It proposes adapting k-means clustering for LEACH to select cluster heads more efficiently and compares performance of random LEACH versus adaptive k-means LEACH.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
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.
Energy efficient protocol with static clustering (eepsc) comparing with low e...Alexander Decker
This document summarizes a new routing protocol called Energy-Efficient Protocol with Static Clustering (EEPSC) that is proposed to improve energy efficiency in wireless sensor networks compared to the LEACH protocol. EEPSC partitions the network into static clusters during an initial setup phase to eliminate the overhead of dynamic clustering. It then selects high-energy sensor nodes within each cluster to serve as cluster heads and temporary cluster heads to distribute the energy load and extend the lifetime of the network. Simulation results showed that EEPSC outperforms LEACH in terms of network lifetime and power consumption.
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.
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.
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.
The document describes two wireless sensor network routing protocols: LEACH and PEGASIS. LEACH uses local processing to reduce global communication and randomly rotates cluster heads to distribute energy load. PEGASIS forms chains between nodes so that each node only communicates with a close neighbor, extending network lifetime compared to LEACH by up to 3 times. Both protocols aim to improve energy efficiency through data aggregation and minimizing transmission distances in wireless sensor networks.
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
In wireless sensor networks, sensor nodes play the most prominent role. These sensor nodes are mainly un-chargeable, so it
raises an issue regarding lifetime of the network. Mainly sensor nodes collect data and transmit it to the Base Station. So, most of the
energy is consumed in the communication process between sensor nodes and the Base Station. In this paper, we present an
improvement on LEACH protocol to enhance the network lifetime. Our goal is to reduce the transmissions between cluster heads and
the sink node. We will choose optimum number of Master Cluster Heads from variation cluster heads present in the network. The
simulation results show that our proposed algorithm enhances the network lifetime as compare to the LEACH protocol.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
In the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
Uniform Distribution Technique of Cluster Heads in LEACH Protocolidescitation
A sensor network is composed of a large number of
sensor nodes that are densely deployed either inside the
phenomenon or very close to it. Clustering provides an effective
way for prolonging the lifetime of a wireless sensor network.
Current clustering algorithms usually utilize two techniques,
selecting cluster heads (CHs) with more residual energy and
rotating cluster heads periodically, to distribute the energy
consumption among nodes in each cluster and extend the
network lifetime. LEACH (Low-Energy Adaptive Clustering
Hierarchy), a clustering-based protocol that utilizes
randomized rotation of local cluster base stations (cluster-
heads) to evenly distribute the energy load among the sensors
in the network. But LEACH cannot select the cluster-heads
uniformly throughout the network. Hence, some nodes in the
network have to transmit their data very far to reach the CHs,
causing the energy in the system to be large. Here we have an
approach to address this problem for selecting CHs and their
corresponding clusters. The goal of this paper is to build such
a wireless sensor network in which each sensor node remains
inside the transmission range of CHs and its lifetime is
enlarged.
Optimizing the Performance of I-mod Leach-PD Protocol in Wireless Sensor Netw...ijsrd.com
Wireless Sensor Networks (WSNs) is a networks of thousands of inexpensive miniature devices capable of computation, communication and sensing. WSN is being been attracting increasing interest for supporting a new generation of ubiquitous computing systems with great potential for many applications such as surveillance, environmental monitoring, health care monitoring or home automation. In the near future, wireless sensor network is expected to consists of thousand of inexpensive nodes, each having sensing capability with limited computational and communication power which enables to deploy large scale sensor networks. Large scale WSN is usually implemented as a cluster network. Clustering sensors into groups, so that sensors communicate information only to cluster-heads and then the cluster-heads communicate the aggregated information to the base station, saves energy and thus prolongs network lifetime. LEACH (Low Energy Adaptive Clustering Hierarchy) protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, how to adjust threshold based on the residual energy, and the measurement of energy required for transmission, based on the distance of cluster head from the base station, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of residual energy and required energy, and the time length of each round are deduced, thereby modifying the threshold value calculation. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.
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.
ENERGY OPTIMISATION SCHEMES FOR WIRELESS SENSOR NETWORKcscpconf
A sensor network is composed of a large number of sensor nodes, which are densely
deployed either inside the phenomenon or very close to it. Sensor nodes have
sensing, processing and transmitting capability . They however have limited energy
and measures need to be taken to make op- timum usage of their energy and save
them from task of only receiving and transmitting data without processing. Various
techniques for energy utilization optimisation have been proposed Ma jor players are
however clustering and relay node placement. In the research related to relay node
placement, it has been proposed to deploy some relay nodes such that the sensors
can transmit the sensed data to a nearby relay node, which in turn delivers the data
to the base stations. In general, the relay node placement problems aim to meet
certain connectivity and/or survivabil- ity requirements of the network by deploying a
minimum number of relay nodes. The other approach is grouping sensor nodes into
clusters with each cluster having a cluster head (CH). The CH nodes aggregate the
data and transmit them to the base station (BS). These two approaches has been
widely adopted by the research community to satisfy the scala- bility objective and generally achieve high energy efficiency and prolong network lifetime in large-scale WSN environments and hence are discussed here along with single hop and multi hop characteristic of sensor node
Improved Performance of LEACH for WSN Using Precise Number of Cluster-Head an...ijsrd.com
Wireless microsensor systems will facilitate the reliable monitoring of a variety of environments for several applications like as civil and military. In this paper, we look at modified LEACH protocol. This paper presents a new approach to clustering wireless sensor networks and determining cluster heads. LEACH is a hierarchical cluster algorithm in which Cluster-Heads are randomly selected from the nodes. Here, I apply new approach for selection of Cluster-Head according to their initial and residual energy of all the nodes and according to their initial and residual energy nodes are eligible for cluster head in the next round. Results of new approach of LEACH protocol compared with Conventional routing protocol.
Analysis of Packet Loss Rate in Wireless Sensor Network using LEACH ProtocolIJTET Journal
Abstract: Wireless sensor network (WSN) is used to collect and send various kinds of messages to a base station (BS). Wireless sensor nodes are deployed randomly and densely in a target region, especially where the physical environment is very harsh that the macro-sensor counterparts cannot be deployed. Low Energy Adaptive Clustering Hierarchical (LEACH) Routing protocol builds a process where it reduces the Packet Loss Rate from 100 % to 55% .Simulations are carried out using NS2 simulator.
Wireless sensor network consists of several distributed sensor nodes. It is used for several environmental applications, military applications and health related applications. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Most of the research in energy efficient data gathering in data centric applications of wireless sensor networks is motivated by LEACH (Low Energy Adaptive Clustering Hierarchy) scheme. It allows the rotation of cluster head role among the sensor nodes and tries to distribute the energy consumption over the network. Selection of sensor node for such role rotations greatly affects the energy efficiency of the network. Some of the routing protocol has a drawback that the cluster is not evenly distributed due to its randomized rotation of local cluster head. We have surveyed several existing methods for selecting energy efficient cluster head in wireless sensor networks. We have proposed an energy efficient cluster head selection method in which the cluster head selection and replacement cost is reduced and ultimately the network lifetime is increased. Using our proposed method, network life time is increased compared to existing methods. Keywords: WSN, CH, BS, LEACH, LEACH-B, LEACH-F
Every cluster comprise of a leader which is known as cluster head. The cluster head will be chosen by the sensor nodes in the individual cluster or be pre-assigned by the user. The main advantages of clustering are the transmission of aggregated data to the base station, offers scalability for huge number of nodes and trims down energy consumption. Fundamentally, clustering could be classified into centralized clustering, distributed clustering and hybrid clustering. In centralized clustering, the cluster head is fixed. The rest of the nodes in the cluster act as member nodes. In distributed clustering, the cluster head is not fixed. The cluster head keeps on shifting form node to node within the cluster on the basis of some parameters. Hybrid clustering is the combination of both centralized clustering and distributed clustering mechanisms. This paper gives a brief overview on clustering process in wireless sensor networks. A research on the well evaluated distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH) and its followers are portrayed artistically. To overcome the drawbacks of these existing algorithms a hybrid distributed clustering model has been proposed for attaining energy efficiency to a larger scale.
An Improved LEACH-C Algorithm for Energy Efficiency in WSN Routingijsrd.com
this paper considered a multi-objective LEACH-C algorithm in the selection of Cluster Head (CH) in such a way so that its energy is used uniformly with load balancing among clusters for delayed disintegration of network. LEACH-C algorithm based single objective clustering approach has been replaced by multi-objective clustering approach where we not only considered the residual energy of nodes but the size of cluster in creating a cluster structure. The improved LEACH-C protocol has been compared with random LEACH and Max Energy LEACH or existing LEACH-C algorithm for energy equi-distribution and load balancing among clusters. Wireless sensor network (WSN) is simulated using a MATLAB programming and power consumption algorithms take into consideration all aspects of power consumption in the operation of the node. The modified LEACH-C routing protocol shows improvements in lifetime as well as in network disintegration criterion
This document summarizes a research paper that proposes a new routing protocol called U-LEACH for wireless sensor networks. U-LEACH aims to prolong the lifetime of sensor networks by uniformly distributing cluster head selection throughout the network, unlike the original LEACH protocol. It describes how LEACH works and its limitations in ensuring uniform cluster head distribution. The proposed U-LEACH protocol incorporates a Uniform Distribution Technique to select cluster heads in a way that ensures each sensor node is within transmission range of a cluster head, extending the overall network lifetime.
Iaetsd survey on wireless sensor networks routingIaetsd Iaetsd
This document summarizes and compares several hierarchical routing protocols for wireless sensor networks that aim to improve energy efficiency. It discusses LEACH, HEED, PEGASIS, TBC and TREEPSI protocols. These protocols use clustering and data aggregation techniques to reduce energy consumption and prolong network lifetime. Simulation results show that these hierarchical protocols can achieve better energy efficiency and balance energy loads compared to traditional routing protocols. The document also analyzes the advantages and disadvantages of the LEACH protocol in detail.
This document discusses clustering algorithms for wireless sensor networks. It begins with an introduction to wireless sensor networks and clustering. It then discusses various clustering algorithms such as LEACH, ACW, CIPRA, ERA, LEACH-C, EECHSSDA, HEED, and HEF. Many of the early algorithms like LEACH, ACW and CIPRA do not consider energy levels of nodes when selecting cluster heads. Later algorithms such as ERA, LEACH-C, EECHSSDA, HEED, and HEF aim to maximize network lifetime by selecting cluster heads based on remaining energy levels or probability related to energy. HEF is presented as an algorithm that can provide optimal cluster head selection as well
This document discusses clustering algorithms for wireless sensor networks. It begins with an introduction to wireless sensor networks and clustering. It then discusses various clustering algorithms such as LEACH, ACW, CIPRA, ERA, LEACH-C, EECHSSDA, HEED, and HEF. Many of the early algorithms like LEACH, ACW and CIPRA do not consider energy levels of nodes when selecting cluster heads. Later algorithms such as ERA, LEACH-C, EECHSSDA, HEED, and HEF aim to maximize network lifetime by selecting cluster heads based on remaining energy levels or probability related to energy. HEF is presented as an algorithm that can provide optimal cluster head selection as well
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.
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.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor node creates challenges for routing in WSNs. The research work presents the organized and detailed description of energy conservation method for WSNs. In the proposed method reclustering and multihop data transmission processes are utilized for data reporting to base station by sensor node. The accurate use of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for longer times inside the cluster. The result shows that the proposed clustering approach has higher stable region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy Adaptive Clustering Hierarchy (LEACH) for WSNs.
Best 20 SEO Techniques To Improve Website Visibility In SERPPixlogix Infotech
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
Building Production Ready Search Pipelines with Spark and MilvusZilliz
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
Digital Marketing Trends in 2024 | Guide for Staying AheadWask
https://www.wask.co/ebooks/digital-marketing-trends-in-2024
Feeling lost in the digital marketing whirlwind of 2024? Technology is changing, consumer habits are evolving, and staying ahead of the curve feels like a never-ending pursuit. This e-book is your compass. Dive into actionable insights to handle the complexities of modern marketing. From hyper-personalization to the power of user-generated content, learn how to build long-term relationships with your audience and unlock the secrets to success in the ever-shifting digital landscape.
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfChart Kalyan
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
Salesforce Integration for Bonterra Impact Management (fka Social Solutions A...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on integration of Salesforce with Bonterra Impact Management.
Interested in deploying an integration with Salesforce for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Taking AI to the Next Level in Manufacturing.pdfssuserfac0301
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?Speck&Tech
ABSTRACT: A prima vista, un mattoncino Lego e la backdoor XZ potrebbero avere in comune il fatto di essere entrambi blocchi di costruzione, o dipendenze di progetti creativi e software. La realtà è che un mattoncino Lego e il caso della backdoor XZ hanno molto di più di tutto ciò in comune.
Partecipate alla presentazione per immergervi in una storia di interoperabilità, standard e formati aperti, per poi discutere del ruolo importante che i contributori hanno in una comunità open source sostenibile.
BIO: Sostenitrice del software libero e dei formati standard e aperti. È stata un membro attivo dei progetti Fedora e openSUSE e ha co-fondato l'Associazione LibreItalia dove è stata coinvolta in diversi eventi, migrazioni e formazione relativi a LibreOffice. In precedenza ha lavorato a migrazioni e corsi di formazione su LibreOffice per diverse amministrazioni pubbliche e privati. Da gennaio 2020 lavora in SUSE come Software Release Engineer per Uyuni e SUSE Manager e quando non segue la sua passione per i computer e per Geeko coltiva la sua curiosità per l'astronomia (da cui deriva il suo nickname deneb_alpha).
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
1. International Journal of Computational Engineering Research||Vol, 04||Issue, 2||
Efficient Cluster Head Selection Method For Wireless Sensor
Network
Manjusha M S1, K E Kannammal2
1
PG Scholar, Department Of Computing Science, Sri Shakthi Institute Of Engineering And Technology
Tamilnadu, India,
2
Associate Professor, Department Of Computing Science, Sri Shakthi Institute Of Engineering And Technology
Tamilnadu, India
ABSTRACT:
A WSN (Wireless Sensor Network) consists of over hundreds of sensor nodes which have limited
energy, process capability and memory. The applications of WSN in some extreme environment make
sensor nodes difficult to replace once they use up the battery resource. Since the wireless transmission
is the most energy consuming operation, how to design an energy efficient routing protocol becomes
the main goal for the wireless sensor network. LEACH is considered as the most popular routing
protocol which has better performance in saving the energy consumption. However, the selecting
formula neglecting the change of nodes’ energy will make the nodes acting as cluster heads too many
times which leads to the death of the cluster head early by consuming excessive amount of energy.
Also, the frequent reclustering wastes certain amount of energy. This paper presents a new version of
LEACH protocol referred to as VLEACH which aims to reduce energy consumption within the
wireless network.
KEYWORDS: Clustering, Cluster Head, LEACH protocol, Routing, V-LEACH, Vice Cluster Head,
Wireless sensor networks
I.
INTRODUCTION
Wireless sensor network consists of hundreds and even thousands of small tiny devices called sensor
nodes distributed autonomously to observe physical or environmental conditions like temperature, pressure,
vibration and motion at different locations such as landslides [5]. Every node in a sensor network usually
equipped with one sensor, a wireless communications device like radio transceiver, a small microcontroller, and
an energy supply, a battery. Since the nodes are battery operated energy plays a vital role. The application of
the WSN involves several fields, like military battleground, fire detection, and other extreme environments. In
these situations, it is troublesome to replace the dead nodes caused by energy’s depletion with new ones to
provide energy for the system. Therefore, making sensor nodes operating as long as possible is the main method
to maximize the lifespan of the sensor network. Because the energy’s consumption of sensor node primarily
originates from the long distance transmission of data, an efficient routing protocol can have a good impact on
the energy’s consumption. Thus how to design an energy efficient routing protocol becomes the main goal for
the wireless sensor network [6].
The basic objective on any routing protocol is to make the network useful and efficient. A cluster
based routing protocol group sensor nodes where each group of nodes has a Cluster Head (CH). Sensed data is
sent to the CH rather than send it to the BS; CH performs some aggregation function on data it receives then
sends it to the BS where these data is needed. LEACH [7] is considered as the most popular routing protocol
that use cluster based routing in order to minimize the energy consumption. Leach divides the communication
process into rounds with each round including a set-up phase and a steady-state phase. In the setup phase, some
sensor nodes are selected as CHs according to certain rules and other nodes join in the clusters as member
nodes. Within the steady-state phase, the CHs collect the data coming from their own cluster members and
aggregate them before transmitting to the BS [4]. However, due to the inherent characteristic of LEACH, the
unnecessary energy consumption caused by the
||Issn 2250-3005 ||
||February||2014||
Page 43
2. Efficient Cluster Head Selection Method For...
unreasonable choosing formula and the high frequency of reclustering among sensor nodes will cause
the uneven energy distribution and waste a certain amount of energy in the whole network. Supported the
ideology of traditional LEACH, we modify the selecting formula by considering the dynamic change of sensor
nodes’ energy and establish a Vice cluster head for every cluster during the communication process, that aims to
diminish the energy consumption spent on the reclustering and prolong the time of being in a steady-state
phase.[2]
II.
LEACH PROTOCOL
Low Energy Adaptive Clustering Hierarchy (LEACH) [3, 8] is the first hierarchical cluster-based
routing protocol for wireless sensor network that partitions the nodes into clusters, in each cluster a special node
with extra privileges referred to as Cluster Head (CH) is responsible for creating and manipulating a TDMA
(Time division multiple access) schedule and sending aggregated data from nodes to the BS where these data is
needed using CDMA (Code division multiple access). Remaining nodes are cluster members. Figure 1 shows
the LEACH protocol. LEACH is divided into rounds; each round consists of two phases.
Base Station
Figure 1. LEACH Protocol
2.1. Set-Up Phase. After finishing the deployment of sensor nodes, each node within the monitor field decides
independently of other nodes whether or not it can become a cluster head in the current round. Throughout the
phase, every node generates a random number between zero and one [1] and then compares it with the threshold
value T (n).
(1)
Where p is that the percentage of cluster heads over all nodes within the network, r is the number of rounds of
selection, and G is that the set of nodes that haven’t been selected as cluster heads in round 1/p. The node whose
number is larger than the threshold can choose itself as a cluster head so broadcasts the message to its surround
sensor nodes. During this phase, a node could receive more than one broadcast message from completely
different cluster heads, however the node will decide its distance to a cluster from the strength of received
broadcast signal; the stronger the signal, the nearer to a cluster. So the node whose number is smaller than
threshold will only send request message containing its ID to the cluster that has the strongest signal strength for
saving energy spent on the transmission distance. Once the cluster head receives request message returning from
one node, it records the node’s ID and decides it as its member node. Once the message exchanges between
cluster heads and normal nodes, every CH gets its own member nodes’ information regarding IDs and every
normal node gets that cluster that it belongs to. Based on the message it records, a
||Issn 2250-3005 ||
||February||2014||
Page 44
3. Efficient Cluster Head Selection Method For...
TDMA schedule is created by the CH and broadcasts it to the cluster members. So all the member nodes of that
CH gets their idle slots for data transmission. Then the steady-state phase starts.
2.2. Steady-State Phase. The establishment of a cluster head in every cluster during the set-up phase provides a
guarantee for the data transmission in the steady-state phase. In normal cases, member nodes can put off their
radio till they sense the required surrounding environment data. If there are some data in need for transmission,
they will send the data to CH during the idle slots recorded within the TDMA schedule table. As for the CHs,
they need to keep up communication status at all times so as to receive the data from different member nodes.
Once receiving all the data from their members, CHs will aggregate these data’s and then send them to BS. As a
result of some sensor nodes may sense similar environment data, the aggregation on the cluster head will
diminish excess bandwidth cost and communication traffic that includes a positive reflection to the energy’s
consumption. Also, the transmission distance becomes shorter comparing with transmitting to BS on an
individual basis for each member node, which can save energy for the member nodes. However, the heavy tasks
on CH will result in an excessive amount of energy consumption. So as to avoid making the CHs die early and
cause the cascade result within the network, a new round begins and new clusters are going to be rebuilt in the
whole network.
Although the LEACH protocol acts in a very sensible manner, they also suffer from several drawbacks just like
the following:
[1]
CHs’ selection is random, that doesn’t consider the residual energy of every node or want the support of
BS.
[2]
The high frequency of reclustering wastes a certain quantity of energy.
[3]
It can’t cover a large area.
[4]
CHs aren’t uniformly distributed, where CH may be settled at the edges of the clusters.
III.
PROPOSED SYSTEM -VLEACH
Motivated by the initial LEACH and different improvement protocols [2, 3] we tend to propose a
modification to the cluster head selection method to reduce energy consumption. For a small sensor network, we
make the following assumptions.
[1]
The base station (BS) is located at a fixed location which is far from the sensors and is immobile.
[2]
All nodes within the network have limited energy with an indentify ID.
[3]
All the nodes are able to reach BS and can communicate with one another.
[4]
CH perform data compression and aggregation function.
Base Station
Figure 2. Proposed VLEACH
In the improvement, we also make use of the hierarchical clustering ideology and divide a round into a
set-up phase and steady-state phase. The set-up phase will use a modified formula for selecting the appropriate
||Issn 2250-3005 ||
||February||2014||
Page 45
4. Efficient Cluster Head Selection Method For...
CHs which are responsible for collecting data from their member nodes and transmitting them to BS. CHs will
consume more energy than member nodes because of the heavy tasks so in order to avoid making the CHs die
early, LEACH take the measure of beginning a new round and rebuilding the clusters. However, in the proposed
system we will make use of the information about the member node which is achieved dynamically by cluster
heads in the steady phase to choose the vice cluster heads (VCHs). VCH take over the role of cluster heads in
the later period of steady state phase. Figure 2 shows the VLEACH protocol. Comparing with the normal
LEACH, the VCHs proposed will diminish the frequency of reclustering in the same interval and extend the
time of being in steady-state phase, which is able to prolong the lifecycle of the whole network.
3.1. Selecting Cluster Heads (CHs) in the Set-Up Phase. Based on the fact that LEACH does not take into
account the residual energy of the nodes during the selection of cluster heads in the set-up phase, we tend to
develop the present energy and also the times being selected as CH or VCH. We first consider about the threshold
T (n) and are modified to the following equation:
(2)
Where p is that the percentage of cluster heads over all the nodes within the network, R is the number of
round of selection in current time. G is that the set of nodes that haven’t been selected as cluster heads in round
1/p.
is the residual energy of the node and
is the initial energy of each node. CH times (VCH
times) is that the times of being selected CH (VCH times) once. Deducing from (2), we can able to get that the
larger the
larger the T(n). So we can infer that the node that has lot of energy will have a much bigger
probability to become the cluster head within the current round. But at the same time, if a node acts as CH or
VCH for an excessive amount of time, the energy it consumes are going to be larger than other sensor nodes.
However, the improved equation can lower the probability of a node acting as CH or VCH too many times to
become CH again. We are able to observe that the improved formula adds some useful determinacy factors within
the choice of cluster heads that is helpful to the stabilization of clusters. If there are too many selected cluster
heads in the deployed area then it will cause some unnecessary energy consumption. For limiting the cluster
heads’ number to a reasonable range, we tend to develop the simulated annealing algorithm to form appropriate
numbers of cluster heads which is about 4%-5% of the overall sensor nodes. Once finishing the choice of cluster
heads within the set-up phase by using the improved equation and simulated annealing algorithm, begin the
steady-state phase of a round.
3.2. Establishment of Vice Cluster Heads’ (VCHs’) during the Steady-State Phase. In the steady-state phase
of LEACH protocol, the cluster heads will consume more energy than member nodes. As a result they need to
take the responsibility of aggregating and relaying data to remote BS for their member nodes. So as to avoid
making the cluster heads die early when undergoing certain amount of communication time, a new replacement
round begins to reorganize the nodes into clusters and reselect the cluster heads. So, all the nodes go to judge
themselves and rebuild the cluster heads so as to campaign for new cluster heads. So, it consumes some energy
spent on recompleting the cluster heads and shortens the full time of being in steady-state phase. Thus we propose
a new scheme to extend the time of being in steady phase and diminish the frequency of recluster. The new
scheme works as follows. During the data communication in steady-state phase, as a result of all member nodes
send the data sensed from environment to their own cluster head, the cluster head will have the chance to find out
the status information of its members. Based on this, the cluster head will record the information of various
member nodes dynamically in the format like <id, E>, which refers the member node id has residual energy E.
Through this fashion, the CH can have global energy information about its member nodes. So as to extend the
time of being in steady-state phase and delay a new round’s coming; CH can appoint a member node which has
the utmost energy in cluster to take over the role of it if it consumes too much energy in the later steady-state
phase of current round. Thus we can call the member node which is appointed by the CH as a vice cluster (VCH).
So as to make the rest of member nodes get the VCH’s id, the CH broadcast this message containing the VCHs id
to various other member nodes. Then from that, the CH itself will become a standard member node because of the
too much energy consumption and the establishment of VCH in a cluster. Since then, all the member nodes can
send their data to VCH, which send the compressed data to the BS. We are able to observe that the establishment
of VCH in cluster can prolong the communication time of being in steady-state phase and it also delay the coming
of a new round. But the problem is that after a certain time,
||Issn 2250-3005 ||
||February||2014||
Page 46
5. Efficient Cluster Head Selection Method For...
VCH also consumes more energy than the member nodes due to the heavy tasks undertaken as previous CH. To
avoid the chances of being the VCH die early, start a new round for selecting CHs among all the sensor nodes in
the set-up phase. So we can call the whole communication in our improved protocol as the cycle of “CH-VCHCH.” It can be described using the Figure 3.
Figure 3. Improved hierarchical protocol working process
In the proposed protocol, we have taken the measure of choosing a VCH for every cluster in the later
period of the steady-state phase in a round by using the energy information achieved by CH, which may
diminish the frequency of reclustering and extend the time of being in steady-state phase. Within the whole
communication phase of a round, CH and VCH have similar roles such as collecting data from member nodes
and relaying the aggregated data to the BS. The distinction is that the CH takes the responsibility within the
earlier stage of the steady-state phase, while VCH replaces the CH and works in the later stage of the steady
phase of the current round. Also, the CHs choice originates the competition among all the nodes within the setup phase. However, CH directly establishes the VCH within the later stage of the steady-state phase in a round.
We are able to get that the method of establishing VCH is easy and speedy comparing with the generation and
cooperation of random numbers within the set-up phase. Thus all of them have a good benefit to the saving of
energy in the whole network.
IV.
SIMULATION RESULT
We examine the improved protocol through simulations in matlab. A network consists of 100 nodes is
deployed in an area of 100m × 100m with BS at (50, 50). For comparing the advantages of the improved
VLEACH protocol we use the number of dead nodes as simulation parameter. The simulation results are shown
in Figure 4. From the simulation we can observe that in our proposed VLEACH node starts to dead earlier than
the normal LEACH protocol.
||Issn 2250-3005 ||
||February||2014||
Page 47
6. Efficient Cluster Head Selection Method For...
Figure 4: LEACH and VLEACH with 100 nodes
We also compare the LEACH and VLEACH with 200 nodes for showing that our proposed protocol
also works in the case of dense networks also. The simulation result with 200 nodes is shown in Figure 5.
Figure 5: LEACH and VLEACH with 200 nodes
By the introduction of VCH, certain amount of energy spent on the reclustering and recomputing
among different nodes gets reduced. From Figure 4 and 5, we can obtain that the number of dead nodes is
reduced in our improved routing protocol than LEACH over the simulation rounds. This shows that our
improved protocol consumes less energy. Also due to our modification to the steady-state phase, the times for
selecting the cluster heads to each member node in the whole network become reduced. This results the
remaining energy of the network using our improved protocol exceeds that of the original LEACH protocol.
||Issn 2250-3005 ||
||February||2014||
Page 48
7. Efficient Cluster Head Selection Method For...
V.
CONCLUSION
In this paper, an outline of the original LEACH protocol is presented and proposed a new version of
hierarchical protocol referred to as VLEACH. The proposed protocol obtains energy efficiency by the
modification for selecting the cluster head formula and the steady-state phase. The modification to the choosing
of cluster heads formula makes the CH or VCH have more opportunity to act as CHs. So the total energy of the
whole network has more even distribution among different nodes. Thus the VCH introduction makes the
frequency of reclustering more lowly and prolongs the time of being in steady-state phase; thus the energy used
for calculating the formula on every node reduces.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
B. Deosarkar, N. Yaday, and R. P. Yadav, “Cluster head selection in clustering algorithms for wireless sensor networks: a
survey,” in Proceedings of the International Conference on Computing Communication and Networking, Tamilnadu, India,
December 2008.
Fuzhe Zhao, You Xu, and Ru Li, “Improved LEACH Routing Communication Protocol for a Wireless Sensor Network”,
Hindawi Publishing Corporation, International Journal of Distributed Sensor Networks, Volume 2012, Article ID 649609.
G. Ran, H. Zhang, and S. Gong, “Improving on LEACH protocol of wireless sensor networks using fuzzy logic,” Journal of
Information and Computational Science, vol. 7, no. 3, pp. 767–775, 2010.
Heinzelman W.R, Chandrakasan A., and Balakrishnan H.: "Energy-Efficient Communication Protocol for Wireless Micro sensor
Networks".2000.
http://en.wikipedia.org/wiki/Low_Energy_Adaptive_Clustering_Hierarchy [Online].
J. Li and H. Gao, “Research advances in wireless sensor networks,” Journal of Computer Research and Advances, vol. 45, no. 1,
pp. 1–15, 2008.
K. Khamforoosh and H. Khamforoush, “A new routing algorithm for energy reduction in wireless sensor networks,” in
Proceedings of the 2nd IEEE International Conference on Computer Science and Information Technology (ICCSIT ’09), pp.
505–509, August 2009.
M. Bani Yassein, A. Al-zou'bi, Y. Khamayseh, W. “Improvement on LEACH protocol of Wireless Sensor Network
(VLEACH)”.
||Issn 2250-3005 ||
||February||2014||
Page 49