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
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.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
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.
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.
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.
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.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
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.
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.
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.
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.
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.
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
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.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
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.
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.
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.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
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.
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.
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
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.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
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.
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.
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.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the
performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to
use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use
routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of
this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering
Network environment, it is divided into two virtual layers (using distance between sensor nodes and base
station) and then regarding to sensors position in each of two layers, residual energy of sensor and
distance from base station is used in clustering. In this article, we compare proposed algorithm with wellknown LEACH and ELEACH algorithms in homogenous environment (with equal energy for all sensors)
and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base
station. Results show that our proposed algorithm delivers improved performance.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the
performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to
use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use
routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of
this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering
Network environment, it is divided into two virtual layers (using distance between sensor nodes and base
station) and then regarding to sensors position in each of two layers, residual energy of sensor and
distance from base station is used in clustering. In this article, we compare proposed algorithm with wellknown LEACH and ELEACH algorithms in homogenous environment (with equal energy for all sensors)
and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base
station. Results show that our proposed algorithm delivers improved performance.
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.
SLGC: A New Cluster Routing Algorithm in Wireless Sensor Network for Decrease...IJCSEA Journal
Decrease energy consumption and maximizing network lifetime are important parameters in designing and protocols for wireless sensor network (WSN).Clustering is one of the efficient methods in energy consumption by Cluster-Head in WSN. Besides, CH can process and aggregate data sent by cluster members, thus reducing network traffic for sending data to sink. In this paper presents a new cluster routing algorithm by dividing network into grids. In each grid computes the center-gravity and threshold of energy for selecting the node that has the best condition base on these parameters in grid for selecting Cluster-Head in current round, also SLGC selecting Cluster-Heads for next rounds thereby this CHs reduce the volume of controlling messages for next rounds and inform nodes for sending data into CH of respective round. This algorithm prolong network lifetime and decrease energy consumption by selecting CH in grid and sending data of grid to sink by this CH. Result of simulation shows that SLGC algorithm in comparison with the previous clustering algorithm has maximizing network lifetime and decrease energy consumption in network.
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.
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.
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.
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.
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.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Similar to Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed In Wireless Sensor Networks (20)
Multi Slot Uwb Antennas to Minimize the Interferences from Wlan & X-Band Appl...IOSRJECE
In this paper designs of different UWB patch antennas with two rejected bands are given. The reference antenna consists of a rectangular patch etched on FR4- epoxy substrate with 50 Ω feed line and relative permittivity 4.4.. The simulated bandwidth with return loss (RL) ≥10 dB is 3.42–11.7 GHz. The rejected bands here are the WLAN and X-bands, achieved by inserting slots in the patch and the feed. The simulation results of the antennas indicate higher gain at the pass bands while a sharp drop at the rejected bands is seen. The second (reference) antenna consists of a hexagonal patch etched on FR4- epoxy substrate with 50 Ω feed line and relative permittivity 4.4,shows better return loss and rejection of the bands. The high frequency structure simulator (HFSS) is used to design and simulate the antennas behaviour over the different frequency ranges. Measurements confirm the antenna characteristic as predicted in the simulation with a slight shift in frequencies.
High –Speed Implementation of Design and Analysis by Using Parallel Prefix Ad...IOSRJECE
The binary adder is the critical element in most digital circuit designs including the digital signal processors (DSP) and microprocessor data unit path. As such as extensive research continues to be focused on improving the power, delay, improvement of the adder. The design and analysis of the parallel prefix adders (carry select adders) is to be implemented by using Verilog. In VLSI implementations, parallel prefix adders are very high speed performance. Binary adders are one of the most essential logic elements within a digital system. Therefore, binary addition is essential that any improvement in binary addition can result in a performance boost for any computing system and hence, help improve the performance of the entire system. Parallel-prefix adders (also known as carry-tree adders) are known to have the best performance in VLSI designs. This paper investigates (the Kogge-Stone, sparse Kogge-Stone, Ladner fischer adder, Brent-Kung adder) and compares them to the simple Ripple Carry Adder (RCA) for high number of binary bits.
Vehicle security system using ARM controllerIOSRJECE
Road accidents are a human tragedy. This involves high human suffering and pecuniary costs in terms of untimely sudden death, injuries and loss of inherent income. In this paper, a system is proposed where the main objective is to detect road signs from a moving vehicle and also enables intelligent detection of an accident at any place and reports about the accident on predefined numbers of dear one .The system will use one signal transmitter in each and every symbol or message board at road side and whenever any vehicle passes from that symbol the receiver situated inside the vehicle i.e. In-Car System will receive the signals and display proper message or the symbol details on display connected in car. Road Traffic Sign Detection is a technology by which a vehicle is able to recognize the traffic signs which are on the road e.g. ”speed limit” or ”school” or ”turn ahead”. This infrastructure is expected to deliver multiple road safety and driving assistance applications
This paper presents different techniques of one bit Full adder. In every technique the main requirements are power consumption, speed and power delay product. The proposed FIN-FET technique gives the bette.r power consumption, speed and power delay product than other techniques. The proposed Fin-FET technique is compared with some of the popular adders based on the power consumption, speed and power delay product. We designed each of these techniques by using Spice simulation soft wares.
A Plasma Tweeter is an audio device which uses a pair of electrodes as a source of sound. It has a clear reproduction and Omni directional radiation pattern. A plasma tweeter has a better frequency response than a conventional speaker and does not involve any moving part (diaphragm) and thus has less reverberation and no wear and tear. Plasma tweeters invented earlier were very expensive. This paper presents a plasma audio system which is making the regular audio system more efficient because of the use of the latest plasma tweeter. Here the objective is to create a low cost and more efficient version of the most speakers invented till now with the complete audio system.
Cmos Full Adder and Multiplexer Based Encoder for Low Resolution Flash AdcIOSRJECE
The present investigation proposed a low power encoding scheme of thermometer code to binary code converter for flash analog to digital conversion by the design of different circuits. In this paper, we have proposed three encoding techniques for the conversion of analog to digital signal using Multiplexer based encoder, heterogeneous encoder and encoding technique using dynamic logic circuits providing low power of operation and we compare the results obtained from each technique based on power consumption. The multiplexer based encoder was designed with the help of multiplexers which consumes less amount of power comparing with other designs.
Performance Analysis of Low Loss Gas Filled Hollow Core Photonic Crystal Fibe...IOSRJECE
A Kagome lattice hollow core photonic crystal fiber was filled by pumping pressurized inert gases (Argon, Krypton, Xenon) through the hollow core and wave guidance properties were observed for terahertz (THz) frequency. By using finite element method (FEM), effective material loss and confinement loss have been observed for different strut width, core diameter and different inert gases. Confinement of light has achieved through the hollow core for THz frequency. Lowest EML of 7.90x10-4 cm-1 is found for 5 µm strut width and 800 µm core diameter at 1 THz frequency for Xenon gas pumped at 1000 bar pressure. Observation and findings of this paper will contribute in the ongoing research trends on THz waveguide
FPGA Based Implementation of AES Encryption and Decryption with Low Power Mul...IOSRJECE
: Encryption is important to keep the confidentiality of data. There are many of encryption algorithms to ensure the data, but should be the select the algorithm depended on the fast, strong and implementation. For that choose the advance encryption standard (AES) algorithm for encryption data because speed and easy implementation on small devices and some the feature for it. In this paper, implementation of encryption and decryption of AES algorithm is presented with a High Secured Low Power Multiplexer Look-Up-Table (MLUT) based Substitution-Box (S-Box) . The main feature in the proposed MLUT based S-Box is that, it is implemented based on 256-byte to 1-byte multiplexer with a 256-byte memory instead of the conventional implementation of employing multiplication inversion in GF(28 ) and affine transformation. Thus, the proposed S-Box is simpler in circuit implementation and lower in power dissipation.
In digital logic and computing, a counter is a device which stores the number of times a particular event or process has occurred, often in relationship to a clock signal. CMOS devices are designed for high noise immunity and low static power consumption. CMOS accomplishes current reduction by complementing every nMOSFET with a pMOSFET and connecting both gates and both drains together. A high voltage on the gates will cause the nMOSFET to conduct and the pMOSFET to not conduct, while a low voltage on the gate causes the reverse. This arrangement greatly reduces power consumption and heat generation .Finally we proposed counter using SRAM model, provides the best resolution, high output current and good output-input current linearity.
Detection of Type-B Artifacts in VEPs using Median Deviation AlgorithmIOSRJECE
The primary goal of this research work is to introduce temporal artifact detection strategy to detect non responsive channels and trials in visual evoked potentials(VEPs) by tracing out the signals with very low energy and to remove artifacts in multichannel visual evoked potentials. The non responsive channels and trials are identified by calculating the energy of the average evoked potential of each channel, and the energy of the average evoked potential of each trial. Then channel wise and trial wise median test is conducted to detect and remove non-responsive channels and trials. An artifact is defined as any signal that may lead to inaccurate classifier parameter estimation. Temporal domain artifact detection tests include: a clipping (CL) test detect amplitude clipped EPs in each channel, a standard deviation (STD) test that can detect signals with little or abnormal variations in each channel, a kurtosis (KU) test to detect unusual signals that are not identified by STD and CL tests and median deviation test to detect signals containing large number of samples with very small deviation from their normal values. An attempt has been made to apply these techniques to 14-channel visual evoked potentials (VEPs) obtained from different subjects.
Design High Performance Combinational Circuits Using Output Prediction Logic-...IOSRJECE
With the continuously increasing demand for low power & high speed VLSI circuits the brain storming among the scientists, inventors & researchers to find the techniques required to design such high performance circuits is also increasing day by day. In the answer to this search several design techniques have been found. Output prediction logic-OPL technique is one of such newly introduced techniques. OPL is a technique that can be applied to conventional CMOS logic families in order to obtain considerable speedups. Speedups of two to three times over static CMOS logic are demonstrated for a variety of combinational circuits. When applied to static CMOS the OPL retains the restoring nature of underlying logic family. In case of OPL applied to the pseudo NMOS & domino logic, the problem of excessive power dissipation is solved & speedups more than static CMOS logic is obtained
Optimum Location of EDFA based on Eye Diagram, Q-factor and Bit Error Rate Me...IOSRJECE
This work investigated the optimum location of Erbium Doped Fiber Amplifier (EDFA) in an optical system based on analysis of BER analyzer metrics by simulation approach using Optisystem software. The simulation model will be studied based on many parameters as input power (dBm), gain of Amplifier (dBm), fiber cable length (km) and attenuation coefficient (dB/km), there are two different parameters will be analyzed at five different locations of EDFA which are Q-Factor and Bit Error Rate (BER) and also Eye Diagram, which Q-factor and BER are measurement parameters used to measure the quality of received signal at receiver.
VANET based Intelligent TransportationSystem using Li-Fi technologyIOSRJECE
VANET (Vehicular Ad-hoc Network) is a wireless network in vehicle for Intelligent Transportation System (ITS).In thispaper, we propose a mechanism toprevent accidents due to sleepiness and alcohol consumption of the driver. Vehicle to Vehicle (V2V) communication is the most effective solutionwe have used in order to prevent accidents using the Li-Fi technology.
An Even Data-Distribution Protocolfor Highly Dynamic VANETIOSRJECE
Vehicular ad -hoc network (VANET) has a problem called high mobility and uneven distribution of vehicles which affect the performance of routing. The high mobility may changes arrangements of a network, and the uneven distribution of vehicles leads to node failures due to network partition; In an urban environment the high density of vehicle cause drastic wireless contentions. In this paper, we use the Even Data Distribution (EDD) protocol to make uneven distribution of data transmission in the vehicular ad-hoc network to even distribution. In which the high mobility of vehicles in urban areas causes loss of data due to uneven distribution in order to reduce the impact of uneven distribution we transform it into even distribution using EDD protocol.
Performance Investigation and Enhancement of Fiber Bragg Gratingfor Efficient...IOSRJECE
In this paper, the performance of various windowfunctions for Fiber Bragg Grating Sensor (FBGS)is investigated and evaluated in order to get optimized reflection spectrum with high reflectivity and an efficient side lobe suppression for efficient sensing measurement applications.For this purpose, a wide range of design parameters which include grating length and refractive index modulation amplitudehas been chosen to evaluate the sensor design. The performances of the different windowfunctions have been then compared in terms of reflectivity, full width half maximum bandwidth (FWHM), and sidelobe level(SLL) so as to get the most suitable design parametersto be used for sensing measurement.The simulation results presented in this paper show the effectiveness of the optimizedFBG sensor, which can be further implemented for high performance sensing applications.
Surface Plasmon Modes of Dielectric-Metal-Dielectric Waveguides and ApplicationsIOSRJECE
The dielectric-metal-dielectric plasmonic waveguide structures find applications in integrated optics and fiber polarizers and sensors. Surface plasmon waves guided by thin metal film have been intensively studied over the last two decades. However, most studies have been confined to relatively low index dielectrics. With growing interest in silicon photonics and other semiconductors dielectric of relatively higher dielectric constant we carried out a detailed study of the modes supported by a metal filmbetween dielectrics of relatively higher dielectric constant. The study clearly shows that both modes, the“antisymmetric” (푎푏 ) short range and “symmetric” (푠푏 ) long range bound modes can exist only when the contrast between the indices is low. For high contrast the symmetric mode transforms into a leaky mode.For completeness we also includethe antisymmetric leaky (푎푙 ) mode and symmetric leaky (푠푙 ) mode in our study, although they are not important for guided wave structures. We have also included “leaky modes” in the bound mode domain as solution of the boundary value problem as reported in some early studies. We have also considered some applications of the DMD waveguides with an emphasis on identifying the participating mode in each application
Performance Analysis of Optical Amplifiers (EDFA and SOA)IOSRJECE
In the optical transmission systems attenuation causes signal power to drop through an optical fiber link, so need to use amplifiers to increase signal power with low noise. Semiconductor Optical Amplifier (SOA) and Erbium-Doped Fiber Amplifier (EDFA) are two of the main types of optical amplifiers, and they were used in this simulation model to analyze their performance, with a data rate of 622 Mb/s (STM-4 level) and 170 km optical fiber length for each simulation model. This was simulated by using OptiSystem simulator, including the main parameters of the optical transmission system as input power (dBm), optical fiber cable length (km) and attenuation per length of optical fiber cable (dB/km), also there are three parameters will be considered which they are output power (dBm), Q-Factor and Bit Error Rate (BER) at receiver, and also Eye Diagram.
Optimum Location of EDFA based on Eye Diagram, Q-factor and Bit Error Rate Me...IOSRJECE
This work investigated the optimum location of Erbium Doped Fiber Amplifier (EDFA) in an optical system based on analysis of BER analyzer metrics by simulation approach using Optisystem software. The simulation model will be studied based on many parameters as input power (dBm), gain of Amplifier (dBm), fiber cable length (km) and attenuation coefficient (dB/km), there are two different parameters will be analyzed at five different locations of EDFA which are Q-Factor and Bit Error Rate (BER) and also Eye Diagram, which Q-factor and BER are measurement parameters used to measure the quality of received signal at receiver.
Study of RF-MEMS Capacitive Shunt Switch for Microwave Backhaul Applications IOSRJECE
In this research paper, we have proposed a new type of capacitive shunt RF-MEMS switch. MicroElectro-Mechanical System (MEMS) is a combination of mechanical and electromagnetics properties at micro level unit. This MEMS switch can be used for switching purpose at RF and microwave frequencies, called RFMEMS switch. The RF-MEMS switch has a potential characteristics and superior performances at radio frequency. The MEMS switch has excellent advantages such as zero power consumption, high power handling capacity, high performance, and low inter-modulation distortion. In this proposed design, a new type of capacitive shunt switch is designed and analyzed for RF applications. The switch is designed both in UP and DOWN-states. The proposed switch design consists of substrate, co-planar waveguide (CPW), dielectric material and suspended metallic bridge. The proposed MEMS switch has dimension of 508 µm × 620 µm with a height of 500 µm and implemented on GaAs as a substrate material with relative permittivity of 12.9. The geometry and results of the proposed switch is designed using Ansoft HFSS electromagnetic simulator based on finite element method (FEM). The electrostatic and electromagnetic result showed better performances such as return loss, insertion loss and isolation. The switch has also excellent isolation property of -48 dB at 26 GHz.
Broad-Spectrum Model for Sharing Analysis between IMTAdvanced Systems and FSS...IOSRJECE
An appraisal of orthogonal frequency division multiplexing (OFDM) accredited for IMT-Advanced has been well thought-out in this letter. Derivation of the power spectral density (PSD) produce new model which easily assess the interfering signal power that appears in the band of a victim system without a spectrum emission mask. Furthermore, the broad-spectrum investigative model (BIM) can assess the interference from the 4G systems into FSS systems, when transmit power is unallocated to some sub-carriers overlapping the band of the victim system. Closed form is derived to create the model.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed In Wireless Sensor Networks
1. IOSR Journal of Electronics and Communication Engineering (IOSR-JECE)
e-ISSN: 2278-2834,p- ISSN: 2278-8735.Volume 12, Issue 2, Ver. II (Mar.-Apr. 2017), PP 55-65
www.iosrjournals.org
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 55 | Page
Comparative Simulation Study Of LEACH-Like And HEED-Like
Protocols Deployed In Wireless Sensor Networks
Soumia Laroui andMohammed Omari
LDDI Laboratory, Mathemetics and Computer Science Department, University of Adrar, Adrar 01000, Algeria
Abstract: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.
Index Terms:WSNs, energy consumption, LEACH, LEACH-C, LEACH-1R, HEED.
I. Introduction
The need for information and the rapid development of microelectronics, micromechanics, and wireless
technologies allowed to producing smaller sensor components with a low price for monitoring the physical
quantities (heat, humidity, and vibrations) [1]. Recently, these components are provided with the
communications system to communicate with the other sensors, which give birth to Wireless Sensor Networks
(WSN). The Wireless Sensor Networks are different from the other wireless networks because they generally
have the following characteristics: high density, low flow, low energy capacity, and an inaccessible environment
[2]. The latter two characteristics have made energy as a major constraint since the sensor batteries are generally
not rechargeable. To extend the lifetime of a wireless sensor network while ensuring the main tasks of a sensor
node (capture, processing, and sending of data) the energy of sensor nodes must be conserved. Among these
three tasks is sending data or communication is the task which consumes much energy. That is why researches
are motivated to focus on the MAC layer (Medium Access Control) and network layer.
A wireless sensor network (WSN) in its simplest form can be defined as a network of (possibly low
size and low-complex) devices denoted as nodes that can sense the environment and communicate the
information gathered from the monitored field through wireless links [3]; the data is forwarded, possibly via
multiple hops relaying, to a sink that can use it locally, or is connected to other networks (e.g., the Internet)
through a gateway [4]. The set of challenges in sensor networks are diverse, but the power consumption is a
central design consideration whether they are powered using batteries, however, security also is a very important
and big challenge in WSNs. Energy is the biggest constraint to wireless sensor capabilities. It is assumed that
once sensor nodes are deployed in a sensor network, they cannot be easily replaced (high operating cost) or
recharged (high cost of sensors). Therefore, the battery charge taken with them to the field must be conserved to
extend the life of the individual sensor node and the entire sensor network [5]. Moreover, sensors have limited
computing power [6] and limited storage capacity. Sensor nodes generally include three types of memory:
RAM, program memory and working memory. RAM is used to store temporary data when working, usually no
more than 2kbytes; program memory for storing the operating system, applications, and security functions; and
sensor memory which is used to store information.
Sensors are also characterized by limited communication range: the time of signal transmission for
energy consumption, sensor nodes in the transmission of RF power module is generally between 10mW to 100
MW, the transmission range is also limited to 100 meters to within 1 km. For these reasons, many routing
protocols were specifically developed to cope with limitations of sensor networks.The rest of this paper is
organized as follows. Section II presents the general classification of routing protocols deployed in WSNs. In
Sections III and IV, routing protocols (LEACH-like and HEED-like) are described for comparison purposes.
The simulation results and analysis are presented in Section V. Section VI is the conclusion.
II. Routing Protocols In Wireless Sensor Networks
Routing protocols in WSNs are for settings up one or more path(s) from sensor nodes have limited
resources, routing protocols should have small overhead which may result from control message interchange
and caching [7]. So a good routing protocol must route data with low latency, consuming little energy, and
minimizing load network and be reliable.
2. Comparative simulation study of LEACH-like and HEED-like protocols deployed in wireless sensor ..
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 56 | Page
Wireless Routing protocols are classified into many categories:
2.1. Flat Routing Protocols
In this category, each node plays the same role and sensor nodes collaborate to perform the sensing task [8].
Examples of flat routing protocols include: Sensor Protocols for Information via Negotiation (SPIN), Directed
Diffusion, Rumor Routing, Gradient-Based Routing (GBR), Minimum Cost Forwarding Algorithm (MCFA),
Constrained Anisotropic Diffusion Routing (CADR) and ACtive Query forwarding InsensoRnEtworks
(ACQUIRE).
2.2. Hierarchical Routing Protocols
In these protocols, higher-energy nodes are used to process and send the information, while low-energy
nodes are used to perform the sensing in the proximity of the target [9]. The creation of clusters and assigning
special tasks to cluster heads can greatly contribute to overall system scalability, lifetime, and energy efficiency.
Hierarchical routing is an efficient way to lower energy consumption within a cluster, performing data
aggregation and fusion in order to decrease the number of transmitted messages to the sink node. Examples of
hierarchical routing protocols include: Low Energy Adaptive Clustering Hierarchy (LEACH), Threshold
sensitive Energy Efficient sensor Network (TEEN), AdaPtive Threshold sensitive Energy Efficient sensor
Network Protocol (APTEEN), Power Efficient Gathering in Sensor Information Systems (PEGASIS), Hybrid
Energy Efficient Distributed Protocol (HEED) and Stable Election Protocol (SEP).
2.3. Location-Based Routing Protocols
In this category, sensor nodes are addressed by means of their locations [8]. The distance between
neighboring nodes can be estimated on the basis of incoming signal strengths. Relative coordinates of
neighboring nodes can be obtained by exchanging such information between neighbors or by communicating
with a satellite using GPS. To save energy, some location-based schemes demand that nodes should go to sleep
if there is no activity. As examples of location-based protocols: Geographic Adaptive Fidelity (GAF),
Geographic and Energy Aware Routing (GEAR) and Greedy Other Adaptive Face Routing (GOAFR).
III. LEACH-Like Protocols
3.1. Low Energy Adaptive Clustering Hierarchy Protocol (LEACH)
Low Energy Adaptive Clustering Hierarchy (LEACH) proposed by Wendi B. Heinzelman, et al. [10] is
the first hierarchical, self-organizing, adaptive cluster-based routing protocol for wireless sensor networks which
partitions the nodes into clusters. LEACH is a hierarchical protocol in which most nodes transmits the data to
cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station. Node
first senses its target and then sends the relevant information to its cluster head. Then the cluster head aggregates
and compresses the information received from all the nodes and sends it to the base station. Nodes that have
been cluster heads cannot become cluster heads again for P rounds, where P is the desired percentage of cluster
heads. Thereafter, each node has a 1/P probability of becoming a cluster head in each round. At the end of each
round, each node that is not a cluster head selects the closest cluster head and joins that cluster. The cluster head
then creates a schedule for each node in its cluster to transmit its data. Each sensor node n generates a random
number r such that 0 < r < 1 and compares it to a pre-defined threshold T(n). If r<T(n), the sensor node becomes
cluster head in that round, otherwise it is cluster member.
After the cluster heads are selected, the cluster heads advertise to all sensor nodes in them network that
they are the new cluster heads. Then, the other nodes organize themselves into local clusters by choosing the
most appropriate cluster head (normally the closest cluster head). During the steady-state phase the cluster heads
receive sensed data from cluster members, and transfer the aggregated data to the BS [11].
3.2. Low Energy Adaptive Clustering Hierarchy Centralized Protocol (LEACH-C)
LEACH-C uses a centralized clustering algorithm and the same steady-state phase as LEACH [12].
LEACH-C protocol can produce better performance by dispersing the cluster heads throughout the network
[13]. During the set-up phase of LEACH-C, each node sends information about its current location (possibly
determined using GPS) and residual energy level to the sink. In addition to determining good clusters, the sink
needs to ensure that the energy load is evenly distributed among all the nodes. To do this, sink computes the
average node energy, and determines which nodes have energy below this average.
Once the cluster heads and associated clusters are found, the sink broadcasts a message that obtains the
cluster head ID for each node. If a cluster head ID matches its own ID, the node is a cluster head; otherwise the
node determines its TDMA slot for data transmission and goes sleep until it’s time to transmit data. The steady-
state phase of LEACH-C is identical to that of the LEACH protocol [13].
3. Comparative simulation study of LEACH-like and HEED-like protocols deployed in wireless sensor ..
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 57 | Page
3.3. LEACH One-Round Protocol (LEACH-1R)
In order to achieve the goal of enhancing the WSNs clustering, that need to perform more control of the
clustering process, i.e., detecting CHs and their members [14]. In fact, such operation is based on two phases. In
the first phase, CHs are selected upon the first round of LEACH mechanism. LEACH-1R can use any of the first
rounds since the percentage P is more or less respected. In the second phase, the clusters are preserved and a
new CH is selected only if the current one ran out of energy, (i.e., the battery level beyond certain threshold). In
this case, a new CH is selected among the cluster members only taking in consideration the strength of the last
received signal.
IV. HEED Like Protocols
The overarching goal of Hybrid Energy Efficient Distributed Clustering Protocol (HEED) is to prolong
network lifetime [15]. For this reason, cluster head selection is primarily based on the residual energy of each
node. Measuring this residual energy is not necessary since the energy consumed per bit for sensing, processing,
and communication is typically known and, hence, residual energy can be estimated.
The primary clustering parameter is used to probabilistically select an initial set of cluster heads, and
the secondary parameter to “break ties” among them. The cluster range or radius is determined by the
transmission power level used for intracluster announcements and during clustering. The cluster power level
should be set to one of the lower power levels of a node, to increase spatial reuse, and reserve higher power
levels for intercluster communication. These higher power levels should cover at least two or more cluster
diameters to guarantee that the resulting intercluster overlay will be connected.
The secondary clustering parameter, intracluster communication cost, is a function of:
1) Cluster properties, such as cluster size.
2) Whether or not variable power levels are permissible for intracluster communication.
If the power level used for intracluster communication is fixed for all nodes, then the cost can be proportional
to:
1) Node degree, if the requirement is to distribute load among cluster heads.
2) 1/ node degree, if the requirement is to create dense clusters. This means that a node joins the cluster head
with minimum degree to distribute cluster head load (possibly at the expense of increased interference and
reduced spatial reuse), or joins the one with maximum degree to create dense clusters [15].
4.1. HEED-MIN and HEED-MAX
We use the terms minimum degree cost and maximum degree cost to denote these cost types. Observe that
intercluster communication is not incorporated in the cost function since local information is insufficient in this
case.
4.2. HEED-AMRP
Now, consider the case when variable power levels are allowed for intracluster communication. Let 𝑀𝑖𝑛𝑃𝑤𝑟𝑖
denote the minimum power level required by a node𝑣𝑖, 1 ≤ 𝑖 ≤ 𝑀, to communicate with a cluster head 𝑢, where
M is the number of nodes within the cluster range. We define the average minimum reachability power (AMRP)
as the mean of the minimum power levels required by all M nodes within the cluster range to reach 𝑢, i.e.,
AMRP =
MinPwr i
M
i=1
M
(1)
If each node is allowed to select the appropriate power level to reach its cluster head, then AMRP provides a
good estimate of the communication cost.
In addition, HEED distribution of energy consumption extends the lifetime of all the nodes in the network,
which adds to the stability of the neighbor set. Nodes also automatically update their neighbor sets in multihop
networks by periodically sending and receiving heartbeat messages [15].
V. Simulation, Results and Analysis
The implementation and simulation of routing protocols is the most important phase of our study,
because it enables us to know which protocol has the best performance in terms of different metrics. In the
literature, we found many simulation environments and network simulators that are available for network
performance measurement. In our study, we selected the MATLAB environment because it very simple and has
easy ways to create GUIs (Graphical User Interface).
The radio hardware dissipation model is a simple radio model. In this model, when the distance of a
node transmitting data to other nodes or the base station is greater than the threshold, the multipath (εmp ) fading
channel model is used. When the distance between a node transmitting data to other nodes or the base station is
less than threshold the free space (εfs ) channel model is used (power loss). Thus, to transmit a L-bit message at
distance d, the radio transmission energy is given by:
𝐸 𝑇𝑋 =
𝐿 ∗ 𝐸𝑒𝑙𝑒𝑐 + 𝐿 ∗ 𝜀𝑓𝑠 ∗ 𝑑2
, 𝑑 < 𝑑0
𝐿 ∗ 𝐸𝑒𝑙𝑒𝑐 + 𝐿 ∗ 𝜀 𝑚𝑝 ∗ 𝑑4
, 𝑑 ≥ 𝑑0
(2)
4. Comparative simulation study of LEACH-like and HEED-like protocols deployed in wireless sensor ..
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 58 | Page
Eelec represents the energy consumption in the for sending or receiving one bit.
εfs ∗ d2
andεmp ∗ d4
is the amplifier energy that depends on the transmitter amplifier model.
Eda is data aggregation energy.
The energy consumption of receiving L-bit data is:
ERX (L) = L ∗ Eelec
5.1. Hardware characteristics for MATLAB environment
In our simulation, we use the same machine characteristics in all experimentations as shown in the table below.
Table 1. Hardware Characteristics
Hardware Characteristics
Processor Intel(R) Core(TM) i3-2348M CPU @ 2.30GHz, 2300 MHz
Memory (RAM) 4.00Go
Operation system Microsoft Windows7 Professional 32bits
5.2. Simulation Parameters
In general, we need to specify the simulation area and the location of the base station, which are important
parameters in any simulation. Some parameters are related to only few clustering methods like the transmission
radius for HEEDs protocols.
Table 2. Parameters of 1st Set of Simulations
Parameters Values
Number of nodes 200
Location of BS (50, 50)
Simulation area 100m×100m
Node deployment Random
Packet size 500 Bytes
Initial energy 0.1J
Eelec 50nJ/bit
Εfs 10pJ/bit/m²
Eda 5pJ/bit/sig
P 0.02, 0.05, 0.07, 0.1
Transmission radius 10, 20, 30, 40, 50
5.3. Results and Analysis
5.3.1. Variable values of P and transmission radius
Fig. 1 presents the number of rounds versus P for the three protocols LEACH, LEACH-C and LEACH-
1R. In general, when P increases the number of rounds decreases for LEACH and LEACH-C unlike LEACH-
1R. This is due to the fact that in LEACH-1R, when the number of clusters increases the members of each
cluster decreases which make the cluster-heads consumes lesser energy.
Fig. 1. Comparison of the number of rounds at different values of “P”
Fig. 2 presents the number of rounds versus the values of transmission radius for the HEEDs protocols.
It can be clearly seen that the number of rounds decreases when increasing the transmission radius. This is due
to the fact that increasing the radius results in more sensor nodes joining the same cluster, and therefore, the
distance of sensor nodes to the cluster-head increases especially at the edges. Thus increasing the transmission
radius affects the lifetime of networks.
5. Comparative simulation study of LEACH-like and HEED-like protocols deployed in wireless sensor ..
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 59 | Page
Fig. 2. Comparison of the number of rounds at different values of transmission radius
5.3.2. The first scenario: BS at the center
Next, we fixed the values of P and the transmission radius to be 0.1 and 17 m respectively. These two values
guarantee the creation of about the same number of clusters for all protocols (about 20 clusters). We also
considered varying the position of the base station to test its impact on the selected protocols.
Table 3. Parameters of 2nd Set of Simulations
Parameters Values
Number of nodes 200
Location of BS (50, 50) and (50, 175)
Simulation area 100m×100m
Node deployment Random
Packet size 500 Bytes
Initial energy 0.1J
Eelec 50nJ/bit
Efs 10pJ/bit/m²
Eda 5pJ/bit/sig
Transmission radius 17m
P 0.1
Fig. 3. Comparison of the lifetime of each protocol in the first scenario
Fig. 3 presents the number of rounds of each protocol when the p = 0.1, radius = 17m and the location
of base station is (50, 50). We observed that LEACH-1R has higher number of rounds, which is about 439
rounds, when compared to the others protocols. On the other hand, LEACH protocol has more lifetime than
LEACH-C and HEEDs protocols.
6. Comparative simulation study of LEACH-like and HEED-like protocols deployed in wireless sensor ..
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 60 | Page
Fig. 4. Comparison of No. of control packets versus No. of rounds in the first scenario
Fig. 4 presents the number of control packets versus the number of rounds for the six protocols. It is
clearly seen that the HEEDs protocols have more control packets because they suffer from a consequent
overhead, since they need several iterations to find cluster heads (tentative CH and final CH). Every iteration, a
lot of control packets are broadcast. However, LEACH-C has more control packets when compared to LEACH
and LEACH-1R because each node sends information about its current location and residual energy level to the
BS. Then, the BS chooses the best CH and broadcasts a message that obtains the cluster head ID for each node
which leads more control packets.
Fig. 5. Comparison of the data received by BS versus No. of rounds in the first scenario.
Fig. 5 presents the amount of data received by the base station versus the number of rounds for the six
protocols. The simulations show that LEACH and LEACH-C have more data delivery to BS, especially
LEACH-C which uses network topology information to form good clusters, and then deliver more data to the
sink. However, LEACH-1R and HEEDs protocols deliver almost the same amount of data because in LEACH-
1R usually use the clusters with the same members, so the same data delivery was recorded in each rounds. But
the delivery of more data to the sink does not mean that this protocol is better because sensors collect the same
physical quantities (heat, humidity, vibrations...).That is why, the LEACH-1R and HEEDs are better than
LEACH and LEACH-C protocols.
7. Comparative simulation study of LEACH-like and HEED-like protocols deployed in wireless sensor ..
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 61 | Page
Fig. 6. Comparison of the residual energy versus No. of rounds in the first scenario
Fig. 6 presents the residual energy versus number of rounds for the six protocols. All protocols showed
a gradual decrease of energy, but LEACH-1R has a regular decrease with the number of rounds until round 439
because it maintains the same members in each cluster and a new CH is selected only if the current one ran out
of energy, unlike the other protocols which make sensors regularly change the clusters. This change leads to
more control packets especially for HEEDs protocols, so more energy is consumed. When comparing LEACH
and LEACH-C, results show that LEACH-C consumes more energy than LEACH; this is due the amount of
data delivery to the BS and the large proportion of control packets (to find CHs).
Fig. 7. Comparison of the live nodes versus No. of rounds in the first scenario
Fig. 7 presents the number of nodes that remain alive over the simulation round for the six protocols.
We observed that after the first 20 rounds the number of live nodes for LEACH-1R protocols decrease because
it does not changed the CH only after it runs out of energy. Due the mechanism of selection of CHs and the
amount of data delivery, LEACH-C protocol shows an early decrease after 40 rounds compared to LEACH and
HEEDs protocols. As illustrated in Fig. 7, the last 50% of the nodes started rapidly dying for all protocols except
for LEACH-1R.
Fig. 8. The first dead node though the simulation rounds in the first scenario
0
20
40
60
LEACH LEACH-C LEACH-1R HEED MIN HEED
MAX
HEED
AMRP
NumberofRounds
Protocols
8. Comparative simulation study of LEACH-like and HEED-like protocols deployed in wireless sensor ..
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 62 | Page
Fig. 8 presents the first dead node through the simulation rounds for the six protocols. It shows that
LEACH-1R is the first protocol losing the first node because this protocol does not change the CH only after
running out of energy, so the first dead node is the cluster head itself. However, HEEDs protocols are better 3
times than LEACH-1R due the distributed clustering method especially with HEED MIN protocol. The node
chooses the cluster which has minimum members and joins it, so has no load in the cluster which conserves
more energy in the first rounds. On the other hand, LEACH is better twice than LEACH-C relative to this metric
because LEACH-C suffers more with control packets before choosing the CH.
5.3.3. The second scenario: Changing the BS location
Fig. 9. Comparison of the lifetime of each protocol in second scenario
Fig. 9 presents the number of rounds of each protocols when the p = 0.1, radius=17 m and the location
of base station is at (50, 175), i.e., far from the simulation zone’s center. Fig. 9 shows that the number of rounds
for all protocols deceases as compared to the first scenario (BS at the center). Usually, LEACH-1R has higher
number of rounds which is about 357 rounds as compared to the others protocols. However, LEACH-C and
HEED MAX maintain almost the same life time compared to LEACH, HEED MIN and HEED AMPR
protocols. This result is almost the contrary of what we found when the base station was located in the middle of
networks.
Fig. 10. Comparison of control packets of each protocol in the second scenario
Fig. 10 presents the number of control packets versus the number of rounds for the six protocols. We observed
that the results are almost the same as the first scenario.
0
100
200
300
400
LEACH LEACH-C LEACH-1R HEED MIN HEED
MAX
HEED
AMRP
NumberofRounds
Protocols
0
50000
100000
150000
200000
250000
300000
350000
400000
450000
500000
0 20 40 60 80 100 120 140 160 180 200 220 240 260 280 300 320 340 360
NumberofControlPackets
Number of Rounds
LEACH
LEACH-C
LEACH-1R
HEED MIN
HEED MAX
HEED AMRP
9. Comparative simulation study of LEACH-like and HEED-like protocols deployed in wireless sensor ..
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 63 | Page
Fig. 11. Comparison of the data received by BS versus number of rounds in the second scenario
Fig. 11 presents the amount of data received by the base station versus the number of rounds for the six
protocols. It shows that LEACH-C has more data delivery (3 times more) than LEACH because the BS is so far.
In LEACH-C protocol the BS choose the CHs which allow it to delivery more data unlike LEACH. On the other
hand, LEACH-1R and HEEDs protocols deliver almost the same amount of data.But when comparing LEACH-
C and LEACH for the two location of BS, we conclude that, these two protocols perform well when the BS is so
far, which reduces the amount of data delivery to the BS.
Fig. 12. Comparison of the residual energy No. of rounds in the second scenario
Fig. 12 presents the residual energy versus the number of rounds for the six protocols. All protocols
showed a gradual decrease of energy and the difference between protocols is very small expect LEACH-1R
because it has no change of clusters unlike the other protocols. When comparing LEACH and LEACH-C, the
former consumes more energy than the latter due the position of the base station, the selection of CHs, and the
distance between sensors and the CH. However, the HEEDs protocols have almost the same results with the first
scenario.
Fig. 13. Comparison of the live nodes versus No. of rounds in the second scenario
10. Comparative simulation study of LEACH-like and HEED-like protocols deployed in wireless sensor ..
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 64 | Page
Fig. 13 presents the number of nodes that remain alive over the simulation round for the six protocols.
We observed in LEACH protocol the nodes die rapidly with the increase of the number of rounds because the
CHs are not uniformly distributed within the cluster. Therefore, CHs can be located at the edges of the cluster,
and the location of BS is so far which need more and more energy. In contrast, LEACH-C has regular decrease
in the number of live nodes due the mechanism of selection of the CHs (Location and energy). For the HEEDs
protocols, the decrease of live nodes is between that of LEACH and LEACH-C because the CH selection is
primarily based on the residual energy of each node which is the best parameters especially when the BS is so
far. For the LEACH-1R protocol, the live nodes decrease uniformly because it has no change of clusters and CH
is changed only if it runs out of energy.
Fig. 14. The first node dies though the simulation rounds in the second scenario
Fig. 14 presents the first dead node though the simulation rounds for the six protocols. As shown in the
first scenario, LEACH-1R is the first protocol losing the first node. So, LEACH-1R protocol has no relation
with the position of BS in this metric. However, HEEDs protocols are better than others due to the distributed
clustering method. On the other hand, LEACH is better than LEACH-C because LEACH-C suffers more when
sending control packets before choosing the CH which might force the first node to exhaust more battery power.
As compared with the results of the first scenario, we show that the three protocols LEACH, LEACH-C and
LEACH-1R have the same results, but the HEEDs protocols are clearly affected by the BS position.
VI. Conclusion
Wireless sensor networks are expanding and being more and more prevalent. Currently, they are very
dynamic research area where enhancements are constantly being sought, adding to their applications are very
numerous and diverse, but the major problem in sensor networks is the conservation of the energy.
In this paper, different routing protocols have been evaluated (LEACH, LEACH-C, LEACH-1R,
HEED MIN, HEED MAX, and HEAD AMRP) in WSN. These routing protocols are compared using MATLAB
environment on Windows7. The comparison is based on the number of control packets, number of rounds, live
nodes, data delivery to the base station and the residual energy in each round. We conducted two different
scenarios with different locations of the BS.
Performance of each protocol has been analyzed and evaluated in each scenario. Our simulation results
indicate that LEACH has the best performance in the first scenario when the base station was in the middle of
the area according to the performance metrics which have been selected. In other hand, LEACH-C works well
in the second scenario on contrary with LEACH protocol, due the best selection of CHs. The rest of the
protocols (HEEDs and LEACH-1R) are almost gave us the same performance in both of scenarios. In addition,
LEACH-1R showed the best performance in terms of residual energy, live nodes, and data delivery to the BS.
Finally, for the future work may consider implementing other routing protocols in wireless sensor
networks and adding other parameters and other metrics like scalability and ratio of dropped packets.
References
[1]. Cayirci, E., 2003. Data aggregation and dilution by modulus addressing in wireless sensor networks. IEEE Communications
Letters, 7(8), pp.355-357.
[2]. Handy, M.J., Haase, M. and Timmermann, D., 2002. Low energy adaptive clustering hierarchy with deterministic cluster-head
selection. In Mobile and Wireless Communications Network, 2002. 4th International Workshop on (pp. 368-372). IEEE.
[3]. Mahizh, P. and Muthuselvi, D.V.K., 2013. A Maximum Residual Energy for WSN Using a Novel A-Star Algorithm And Neuro
Fuzzy Approach.International Journal on Current Issues of Computer Science, 1(1).
[4]. A. B. Pagi, V. R. Budyal, and M. J. Sataraddi, 2014. Fuzzy Based Energy Aware Flat Routing (FEAFR) in Wireless Sensor
Networks. International Journal of Emerging Technology and Advanced Engineering.
0
10
20
30
40
LEACH LEACH-C LEACH-1R HEED MIN HEED
MAX
HEED
AMRP
NumberofRounds
Protocols
11. Comparative simulation study of LEACH-like and HEED-like protocols deployed in wireless sensor ..
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 65 | Page
[5]. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y. and Cayirci, E., 2002. A survey on sensor networks. IEEE communications
magazine, 40(8), pp.102-114.
[6]. Joby, P.P., 2015. A Survey on Threats and Security schemes in Wireless Sensor Networks. International Journal of engineering
Research and Applications,1(5), pp.89-94.
[7]. Al-Ma'aqbeh, F., Banimelhem, O., Taqieddin, E., Awad, F. and Mowafi, M., 2012. Fuzzy logic based energy efficient adaptive
clustering protocol. In Proceedings of the 3rd International Conference on Information and Communication Systems (p. 21). ACM.
[8]. Nikolidakis, S.A. and Vergados, D.D., 2013. Energy-efficient routing protocols in wireless sensor networks: A survey. IEEE
Communications Surveys & Tutorials, 15(2), pp.551-591.
[9]. Kour, H., 2012. Hierarchical Routing Protocols In Wireless Sensor Networks.International Journal of Information Technology and
Knowledge Management,6(1), pp.47-52.
[10]. Heinzelman, W.R., Chandrakasan, A. and Balakrishnan, H., 2000. Energy-efficient communication protocol for wireless
microsensor networks. In System sciences, 2000. Proceedings of the 33rd annual Hawaii international conference on (pp. 10-pp).
IEEE.
[11]. Himanshi, S.V. and Soni, M.K., 2013. Study of Wireless Sensor Network Using LEACH Protocol. International Journal of
Innovative Technology and Exploring Engineering, ISSN, pp.2278-3075.
[12]. Heinzelman, W.B., Chandrakasan, A.P. and Balakrishnan, H., 2002. An application-specific protocol architecture for wireless
microsensor networks.IEEE Transactions on wireless communications, 1(4), pp.660-670.
[13]. Panchal, S., Raval, G. and Pradhan, S.N., 2010. Optimization of Hierarchical Routing Protocol for Wireless Sensor Networks with
Identical Clustering. In Proceedings of the 2010 International Conference on Advances in Communication, Network, and
Computing (pp. 119-123). IEEE Computer Society.
[14]. Omari, M., 2014. LEACH-1R: Enhancing The LEACH Protocol Using The First Round Clusters. International Journal of Computer
and Information Technology, 3(5), pp.1403-1408.
[15]. Younis, O. and Fahmy, S., 2004. HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor
networks. IEEE Transactions on mobile computing, 3(4), pp.366-379.
![IOSR Journal of Electronics and Communication Engineering (IOSR-JECE)
e-ISSN: 2278-2834,p- ISSN: 2278-8735.Volume 12, Issue 2, Ver. II (Mar.-Apr. 2017), PP 55-65
www.iosrjournals.org
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 55 | Page
Comparative Simulation Study Of LEACH-Like And HEED-Like
Protocols Deployed In Wireless Sensor Networks
Soumia Laroui andMohammed Omari
LDDI Laboratory, Mathemetics and Computer Science Department, University of Adrar, Adrar 01000, Algeria
Abstract: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.
Index Terms:WSNs, energy consumption, LEACH, LEACH-C, LEACH-1R, HEED.
I. Introduction
The need for information and the rapid development of microelectronics, micromechanics, and wireless
technologies allowed to producing smaller sensor components with a low price for monitoring the physical
quantities (heat, humidity, and vibrations) [1]. Recently, these components are provided with the
communications system to communicate with the other sensors, which give birth to Wireless Sensor Networks
(WSN). The Wireless Sensor Networks are different from the other wireless networks because they generally
have the following characteristics: high density, low flow, low energy capacity, and an inaccessible environment
[2]. The latter two characteristics have made energy as a major constraint since the sensor batteries are generally
not rechargeable. To extend the lifetime of a wireless sensor network while ensuring the main tasks of a sensor
node (capture, processing, and sending of data) the energy of sensor nodes must be conserved. Among these
three tasks is sending data or communication is the task which consumes much energy. That is why researches
are motivated to focus on the MAC layer (Medium Access Control) and network layer.
A wireless sensor network (WSN) in its simplest form can be defined as a network of (possibly low
size and low-complex) devices denoted as nodes that can sense the environment and communicate the
information gathered from the monitored field through wireless links [3]; the data is forwarded, possibly via
multiple hops relaying, to a sink that can use it locally, or is connected to other networks (e.g., the Internet)
through a gateway [4]. The set of challenges in sensor networks are diverse, but the power consumption is a
central design consideration whether they are powered using batteries, however, security also is a very important
and big challenge in WSNs. Energy is the biggest constraint to wireless sensor capabilities. It is assumed that
once sensor nodes are deployed in a sensor network, they cannot be easily replaced (high operating cost) or
recharged (high cost of sensors). Therefore, the battery charge taken with them to the field must be conserved to
extend the life of the individual sensor node and the entire sensor network [5]. Moreover, sensors have limited
computing power [6] and limited storage capacity. Sensor nodes generally include three types of memory:
RAM, program memory and working memory. RAM is used to store temporary data when working, usually no
more than 2kbytes; program memory for storing the operating system, applications, and security functions; and
sensor memory which is used to store information.
Sensors are also characterized by limited communication range: the time of signal transmission for
energy consumption, sensor nodes in the transmission of RF power module is generally between 10mW to 100
MW, the transmission range is also limited to 100 meters to within 1 km. For these reasons, many routing
protocols were specifically developed to cope with limitations of sensor networks.The rest of this paper is
organized as follows. Section II presents the general classification of routing protocols deployed in WSNs. In
Sections III and IV, routing protocols (LEACH-like and HEED-like) are described for comparison purposes.
The simulation results and analysis are presented in Section V. Section VI is the conclusion.
II. Routing Protocols In Wireless Sensor Networks
Routing protocols in WSNs are for settings up one or more path(s) from sensor nodes have limited
resources, routing protocols should have small overhead which may result from control message interchange
and caching [7]. So a good routing protocol must route data with low latency, consuming little energy, and
minimizing load network and be reliable.](https://image.slidesharecdn.com/i1202025565-170704053024/85/Comparative-Simulation-Study-Of-LEACH-Like-And-HEED-Like-Protocols-Deployed-In-Wireless-Sensor-Networks-1-320.jpg)
![Comparative simulation study of LEACH-like and HEED-like protocols deployed in wireless sensor ..
DOI: 10.9790/2834-1202025565 www.iosrjournals.org 56 | Page
Wireless Routing protocols are classified into many categories:
2.1. Flat Routing Protocols
In this category, each node plays the same role and sensor nodes collaborate to perform the sensing task [8].
Examples of flat routing protocols include: Sensor Protocols for Information via Negotiation (SPIN), Directed
Diffusion, Rumor Routing, Gradient-Based Routing (GBR), Minimum Cost Forwarding Algorithm (MCFA),
Constrained Anisotropic Diffusion Routing (CADR) and ACtive Query forwarding InsensoRnEtworks
(ACQUIRE).
2.2. Hierarchical Routing Protocols
In these protocols, higher-energy nodes are used to process and send the information, while low-energy
nodes are used to perform the sensing in the proximity of the target [9]. The creation of clusters and assigning
special tasks to cluster heads can greatly contribute to overall system scalability, lifetime, and energy efficiency.
Hierarchical routing is an efficient way to lower energy consumption within a cluster, performing data
aggregation and fusion in order to decrease the number of transmitted messages to the sink node. Examples of
hierarchical routing protocols include: Low Energy Adaptive Clustering Hierarchy (LEACH), Threshold
sensitive Energy Efficient sensor Network (TEEN), AdaPtive Threshold sensitive Energy Efficient sensor
Network Protocol (APTEEN), Power Efficient Gathering in Sensor Information Systems (PEGASIS), Hybrid
Energy Efficient Distributed Protocol (HEED) and Stable Election Protocol (SEP).
2.3. Location-Based Routing Protocols
In this category, sensor nodes are addressed by means of their locations [8]. The distance between
neighboring nodes can be estimated on the basis of incoming signal strengths. Relative coordinates of
neighboring nodes can be obtained by exchanging such information between neighbors or by communicating
with a satellite using GPS. To save energy, some location-based schemes demand that nodes should go to sleep
if there is no activity. As examples of location-based protocols: Geographic Adaptive Fidelity (GAF),
Geographic and Energy Aware Routing (GEAR) and Greedy Other Adaptive Face Routing (GOAFR).
III. LEACH-Like Protocols
3.1. Low Energy Adaptive Clustering Hierarchy Protocol (LEACH)
Low Energy Adaptive Clustering Hierarchy (LEACH) proposed by Wendi B. Heinzelman, et al. [10] is
the first hierarchical, self-organizing, adaptive cluster-based routing protocol for wireless sensor networks which
partitions the nodes into clusters. LEACH is a hierarchical protocol in which most nodes transmits the data to
cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station. Node
first senses its target and then sends the relevant information to its cluster head. Then the cluster head aggregates
and compresses the information received from all the nodes and sends it to the base station. Nodes that have
been cluster heads cannot become cluster heads again for P rounds, where P is the desired percentage of cluster
heads. Thereafter, each node has a 1/P probability of becoming a cluster head in each round. At the end of each
round, each node that is not a cluster head selects the closest cluster head and joins that cluster. The cluster head
then creates a schedule for each node in its cluster to transmit its data. Each sensor node n generates a random
number r such that 0 < r < 1 and compares it to a pre-defined threshold T(n). If r<T(n), the sensor node becomes
cluster head in that round, otherwise it is cluster member.
After the cluster heads are selected, the cluster heads advertise to all sensor nodes in them network that
they are the new cluster heads. Then, the other nodes organize themselves into local clusters by choosing the
most appropriate cluster head (normally the closest cluster head). During the steady-state phase the cluster heads
receive sensed data from cluster members, and transfer the aggregated data to the BS [11].
3.2. Low Energy Adaptive Clustering Hierarchy Centralized Protocol (LEACH-C)
LEACH-C uses a centralized clustering algorithm and the same steady-state phase as LEACH [12].
LEACH-C protocol can produce better performance by dispersing the cluster heads throughout the network
[13]. During the set-up phase of LEACH-C, each node sends information about its current location (possibly
determined using GPS) and residual energy level to the sink. In addition to determining good clusters, the sink
needs to ensure that the energy load is evenly distributed among all the nodes. To do this, sink computes the
average node energy, and determines which nodes have energy below this average.
Once the cluster heads and associated clusters are found, the sink broadcasts a message that obtains the
cluster head ID for each node. If a cluster head ID matches its own ID, the node is a cluster head; otherwise the
node determines its TDMA slot for data transmission and goes sleep until it’s time to transmit data. The steady-
state phase of LEACH-C is identical to that of the LEACH protocol [13].](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)