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.
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
Performance Analysis of Routing Protocols of Wireless Sensor NetworksDarpan Dekivadiya
The document summarizes different types of routing protocols that can be used in wireless sensor networks. It categorizes the protocols based on their mode of functioning, participation style of nodes, and network structure. Some key routing protocols discussed include LEACH, which is a proactive clustering protocol, SPIN that uses direct communication, and TEEN which is a reactive clustering protocol. The document also discusses challenges in routing for wireless sensor networks given the constraints of sensor nodes.
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.
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.
The document discusses routing protocols in wireless sensor networks. It outlines several key challenges for routing protocols including node deployment, network dynamics, energy conservation, fault tolerance, scalability, and hardware constraints. It then describes several common routing techniques used in wireless sensor networks, including proactive, reactive, and hybrid path establishment approaches, as well as flat, hierarchical, and location-based network structures. Finally, it discusses different protocol operations such as multipath routing, query-based routing, negotiation-based routing, and supporting quality of service metrics.
Routing protocols for wireless sensor networks face several unique challenges compared to other wireless networks. This document discusses routing challenges in wireless sensor networks and provides an overview of different routing protocol approaches, including flat routing, hierarchical routing, location-based routing, and QoS-based routing. It specifically describes two flat routing protocols: directed diffusion, which uses data negotiation and aggregation to reduce energy costs, and SPIN, which employs data description messages to avoid redundant transmissions through negotiation between sensor nodes.
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.
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.
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
Performance Analysis of Routing Protocols of Wireless Sensor NetworksDarpan Dekivadiya
The document summarizes different types of routing protocols that can be used in wireless sensor networks. It categorizes the protocols based on their mode of functioning, participation style of nodes, and network structure. Some key routing protocols discussed include LEACH, which is a proactive clustering protocol, SPIN that uses direct communication, and TEEN which is a reactive clustering protocol. The document also discusses challenges in routing for wireless sensor networks given the constraints of sensor nodes.
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.
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.
The document discusses routing protocols in wireless sensor networks. It outlines several key challenges for routing protocols including node deployment, network dynamics, energy conservation, fault tolerance, scalability, and hardware constraints. It then describes several common routing techniques used in wireless sensor networks, including proactive, reactive, and hybrid path establishment approaches, as well as flat, hierarchical, and location-based network structures. Finally, it discusses different protocol operations such as multipath routing, query-based routing, negotiation-based routing, and supporting quality of service metrics.
Routing protocols for wireless sensor networks face several unique challenges compared to other wireless networks. This document discusses routing challenges in wireless sensor networks and provides an overview of different routing protocol approaches, including flat routing, hierarchical routing, location-based routing, and QoS-based routing. It specifically describes two flat routing protocols: directed diffusion, which uses data negotiation and aggregation to reduce energy costs, and SPIN, which employs data description messages to avoid redundant transmissions through negotiation between sensor nodes.
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.
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.
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.
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.
Routing protocol on wireless sensor networkshashankcsnits
The document summarizes routing protocols for wireless sensor networks. It first defines wireless sensor networks and describes their key characteristics. It then surveys traditional routing techniques like flooding and gossiping, as well as current techniques including flat routing protocols like SPIN and directed diffusion, hierarchical routing protocols like LEACH and PEGASIS, and location-based routing protocols like GEAR. For each protocol, it provides a brief overview of how it works and compares their advantages and disadvantages. In conclusion, it states that hierarchical routing protocols generally outperform flat routing protocols, and references several papers on sensor network routing.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
A Survey on Clustering Techniques for Wireless Sensor Network IJORCS
This document summarizes clustering techniques for wireless sensor networks. It discusses how clustering helps improve energy efficiency and network lifetime by organizing nodes into clusters with cluster heads. The document surveys several clustering algorithms, including LEACH, DEEC, SEP, HEED, LCA, LCA2, Max-Min D-Cluster algorithm, and weighted clustering algorithms like WCA. It describes how these algorithms elect cluster heads and organize nodes into clusters using different metrics and probabilities based on remaining energy levels or node connectivity. The document concludes that clustering is a key technique for extending network lifetime in wireless sensor networks.
Energy efficient routing in wireless sensor networksSpandan Spandy
The document summarizes several energy efficient multicast routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and routing challenges. It then summarizes the following protocols: MAODV, TEEN, APTEEN, SPEED, MMSPEED, RPAR, and LEACH. For each protocol, it provides a brief overview of the protocol's design, objectives, components, and how it aims to improve energy efficiency in wireless sensor network routing. The document concludes that providing energy-efficient multicast routing is important for wireless sensor network applications and that the protocols presented aim to achieve lower energy requirements through approaches like clustering, adaptive thresholding, and congestion control.
The document discusses various data dissemination protocols in wireless sensor networks. It describes flooding, gossiping, rumor routing, sequential assignment routing, direct diffusion, SPIN, and geographic hash table protocols. Flooding broadcasts packets to all neighbors, causing implosion and resource blindness issues. Gossiping sends packets randomly to one neighbor to avoid implosion. Rumor routing and direct diffusion use flooding initially and then optimize routing. SPIN uses data advertisements before transmission. Geographic hash table hashes node locations to optimize routing.
This document provides an overview and critical review of routing protocols in wireless sensor networks. It begins with an introduction to wireless sensor networks and their applications. It then discusses several related works on routing protocols. The main body discusses different types of routing protocols, including location-based protocols like MECN and GEAR, hierarchical protocols like LEACH and PEGASIS, and data-centric protocols like SPIN and Directed Diffusion. It provides examples of each type and evaluates them based on factors like energy efficiency, scalability, reliability and more. Finally, it lists references for further reading on routing protocols in wireless sensor networks.
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 presents a graduate project on efficient data aggregation from polling points in wireless sensor networks. The proposed system called Mobi-Cluster aims to minimize overall network overhead and energy expenditure associated with multi-hop data retrieval while ensuring balanced energy consumption and prolonged network lifetime. This is achieved through building cluster structures consisting of member nodes that route data to assigned cluster heads, and selecting appropriate polling points to act as intermediaries between clusters and a mobile collector. The key stages of the Mobi-Cluster protocol are described as cluster head selection, polling point selection, cluster head attachment to polling points, data aggregation and forwarding to polling points, and communication between polling points and the mobile collector.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
A QoI Based Energy Efficient Clustering for Dense Wireless Sensor Networkijassn
In a wireless sensor network Quality of Information (QoI), Energy Efficiency, Redundant data avoidance,
congestion control are the important metrics that affect the performance of wireless sensor network. As
many approaches were proposed to increase the performance of a wireless sensor network among them
clustering is one of the efficient approaches in sensor network. Many clustering algorithms concentrate
mainly on power Optimization like FSCH, LEACH, and EELBCRP. There is necessity of the above
metrics in wireless sensor network where nodes are densely deployed in a given network area. As the nodes
are deployed densely there is maximum possibility of nodes appear in the sensing region of other nodes. So
there exists an option that nodes have to send the information that is already reached the base station by its
own cluster members or by members of other clusters. This mechanism will affect the QoI, Energy factor
and congestion control of the wireless sensor networks. Even though clustering uses TDMA (Time Division
Multiple Access) for avoiding congestion control for intra clustering data transmission, but it may fail in
some critical situation. This paper proposed a energy efficient clustering which avoid data redundancy in a
dense sensor network until the network becomes sparse and hence uses the TDMA efficiently during high
density of the nodes.
This project report summarizes a wireless sensor network project completed by three students. It describes the objectives and types of routing protocols used in wireless sensor networks, focusing on the LEACH hierarchical routing protocol. It then discusses some weaknesses of LEACH and proposes an improved DECSA algorithm that selects cluster heads based on both distance and remaining energy to try to overcome LEACH's energy imbalance issues and extend network lifetime.
Routing protocols in wireless sensor networks face several unique challenges compared to other wireless networks. The document discusses these challenges and provides an overview of common routing protocol approaches in WSNs, including flat routing protocols like SPIN and Directed Diffusion, hierarchical routing protocols like LEACH, and location-based routing protocols. It also covers routing design issues specific to WSNs such as energy efficiency, data delivery models, fault tolerance, and quality of service.
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.
This document discusses energy consumption in wireless sensor networks using routing protocols. It introduces a new routing protocol called MIN-RC, which aims to balance energy consumption among sensor nodes. MIN-RC is based on the LEACH-C protocol and uses adaptive round control to adjust cluster size, head location, and round time based on network conditions to minimize energy usage. The document compares MIN-RC to LEACH-C through simulations to evaluate its ability to extend network lifetime by more evenly distributing energy consumption across sensor nodes.
Wireless sensor networks have recently come into prominence because they hold the
potential to revolutionize many segments. The Wireless Sensor Network (WSN) is made up of a
collection of sensor nodes, which were small energy constrained devices. Routing technique is one of
the research area in wireless sensor network. So by designing an efficient routing protocol for
reducing energy consumption is the important factor. In this paper, a brief introduction to routing
challenges in WSN have been mentioned. This paper also provides the basic classification of routing
protocols in WSNs along with the most energy efficient protocol named LEACH along with its
advantages and disadvantages. This paper also focus on some of the improved version of LEACH
protocol.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
El documento describe cómo los teléfonos móviles pueden usarse para mejorar la recolección y análisis de datos, así como la comunicación, en el mundo en desarrollo. Explica dos ejemplos de proyectos, EpiSurveyor y MIP, que permiten a los usuarios crear encuestas y canales de mensajes SMS para compartir información de manera barata y fácil. El documento argumenta que los teléfonos móviles pueden usarse para hacer cosas que antes eran caras y difíciles, como la recolección y anális
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.
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.
Routing protocol on wireless sensor networkshashankcsnits
The document summarizes routing protocols for wireless sensor networks. It first defines wireless sensor networks and describes their key characteristics. It then surveys traditional routing techniques like flooding and gossiping, as well as current techniques including flat routing protocols like SPIN and directed diffusion, hierarchical routing protocols like LEACH and PEGASIS, and location-based routing protocols like GEAR. For each protocol, it provides a brief overview of how it works and compares their advantages and disadvantages. In conclusion, it states that hierarchical routing protocols generally outperform flat routing protocols, and references several papers on sensor network routing.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
A Survey on Clustering Techniques for Wireless Sensor Network IJORCS
This document summarizes clustering techniques for wireless sensor networks. It discusses how clustering helps improve energy efficiency and network lifetime by organizing nodes into clusters with cluster heads. The document surveys several clustering algorithms, including LEACH, DEEC, SEP, HEED, LCA, LCA2, Max-Min D-Cluster algorithm, and weighted clustering algorithms like WCA. It describes how these algorithms elect cluster heads and organize nodes into clusters using different metrics and probabilities based on remaining energy levels or node connectivity. The document concludes that clustering is a key technique for extending network lifetime in wireless sensor networks.
Energy efficient routing in wireless sensor networksSpandan Spandy
The document summarizes several energy efficient multicast routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and routing challenges. It then summarizes the following protocols: MAODV, TEEN, APTEEN, SPEED, MMSPEED, RPAR, and LEACH. For each protocol, it provides a brief overview of the protocol's design, objectives, components, and how it aims to improve energy efficiency in wireless sensor network routing. The document concludes that providing energy-efficient multicast routing is important for wireless sensor network applications and that the protocols presented aim to achieve lower energy requirements through approaches like clustering, adaptive thresholding, and congestion control.
The document discusses various data dissemination protocols in wireless sensor networks. It describes flooding, gossiping, rumor routing, sequential assignment routing, direct diffusion, SPIN, and geographic hash table protocols. Flooding broadcasts packets to all neighbors, causing implosion and resource blindness issues. Gossiping sends packets randomly to one neighbor to avoid implosion. Rumor routing and direct diffusion use flooding initially and then optimize routing. SPIN uses data advertisements before transmission. Geographic hash table hashes node locations to optimize routing.
This document provides an overview and critical review of routing protocols in wireless sensor networks. It begins with an introduction to wireless sensor networks and their applications. It then discusses several related works on routing protocols. The main body discusses different types of routing protocols, including location-based protocols like MECN and GEAR, hierarchical protocols like LEACH and PEGASIS, and data-centric protocols like SPIN and Directed Diffusion. It provides examples of each type and evaluates them based on factors like energy efficiency, scalability, reliability and more. Finally, it lists references for further reading on routing protocols in wireless sensor networks.
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 presents a graduate project on efficient data aggregation from polling points in wireless sensor networks. The proposed system called Mobi-Cluster aims to minimize overall network overhead and energy expenditure associated with multi-hop data retrieval while ensuring balanced energy consumption and prolonged network lifetime. This is achieved through building cluster structures consisting of member nodes that route data to assigned cluster heads, and selecting appropriate polling points to act as intermediaries between clusters and a mobile collector. The key stages of the Mobi-Cluster protocol are described as cluster head selection, polling point selection, cluster head attachment to polling points, data aggregation and forwarding to polling points, and communication between polling points and the mobile collector.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
A QoI Based Energy Efficient Clustering for Dense Wireless Sensor Networkijassn
In a wireless sensor network Quality of Information (QoI), Energy Efficiency, Redundant data avoidance,
congestion control are the important metrics that affect the performance of wireless sensor network. As
many approaches were proposed to increase the performance of a wireless sensor network among them
clustering is one of the efficient approaches in sensor network. Many clustering algorithms concentrate
mainly on power Optimization like FSCH, LEACH, and EELBCRP. There is necessity of the above
metrics in wireless sensor network where nodes are densely deployed in a given network area. As the nodes
are deployed densely there is maximum possibility of nodes appear in the sensing region of other nodes. So
there exists an option that nodes have to send the information that is already reached the base station by its
own cluster members or by members of other clusters. This mechanism will affect the QoI, Energy factor
and congestion control of the wireless sensor networks. Even though clustering uses TDMA (Time Division
Multiple Access) for avoiding congestion control for intra clustering data transmission, but it may fail in
some critical situation. This paper proposed a energy efficient clustering which avoid data redundancy in a
dense sensor network until the network becomes sparse and hence uses the TDMA efficiently during high
density of the nodes.
This project report summarizes a wireless sensor network project completed by three students. It describes the objectives and types of routing protocols used in wireless sensor networks, focusing on the LEACH hierarchical routing protocol. It then discusses some weaknesses of LEACH and proposes an improved DECSA algorithm that selects cluster heads based on both distance and remaining energy to try to overcome LEACH's energy imbalance issues and extend network lifetime.
Routing protocols in wireless sensor networks face several unique challenges compared to other wireless networks. The document discusses these challenges and provides an overview of common routing protocol approaches in WSNs, including flat routing protocols like SPIN and Directed Diffusion, hierarchical routing protocols like LEACH, and location-based routing protocols. It also covers routing design issues specific to WSNs such as energy efficiency, data delivery models, fault tolerance, and quality of service.
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.
This document discusses energy consumption in wireless sensor networks using routing protocols. It introduces a new routing protocol called MIN-RC, which aims to balance energy consumption among sensor nodes. MIN-RC is based on the LEACH-C protocol and uses adaptive round control to adjust cluster size, head location, and round time based on network conditions to minimize energy usage. The document compares MIN-RC to LEACH-C through simulations to evaluate its ability to extend network lifetime by more evenly distributing energy consumption across sensor nodes.
Wireless sensor networks have recently come into prominence because they hold the
potential to revolutionize many segments. The Wireless Sensor Network (WSN) is made up of a
collection of sensor nodes, which were small energy constrained devices. Routing technique is one of
the research area in wireless sensor network. So by designing an efficient routing protocol for
reducing energy consumption is the important factor. In this paper, a brief introduction to routing
challenges in WSN have been mentioned. This paper also provides the basic classification of routing
protocols in WSNs along with the most energy efficient protocol named LEACH along with its
advantages and disadvantages. This paper also focus on some of the improved version of LEACH
protocol.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
El documento describe cómo los teléfonos móviles pueden usarse para mejorar la recolección y análisis de datos, así como la comunicación, en el mundo en desarrollo. Explica dos ejemplos de proyectos, EpiSurveyor y MIP, que permiten a los usuarios crear encuestas y canales de mensajes SMS para compartir información de manera barata y fácil. El documento argumenta que los teléfonos móviles pueden usarse para hacer cosas que antes eran caras y difíciles, como la recolección y anális
10 Insightful Quotes On Designing A Better Customer ExperienceYuan Wang
In an ever-changing landscape of one digital disruption after another, companies and organisations are looking for new ways to understand their target markets and engage them better. Increasingly they invest in user experience (UX) and customer experience design (CX) capabilities by working with a specialist UX agency or developing their own UX lab. Some UX practitioners are touting leaner and faster ways of developing customer-centric products and services, via methodologies such as guerilla research, rapid prototyping and Agile UX. Others seek innovation and fulfilment by spending more time in research, being more inclusive, and designing for social goods.
Experience is more than just an interface. It is a relationship, as well as a series of touch points between your brand and your customer. Here are our top 10 highlights and takeaways from the recent UX Australia conference to help you transform your customer experience design.
For full article, continue reading at https://yump.com.au/10-ways-supercharge-customer-experience-design/
http://inarocket.com
Learn BEM fundamentals as fast as possible. What is BEM (Block, element, modifier), BEM syntax, how it works with a real example, etc.
How to Build a Dynamic Social Media PlanPost Planner
Stop guessing and wasting your time on networks and strategies that don’t work!
Join Rebekah Radice and Katie Lance to learn how to optimize your social networks, the best kept secrets for hot content, top time management tools, and much more!
Watch the replay here: bit.ly/socialmedia-plan
The document discusses how personalization and dynamic content are becoming increasingly important on websites. It notes that 52% of marketers see content personalization as critical and 75% of consumers like it when brands personalize their content. However, personalization can create issues for search engine optimization as dynamic URLs and content are more difficult for search engines to index than static pages. The document provides tips for SEOs to help address these personalization and SEO challenges, such as using static URLs when possible and submitting accurate sitemaps.
The document discusses energy efficient routing protocols for clustered wireless sensor networks. It provides an overview of wireless sensor networks and discusses how clustering is commonly used to improve energy efficiency and scalability. The document reviews several existing clustering-based routing protocols and analyzes their approaches for prolonging network lifetime by minimizing energy consumption 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.
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.
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.
Wireless sensor network consists of several distributed sensor nodes. It is used for several environmental applications, military applications and health related applications. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Most of the research in energy efficient data gathering in data centric applications of wireless sensor networks is motivated by LEACH (Low Energy Adaptive Clustering Hierarchy) scheme. It allows the rotation of cluster head role among the sensor nodes and tries to distribute the energy consumption over the network. Selection of sensor node for such role rotations greatly affects the energy efficiency of the network. Some of the routing protocol has a drawback that the cluster is not evenly distributed due to its randomized rotation of local cluster head. We have surveyed several existing methods for selecting energy efficient cluster head in wireless sensor networks. We have proposed an energy efficient cluster head selection method in which the cluster head selection and replacement cost is reduced and ultimately the network lifetime is increased. Using our proposed method, network life time is increased compared to existing methods. Keywords: WSN, CH, BS, LEACH, LEACH-B, LEACH-F
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.
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.
ENERGY OPTIMISATION SCHEMES FOR WIRELESS SENSOR NETWORKcscpconf
A sensor network is composed of a large number of sensor nodes, which are densely
deployed either inside the phenomenon or very close to it. Sensor nodes have
sensing, processing and transmitting capability . They however have limited energy
and measures need to be taken to make op- timum usage of their energy and save
them from task of only receiving and transmitting data without processing. Various
techniques for energy utilization optimisation have been proposed Ma jor players are
however clustering and relay node placement. In the research related to relay node
placement, it has been proposed to deploy some relay nodes such that the sensors
can transmit the sensed data to a nearby relay node, which in turn delivers the data
to the base stations. In general, the relay node placement problems aim to meet
certain connectivity and/or survivabil- ity requirements of the network by deploying a
minimum number of relay nodes. The other approach is grouping sensor nodes into
clusters with each cluster having a cluster head (CH). The CH nodes aggregate the
data and transmit them to the base station (BS). These two approaches has been
widely adopted by the research community to satisfy the scala- bility objective and generally achieve high energy efficiency and prolong network lifetime in large-scale WSN environments and hence are discussed here along with single hop and multi hop characteristic of sensor node
This document summarizes several energy-efficient routing protocols for wireless sensor networks. It begins by introducing the basic components and architecture of wireless sensor networks. It then categorizes routing protocols based on network structure (flat, hierarchical, location-based) and operation (multipath, query-based, etc.). The majority of the document focuses on reviewing hierarchical protocols, including LEACH, PEGASIS, Hierarchical PEGASIS, and HEED. It provides brief overviews of how these protocols work to reduce energy consumption and extend network lifetime through clustering and data aggregation approaches.
Performance Evaluation of Ant Colony Optimization Based Rendezvous Leach Usin...IJERD Editor
- The document discusses the performance evaluation of an Ant Colony Optimization (ACO) based algorithm for wireless sensor networks with mobile sinks.
- It proposes using ACO along with rendezvous points and mobile sinks in a clustering protocol called Rendezvous LEACH (RZ LEACH) to optimize energy efficiency and network lifetime.
- Simulation results show that the ACO based RZ LEACH outperforms the original RZ LEACH protocol by prolonging the number of operational nodes and increasing average remaining energy in the network over time.
This document provides a review of atypical hierarchical routing protocols for wireless sensor networks. It begins by introducing hierarchical routing and typical clustering routing in wireless sensor networks. It then describes several types of atypical hierarchical routing protocols, including chain-based, tree-based, grid-based, and area-based routing protocols. For each type, some representative protocols are described and their advantages and disadvantages are analyzed. The document concludes by comparing the performance of different chain-based hierarchical routing protocols based on factors like energy efficiency, scalability, delivery delay, and load balancing.
A Review of Atypical Hierarchical Routing Protocols for Wireless Sensor Networksiosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical issue that degrades the network performance. Recharging and providing security to the sensor devices is very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an important and suitable approach to increase energy efficiency and transmitting secured data which in turn enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC) works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all the cluster heads are formed at a time and selected on rotation based on considering the highest energy of the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access (CSMA), a contention window based protocol is used at the MAC layer for collision detection and to provide channel access prioritization to HWSN of different traffic classes with reduction in End to End delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the cluster head for transmission without depleting the energy. Simulation parameters of the proposed system such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing system.
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical
issue that degrades the network performance. Recharging and providing security to the sensor devices is
very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an
important and suitable approach to increase energy efficiency and transmitting secured data which in turn
enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC)
works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the
rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the
network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on
the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all
the cluster heads are formed at a time and selected on rotation based on considering the highest energy of
the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum
flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access
(CSMA), a contention window based protocol is used at the MAC layer for collision detection and to
provide channel access prioritization to HWSN of different traffic classes with reduction in End to End
delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the
cluster head for transmission without depleting the energy. Simulation parameters of the proposed system
such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing
system.
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
ENERGY EFFICIENT HIERARCHICAL CLUSTER HEAD ELECTION USING EXPONENTIAL DECAY F...ijwmn
This document summarizes an article that proposes an improved algorithm for selecting cluster heads in wireless sensor networks. The algorithm uses an exponential decay function to predict the average energy of sensor nodes and selects cluster heads based on both the probabilistic LEACH algorithm and predicted energy levels. The algorithm was tested in MATLAB simulations of a homogeneous sensor network and showed improvements in stability, average energy dissipation per round, and lifespan over the baseline LEACH protocol.
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor NetworksCSCJournals
A wireless sensor network (WSN) consists of large number of sensor nodes where each node operates by a finite battery for sensing, computing, and performing wireless communication tasks. Energy aware routing and MAC protocols were proposed to prolong the lifetime of WSNs. MAC protocols reduce energy consumption by putting the nodes into sleep mode for a relatively longer period of time; thereby minimizing collisions and idle listening time. On the other hand, efficient energy aware routing is achieved by finding the best path from the sensor nodes to the Base Sta-tion (BS) where energy consumption is minimal. In almost all solutions there is always a tradeoff between power consumption and delay reduction. This paper presents an improved hierarchical coordination for data gathering (HCDG) routing schema for WSNs based on multi-level chains formation with data aggregation. Also, this paper provides an analytical model for energy consumption in WSN to compare the performance of our proposed HCDG schema with the near optimal energy reduction methodology, PEGASIS. Our results demonstrate that the proposed routing schema provides relatively lower energy consumption with minimum delay for large scale WSNs.
Energy Efficient Optimized LEACH-C Protocol using PBO Algorithm For Wireless ...IRJET Journal
This document proposes an optimized LEACH-C protocol called OLEACH-C that uses a pollination-based optimization (PBO) algorithm to select cluster heads in a wireless sensor network. The goal is to improve energy efficiency and extend the lifetime of the network. It first describes existing hierarchical routing protocols like LEACH, LEACH-C, and Multi-hop LEACH. It then explains how the proposed OLEACH-C protocol would use the PBO algorithm to select cluster heads based on remaining energy and distance to the base station, aiming to minimize energy consumption during data transmission. The PBO algorithm is inspired by flower pollination processes and aims to optimize cluster head selection. The document argues this approach could
This paper considers a heterogeneous network of energy constrained sensors deployed over a region. Each
Normal sensor node in a network is systematically gathering and transmitting sensed data to the clusterhead,
and then cluster head sending data to a base station (via intermediate cluster- heads). This paper
focuses on reducing the energy consumption and hence improving lifetime of wireless sensor Networks.
Clustering sensor node is an effective topology for the energy constrained networks. So energy saving
algorithm has been developed in which clusters are formed considering a subset of high energy nodes as a
cluster-head and another subset of powerful nodes is ask to go to sleep. When Cluster heads deplete their
energy another subset of nodes becomes active and acts as a cluster head. Proposed approach is
implemented in MATLAB, Simulation results shows that it can prolong the network lifetime than LEACH
protocol, and achieves better performance than the existing clustering algorithms such as LEACH.
1. Nazia Majadi / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue4, July-August 2012, pp.1649-1652
U-LEACH: A Routing Protocol for Prolonging Lifetime of
Wireless Sensor Networks
Nazia Majadi
Department of Computer Science and Engineering,
Military Institute of Science and Technology (MIST), Dhaka, Bangladesh
ABSTRACT
A wireless sensor network is composed of Deployment in inaccessible terrains or disaster relief
a large number of sensor nodes that are densely operations. On the other hand, this also means that
deployed in a phenomenon or very close to it. The sensor network protocols and algorithms must
lifetime of sensor nodes shows a strong possess self-organizing capabilities. Another unique
dependence on battery lifetime. Clustering feature of sensor networks is the cooperative effort of
provides an effective way for prolonging the sensor nodes. Sensor nodes are fitted with an onboard
lifetime of a wireless sensor network. Therefore, processor. Instead of sending the raw data to the
Clustering techniques are used to distribute the nodes responsible for the fusion, they use their
energy consumption among nodes in each cluster processing abilities to locally carry out simple
and extend the network lifetime. LEACH (Low- computations and transmit only the required and
Energy Adaptive Clustering Hierarchy), a partially processed data. Some of the application
clustering-based protocol that utilizes randomized areas for WSNs are health, military, and home. In
rotation of Cluster-Heads (CHs) to evenly military, for example, the rapid deployment, self-
distribute the energy among the sensors in the organization, and fault tolerance characteristics of
network. But LEACH cannot select CHs sensor networks make them a very promising sensing
uniformly throughout the network. Therefore technique for military command, control,
there is the possibility that the elected CHs will be communications, computing, intelligence,
concentrated in certain area of the network. surveillance, reconnaissance, and targeting systems
Hence, some nodes will not have any CHs in their [3].
vicinity. The proposed approach U-LEACH is an Despite the innumerable applications of
approach to address this problem. It describes a WSNs, these networks have several restrictions, such
uniform distribution technique that is Uniform as limited energy supply, limited computing power,
Distribution Technique (UDT) for selecting CHs and limited bandwidth of the wireless links
and their corresponding clusters. The goal of this connecting sensor nodes. One of the main design
paper is to build such a wireless sensor network in goals of WSNs is to carry out data communication
which each sensor node remains inside the while trying to prolong the lifetime of the network and
transmission range of CHs and therefore, the prevent connectivity degradation by employing
lifetime of the network is prolonged. aggressive energy management techniques. The
design of routing protocols in WSNs is influenced by
Keywords- Base Station (BS), Cluster Head (CH) many challenging factors. These factors must be
, Energy Efficient Unequal Clustering (EEUC) overcome before efficient communication can be
Mechanism, Low-Energy Adaptive Clustering achieved in WSNs [2].
Hierarchy (LEACH), Uniform Low-Energy
In this paper, the proposed U-LEACH is
Adaptive Clustering Hierarchy (U-LEACH),
described which consists of a technique for selecting
Uniform Distribution Technique (UDT), Wireless
cluster heads and their corresponding clusters that is
Sensor Network (WSN).
Uniform Distribution Technique (UDT). The goal of
this paper is to build a wireless sensor network in
I. INTRODUCTION which CHs are uniformly selected base on the
Recent advances in wireless remaining energy of the sensor nodes, each sensor
communications and electronics have enabled the node remains inside the transmission range of CHs
development of low-cost, low-powered and therefore, the lifetime of the network is enlarged.
multifunctional sensor nodes that are small in size The rest of the paper proceeds as follows. Section II
and jointly communicate in short distances. These describes some related work on routing protocol in
tiny sensor nodes, which consist of sensing, data WSN. The proposed routing protocol U-LEACH is
processing, and communicating components, discussed in Section III. The problem domain is
leverage the idea of sensor networks [3]. A sensor described in Section IV. Finally, conclusion of this
network is consisting of a large number of sensor study is drawn in Section V.
nodes and the position of sensor nodes need not be
engineered or predetermined. This allows random
1649 | P a g e
2. Nazia Majadi / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue4, July-August 2012, pp.1649-1652
II.ROUTING PROTOCOL IN WSN way to transmit data to the base station
In general, routing in WSNs can be divided through cluster-head, failure of the CH
into flat-based routing, hierarchical-based routing, and disappear the whole cluster. When cluster
location-based routing depending on the network heads cooperate with each other to forward
structure. In flat-based routing, all nodes are typically their data to the base station, the cluster
assigned equal roles or functionality. In hierarchical- heads closer to the base station are burdened
based routing, nodes will play different roles in the with heavy relay traffic and tend to die early,
network. In location-based routing, sensor nodes’ leaving areas of the network uncovered and
positions are exploited to route data in the network causing network partition.
[2]. The objective of the Energy-Aware Routing (iii) There is no real time transmission. As the
protocol [1] is to increase the network lifetime [2]. node senses ever changing real life data,
LEACH (Low-Energy Adaptive Clustering sensed data can be changed during the
Hierarchy), a clustering-based protocol that utilizes transmission latency from nodes to base
randomized rotation of local cluster base stations station through cluster-head.
(cluster-heads) to evenly distribute the energy load
among the sensors in the network. LEACH uses
localized coordination to enable scalability and III. U-LEACH: A UNIFORM DISTRIBUTION
robustness for dynamic networks, and incorporates TECHNIQUE OF CHS SELECTION
data fusion into the routing protocol to reduce the In this paper, a routing protocol U-LEACH is
amount of information that must be transmitted to the proposed which is a uniform distribution technique of
base station [4]. CHs in LEACH Protocol in wireless sensor networks.
LEACH is a self-organizing, adaptive It wisely organizes the network through consistent
clustering protocol that uses randomization to distribution of clustering. LEACH Protocol works in
distribute the energy load evenly among the sensors in the following steps [4]:
the network. In LEACH, the nodes organize Step 1: Decide CHs and broadcast advertisement.
themselves into local clusters, with one node acting as Step 2: Nodes transmit membership.
the local base station or cluster-head. Sensors elect Step 3: Heads broadcast schedule.
themselves to be local cluster-heads at any given time
Step 4: Nodes transmit data.
with a certain probability. These cluster head nodes
broadcast their status to the other sensors in the Step 5: Heads compress data and send to base
network. Each sensor node determines to which station.
cluster it wants to belong by choosing the cluster-head Step 6: New turn begins go to Step 1.
that requires the minimum communication energy. If the coverage area of each CH can be
Once all the nodes are organized into clusters, each predefined before Step 1, then the limitation of
cluster-head creates LEACH outperforms static uniform distribution of CHs can be improved. The
clustering algorithms by requiring nodes to volunteer CHs will be efficiently allocated throughout the
to be high-energy cluster-heads and adapting the network. Initially all nodes are homogeneous. The
corresponding clusters based on the nodes that choose node, which has the maximum remaining energy,
to be cluster-heads at a given time. Once the cluster- advertises itself as the first CH. Then the first CH
head has all the data from the nodes in its cluster, the selects an area, no other node in that particular area
cluster-head node aggregates the data and then can advertise itself as CH. After that another CH is
transmits the compressed data to the base station. selected from rest of the network. In this way the
whole network is divided into some predefined areas.
Each area contains one CH and all the nodes in that
II. PROBLEM DOMAIN
area constructs a cluster, not a single node will remain
According to the existing LEACH protocol,
outside these areas. Thus the CHs are uniformly
there are some drawbacks that need to be overcome:
distributed throughout the network. The selection of
(i) No uniform distribution techniques for
coverage area for a certain CH can be determined by
predetermined CHs. It also assumes that
selecting a circle using an Energy-Efficient Unequal
nodes always have data to send, and nodes
Clustering Mechanism [4]. EEUC is a distributed
located close to each other have correlated
cluster heads competitive algorithm, where cluster
data. It is not obvious how the number of
head selection is primarily based on the residual
predetermined CHs is going to be uniformly
energy of each node.
distributed through the network. Therefore,
there is the possibility that the elected CHs
will be concentrated in one part of the
network; hence, some nodes will not have
any CHs in their vicinity.
(ii) Failure of a CH causes fail to the whole
cluster. As nodes in a cluster have the only
1650 | P a g e
3. Nazia Majadi / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue4, July-August 2012, pp.1649-1652
to say, the node’s competition radius should decrease
as its distance to the base station decreases. The range
of competition radius in the network needs to be
controlled [4]. Suppose R0comp is the maximum
competition radius which is predefined. Setting Rcomp
of Si as a function of its distance to the base station
[4]:
d d si , BS 0
si .Rcomp 1 c max
R comp ………..
d max d min
(1)
where dmax and dmin denote the maximum and
minimum distance between sensor nodes and the base
station, d(Si, BS) is the distance between Si and the
Fig. 1: An overview of U-LEACH base station, c is a constant coefficient between 0 and
1. According to the equation (1), the competition
radius varies from (1 - c) R0comp to R0comp.
Fig. 1 gives an overview of U-LEACH
protocol, where the circles of unequal size represent Each tentative cluster head maintains a set
clusters. First, several tentative cluster heads are SCH of its adjacent tentative cluster heads. Tentative
selected to compete for final cluster heads. Every head Sj is an adjacent node of Si if Sj is in Si’s
node becomes a tentative cluster head with the same competition diameter or Si is in Sj’s competition
probability T that is a predefined threshold. Other diameter [4]. Whether a tentative cluster head Si will
nodes keep sleeping until the cluster head selection become a final cluster head depends on the nodes in
stage ends. Suppose Si becomes a tentative cluster SCH. Therefore, the proposed approach to enhance the
head. Si has a competition range Rcomp, which is a performance of LEACH protocol should pursue the
function of its distance to the base station. If Si following sequences:
becomes a cluster head at the end of the competition, CHs Selection Algorithm of U-LEACH
there will not be another cluster head Sj within Si’s Initially all nodes are homogeneous and CHi = 0 for
competition diameter. Fig. 2 illustrates a topology of all nodes where i is the sensor node.
tentative cluster heads, where the circles represent Let us suppose, number of nodes is N, queue QN
different competition ranges of tentative cluster heads. contains all nodes who will perform in the election
and queue QE contains those nodes that are not going
to perform in the election, Ei=1N of node i, t indicates
time of rearrangement of CH selection. Initially all
nodes are inserted into QN,
QE = null
Step 1: The node, which has the maximum
remaining energy, advertises itself as CH.
Then the CH selects an area, no other node in that
particular area can advertise itself as CH.
After that another CH is selected from rest of the
network. In this way the whole network is divided
into some predefined areas.
Each area contains one CH and all the nodes in that
area constructs a cluster. Thus the CHs are uniformly
distributed throughout the network.
Step 2: Set CHi =1 for maximum Ei of QN - QE
Fig. 2: The competition among tentative CHs
Step 3: Push QE all nodes inside Rcomp2 where
node i is the center. Node i advertises itself as CH.
In Fig. 2, S1 and S2 can both be cluster heads,
Go to Step 3 until QN NULL.
but S3 and S4 cannot. Therefore the distribution of
cluster heads can be controlled over the network. And Step 4: Each node starts data transmission to CHs
the cluster heads closer to the base station should and CHs transmit to BS.
support smaller cluster sizes because of higher energy Step 5: After t time go to step 1.
consumption during the inter-cluster multihop
forwarding communication. Thus more clusters
should be produced closer to the base station. That is
1651 | P a g e
4. Nazia Majadi / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue4, July-August 2012, pp.1649-1652
V. CONCLUSION Communications Magazine, 40(8), 2002,
It is found that LEACH protocol fails in 102-114.
some conditions where the higher energetic nodes are [2] J. N. Al-Karaki, and A. E. Kamal, Routing
concentrated, some nodes having highly probable to techniques in wireless sensor networks: A
remain outside of any CH’s vicinity will die within survey, IEEE Wireless Communications,
short period. Therefore the rotation of cluster heads 11(6), 2004, 6-28.
and the metric of residual energy are not sufficient to Book:
balance the energy consumption across the network, [3] F. Zhao and L. J. Guibas, Wireless sensor
CHs are required to be distributed uniformly networks: An information processing
throughout the network so that a single node should approach (San Francisco, CA: Elsevier,
not be deducted by clusters. This paper has presented 2004).
a routing protocol U-LEACH in WSN that can reduce Proceeding Paper:
the problems of LEACH. As well as, a uniform [4] W. R. Heinzelman, A. Chandrakasan, and H.
distribution technique of U-LEACH for selecting CHs Balakrishnan, Energy-Efficient
can not only reduce energy consumption but also Communication Protocol for Wireless
increase nodes life time. Therefore, the network Microsensor Networks, Proc. 33rd Hawaii
lifetime is prolonged. As the future work, the International Conference on System
proposed U-LEACH protocol will be applied to Sciences, Washington DC, USA, 2000,
WSNs where sensor nodes are heterogeneous. 8020-8029.
REFERENCES
Journal Papers:
[1] I. F. Akyildiz, W. Su, Y.
Sankarasubramaniam, and E. Cayirci, A
survey on sensor networks, IEEE
1652 | P a g e