This document summarizes a new routing protocol called Energy-Efficient Protocol with Static Clustering (EEPSC) that is proposed to improve energy efficiency in wireless sensor networks compared to the LEACH protocol. EEPSC partitions the network into static clusters during an initial setup phase to eliminate the overhead of dynamic clustering. It then selects high-energy sensor nodes within each cluster to serve as cluster heads and temporary cluster heads to distribute the energy load and extend the lifetime of the network. Simulation results showed that EEPSC outperforms LEACH in terms of network lifetime and power consumption.
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...IJERD Editor
Wireless sensor network is an emerging field leading to the various applications worldwide. Small nodes being used are capable enough to sensing, computation, collection and forwarding the data to the Base Station. Battery source is one of the most prominent concerning issue in making the sensor network running for performing various assigned tasks. This battery source has all business with the routing strategies being employed. Here in this paper the routing protocol LEACH (Low-Energy Adaptive Clustering Hierarchy) is being reviewed to explore the advancements in clustering strategies. LEACH is being the first clustering protocol which selects the cluster head in each round and thereby balancing the energy consumption throughout the network. The work in the paper focus to discuss various variants of LEACH aiming to enhance the network life-time.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...IJERD Editor
Wireless sensor network is an emerging field leading to the various applications worldwide. Small nodes being used are capable enough to sensing, computation, collection and forwarding the data to the Base Station. Battery source is one of the most prominent concerning issue in making the sensor network running for performing various assigned tasks. This battery source has all business with the routing strategies being employed. Here in this paper the routing protocol LEACH (Low-Energy Adaptive Clustering Hierarchy) is being reviewed to explore the advancements in clustering strategies. LEACH is being the first clustering protocol which selects the cluster head in each round and thereby balancing the energy consumption throughout the network. The work in the paper focus to discuss various variants of LEACH aiming to enhance the network life-time.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Improved Performance of LEACH for WSN Using Precise Number of Cluster-Head an...ijsrd.com
Wireless microsensor systems will facilitate the reliable monitoring of a variety of environments for several applications like as civil and military. In this paper, we look at modified LEACH protocol. This paper presents a new approach to clustering wireless sensor networks and determining cluster heads. LEACH is a hierarchical cluster algorithm in which Cluster-Heads are randomly selected from the nodes. Here, I apply new approach for selection of Cluster-Head according to their initial and residual energy of all the nodes and according to their initial and residual energy nodes are eligible for cluster head in the next round. Results of new approach of LEACH protocol compared with Conventional routing protocol.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of 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.
Power Optimization Technique for Sensor NetworkEditor IJCATR
In this paper different power optimization techniques for wireless sensor network is proposed and compared. The
energy conservation in a wireless sensor network is of great significance and very essential. The nodes in a wireless environment are
subject to less transmission capabilities and limited battery resources. There are several issues that constrain the WSNs and challenges
posed by the environment of handling traffic and the lifetime of the battery in the nodes. The battery of node is energy limited and is
not convenient to be replaced by the restriction of circumstance. But we have to ensure that even the slightest of energy is utilized and
the overall power conserved in a wireless environment is greatly reduced. This paper aims to reduce the power conservation in a
wireless sensor network using Dijkstra‘s algorithm, with a set of optimal path and available idle nodes.
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...acijjournal
Wireless sensor networks consists of thousands of tiny, low cost, low power and multifunctional sensor nodes where each sensor node has very low battery life. Purpose is to conserve the transmitted energy
from various sensor nodes. Various energy efficient algorithms have been designed for this. LEACH uses
distributed cluster formation & randomized rotation of the cluster head to minimize the network energy
consumption. Our paper is proposing an algorithm which is the enhancement of existing IB-LEACH. It reduces the energy consumption by using energy bank. This energy bank stores the energy after each round in both routing and clustering phase which overall increases the life time of the network. In this
approach, ACTIVE_ROUTE_TIMEOUT is also enhanced by shamming the static parameters of HELLO_INTERVAL, RREQ_RETRIES and NET_DIAMETER. Results are compared through MATLAB and provide better approach than previous ones.
Energy Efficient Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
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.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s
lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period
K-means clustering-based WSN protocol for energy efficiency improvement IJECEIAES
Since it is very difficult to replace or recharge the batteries of the sensor nodes in the wireless sensor network (WSN), efficient use of the batteries of the sensor nodes is a very important issue. This has a deep relationship with the lifetime of the network. If the node's energy is exhausted, the node is no longer available. If a certain number of nodes (50% or 80%) in a network consume energy completely, the whole network will not work. Therefore, various protocols have been proposed to maintain the network for a long time by minimizing energy consumption. In recent years, a protocol using a K-means clustering algorithm, one of machine learning techniques, has been proposed. A KCED protocol is proposed in consideration of residual energy of a node, a cluster center, and a distance to a base station in order to improve a problem of a protocol using K-average gung zipper algorithm such as cluster center consideration.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
ENERGY CONSUMPTION IMPROVEMENT OF TRADITIONAL CLUSTERING METHOD IN WIRELESS S...IJCNCJournal
In the traditional clustering routing protocol of wireless sensor network, LEACH protocol (Low Energy
Adaptive Clustering Hierarchy) is considered to have many outstanding advantages in the implementation
of the hierarchy according to low energy adaptive cluster to collect and distribute the data to the base
station. The main objective of LEACH is: To prolong life time of the network, reduce the energy
consumption by each node, using the data concentration to reduce bulletins in the network. However, in the
case of large network, the distance from the nodes to the base station is very different. Therefore, the
energy consumption when becoming the host node is very different but LEACH is not based on the
remaining energy to choose the host node, which is based on the number of times to become the host node
in the previous rounds. This makes the nodes far away from the base station lose power sooner.
In this paper, we give a new routing protocol based on the LEACH protocol in order to improve operating
time of sensor network by considering energy issues and distance in selecting the cluster-head (CH), at that
time the nodes with high energy and near the base station (BS) will have a greater probability of becoming
the cluster-head than the those in far and with lower energy.
Survey on sensor protocol for information via negotiation (spin) protocoleSAT Journals
Abstract Wireless sensor network is a collection of sensor nodes which sense application specific data and send it to sink to perform some task. One of the major issues due to energy constraint in wireless sensor network is data transmission. Many routing protocols till day have been proposed to route data efficiently in order to increase network lifetime. Sensor Protocol for Information via Negotiation (SPIN) is one of the most popular data centric dissemination protocols. It efficiently disseminates data among other nodes in the network. This protocol uses meta-data for negotiation and eliminates the transmission of the outmoded data throughout the network. This paper survey issues in SPIN protocol and explain about possible enhancement of SPIN protocol. Keywords: Wireless Sensor Network, Sensor Protocol via Information Negotiation, Advertisement Message, Request Message
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
in the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Energy Efficient 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.
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
In wireless sensor networks, sensor nodes play the most prominent role. These sensor nodes are mainly un-chargeable, so it
raises an issue regarding lifetime of the network. Mainly sensor nodes collect data and transmit it to the Base Station. So, most of the
energy is consumed in the communication process between sensor nodes and the Base Station. In this paper, we present an
improvement on LEACH protocol to enhance the network lifetime. Our goal is to reduce the transmissions between cluster heads and
the sink node. We will choose optimum number of Master Cluster Heads from variation cluster heads present in the network. The
simulation results show that our proposed algorithm enhances the network lifetime as compare to the LEACH protocol.
Improved Performance of LEACH for WSN Using Precise Number of Cluster-Head an...ijsrd.com
Wireless microsensor systems will facilitate the reliable monitoring of a variety of environments for several applications like as civil and military. In this paper, we look at modified LEACH protocol. This paper presents a new approach to clustering wireless sensor networks and determining cluster heads. LEACH is a hierarchical cluster algorithm in which Cluster-Heads are randomly selected from the nodes. Here, I apply new approach for selection of Cluster-Head according to their initial and residual energy of all the nodes and according to their initial and residual energy nodes are eligible for cluster head in the next round. Results of new approach of LEACH protocol compared with Conventional routing protocol.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of 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.
Power Optimization Technique for Sensor NetworkEditor IJCATR
In this paper different power optimization techniques for wireless sensor network is proposed and compared. The
energy conservation in a wireless sensor network is of great significance and very essential. The nodes in a wireless environment are
subject to less transmission capabilities and limited battery resources. There are several issues that constrain the WSNs and challenges
posed by the environment of handling traffic and the lifetime of the battery in the nodes. The battery of node is energy limited and is
not convenient to be replaced by the restriction of circumstance. But we have to ensure that even the slightest of energy is utilized and
the overall power conserved in a wireless environment is greatly reduced. This paper aims to reduce the power conservation in a
wireless sensor network using Dijkstra‘s algorithm, with a set of optimal path and available idle nodes.
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...acijjournal
Wireless sensor networks consists of thousands of tiny, low cost, low power and multifunctional sensor nodes where each sensor node has very low battery life. Purpose is to conserve the transmitted energy
from various sensor nodes. Various energy efficient algorithms have been designed for this. LEACH uses
distributed cluster formation & randomized rotation of the cluster head to minimize the network energy
consumption. Our paper is proposing an algorithm which is the enhancement of existing IB-LEACH. It reduces the energy consumption by using energy bank. This energy bank stores the energy after each round in both routing and clustering phase which overall increases the life time of the network. In this
approach, ACTIVE_ROUTE_TIMEOUT is also enhanced by shamming the static parameters of HELLO_INTERVAL, RREQ_RETRIES and NET_DIAMETER. Results are compared through MATLAB and provide better approach than previous ones.
Energy Efficient Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
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.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s
lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period
K-means clustering-based WSN protocol for energy efficiency improvement IJECEIAES
Since it is very difficult to replace or recharge the batteries of the sensor nodes in the wireless sensor network (WSN), efficient use of the batteries of the sensor nodes is a very important issue. This has a deep relationship with the lifetime of the network. If the node's energy is exhausted, the node is no longer available. If a certain number of nodes (50% or 80%) in a network consume energy completely, the whole network will not work. Therefore, various protocols have been proposed to maintain the network for a long time by minimizing energy consumption. In recent years, a protocol using a K-means clustering algorithm, one of machine learning techniques, has been proposed. A KCED protocol is proposed in consideration of residual energy of a node, a cluster center, and a distance to a base station in order to improve a problem of a protocol using K-average gung zipper algorithm such as cluster center consideration.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
ENERGY CONSUMPTION IMPROVEMENT OF TRADITIONAL CLUSTERING METHOD IN WIRELESS S...IJCNCJournal
In the traditional clustering routing protocol of wireless sensor network, LEACH protocol (Low Energy
Adaptive Clustering Hierarchy) is considered to have many outstanding advantages in the implementation
of the hierarchy according to low energy adaptive cluster to collect and distribute the data to the base
station. The main objective of LEACH is: To prolong life time of the network, reduce the energy
consumption by each node, using the data concentration to reduce bulletins in the network. However, in the
case of large network, the distance from the nodes to the base station is very different. Therefore, the
energy consumption when becoming the host node is very different but LEACH is not based on the
remaining energy to choose the host node, which is based on the number of times to become the host node
in the previous rounds. This makes the nodes far away from the base station lose power sooner.
In this paper, we give a new routing protocol based on the LEACH protocol in order to improve operating
time of sensor network by considering energy issues and distance in selecting the cluster-head (CH), at that
time the nodes with high energy and near the base station (BS) will have a greater probability of becoming
the cluster-head than the those in far and with lower energy.
Survey on sensor protocol for information via negotiation (spin) protocoleSAT Journals
Abstract Wireless sensor network is a collection of sensor nodes which sense application specific data and send it to sink to perform some task. One of the major issues due to energy constraint in wireless sensor network is data transmission. Many routing protocols till day have been proposed to route data efficiently in order to increase network lifetime. Sensor Protocol for Information via Negotiation (SPIN) is one of the most popular data centric dissemination protocols. It efficiently disseminates data among other nodes in the network. This protocol uses meta-data for negotiation and eliminates the transmission of the outmoded data throughout the network. This paper survey issues in SPIN protocol and explain about possible enhancement of SPIN protocol. Keywords: Wireless Sensor Network, Sensor Protocol via Information Negotiation, Advertisement Message, Request Message
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
in the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Energy Efficient 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.
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
In wireless sensor networks, sensor nodes play the most prominent role. These sensor nodes are mainly un-chargeable, so it
raises an issue regarding lifetime of the network. Mainly sensor nodes collect data and transmit it to the Base Station. So, most of the
energy is consumed in the communication process between sensor nodes and the Base Station. In this paper, we present an
improvement on LEACH protocol to enhance the network lifetime. Our goal is to reduce the transmissions between cluster heads and
the sink node. We will choose optimum number of Master Cluster Heads from variation cluster heads present in the network. The
simulation results show that our proposed algorithm enhances the network lifetime as compare to the LEACH protocol.
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.
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.
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.
Analysis of Packet Loss Rate in Wireless Sensor Network using LEACH ProtocolIJTET Journal
Abstract: Wireless sensor network (WSN) is used to collect and send various kinds of messages to a base station (BS). Wireless sensor nodes are deployed randomly and densely in a target region, especially where the physical environment is very harsh that the macro-sensor counterparts cannot be deployed. Low Energy Adaptive Clustering Hierarchical (LEACH) Routing protocol builds a process where it reduces the Packet Loss Rate from 100 % to 55% .Simulations are carried out using NS2 simulator.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Uniform Distribution Technique of Cluster Heads in LEACH Protocolidescitation
A sensor network is composed of a large number of
sensor nodes that are densely deployed either inside the
phenomenon or very close to it. Clustering provides an effective
way for prolonging the lifetime of a wireless sensor network.
Current clustering algorithms usually utilize two techniques,
selecting cluster heads (CHs) with more residual energy and
rotating cluster heads periodically, to distribute the energy
consumption among nodes in each cluster and extend the
network lifetime. LEACH (Low-Energy Adaptive Clustering
Hierarchy), a clustering-based protocol that utilizes
randomized rotation of local cluster base stations (cluster-
heads) to evenly distribute the energy load among the sensors
in the network. But LEACH cannot select the cluster-heads
uniformly throughout the network. Hence, some nodes in the
network have to transmit their data very far to reach the CHs,
causing the energy in the system to be large. Here we have an
approach to address this problem for selecting CHs and their
corresponding clusters. The goal of this paper is to build such
a wireless sensor network in which each sensor node remains
inside the transmission range of CHs and its lifetime is
enlarged.
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
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.
Wireless sensor network consists of several distributed sensor nodes. It is used for several environmental applications, military applications and health related applications. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Most of the research in energy efficient data gathering in data centric applications of wireless sensor networks is motivated by LEACH (Low Energy Adaptive Clustering Hierarchy) scheme. It allows the rotation of cluster head role among the sensor nodes and tries to distribute the energy consumption over the network. Selection of sensor node for such role rotations greatly affects the energy efficiency of the network. Some of the routing protocol has a drawback that the cluster is not evenly distributed due to its randomized rotation of local cluster head. We have surveyed several existing methods for selecting energy efficient cluster head in wireless sensor networks. We have proposed an energy efficient cluster head selection method in which the cluster head selection and replacement cost is reduced and ultimately the network lifetime is increased. Using our proposed method, network life time is increased compared to existing methods. Keywords: WSN, CH, BS, LEACH, LEACH-B, LEACH-F
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
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.
IMPROVEMENT OF LEACH AND ITS VARIANTS IN WIRELESS SENSOR NETWORKIAEME Publication
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical to operate the sensor network for a long period of time. A data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. If each node transmits its sensed data directly to the base station then it will deplete its power quickly. Since wireless communications consume significant amounts of battery power, sensor nodes should spend as little energy as possible receiving and transmitting data.
Similar to Energy efficient protocol with static clustering (eepsc) comparing with low energy adaptive clustering hierarchy (leach) protocol (20)
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™UiPathCommunity
In questo evento online gratuito, organizzato dalla Community Italiana di UiPath, potrai esplorare le nuove funzionalità di Autopilot, il tool che integra l'Intelligenza Artificiale nei processi di sviluppo e utilizzo delle Automazioni.
📕 Vedremo insieme alcuni esempi dell'utilizzo di Autopilot in diversi tool della Suite UiPath:
Autopilot per Studio Web
Autopilot per Studio
Autopilot per Apps
Clipboard AI
GenAI applicata alla Document Understanding
👨🏫👨💻 Speakers:
Stefano Negro, UiPath MVPx3, RPA Tech Lead @ BSP Consultant
Flavio Martinelli, UiPath MVP 2023, Technical Account Manager @UiPath
Andrei Tasca, RPA Solutions Team Lead @NTT Data
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdfPeter Spielvogel
Building better applications for business users with SAP Fiori.
• What is SAP Fiori and why it matters to you
• How a better user experience drives measurable business benefits
• How to get started with SAP Fiori today
• How SAP Fiori elements accelerates application development
• How SAP Build Code includes SAP Fiori tools and other generative artificial intelligence capabilities
• How SAP Fiori paves the way for using AI in SAP apps
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
The Metaverse and AI: how can decision-makers harness the Metaverse for their...Jen Stirrup
The Metaverse is popularized in science fiction, and now it is becoming closer to being a part of our daily lives through the use of social media and shopping companies. How can businesses survive in a world where Artificial Intelligence is becoming the present as well as the future of technology, and how does the Metaverse fit into business strategy when futurist ideas are developing into reality at accelerated rates? How do we do this when our data isn't up to scratch? How can we move towards success with our data so we are set up for the Metaverse when it arrives?
How can you help your company evolve, adapt, and succeed using Artificial Intelligence and the Metaverse to stay ahead of the competition? What are the potential issues, complications, and benefits that these technologies could bring to us and our organizations? In this session, Jen Stirrup will explain how to start thinking about these technologies as an organisation.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Energy efficient protocol with static clustering (eepsc) comparing with low energy adaptive clustering hierarchy (leach) protocol
1. Network and Complex Systems
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol.3, No.7, 2013
www.iiste.org
Energy Efficient Protocol with Static Clustering (EEPSC)
Comparing with Low Energy Adaptive Clustering Hierarchy
(LEACH) Protocol
1*.Vinidha roc-Research scholar-Sathyabama university
Vinidha.eee@gmail.com- (corresponding author)
2.Dr.Ajay D.Vimalraj-Guide-Pondicherry engineering college
3.C.Maria Antoine Pushparaj-Research scholar-SRM university
Abstract
A wireless sensor network with a large number of tiny sensor nodes can be used as an effective tool for gathering
data in various situations. One of the major issues in wireless sensor networks is developing an energy-efficient
routing protocol which has a significant impact on the overall lifetime of the sensor network. In this paper, we
propose a novel hierarchical with static clustering routing protocol called Energy-Efficient Protocol with Static
Clustering (EEPSC). EEPSC, partitions the network into static clusters, eliminates the overhead of dynamic
clustering and utilizes temporary-cluster-heads to distribute the energy load among high power sensor nodes;
thus extends network lifetime. We have conducted simulation-based evaluations to compare the performance of
EEPSC against Low-Energy Adaptive Clustering Hierarchy (LEACH). Our experiment results show that EEPSC
outperforms LEACH in terms of network lifetime and power consumption minimization.
Keywords: Clustering methods, energy efficiency, routing protocol, wireless sensor networks
I. INTRODUCTION:Wireless sensor network is a collection of sensor nodes interconnected by wireless communication channels.
Each sensor node is a small device that can collect data from its surrounding area, carry out simple
computations, and communicate with other sensors or with the base station (BS). Such networks have been
realized due to recent advances in micro electromechanical systems and are expected to be widely used for
applications such as environment monitoring, home security, and earthquake warning. Despite the infinite scopes
of wireless sensor networks, they are limited by the node battery lifetime. Once they are deployed, the network
can keep operating while the battery power is adequate. This is critical point to be considered as it is almost
impossible to replace the node battery once deployed over an inaccessible area. Such constraints combined with
a typical deployment of large number of sensor nodes, have posed many challenges to the design and
management of
Sensor networks and necessitate energy-awareness at all layers of networking protocol stack In this paper we
assume a sensor network model, similar to those used in, with the following properties:
• All sensor nodes are immobile and homogeneous with a limited stored energy.
• The nodes are equipped with power control capabilities to vary their transmitted power.
• None of the nodes know their location in the network.
• Each node senses the environment at a fixed rate and always has data to send to the base station.
• Base station is fixed and not located between sensor nodes.
In this paper, we propose EEPSC (Energy-Efficient Protocol with Static Clustering), a hierarchical static
clustering based protocol, which eliminates the overhead of dynamic clustering and engages high power sensor
nodes for power consuming tasks and as a result prolongs the network lifetime. In each cluster, EEPSC chooses
the sensor node with maximum energy as the cluster-head (CH); thus, not only there is always one CH for each
cluster, but also the overhead of dynamic clustering is removed. EEPSC is a modified version of the Low-Energy
Adaptive Clustering Hierarchy (LEACH) protocol presented in LEACH uses the paradigm of data fusion to
reduce the amount of data transmitted between sensor nodes and the base station. Data fusion combines one or
more data packets from different sensors in a cluster to produce a single packet. It selects a small number of CHs
by a random scheme which collects and fuses data from sensor nodes and transmits the result to the base station.
LEACH uses randomization to rotate the CHs and achieves a factor of 8 improvement compared to the direct
approach before the first node dies The main difference between EEPSC and LEACH are described below:
• EEPSC benefits a new idea of using temporary-CHs and utilizes a new setup and responsible node selection
phase.
• EEPSC utilizes static clustering scheme, therefore eliminates the overhead of dynamic clustering.
The rest of the paper is organized as follows. Section II describes the proposed method.
30
2. Network and Complex Systems
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol.3, No.7, 2013
www.iiste.org
2. EEPSC PROTOCOL ARCHITECTURE
EEPSC is a self-organizing, static clustering method that forms clusters only once during the network action.
The operation of EEPSC is broken up into rounds, where each round consists set-up phase, responsible node
selection phase and steady-state phase.
In the following sub-sections we discuss each of these phases in details.
A. Setup Phase
According to the static clustering scheme which is used in EEPSC, cluster formation is performed only once at
the beginning of network operation. For this aim, base station broadcasts k-1 different messages with different
transmission powers, which k is the desired number of clusters (specified a priori). By broadcasting the k=1
message all the sensor nodes which hear this message (are in the radio range of this message) set their cluster ID
to k and inform the base station that they are member of the cluster k via transmitting a join request message
(Join-REQ) back to the base station. Similarly, by broadcasting the k=k-1 message, all the sensor nodes which
are not joined to any clusters yet and hear this message set their cluster ID to k-1 and inform base station with a
Join-REQ message. Later, all sensor nodes which are not joined to any clusters set their cluster ID to k and
inform base station.
Fig. 1 shows how the network area is divided into k=4 clusters with broadcasting k-1=3 different messages from
base station. Fig. 1 Network area is divided into 4 clusters with broadcasting 3 different messages from base
station. These messages are small messages containing node’s Ids and a header that distinguishes them as
announcement messages. Like LEACH, in order to reduce the probability of collision among joint-REQ
messages during the setup phase, CSMA (Carrier Sense Multiple Access) is utilized as the MAC layer protocol
Afterward, the base station selects randomly one temporary-CH for each cluster and advertises these rules to the
whole network. In addition, base station (based on the number of each cluster) sets up a TDMA (time-division
multiple-access) schedule and transmits this schedule to the nodes in each cluster. Once the TDMA schedule is
known by all nodes in the cluster, the set-up phase is complete and the next phase can begin.
B. Responsible Node Selection Phase
After the clusters are established, network starts its normal operation and responsible nodes (temporary-CH and
CH) selection phase begins. At the beginning of each round, every node sends its energy level to the temporaryCH in it’s time slot. Afterward, temporary-CH choose the sensor node with utmost energy level as CH for
current round to collect the data of sensor nodes of that cluster, perform local data aggregation, and communicate
with the base station; and the node with lowest energy level as temporary-CH for next round and sends a roundstart packet including the new responsible sensor IDs for the current round. This packet also indicates the
beginning of round to other sensor nodes. Since every sensor node has a pre-specified time slot, changing the
CHs has no effect on the schedule of the cluster operation.
C. Steady-State Phase
The steady-state phase is broken into frames where nodes send their data to the CH during pre-allocated time
slots. These data contain node ID and the measure of sensed parameter. We show in the next section that the
total energy expended in the system is greater using multi-hop routing than direct transmission to the base
station; thus, we use direct transmission approach among CH and base station. The duration of each slot in which
a node transmits data is constant, so the time to send a frame of data depends on the number of nodes in the
cluster. To reduce energy dissipation, the radio of each non-cluster head node is turned off until its allocated
transmission time, but the CHs must be awake to receive all the data from nodes in the cluster.
3.The assumptions for the working scenarios are shown as following:
1. All sensors rarely move.
2. All sensors are homogeneous and energy restricted.
3. Energy consumption is variable for different types of sensors.
4. The base station is fixed with energy supply, and located outside the wireless sensor network.
5. Network stability is highly requested.
6. Once certain percent of the sensors fail, the full wireless sensor network fails.
In such scenarios, wireless sensor network must lower down energy consumption of each sensor, distribute
energy consumption equally throughout the sensors and keep high
stability of the whole network. The running stages of LESCS can be divided into three
phases, centralist network clustering calculation phase, cluster formation phase, and intra-cluster scheduling
phase. The centralist network clustering calculation phase and the
cluster formation phase, only run one time during the network initialization. Once the network cluster is formed,
the wireless sensor network enters the third phase, a loop
procedure, until the entire network fails. Figure 1. Network data transmission
First phase is centralist network clustering calculation.Because the data information is always attached with
31
3. Network and Complex Systems
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol.3, No.7, 2013
www.iiste.org
position information [5, 6], it is easy to employ a base station that locates outside to calculate the optimal
network topology, which means how to divide the entire network to several clusters. Also, the base station
selects cluster head for each cluster. The cluster and their heads are decided only once and never changed. Then,
the base station broadcasts the results to the whole network. An example of clustering calculation results is given
as Figure 1. In the example, the network is divided to 9 clusters.
Second phase is cluster formation phase. Based on the broadcast message from the base station, each sensor
selects to join the cluster whose center is the nearest from itself.
The cluster head answers for recording the position and energy information of all sensors in the cluster. Then,
cluster head will assign a sequence number, from 0 to k-1 (k means
the amount of sensors in the cluster), to each sensor in the cluster. The sequence number is used for later
scheduling. The cluster head also records the available energy
information of each sensor. Before the description of the third phase, it must be made clear how the static
clustering protocols work. Figure 1 also illustrates an example of how to transmit data from source sensor to the
base station in LESCS. The sensors in the upper-left corner cluster of Figure 1 transmit the data to their gateway.
The gateway fuses the data and transmits the data to the gateway of the adjacent cluster [7, 8, 9, 10, 11]. Through
such multi hops, the fused data can be finally transmitted to the base station.During the multi hops, the gateways
take charge of collecting data, fusing data and transmitting data. Obviously, gateways consume energy much
faster than other sensors. If a sensor is always serving as gateway, it will fail much earlier than others. Such
phenomenon is called hotspot problem, which inherently exists in the static clustering protocols. To solve this,
LESCS carries out the third phase to assign gateway dynamically.The third phase is a loop procedure. Each loop
is a fixed time span, named time step or round, same as that concept of LEACH. In each round, cluster head
assigns the most energy remained sensor as the gateway.
4.For example
Figure 2 shows the gateway assignment and data transmission between two adjacent clusters, in some round.
The sensor of (C1, 3), serves as the gateway of cluster
All data from sensors in cluster 1, will be transmitted to (C1, 3). Then, (C1, 3) will fuse the data and transmit the
data to the gateway of cluster 2, (C2, 2). Observing the energy level shown in Figure 2, the sensor For example,
Figure 2 shows the gateway assignment and data transmission between two adjacent clusters, in some round. The
sensor of (C1, 3), serves as the gateway of cluster 1. All data from sensors in cluster 1, will be transmitted to
(C1, 3). Then, (C1, 3) will fuse the data and transmit the data to the gateway of cluster 2, (C2, 2). Observing the
energy level shown in Figure 2, the sensor For example, Figure 2 shows the gateway assignment and data
transmission between two adjacent clusters, in some round. The sensor of (C1, 3), serves as the gateway of
32
4. Network and Complex Systems
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol.3, No.7, 2013
www.iiste.org
cluster 1. All data from sensors in cluster 1, will be transmitted to (C1, 3). Then, (C1, 3) will fuse the data and
transmit the data to the gateway of cluster 2, (C2, 2). Observing the energy level shown in Figure 2, the sensor
(C1, 3) consumes energy faster than cluster head (C1, 0) and other sensors in the cluster, for example, the sensor
of (C1,2). If no adaptation was performed, it’s obvious that (C1, 3) would fail faster than other sensors. Figure 3
shows the situation after a round. Now, (C1, 2) is assigned to serve as the gateway of cluster 1. Serving as the
gateway, (C1, 2) also consume more energy than other sensors of cluster 1. However, the available energy of
(C1, 2) is almost equal to that of (C1, 3). Through assigning the gateway dynamically, the energy consumption
of each sensor can be balanced.Such scheduling can distribute the large energy consumption for serving as
gateway, to all sensors. It can solve the hotspot problem and lengthen the lifetime of the entire wireless sensor
network. The detailed procedure of the gateway assignment is following: First step, the cluster head predicts the
available energy of each sensor in the cluster. Then, the cluster head selects the most energy remained sensor as
the gateway, following the prediction. After that, cluster head broadcasts the selection to all sensors in the
cluster. If any sensor has more available energy than the selected sensor, the cluster head will correct the
selection and the new one is assigned as the gateway. Otherwise, the predicted most available energy sensor will
be assigned as the gateway. It’s also possible that the cluster head itself is assigned as gateway sometimes,
because, the additional energy consumption for serving as a cluster head can be marginally ignored, comparing it
with the large energy consumption for serving as the gateway.
5.Energy Analysis and Simulation
To analyze the energy consumption, assumptions are made about the radio characteristics, including energy
consumption in the transmit and receive modes. In our research, a simple model is assumed that the radio
dissipates
Eelec = 50 nJ/bit to run the transmitter or receiver circuitry and ƒÃamp = 100 pJ/bit/m2 for the transmit
amplifier [4]. Thus, it is calculated that, to transmit a k-bit message over a distance d, the energy consumption
ET is
Et= Eelec x K+e amp X K d2 .................................................(1)
and to receive the message, the energy consumption ER is
Er= Eelec x K ..........................................................................(2)
It fs also assumed that there are three types of sensors with different data send-out rates of 1000 bit/round, 2000
bit/round and 3000 bit/round, named type 1, type 2 and type 3 respectively. According to equation (1) and (2), it
is calculated that, E1, E2 and E3, energy consumptions for the three types in each round while not serving as
gateway, are
E1 = 50ƒÊJ +100nJ x d 2.........................................................(3)
E2 =100ƒÊJ + 200nJ x d2........................................................(4)
E3 =150ƒÊJ + 300nJ xd2.........................................................(5)
33
5. Network and Complex Systems
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol.3, No.7, 2013
www.iiste.org
And E gateway, energy consumption while serving as gateway, is
In the equations, d is the distance between sensors and gateway inside cluster, D is the distance between
gateways in different clusters, m1 is the total data rate inside each cluster and m2 is the total data rate after data
fusion and
transmitted to the base station through multi-hop.A 100 sensors network is randomly generated for the
simulation. The locations of 100 sensors are randomly generated in a square of 100 ~100m2, with 50 type 1
sensors (1000 bit/round), 30 type 2 sensors (2000 bit/round) and 20 type 3 sensors (3000 bit/round). Each sensor
has the initial energy of 1.0 J.Two evaluation parameters are taken into account. The first one is the round when
the initial failure of sensor occurs .The second one is the average lifetime of sensors.
The simulation result for LESCS and LEACH, with 1.0J/node in a square of 100×100 m2. X-axis is the round of
the simulation and y-axis is the number of the sensors that keep active. Observing Figure 4, it’s found that
LESCS performs better than LEACH, not only on the initial failure of sensor, but also on the average lifetime of
sensors. The initial failure of sensor occurs much later than LEACH, and the final failure of sensor occurs almost
the same round as LEACH. LESCS keeps the entire network working normally longer
than LEACH.
6. Energy and Simulation of Leach;-
If 100 nodes of the LEACH are dissipates per round as the number of cluster varies between 1 to 100 is the most
energy efficient method when there are between 3 and 5 cluster in the 100-node network as predicted by by the
analysis.
34
6. Network and Complex Systems
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol.3, No.7, 2013
www.iiste.org
Number of cluster Vs average energy dissipation per round (J)
Fig. shows that LEACH is not as efficient as EEPSC
(LEACH-C delivers about 40% more data per unit energy than LEACH). This is because the BS has global
knowledge of the location and energy of all the nodes in the network, so it can
produce better clusters that require less energy for data transmission.
In addition, the BS formation algorithm ensures that there are clusters during each round of operation. As there
are only 100 nodes in the simulation, even though the expected
number of clusters per round is in LEACH, each round does not always have five clusters.
Energy distribution:- EEPCA shows the energy distribution across the boundary of the base station where the
three vector coincidence occurs at the level of the distribution rounds.Inthe the distribution chamber has been
consider to convert the medium into energy transformation across the cluster.These energy system shows the
formation of the cluster from the equation (1). This distribution curve shows the leading legend in the energy
shows is the eeca forms the symbol in the corner formation of the energy level simulation.
The energy distribution is seen from the plot chamber that EECA forwars in the surface plot level that the energy
conservation is greater in the base station of the secure transformation of the consumption.The queue formation
of the legend has been in the sector to show the distribution of the plot where the segment is Distributed
.
35
7. Network and Complex Systems
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol.3, No.7, 2013
www.iiste.org
7.Expiereimental analysis plot
In these experiments, each node begins with only 2 J of energy and an unlimited amount of data to send to the
BS. Each node uses the probabilities in (3) to determine its cluster head status at the beginning of each round,
and each round lasts for 20 s.6 We tracked the rate at which the data packets are transfered to the BS and the
amount of energy required to get the data to the BS. When the nodes use up their limited energy during the
course of the simulation, they can no longer transmit or receive data. For these simulations, energy is consumed
whenever a node transmits or receives data or performs data aggregation. Using
spread-spectrum increases the number of bits transmitted, thereby increasing the amount of energy dissipated in
the electronics of the radio. We do not assume any static energy
dissipation nor do we assume energy is consumed during carrier-sense operations; hence, the results here do not
account for the potential energy benefits of using TDMA in LEACH
compared with CSMA in MTE.
8. Conclusion
When designing protocol architectures for wireless microsensor networks, it is important to consider the function
of the application, the need for ease of deployment, and the
severe energy constraints of the nodes. These features led us to design LEACH, a protocol architecture where
computation is performed locally to reduce the amount of transmitted
data, network configuration and operation is done using local control, and media access control (MAC) and
routing protocols enable low-energy networking. Results from our experiments show that EECA provides the
high performance needed under
the tight constraints of the wireless channel.
REFERENCES
[1] P. Agarwal and C. Procopiuc, “Exact and approximation algorithms for clustering,” in Proc. 9th Annu. ACMSIAM Symp. Discrete Algorithms, Baltimore, MD, Jan. 1999, pp. 658–667.
[2] J. Agre and L. Clare, “An integrated architecture for cooperative sensing networks,” IEEE Computer, vol. 33,
pp. 106–108, May 2000.
[3] D. Baker, A. Ephremides, and J. Flynn, “The design and simulation of a mobile radio network with
distributed control,” IEEE J. Select. Areas Commun., vol. SAC–2, pp. 226–237, Jan. 1984.
[4] A. Chandrakasan, R. Amirtharajah, S.-H. Cho, J. Goodman, G. Konduri, J. Kulik, W. Rabiner, and A. Wang,
“Design considerations for
distributed microsensor systems,” in Proc. IEEE Custom Integrated CircuitsConf. (CICC), San Diego, CA, May
1999, pp. 279–286.
[5] L. Clare, G. Pottie, and J. Agre, “Self-organizing distributed sensor networks,” in Proc. SPIE Conf.
Unattended Ground Sensor Technologies and Applications, vol. 3713, Orlando, FL, Apr. 1999, pp. 229–237.
[6] M. Dong, K. Yung, and W. Kaiser, “Low power signal processing architectures for network microsensors,”
in Proc. Int. Symp. Low Power Electronics and Design, Monterey, CA, Aug. 1997, pp. 173–177.
[7] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next century challenges: Scalable coordination in
sensor networks,” in Proc. 5th
36
8. Network and Complex Systems
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol.3, No.7, 2013
www.iiste.org
Annual ACM Int. Confe. Mobile Computing Networking (MobiCom), Seattle, WA, Aug. 1999, pp. 263–270.
[8] M. Ettus, “System capacity, latency, and power consumption in multihop- routed SS-CDMA wireless
networks,” in Proc. Radio and Wireless Conf. (RAWCON), Colorado Springs, CO, Aug. 1998, pp. 55–58.
[9] D. Hall, Mathematical Techniques in Multisensor Data Fusion. Boston, MA: Artech House, 1992.
[10] W. Heinzelman, “Application-specific protocol architectures for wireless networks,” Ph.D. dissertstion,
Mass. Inst. Technol., Cambridge, 2000.
[11] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient routing protocols for wireless
microsensor networks,” in Proc.33rd Hawaii Int. Conf. System Sciences (HICSS), Maui, HI, Jan. 2000.
[12] L. Hu, “Distributed code assignments for CDMA packet radio networks,” IEEE/ACM Trans. Networking,
vol. 1, pp. 668–677, Dec. 1993.
[13] C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed diffusion: A scalable and robust communication
paradigm for sensor networks,” in Proc. Fourth Annu. ACM Int. Conf. Mobile Computing and Networking
(MobiCom), Boston, MA, Aug. 2000, pp. 56–67.
[14] T. Kwon and M. Gerla, “Clutering with power control,” in Proc. MILCOM, vol. 2, Atlantic City, NJ, Nov.
1999.
[15] C. Lin and M. Gerla, “Adaptive clustering for mobile wireless networks,” IEEE J. Select. Areas Commun.,
vol. 15, pp. 1265–1275, Sept.1997.
[16] T. Murata and H. Ishibuchi, “Performance evaluation of genetic algorithms for flowshop scheduling
problems,” Proc. 1st IEEE Conf. Evolutionary Computation, vol. 2, pp. 812–817, June 1994.
[17] UCB/LBNL/VINT Network Simulator – ns (2000). [Online]. Available: http://www.isi.edu/vint/ nsnam/
[18] K. Pahlavan and A. Levesque, Wireless Information Networks. New York: Wiley, 1995.
[19] S. Park and M. Srivastava, “Power aware routing in sensor networks using dynamic source routing,” ACM
MONET Special Issue on Energy Conserving Protocols in Wireless Networks, 1999
37
9. This academic article was published by The International Institute for Science,
Technology and Education (IISTE). The IISTE is a pioneer in the Open Access
Publishing service based in the U.S. and Europe. The aim of the institute is
Accelerating Global Knowledge Sharing.
More information about the publisher can be found in the IISTE’s homepage:
http://www.iiste.org
CALL FOR JOURNAL PAPERS
The IISTE is currently hosting more than 30 peer-reviewed academic journals and
collaborating with academic institutions around the world. There’s no deadline for
submission. Prospective authors of IISTE journals can find the submission
instruction on the following page: http://www.iiste.org/journals/
The IISTE
editorial team promises to the review and publish all the qualified submissions in a
fast manner. All the journals articles are available online to the readers all over the
world without financial, legal, or technical barriers other than those inseparable from
gaining access to the internet itself. Printed version of the journals is also available
upon request of readers and authors.
MORE RESOURCES
Book publication information: http://www.iiste.org/book/
Recent conferences: http://www.iiste.org/conference/
IISTE Knowledge Sharing Partners
EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open
Archives Harvester, Bielefeld Academic Search Engine, Elektronische
Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial
Library , NewJour, Google Scholar