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.
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.
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.
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.
This document discusses routing protocols in wireless sensor networks. It begins with an introduction to routing challenges in WSNs such as limited energy, processing, and storage in sensor nodes. It then covers different routing techniques including flat routing protocols like SPIN, directed diffusion, and rumor routing. Hierarchical routing protocols discussed include LEACH, PEGASIS, TEEN, and APTEEN. Finally, it briefly mentions location-based routing and the GEAR 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.
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.
EDEEC and LEACH are clustering protocols for wireless sensor networks. EDEEC is for heterogeneous networks where nodes have different energy levels, while LEACH is for homogeneous networks. The document compares the performance of EDEEC and LEACH in terms of network lifetime, energy consumption, and total data transmission. Simulation results show that EDEEC outperforms LEACH by prolonging network lifetime, reducing energy consumption rate over time, and increasing total data transmitted to the base station.
Sensor Protocols for Information via Negotiation (SPIN)rajivagarwal23dei
Wireless sensor networks consist of large numbers of sensor nodes that monitor parameters and communicate wirelessly. The SPIN protocol family was developed to address the limitations of sensor nodes, particularly their limited energy, computation, and communication capabilities. SPIN uses meta-data negotiation and resource awareness to disseminate data between nodes more efficiently than flooding protocols. SPIN-1 is a simple three-stage handshake protocol that reduces energy costs. SPIN-2 builds upon SPIN-1 with an additional energy conservation heuristic to further prolong network lifetime. Evaluation shows SPIN consumes significantly less energy than flooding for data dissemination in wireless sensor networks.
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.
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.
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.
This document discusses routing protocols in wireless sensor networks. It begins with an introduction to routing challenges in WSNs such as limited energy, processing, and storage in sensor nodes. It then covers different routing techniques including flat routing protocols like SPIN, directed diffusion, and rumor routing. Hierarchical routing protocols discussed include LEACH, PEGASIS, TEEN, and APTEEN. Finally, it briefly mentions location-based routing and the GEAR 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.
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.
EDEEC and LEACH are clustering protocols for wireless sensor networks. EDEEC is for heterogeneous networks where nodes have different energy levels, while LEACH is for homogeneous networks. The document compares the performance of EDEEC and LEACH in terms of network lifetime, energy consumption, and total data transmission. Simulation results show that EDEEC outperforms LEACH by prolonging network lifetime, reducing energy consumption rate over time, and increasing total data transmitted to the base station.
Sensor Protocols for Information via Negotiation (SPIN)rajivagarwal23dei
Wireless sensor networks consist of large numbers of sensor nodes that monitor parameters and communicate wirelessly. The SPIN protocol family was developed to address the limitations of sensor nodes, particularly their limited energy, computation, and communication capabilities. SPIN uses meta-data negotiation and resource awareness to disseminate data between nodes more efficiently than flooding protocols. SPIN-1 is a simple three-stage handshake protocol that reduces energy costs. SPIN-2 builds upon SPIN-1 with an additional energy conservation heuristic to further prolong network lifetime. Evaluation shows SPIN consumes significantly less energy than flooding for data dissemination in wireless sensor networks.
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
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.
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.
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 discusses wireless sensor networks and routing protocols for wireless sensor networks. It defines what a wireless sensor network is and its key characteristics. It then discusses objectives like understanding ad hoc network basics and various routing protocols. It covers topics like the differences between WSNs and ad hoc networks, what a network simulator is and reasons for using NS2, various routing techniques like flooding, gossiping, and hierarchical routing. It also discusses routing challenges, wireless nodes, packet transmission, applications and the future scope of WSNs.
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.
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.
This document summarizes several cluster-based routing protocols for wireless sensor networks that aim to improve energy efficiency. It discusses both pre-established protocols like LEACH, EEHC, and HEED, as well as on-demand protocols like Passive Clustering and Energy Level-based Passive Clustering. For each protocol, it describes the key ideas such as random cluster head election, using residual energy to select cluster heads, and rotating cluster head roles to balance energy load among nodes. The document concludes that hierarchical routing protocols can improve energy efficiency but optimal clustering parameters and handling of network dynamics are still challenges.
This document describes the LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol for wireless microsensor networks. LEACH utilizes randomized rotation of cluster heads to distribute the energy load evenly among the sensors and achieves longer system lifetime. It uses localized coordination and control for data transfers to reduce global network communication. LEACH allows adaptive clustering and uses data aggregation in the clusters to reduce global data transmission and improve system scalability and energy efficiency. Simulation results show that LEACH distributes energy load evenly and outperforms other routing protocols by achieving up to a factor of 4 times increase in system lifetime.
This document summarizes several energy-aware routing protocols for wireless sensor networks. It discusses classical approaches like flooding and gossiping and their deficiencies. It then describes the SPIN protocol which uses negotiations and metadata to adapt to resource constraints. Directed Diffusion is also covered, using interests, data messages, gradients, and reinforcement to set up multiple paths between sources and sinks. The document provides details on how these protocols establish and maintain paths while conserving energy in wireless sensor networks.
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.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
The document discusses the LEACH protocol and DECSA improvement for wireless sensor networks. It describes the two phases of LEACH - the set-up phase where cluster heads are chosen and the steady-state phase where data is transmitted. DECSA considers both distance and residual energy to select cluster heads, forming a three-level hierarchy. DECSA prolongs network lifetime by 31% and reduces energy consumption by 40% compared to the original LEACH protocol.
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 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.
This document summarizes research on predicting the shear strength of reinforced concrete beams without web reinforcement. It begins by introducing the topic and noting that shear strength decreases as beam depth increases. It then reviews existing literature on shear strength mechanisms and factors that influence strength. The document discusses the challenges of theoretical models given complexities and uncertainties. It proposes using genetic programming and fuzzy set theory to develop empirical models from an existing database of over 2000 test results. The models would express shear strength as a function of concrete strength, reinforcement ratio, depth and other variables.
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.
This document describes the design of a standalone hybrid biomass and photovoltaic (PV) power system for an off-grid house in a remote area. It discusses using Homer software to simulate and optimize the system design. The system combines a PV array, battery bank, biomass generator, charge controller and DC/AC converter to meet the household's electricity needs. Simulation results can help improve hybrid system designs for providing power in remote, off-grid locations.
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
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.
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.
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 discusses wireless sensor networks and routing protocols for wireless sensor networks. It defines what a wireless sensor network is and its key characteristics. It then discusses objectives like understanding ad hoc network basics and various routing protocols. It covers topics like the differences between WSNs and ad hoc networks, what a network simulator is and reasons for using NS2, various routing techniques like flooding, gossiping, and hierarchical routing. It also discusses routing challenges, wireless nodes, packet transmission, applications and the future scope of WSNs.
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.
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.
This document summarizes several cluster-based routing protocols for wireless sensor networks that aim to improve energy efficiency. It discusses both pre-established protocols like LEACH, EEHC, and HEED, as well as on-demand protocols like Passive Clustering and Energy Level-based Passive Clustering. For each protocol, it describes the key ideas such as random cluster head election, using residual energy to select cluster heads, and rotating cluster head roles to balance energy load among nodes. The document concludes that hierarchical routing protocols can improve energy efficiency but optimal clustering parameters and handling of network dynamics are still challenges.
This document describes the LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol for wireless microsensor networks. LEACH utilizes randomized rotation of cluster heads to distribute the energy load evenly among the sensors and achieves longer system lifetime. It uses localized coordination and control for data transfers to reduce global network communication. LEACH allows adaptive clustering and uses data aggregation in the clusters to reduce global data transmission and improve system scalability and energy efficiency. Simulation results show that LEACH distributes energy load evenly and outperforms other routing protocols by achieving up to a factor of 4 times increase in system lifetime.
This document summarizes several energy-aware routing protocols for wireless sensor networks. It discusses classical approaches like flooding and gossiping and their deficiencies. It then describes the SPIN protocol which uses negotiations and metadata to adapt to resource constraints. Directed Diffusion is also covered, using interests, data messages, gradients, and reinforcement to set up multiple paths between sources and sinks. The document provides details on how these protocols establish and maintain paths while conserving energy in wireless sensor networks.
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.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
The document discusses the LEACH protocol and DECSA improvement for wireless sensor networks. It describes the two phases of LEACH - the set-up phase where cluster heads are chosen and the steady-state phase where data is transmitted. DECSA considers both distance and residual energy to select cluster heads, forming a three-level hierarchy. DECSA prolongs network lifetime by 31% and reduces energy consumption by 40% compared to the original LEACH protocol.
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 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.
This document summarizes research on predicting the shear strength of reinforced concrete beams without web reinforcement. It begins by introducing the topic and noting that shear strength decreases as beam depth increases. It then reviews existing literature on shear strength mechanisms and factors that influence strength. The document discusses the challenges of theoretical models given complexities and uncertainties. It proposes using genetic programming and fuzzy set theory to develop empirical models from an existing database of over 2000 test results. The models would express shear strength as a function of concrete strength, reinforcement ratio, depth and other variables.
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.
This document describes the design of a standalone hybrid biomass and photovoltaic (PV) power system for an off-grid house in a remote area. It discusses using Homer software to simulate and optimize the system design. The system combines a PV array, battery bank, biomass generator, charge controller and DC/AC converter to meet the household's electricity needs. Simulation results can help improve hybrid system designs for providing power in remote, off-grid locations.
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.
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.
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.
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.
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.
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.
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.
The document presents a new adaptive active constellation extension (ACE) algorithm for peak-to-average power ratio (PAPR) minimization in orthogonal frequency-division multiplexing (OFDM) systems. The algorithm combines clipping-based ACE with an adaptive control mechanism that allows finding the optimal clipping level. Simulation results show that the proposed algorithm achieves a minimum PAPR even for severely low clipping signals, solving a problem with conventional CB-ACE where PAPR reduction decreases for low clipping ratios.
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.
This document presents a proposed virtual body measurement system to measure body parameters from images in order to select appropriately sized clothing without needing to be physically present. The system uses HAAR features to recognize body parameters like height, waist, bust from images. It then considers factors like fashion style and clothing psychology to enable tailored clothing alterations. The methodology involves using HAAR classifiers and integral images to detect facial features and then train classifiers to recognize other body measurements. This virtual system aims to reduce time spent on physical fittings while shopping for tailored clothing.
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.
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.
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.
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.
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.
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.
The document describes the design of a fractional order PIλDλ controller for liquid level control of a spherical tank modeled as a fractional order system. A fractional order proportional integral derivative (FOPID) controller is designed and its performance is compared to a traditional integer order PID controller designed for the same spherical tank modeled as a first order plus dead time system. Simulation results show that the fractional order controller designed using frequency domain specifications achieves improved performance over the integer order controller. The fractional order controller provides extra tuning parameters that allow it to better match the dynamics of the fractional order plant model.
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.
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.
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.
This document compares and contrasts several common cluster-based routing algorithms for wireless sensor networks, including LEACH, TEEN, APTEEN, HEED, and PEGASIS. It discusses the advantages and disadvantages of each algorithm, with a focus on their approaches to energy efficiency. LEACH randomly selects cluster heads and uses TDMA, but assumes equal energy levels and that all nodes can reach the base station. TEEN and APTEEN add thresholds to improve energy efficiency for time-critical applications. HEED selects cluster heads based on both residual energy and node degree to balance energy use. The document provides an overview of the key clustering algorithms and issues to consider when choosing an approach.
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 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.
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.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
CLUSTERING-BASED ROUTING FOR WIRELESS SENSOR NETWORKS IN SMART GRID ENVIRONMENTijassn
Wireless Sensor Networks (WSN) is widely deployed in different fields of applications of smart grid to provide reliable monitoring and controlling of the electric power grid. The objective of this paper is simulate and analyze impact of various smart grid environments on performance of four different WSN
routing protocols namely the Low Energy Adaptive Clustering Hierarchy (LEACH) and Centralized LEACH (LEACT-C) as well as other two conventional protocols namely Minimum Transmission Energy (MTE) and Static Clustering. This analysis would be beneficial in making the correct choice of WSN
routing protocols for various smart grid applications. The performance of the four protocols is simulated using NS-2 network simulation on Ubuntu. The results are analyzed and compared using number of data signals received at base station, energy consumption, and network lifetime as performance metrics. The results show that the performance of various protocols in the smart grid environments have deteriorated due log normal channel characteristics and consequently network lifetime have decreased significantly.
The results also indicate that clustering based routing protocols have more advantageous over conventional protocols; MTE and static clustering. Also, centralized clustering approach is more effective as it distributes energy dissipation evenly throughout the sensor nodes which reduce energy consumption
and prolong the networks’ lifetime. This approach is more effective in delivering data to base station because it has global knowledge of the location and energy of all the nodes in the network.
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.
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.
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.
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.
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
Data gathering in wireless sensor networks using intermediate nodesIJCNCJournal
Energy consumption is an essential concern to Wireless Sensor Networks (WSNs).The major cause of the energy consumption in WSNs is due to the data aggregation. A data aggregation is a process of collecting data from sensor nodes and transmitting these data to the sink node or base station. An effective way to perform such a task is accomplished by using clustering. In clustering, nodes are grouped into clusters where a number of nodes, called cluster heads, are responsible for gathering data from other nodes, aggregate them and transmit them to the Base Station (BS).
In this paper we produce a new algorithm which focused on reducing the transmission bath between sensor nodes and cluster heads. A proper utilization and reserving of the available power resources is achieved with this technique compared to the well-known LEACH_C algorithm.
This document summarizes and compares three clustering algorithms for wireless sensor networks: LEACH, HEED, and PEGASIS. LEACH is the first protocol to use hierarchical routing to increase network lifetime. It forms clusters with local heads that collect data from members and transmit to the base station. HEED uses residual energy and network topology features to select distributed cluster heads. PEGASIS forms chains between sensors so each transmits to a close neighbor, avoiding hotspots. The document analyzes these algorithms and compares their effects on network lifetime.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
SEECH is a secure and energy efficient centralized routing protocol for hierarchical wireless sensor networks. It utilizes a base station to efficiently form clusters based on sensor node energy levels and neighbor information. The base station selects cluster heads that have above average energy and many neighbors. Cluster heads then schedule sensor node transmissions to reduce interference and aggregate and encrypt sensor data before transmitting to the base station or other cluster heads. SEECH aims to prolong network lifetime by minimizing energy consumption through efficient clustering and routing.
MULTI-HOP DISTRIBUTED ENERGY EFFICIENT HIERARCHICAL CLUSTERING SCHEME FOR HET...ijfcstjournal
Wireless sensor network (WSNs) are network of Sensor Nodes (SNs) with inherent sensing, processing and
communicating abilities. One of current concerns in wireless sensor networks is developing a stable
clustered heterogeneous protocol prolonging the network lifetime with minimum consumption of battery
power. In the recent times, many routing protocols have been proposed increasing the network lifetime,
stability in short proposing a reliable and robust routing protocol. In this paper we study the impact of
hierarchical clustered network with sensor nodes of two-level heterogeneity. The main approach in this
research is to develop an enhanced multi-hop DEEC routing protocol unlike DEEC. Simulation results
show the proposed protocol is better than DEEC in terms of FDN (First Dead Node), energy consumption
and Packet transmission.
Introducing BoxLang : A new JVM language for productivity and modularity!Ortus Solutions, Corp
Just like life, our code must adapt to the ever changing world we live in. From one day coding for the web, to the next for our tablets or APIs or for running serverless applications. Multi-runtime development is the future of coding, the future is to be dynamic. Let us introduce you to BoxLang.
Dynamic. Modular. Productive.
BoxLang redefines development with its dynamic nature, empowering developers to craft expressive and functional code effortlessly. Its modular architecture prioritizes flexibility, allowing for seamless integration into existing ecosystems.
Interoperability at its Core
With 100% interoperability with Java, BoxLang seamlessly bridges the gap between traditional and modern development paradigms, unlocking new possibilities for innovation and collaboration.
Multi-Runtime
From the tiny 2m operating system binary to running on our pure Java web server, CommandBox, Jakarta EE, AWS Lambda, Microsoft Functions, Web Assembly, Android and more. BoxLang has been designed to enhance and adapt according to it's runnable runtime.
The Fusion of Modernity and Tradition
Experience the fusion of modern features inspired by CFML, Node, Ruby, Kotlin, Java, and Clojure, combined with the familiarity of Java bytecode compilation, making BoxLang a language of choice for forward-thinking developers.
Empowering Transition with Transpiler Support
Transitioning from CFML to BoxLang is seamless with our JIT transpiler, facilitating smooth migration and preserving existing code investments.
Unlocking Creativity with IDE Tools
Unleash your creativity with powerful IDE tools tailored for BoxLang, providing an intuitive development experience and streamlining your workflow. Join us as we embark on a journey to redefine JVM development. Welcome to the era of BoxLang.
TrustArc Webinar - Your Guide for Smooth Cross-Border Data Transfers and Glob...TrustArc
Global data transfers can be tricky due to different regulations and individual protections in each country. Sharing data with vendors has become such a normal part of business operations that some may not even realize they’re conducting a cross-border data transfer!
The Global CBPR Forum launched the new Global Cross-Border Privacy Rules framework in May 2024 to ensure that privacy compliance and regulatory differences across participating jurisdictions do not block a business's ability to deliver its products and services worldwide.
To benefit consumers and businesses, Global CBPRs promote trust and accountability while moving toward a future where consumer privacy is honored and data can be transferred responsibly across borders.
This webinar will review:
- What is a data transfer and its related risks
- How to manage and mitigate your data transfer risks
- How do different data transfer mechanisms like the EU-US DPF and Global CBPR benefit your business globally
- Globally what are the cross-border data transfer regulations and guidelines
So You've Lost Quorum: Lessons From Accidental DowntimeScyllaDB
The best thing about databases is that they always work as intended, and never suffer any downtime. You'll never see a system go offline because of a database outage. In this talk, Bo Ingram -- staff engineer at Discord and author of ScyllaDB in Action --- dives into an outage with one of their ScyllaDB clusters, showing how a stressed ScyllaDB cluster looks and behaves during an incident. You'll learn about how to diagnose issues in your clusters, see how external failure modes manifest in ScyllaDB, and how you can avoid making a fault too big to tolerate.
MySQL InnoDB Storage Engine: Deep Dive - MydbopsMydbops
This presentation, titled "MySQL - InnoDB" and delivered by Mayank Prasad at the Mydbops Open Source Database Meetup 16 on June 8th, 2024, covers dynamic configuration of REDO logs and instant ADD/DROP columns in InnoDB.
This presentation dives deep into the world of InnoDB, exploring two ground-breaking features introduced in MySQL 8.0:
• Dynamic Configuration of REDO Logs: Enhance your database's performance and flexibility with on-the-fly adjustments to REDO log capacity. Unleash the power of the snake metaphor to visualize how InnoDB manages REDO log files.
• Instant ADD/DROP Columns: Say goodbye to costly table rebuilds! This presentation unveils how InnoDB now enables seamless addition and removal of columns without compromising data integrity or incurring downtime.
Key Learnings:
• Grasp the concept of REDO logs and their significance in InnoDB's transaction management.
• Discover the advantages of dynamic REDO log configuration and how to leverage it for optimal performance.
• Understand the inner workings of instant ADD/DROP columns and their impact on database operations.
• Gain valuable insights into the row versioning mechanism that empowers instant column modifications.
Lee Barnes - Path to Becoming an Effective Test Automation Engineer.pdfleebarnesutopia
So… you want to become a Test Automation Engineer (or hire and develop one)? While there’s quite a bit of information available about important technical and tool skills to master, there’s not enough discussion around the path to becoming an effective Test Automation Engineer that knows how to add VALUE. In my experience this had led to a proliferation of engineers who are proficient with tools and building frameworks but have skill and knowledge gaps, especially in software testing, that reduce the value they deliver with test automation.
In this talk, Lee will share his lessons learned from over 30 years of working with, and mentoring, hundreds of Test Automation Engineers. Whether you’re looking to get started in test automation or just want to improve your trade, this talk will give you a solid foundation and roadmap for ensuring your test automation efforts continuously add value. This talk is equally valuable for both aspiring Test Automation Engineers and those managing them! All attendees will take away a set of key foundational knowledge and a high-level learning path for leveling up test automation skills and ensuring they add value to their organizations.
CTO Insights: Steering a High-Stakes Database MigrationScyllaDB
In migrating a massive, business-critical database, the Chief Technology Officer's (CTO) perspective is crucial. This endeavor requires meticulous planning, risk assessment, and a structured approach to ensure minimal disruption and maximum data integrity during the transition. The CTO's role involves overseeing technical strategies, evaluating the impact on operations, ensuring data security, and coordinating with relevant teams to execute a seamless migration while mitigating potential risks. The focus is on maintaining continuity, optimising performance, and safeguarding the business's essential data throughout the migration process
Must Know Postgres Extension for DBA and Developer during MigrationMydbops
Mydbops Opensource Database Meetup 16
Topic: Must-Know PostgreSQL Extensions for Developers and DBAs During Migration
Speaker: Deepak Mahto, Founder of DataCloudGaze Consulting
Date & Time: 8th June | 10 AM - 1 PM IST
Venue: Bangalore International Centre, Bangalore
Abstract: Discover how PostgreSQL extensions can be your secret weapon! This talk explores how key extensions enhance database capabilities and streamline the migration process for users moving from other relational databases like Oracle.
Key Takeaways:
* Learn about crucial extensions like oracle_fdw, pgtt, and pg_audit that ease migration complexities.
* Gain valuable strategies for implementing these extensions in PostgreSQL to achieve license freedom.
* Discover how these key extensions can empower both developers and DBAs during the migration process.
* Don't miss this chance to gain practical knowledge from an industry expert and stay updated on the latest open-source database trends.
Mydbops Managed Services specializes in taking the pain out of database management while optimizing performance. Since 2015, we have been providing top-notch support and assistance for the top three open-source databases: MySQL, MongoDB, and PostgreSQL.
Our team offers a wide range of services, including assistance, support, consulting, 24/7 operations, and expertise in all relevant technologies. We help organizations improve their database's performance, scalability, efficiency, and availability.
Contact us: info@mydbops.com
Visit: https://www.mydbops.com/
Follow us on LinkedIn: https://in.linkedin.com/company/mydbops
For more details and updates, please follow up the below links.
Meetup Page : https://www.meetup.com/mydbops-databa...
Twitter: https://twitter.com/mydbopsofficial
Blogs: https://www.mydbops.com/blog/
Facebook(Meta): https://www.facebook.com/mydbops/
Radically Outperforming DynamoDB @ Digital Turbine with SADA and Google CloudScyllaDB
Digital Turbine, the Leading Mobile Growth & Monetization Platform, did the analysis and made the leap from DynamoDB to ScyllaDB Cloud on GCP. Suffice it to say, they stuck the landing. We'll introduce Joseph Shorter, VP, Platform Architecture at DT, who lead the charge for change and can speak first-hand to the performance, reliability, and cost benefits of this move. Miles Ward, CTO @ SADA will help explore what this move looks like behind the scenes, in the Scylla Cloud SaaS platform. We'll walk you through before and after, and what it took to get there (easier than you'd guess I bet!).
ScyllaDB is making a major architecture shift. We’re moving from vNode replication to tablets – fragments of tables that are distributed independently, enabling dynamic data distribution and extreme elasticity. In this keynote, ScyllaDB co-founder and CTO Avi Kivity explains the reason for this shift, provides a look at the implementation and roadmap, and shares how this shift benefits ScyllaDB users.
DynamoDB to ScyllaDB: Technical Comparison and the Path to SuccessScyllaDB
What can you expect when migrating from DynamoDB to ScyllaDB? This session provides a jumpstart based on what we’ve learned from working with your peers across hundreds of use cases. Discover how ScyllaDB’s architecture, capabilities, and performance compares to DynamoDB’s. Then, hear about your DynamoDB to ScyllaDB migration options and practical strategies for success, including our top do’s and don’ts.
Test Management as Chapter 5 of ISTQB Foundation. Topics covered are Test Organization, Test Planning and Estimation, Test Monitoring and Control, Test Execution Schedule, Test Strategy, Risk Management, Defect Management
Elasticity vs. State? Exploring Kafka Streams Cassandra State StoreScyllaDB
kafka-streams-cassandra-state-store' is a drop-in Kafka Streams State Store implementation that persists data to Apache Cassandra.
By moving the state to an external datastore the stateful streams app (from a deployment point of view) effectively becomes stateless. This greatly improves elasticity and allows for fluent CI/CD (rolling upgrades, security patching, pod eviction, ...).
It also can also help to reduce failure recovery and rebalancing downtimes, with demos showing sporty 100ms rebalancing downtimes for your stateful Kafka Streams application, no matter the size of the application’s state.
As a bonus accessing Cassandra State Stores via 'Interactive Queries' (e.g. exposing via REST API) is simple and efficient since there's no need for an RPC layer proxying and fanning out requests to all instances of your streams application.
For senior executives, successfully managing a major cyber attack relies on your ability to minimise operational downtime, revenue loss and reputational damage.
Indeed, the approach you take to recovery is the ultimate test for your Resilience, Business Continuity, Cyber Security and IT teams.
Our Cyber Recovery Wargame prepares your organisation to deliver an exceptional crisis response.
Event date: 19th June 2024, Tate Modern
The Department of Veteran Affairs (VA) invited Taylor Paschal, Knowledge & Information Management Consultant at Enterprise Knowledge, to speak at a Knowledge Management Lunch and Learn hosted on June 12, 2024. All Office of Administration staff were invited to attend and received professional development credit for participating in the voluntary event.
The objectives of the Lunch and Learn presentation were to:
- Review what KM ‘is’ and ‘isn’t’
- Understand the value of KM and the benefits of engaging
- Define and reflect on your “what’s in it for me?”
- Share actionable ways you can participate in Knowledge - - Capture & Transfer
1. Poonam Shrivastava et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.386-389
RESEARCH ARTICLE
www.ijera.com
OPEN ACCESS
Analysis of LEACH and Its Variants for Routing In Wireless
Sensor Networks
Poonam Shrivastava*, Srija Unnikrishnan**
*(Watumull Institute of Electronics Engg and Computer Technology, University of Mumbai, India)
** (Fr Conceicao Rodrigues College of Engg, University of Mumbai, India)
ABSTRACT
Wireless sensor networks (WSNs) have revolutionized many segments of our economy as well as our lives.
Various modern devices require sensory data from the real world around them. This data is provided by WSNs,
which consists of several tiny sensor nodes. Different routing protocols govern the movement of this
information. Energy efficiency is one of the main design objective for these sensor networks. Low-Energy
Adaptive Clustering Hierarchy (LEACH) is a classical cluster based routing protocol for WSNs having good
performance. In this paper we mainly focus on implementing wireless sensor network using LEACH protocol to
analyze performance of WSNs in terms of energy, throughput and lifetime using ns-2 and present a survey of
variants of LEACH , that has produced different routing protocols for WSNs and highlight their features.
Keywords - Cluster, Energy, LEACH, Lifetime, Wireless Sensor Network
I.
Introduction
WSNs with number of tiny sensor nodes;
find wide applicability in various fields, as they
enable reliable monitoring and analysis of the
environment. Within its radio communication range
each sensor node communicates wirelessly with a few
other local nodes. These sensor nodes are equipped
with small batteries with limited power capacities. If
each node transmits its sensed data directly to the
base station, then its power depletes quickly [1]. The
advancement in technology results in extremely small
and low powered devices, equipped with
programmable computing, multiple parameter sensing
and wireless communication capability [2].The sensor
nodes are small embedded computing devices that
interface with sensors or actuators and communicate
using short-range wireless transmitters. Such nodes
act autonomously as well as cooperatively to form a
logical network, in which data packets are routed
towards management nodes, called sinks or base
stations. In order to save energy, it is necessary to
schedule the state of the nodes, vary the transmission
range between the sensing nodes and use efficient
routing protocols.
On the basis of network structure, routing in
wireless sensor networks can be classified as:
i) Flat-based routing: All the nodes in this topology
have assigned the same function to perform the
sensing task.
ii) Hierarchical-based routing: In this architecture,
higher energy nodes process and send the
information, while low-energy nodes perform
sensing in the proximity of the target.
iii) Location-based routing: Routing path for the data
is decided according to the position of sensor
nodes in the field.
www.ijera.com
II.
LEACH Protocol
It is a cluster based routing protocol that
minimizes energy dissipation in sensor networks and
is proposed by W. R. Heinzelman [3]. In this
protocol, the total number of nodes are divided in
many small groups or cluster for equal distribution of
power consumption inside the network. A cluster
head (CH) is a sensor node that can be selected either
randomly or in a predefined sequential manner inside
a cluster to transmit an aggregated sensor data to the
distant base station. At every iteration, the CH shifts
to other and communicates directly to each node
inside the cluster to collect data and sends it to the
sink or router or to another CH to propagate data
towards sink. LEACH operation is divided into two
phases i.e., Setup phase and Steady-state phase.
2.1 Setup phase
In this phase clusters are formed and a CH is
chosen for each cluster. Every node produces a
random number between 0 and 1, and if this number
is less than threshold value T (n), then it becomes CH.
In every round, T(n) is set to 0, for the node which
already worked as CH before, so that this node will
not be selected again. For the nodes that have not
been selected once, the possibility of being selected is
T(n). If only one node left then T (n) =1, means this
node will be certainly selected as CH[3,4,7].
T (n) is defined as follows :
T (n) = p/ [1-p×{r mod (1/p)}] , n ε G
0,
otherwise (1)
Where,
p= percentage of number of CH in the total number of
nodes,
r = number of current round,
386 | P a g e
2. Poonam Shrivastava et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.386-389
www.ijera.com
G= set of nodes that have not been elected in the past
1/p rounds of election.
When any of the nodes is selected as CH, it
informs other nodes. Based on the received signal
strength non-CH nodes choose their CH for this
round. The CH node sets up a TDMA schedule and
transmits this schedule to all the nodes in its cluster
[3,4, 5, and 6].
network but energy consumption increases. Thus
there is a trade-off between energy efficiency and
accuracy. The drawback of this scheme is the
complexity of forming clusters in multiple levels.
Moreover, TEEN only transmits time-critical data
while sensing the environment continuously and the
nodes will never communicate if the thresholds are
not reached[2,11].
2.2 Steady-state phase
In this phase, the non-CH nodes start sensing
data and send it to their CH according to the TDMA
schedule. The CH node compresses the received data
and sends it to the base-station . Communication is
via direct-sequence spread spectrum and each cluster
uses a unique spreading code to reduce inter-cluster
interference. After certain period of time, the network
again goes into the setup phase and enters another
round of selecting cluster heads(CHs).
3.2 Adaptive Threshold sensitive Energy Efficient
sensor Network protocol (APTEEN)
It is an extension to TEEN and aims at both
capturing periodic data collections and reacting to
time critical events. CHs also perform data
aggregation in order to save energy. The nodes in
such a network gives an overall picture of the network
at periodic intervals in an energy efficient manner.
Such a network enables the user to request past,
present and future data from the network. The
performance of APTEEN lies between TEEN and
LEACH with respect to energy consumption and
lifetime of the network. The drawbacks of TEEN can
be overcome using APTEEN which uses periodic data
transmission. APTEEN transmits data, based on the
threshold values unlike LEACH which transmits data
at all times. But this energy saving increases the
response time[8,11].
2.3 Limitations of LEACH Protocol
A few of these assumptions are as follows:
i) All nodes can transmit with enough power to
reach the base station if needed.
ii) Nodes always have data to send.
iii) Nodes located close to each other have correlated
data.
iv) It is not obvious how the number of
predetermined CHs are going to be uniformly
distributed throughout the network. Therefore,
there is a possibility that the elected CHs will be
concentrated in one part of the network. Hence,
some nodes will not have any CH nearer to them.
v) It assumes a homogeneous distribution of sensor
nodes in the given area.
vi) CHs are selected randomly in LEACH, hence
nodes with less energy may be chosen, which
could lead to these nodes die too fast. Moreover,
in LEACH protocol CHs communicate with base
station in single-hop manner, it is energy
consuming and therefore it could not adapt to
large network[7].
III.
Variants of LEACH
3.1Threshold sensitive Energy Efficient sensor
Network protocol (TEEN)
It is a hierarchical protocol with the use of a
data-centric mechanism and is very much suitable for
time critical data sensing applications in terms of
energy consumption and response time. It is
responsive to sudden changes in the sensed attributes.
In the sensor network architecture closer nodes form
clusters and this process goes on the second level
until base station is reached. After the clusters are
formed, the CH broadcasts two thresholds to the
nodes. These are hard and soft thresholds for sensed
attributes. Hard threshold is the minimum possible
value. The soft threshold can be varied, depending on
the target application. A smaller value of the soft
threshold gives a more accurate picture of the
www.ijera.com
3.3 Power-Efficient Gathering in Sensor
Information Systems (PEGASIS)
It is a chain-based protocol and is an
improvement over LEACH protocol. In this protocol
each node
communicates only with its closer
neighbor . The data which moves from one node to
another node, aggregates and send to the base station.
In contrast to LEACH, only one node is used to
transmit data to the base station instead of using
multiple nodes. Hence it extends the network lifetime
by using collaborative techniques. Moreover,
bandwidth consumed in communication is reduced as
there is only local coordination between closer nodes.
PEGASIS has been shown to outperform LEACH by
about 100–200% for different network sizes and
topologies. It is due reduction in the number of
transmissions and receptions using data aggregation
as well as due to the elimination of overhead caused
by dynamic cluster formation in LEACH. However, it
results in excessive delay for distant node on the
chain [9,11].
3.4 Hybrid Energy-Efficient Distributed clustering
HEED (Hybrid Energy-Efficient Distributed
clustering)
This is a stand-alone distributed clustering
protocol that periodically selects CH by only
considering communication distance and the node
residual energy. Thus, a node with high residual
energy has a higher chance to become a CH. HEED
terminates the clustering process within a constant
number of iterations, incurs low message overhead,
387 | P a g e
3. Poonam Shrivastava et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.386-389
and achieves fairly uniform CH distribution across the
network. But, it does not guarantee the number of
selected CH. If the energy of all nodes is similarly
low, most nodes can become CH[10].HEED
outperforms LEACH in terms of prolonging network
lifetime by distributing energy consumption for a
large network[11].
3.5 Density based Cluster Head Selection
This is a subtractive clustering technique. It
overcomes the shortcomings of
basic LEACH
protocol in handling node’s non-uniform and time
variant energy distribution. In this algorithm the
sensor node with the highest probability is taken up as
the first cluster center and eliminates all nearby
sensor nodes to determine the next probable cluster
and its center location. This process continues until all
sensor nodes are covered. A CH performs data
aggregation and monitors inter as well as intra-cluster
transmission of data in the network. A multi-layer
selection criteria is considered for the selection of
CH. The first level is the Energy Filtration. It checks
the energy level of all the nodes in dominating set
(DS). The next level is based on Node Connectivity
via single hopping. The third level is based on
considering the node identity. Initially nodes are
provided a unique identity (ID), which is basically a
number. Lowest identity (LID) is simple algorithm
that selects a node with its ID lowest among the
remaining nodes in the given set . In third level LID
is considered only for the first round of CH selection.
In LEACH, the CHs are elected randomly, so the
optimal number and distribution of CHs cannot be
ensured. The nodes with low residual energy have the
same priority to be a CH as the node with high
residual energy, resulting in some node with low
residual energy may die first. Hence in this new
approach , the phenomenon of aging is used as the
load balancing parameter for selecting CH. Once, a
node from IDS becomes a CH, its probability to get
re-elected as CH reduces. Therefore proper load
distribution within clusters increases the lifespan of
the sensor network[12].
3.6 LEACH protocol using Fuzzy Logic (LEACHFL)
This protocol takes three variables battery
level, distance and node density into consideration.
As LEACH only depends on probability model, some
CHs may be very close to each other and can be
located in the edge of the WSN. These in-efficient
CHs could not maximize energy efficiency. A CH
election method using fuzzy logic has been
introduced to overcome the defects of LEACH. In this
the network lifetime can be efficiently prolonged by
using fuzzy variables : concentration , energy and
centrality. In this approach a part of energy is spent to
get the data of the three variables especially
concentration and centrality[5].
IV.
www.ijera.com
Simulation
www.ijera.com
To analyze lifetime, throughput and the
effective use of energy of a network, LEACH
algorithm is followed. It is based on two different
radio models i.e., free space model and two-ray
ground propagation model depending upon the
distance between transmitter and receiver[3,4]. When
this distance is less than threshold value i.e. d crossover,
algorithm adopts
free space model (d2 power
loss),otherwise it adopts two-ray ground propagation
model (d 4 power loss). The crossover is defined as
follows:
dcrossover = (4*π*√L*ht*hr) / λ
(2)
Transmit power is attenuated based on the distance
‘d’ between the transmitter and receiver and the
threshold value is given as:
Pr(d) = (Pt* Gt *Gr*λ2) / (4* π*d)2*L
(3)
if d< dcrossover
free space model
Pr(d) = (Pt*Gt*Gr*ht2*hr2)/d4
(4)
if d ≥ dcrossover two-ray ground propagation
where, L = 1 is system loss factor,
ht = height of transmitting antenna
hr = height of receiving antenna
λ = wavelength of carrier signal
Pt = transmitted power
Pr = received power at distance d,
Gt = gain of transmitting antenna
Gr = gain of receiving antenna
A simple model for radio energy dissipation
will be considered where the transmitter dissipates
energy to run the radio electronics and the power
amplifier, and the receiver dissipates energy to run the
radio electronics as shown in Fig.1[3].
figure1: Energy consumption model
Therefore if the transmitter sends k-bit
message to the receiver up to a distance of d, the
energy consumption of the transmitter and the
receiver can be calculated by the following equations:
ET x (k, d) = Eelec−T x (k) + Eamp−T x (k, d) (5)
ETx (k, d) = Eelec * k+ *k*d2,
d<d crossover
(6)
ETx (k, d) = Eelec* k+ *k*d4,
d≥ d crossover
(7)
ERx(k) = Eelec−Rx (k)
(8)
ERx(k) = Eelec ∗ k
(9)
where, ETx (k, d) is the energy consumed by
the transmitter to send a k-bit long packet over
distance d, Eelec−T x (k) is the energy used by the
electronics of the transmitter, and Eamp−T x (k, d) is
the energy expended by the amplifier. Whereas,
388 | P a g e
4. Poonam Shrivastava et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.386-389
ERx(k) is the energy consumed by the receiver in
receiving a k-bit long packet, which is given by the
energy used by the electronics of the receiver;
and
represent the energy consumption factor of
amplification in the two radio models[5].
V.
[3]
Simulation analysis and results
Simulation is carried out using network
simulator ns-2, considering 100 nodes within the area
of 1000x1000 sqm.
is 100pj/bit/m2,
is
4
0.013pj/bit/m and Eelec−T x is equal to Eelec−Rx
which is equal to Eelec and is 50nj/bit, loss factor is
1, transmitting and receiving antenna gain is 1and
radio frequency is 914MHz, using bidirectional
communication model.
[4]
[5]
Table.1 Simulation Results
% CH Life time(s) Throughput
(bits)
2
418
41968
3
351.6
38441
4
301.09
19431
5
524.1
53777
6
423
39411
7
270.99
23677
8
111.99
5309
Energy
Consumed(J)
429.28
393.52
464.04
326.799
393.965
344.68
394.694
Results show that the energy consumption is
comparatively lesser, lifetime and throughput is
comparatively higher when the no. of cluster heads
are 5 percentage of the sensor nodes.
VI.
REFERENCES
[2]
[7]
[8]
Conclusion and future scope
The energy of sensor nodes plays a very
important role because the lifetime of WSNs depends
upon the energy of these nodes. The Hierarchical
routing protocol LEACH is energy efficient for the
sensor network and is designed to improve the
lifetime of a network. Moreover, proper selection of
CH can be a better solution for making an efficient
WSN in terms of throughput, energy consumption
and life-time of sensor nodes. Analysis of the variants
of LEACH protocol for WSNs , describes various
modifications over the primitive LEACH protcol and
highlight their features. Future scope of this
Hierarchical-based routing protocol may be the use of
multi-hop routing taking into account the improved
way of choosing CHs by considering energy as well
as density of the sensor nodes to further prolong the
lifetime of wireless sensor network and to save
energy.
[1]
[6]
Stephanie Lindsey, Cauligi Raghavendra and
Krishna M. Sivalingam, Data Gathering
Algorithms in Sensor Networks Using Energy
Metrics, IEEE Transactions on parallel and
distributed systems, vol. 13, no. 9, sept., 2002.
Arati Manjeshwar and Dharma P. Agrawal,
TEEN: A Routing Protocol for Enhanced
www.ijera.com
[9]
[10]
[11]
[12]
www.ijera.com
Efficiency in Wireless Sensor Network: Proc.
of the 5th Parallel and distributed Processing
Symposium, San Francisco, IEEE, 2001.
Wendi
Rabiner
Heinzelman,
Anantha
Chandrakasan, and Hari Balakrishnan, EnergyEfficient Communication Protocol for Wireless
Micro sensor Networks, Published in the
Proceedings of IEEE the Hawaii International
Conference on System Sciences, January 4-7,
2000, Maui, Hawaii.
Rajesh Patel, Sunil Pariyani and Vijay Ukani,
Energy and Throughput Analysis of
Hierarchical Routing Protocol (LEACH) for
Wireless Sensor Network, International
Journal of Computer Applications (0975 –
8887) Volume 20– No.4, April 2011.
Ge Ran , Huazhong Zhang b, Shulan Gong,
Improving on LEACH Protocol of Wireless
Sensor Networks Using Fuzzy Logic, Journal
of Information & Computational Science 7: 3
(2010) 767–775.
Rudranath Mitra, Anurupa Biswas, Enhanced
Clusterhead Selection Algorithm Using
LEACH Protocol for Wireless Sensor
Networks, IJCER | May-June 2012 | Vol. 2 |
Issue No.3, 766-770.
WU Xiaoping, LIN Hongan and LI Gang, An
Improved Routing Algorithm Based On
LEACH
Protocol,
Ninth
International
Symposium on Distributed Computing and
Applications to Business, Engineering and
Science, 2010.
Arati Manjeshwar and Dharma P. Agrawal,
APTEEN: A Hybrid Protocol for Efficient
Routing and Comprehensive Information
Retrieval in Wireless Sensor Networks,Center
for Distributed and Mobile Computing: Proc.
of the 2nd int’l Workshop on Parallel and
Distributed Computing Issues in Wireless
Networks and Mobile Computing, Florida,
2002:195~202.
Stephanie
Lindsey
and
Cauligi
S.
Raghavendra,PEGASIS:
Power-Efficient
GAthering in Sensor Information Systems,
Aerospace Conference Proceedings,IEEE,Los
Angeles,2002, CA 90009-2957
O. Younis and S. Fahmy, HEED: A Hybrid,
Energy-Efficient,Distributed
Clustering
Approach for Ad Hoc Sensor Networks, IEEE
Trans. Mobile Computing, vol. 3(4), pp.
366~379, December 2004.
P.T.V.Bhuvaneswari
and
V.Vaidehi,
Enhancement techniques incorporated in
LEACH- a survey, Indian Journal of Science
and Technology Vol.2 No 5 (May 2009).
Priti Narwal, S.S. Tyagi, Density Based
Protocol For Head Selection In Wireless
Sensor Networks, International Journal of Soft
Computing and Engineering (IJSCE) ISSN:
2231-2307, Volume-1, Issue-3, July 2011
389 | P a g e