The document proposes a new clustering protocol called DEEAC for wireless sensor networks. DEEAC is adaptive based on the data reporting rates and residual energy levels of nodes. It aims to distribute energy consumption more evenly across the network by selecting cluster heads that have high residual energy and are located in "hot regions" with high data generation rates. This is intended to prolong the lifetime of sensor networks compared to the original LEACH protocol.
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.
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
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.
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
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.
The comparison between routing protocols based on lifetime of wireless sensor...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
COMPARISON OF ENERGY OPTIMIZATION CLUSTERING ALGORITHMS IN WIRELESS SENSOR NE...IJCSIT Journal
In recent years, Wireless Sensor Networks have gained growing attention from both the research community and actual users. As sensor nodes are generally battery-energized devices, so the network lifetime can be widespread to sensible times.
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.
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.
A Novel Cluster-Based Energy Efficient Routing With Hybrid Protocol in Wirele...IJERA Editor
In wireless sensor network, lifetime of sensor nodes is the most essential parameters. sensor node's lifetime may be extended using LEACH and HEED scheme which is allowing to move the cluster head surrounded by the sensor nodes try to allocate the energy consumption over all nodes in the network. Energy efficiency is depends on the selection of cluster head. In this paper, we proposed the clustering algorithm to minimize the overhead of control packets by using LEACH and HEED and Efficient utilization of node near sink and to implements the hybrid protocol which would be better than the existing protocol.
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.
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.
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.
Prolong Lifetime Analysis and Efficient Utilization of Energy in Heterogeneou...IJTET Journal
Abstract - The clustering-based protocols are believed to be the best for heterogeneous wireless sensor networks (WSNs). The evaluation is based on two new clustering-based protocols, which are called single-hop energy-efficient clustering protocol (S-EECP) and multi-hop energy-efficient clustering protocol (M-EECP) [1]. In S-EECP, the cluster heads (CHs) are elected by a weighted probability [2] based on the ratio between average energy of the network and residual energy of each node. The nodes having more initial energy and residual energy will have more chances to be elected as CHs than nodes with low energy. In M-EECP, the election of CHs is same as S-EECP, but the elected CHs communicate the data packets to the base station via multi-hop communication approach. To analyze the network lifetime three types of sensor nodes equipped with different battery energy are assumed. By analyzing these parameters, M-EECP achieves load balance among the CHs better than the existing clustering protocols and gives prolong network lifetime. Here the simulation is based on ns-2 simulator.
Introduction from Uptime Consultant Ltd looking at the Sustainability & Safety impact Condition Monitoring can have in industrial plant. Learn the basics and more at www.uptimeconsultant.co.uk
The comparison between routing protocols based on lifetime of wireless sensor...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
COMPARISON OF ENERGY OPTIMIZATION CLUSTERING ALGORITHMS IN WIRELESS SENSOR NE...IJCSIT Journal
In recent years, Wireless Sensor Networks have gained growing attention from both the research community and actual users. As sensor nodes are generally battery-energized devices, so the network lifetime can be widespread to sensible times.
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.
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.
A Novel Cluster-Based Energy Efficient Routing With Hybrid Protocol in Wirele...IJERA Editor
In wireless sensor network, lifetime of sensor nodes is the most essential parameters. sensor node's lifetime may be extended using LEACH and HEED scheme which is allowing to move the cluster head surrounded by the sensor nodes try to allocate the energy consumption over all nodes in the network. Energy efficiency is depends on the selection of cluster head. In this paper, we proposed the clustering algorithm to minimize the overhead of control packets by using LEACH and HEED and Efficient utilization of node near sink and to implements the hybrid protocol which would be better than the existing protocol.
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.
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.
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.
Prolong Lifetime Analysis and Efficient Utilization of Energy in Heterogeneou...IJTET Journal
Abstract - The clustering-based protocols are believed to be the best for heterogeneous wireless sensor networks (WSNs). The evaluation is based on two new clustering-based protocols, which are called single-hop energy-efficient clustering protocol (S-EECP) and multi-hop energy-efficient clustering protocol (M-EECP) [1]. In S-EECP, the cluster heads (CHs) are elected by a weighted probability [2] based on the ratio between average energy of the network and residual energy of each node. The nodes having more initial energy and residual energy will have more chances to be elected as CHs than nodes with low energy. In M-EECP, the election of CHs is same as S-EECP, but the elected CHs communicate the data packets to the base station via multi-hop communication approach. To analyze the network lifetime three types of sensor nodes equipped with different battery energy are assumed. By analyzing these parameters, M-EECP achieves load balance among the CHs better than the existing clustering protocols and gives prolong network lifetime. Here the simulation is based on ns-2 simulator.
Introduction from Uptime Consultant Ltd looking at the Sustainability & Safety impact Condition Monitoring can have in industrial plant. Learn the basics and more at www.uptimeconsultant.co.uk
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.
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.
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.
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.
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.
Optimizing the Performance of I-mod Leach-PD Protocol in Wireless Sensor Netw...ijsrd.com
Wireless Sensor Networks (WSNs) is a networks of thousands of inexpensive miniature devices capable of computation, communication and sensing. WSN is being been attracting increasing interest for supporting a new generation of ubiquitous computing systems with great potential for many applications such as surveillance, environmental monitoring, health care monitoring or home automation. In the near future, wireless sensor network is expected to consists of thousand of inexpensive nodes, each having sensing capability with limited computational and communication power which enables to deploy large scale sensor networks. Large scale WSN is usually implemented as a cluster network. Clustering sensors into groups, so that sensors communicate information only to cluster-heads and then the cluster-heads communicate the aggregated information to the base station, saves energy and thus prolongs network lifetime. LEACH (Low Energy Adaptive Clustering Hierarchy) protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, how to adjust threshold based on the residual energy, and the measurement of energy required for transmission, based on the distance of cluster head from the base station, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of residual energy and required energy, and the time length of each round are deduced, thereby modifying the threshold value calculation. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.
ENERGY EFFICIENT GRID AND TREE BASED ROUTING PROTOCOLijwmn
In Wireless Sensor Network, a large number of sensor nodes are deployed and they mainly consume energy
in transmitting data over long distances. Sensor nodes are battery powered and their energy is restricted.
Since the location of the sink is remote, considerable energy would be consumed if each node directly
transmits data to the base station. Aggregating data at the intermediate nodes and transmitting using multihops
aids in reducing energy consumption to a great extent. This paper proposes a hybrid protocol
“Energy efficient Grid and Tree based routing protocol” (EGT) in which the sensing area is divided into
grids. The nodes in the grid relay data to the cell leader which aggregates the data and transmits to the
sink using the constructed hop tree. Simulation results show that EGT performs better than LEACH.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
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.
Energy aware clustering protocol (eacp)IJCNCJournal
Energy saving to prolong the network life is an important design issue while developing a new routing
protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the
network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a
homogeneous network architecture, in which all sensors have the same capabilities in terms of battery
power, communication, sensing, storage, and processing. Recently, there has been an interest in
heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new
energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is
introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal
nodes are elected with the help of a probability scheme based on residual and average energy of the
normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a
round. Advanced nodes use a separate probability based scheme for cluster head election and they will
further act as a gateway for normal cluster heads and transmit their data load to base station when they
are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during
cluster formation phase to save network energy. The performance of EACP is compared with SEP and
simulation result shows the better result for stability period, network life and energy saving than SEP.
An Improved LEACH-C Algorithm for Energy Efficiency in WSN Routingijsrd.com
this paper considered a multi-objective LEACH-C algorithm in the selection of Cluster Head (CH) in such a way so that its energy is used uniformly with load balancing among clusters for delayed disintegration of network. LEACH-C algorithm based single objective clustering approach has been replaced by multi-objective clustering approach where we not only considered the residual energy of nodes but the size of cluster in creating a cluster structure. The improved LEACH-C protocol has been compared with random LEACH and Max Energy LEACH or existing LEACH-C algorithm for energy equi-distribution and load balancing among clusters. Wireless sensor network (WSN) is simulated using a MATLAB programming and power consumption algorithms take into consideration all aspects of power consumption in the operation of the node. The modified LEACH-C routing protocol shows improvements in lifetime as well as in network disintegration criterion
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
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.
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.
An Adaptive Energy Aware Clustering Based Reliable Routing for in-Network Agg...Editor IJCATR
Wireless Sensor Network (WSN) consists of spatially distributed autonomous devices that cooperatively sense physical or
environmental conditions. Due to the non-uniform node deployment, the energy consumption among nodes are more
imbalanced in cluster-based wireless sensor networks this factor will affect the network life time. Cluster-based routing and EADC
algorithm through an efficient energy aware clustering algorithm is employed to avoid imbalance network distribution. Our proposed
protocol EADC aims at minimizing the overall network overhead and energy expenditure associated with the multi hop data retrieval
process while also ensuring balanced energy consumption among SNs and prolonged network life time .A optimal one-hop based
selective node in building cluster structures consisted of member nodes that route their measured data to their assigned cluster head is
identified to ensure efficient communication. The proposed routing algorithm increases forwarding tasks of the nodes in scarcely
covered areas by forcing cluster heads to choose nodes with higher energy and fewer member nodes and finally, achieves
imbalanced among cluster head and improve the network life time.
9.distributive energy efficient adaptive clustering protocol for wireless sensor networks
1. Distributive Energy Efficient Adaptive Clustering Protocol for Wireless Sensor Networks Udit Sajjanhar and Pabitra Mitra Department of Computer Science & Engineering
Indian Institute of Technology, Kharagpur, India
udit.sajjanhar@iitkgp.ac.in, pabitra@cse.iitkgp.ac.in
Abstract - 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 prolong network lifetime. Adapting this approach, we propose a Distributive Energy Efficient Adaptive Clustering (DEEAC) protocol. This protocol is adaptive in terms of data reporting rates and residual energy of each node within the network. Motivated by the LEACH protocol [1], we extend its stochastic cluster selection algorithm for networks having spatio- temporal variations in data reporting rates across different regions. Simulation results demonstrate that DEEAC is able to distribute energy consumption more effectively among the sensors, thereby prolonging the network lifetime by as much as 50% compared to LEACH. I. INTRODUCTION Sensor nodes are often left unattended e.g., in hostile environments, which makes it difficult or impossible to re-charge or replace their batteries. This necessitates devising novel energy-efficient solutions to some of the conventional wireless networking problems, such as medium access control, routing, self-organization, so as to prolong the network lifetime. In most of the applications sensors are required to detect events and then communicate the collected information to a distant base station (BS) where parameters characterizing these events are estimated. The cost of transmitting a information is higher than computation [] and hence it is be advantageous to organize the sensors into clusters [1] [2], where the data gathered by the sensors is communicated to the BS through a hierarchy of cluster-heads.
LEACH [1] is perhaps the first cluster based routing protocol for wireless sensor networks, which uses a stochastic model for cluster head selection. LEACH has motivated the design of several other protocols which try to optimize energy consumption in different ways, [3] [4] [5]. They improve upon the cluster-head selection process by considering the residual energy of the nodes. TL-LEACH [9] uses two levels of cluster heads instead of one in LEACH. EDAC [10] enables cluster heads to change status asynchronously and co-ordinate energy consumption. HEED [8] uses an hybrid approach based on residual energy and communication cost to select cluster heads. ANTICLUST [12] uses a two level cluster- head selection process involving local communication between neighboring nodes. Protocols like TEEN [6], APTEEN [7], and EDC [13] optimize energy by responding to events in the network but are not suited for applications which require continuous data delivery. However none of the above approaches exploit both of the spatial and temporal correlation present in the data transmitted by the sensor nodes. In many applications due to high density of sensor nodes in network topology, spatially proximal sensor observations are highly correlated. Also the nature of the energy radiating physical process constitutes the temporal correlation between consecutive observations of a sensor node [15]. CAG [16] exploits spatial correlation by clustering the nodes sensing similar values. ELECTION [17] is an event based clustering system which also exploits spatial and temporal correlation by controlling sleep schedules of the sensor nodes.
In all the above approaches data is collected from the network periodically or on an occurrence of an event. Hence, none of them adapts to the temporal variations in data delivered by the sensor network. This necessitates the uses of a hybrid approach for data collection that readily adapts to the changes in the data delivery rate. An example would be of a temperature sensing application where normally there is periodic values of temperature ranges and an alert
2. situation when the sensed value increases certain threshold. The proposed DEEAC protocol is well suited for such applications. The regions in the network having high data generation rate are considered to be “hot regions”. “Hotness” value of a node is a parameter indicating the data generation rate at that node relative to the whole network. DEEAC tries to optimize the energy consumption of the network by ensuring that nodes belonging to hot regions have a high probability of becoming a cluster heads. Thus nodes belonging to hot regions, which are expected to transmit data more frequently, do it over shorter distances, thereby leading to balanced energy consumption over the network. DEEAC selects a node to be a cluster head depending upon its hotness value and residual energy. This is an improvement over stochastic approach used in LEACH in terms of energy efficiency. The DEEAC approach considers two additional parameters for cluster-head selection. These are the residual energy of a node and the hotness of the region sensed by the node. These two factors are used in a fashion which leads to Spatio-temporal adaption for optimum energy usage. II. LEACH PROTOCOL LEACH makes certain assumptions about the sensor nodes and the underlying network model. It assumes that all nodes can transmit with enough power to reach BS if needed, and that nodes can use power control to the amount of transmit power to support different MAC protocols. In LEACH, nodes organize themselves into clusters and all non-cluster head nodes transmit to the cluster-head. The cluster head performs data aggregation and transmits the data to the remote base station. Therefore, being a cluster-head node is much more energy intensive than being a non-cluster head node. The operation in LEACH is divided into rounds. Each round begins with a setup phase when clusters are organized, followed by a steady phase when data is transferred from nodes to cluster-head and on to the BS, as shown in Fig. 1. During the setup phase cluster heads are randomly selected. The decision of cluster-heads is simply based on the suggested percentage of them for the network and the number of times the node has been a cluster-head so far. This decision is made by each node n choosing a random number between 0 and 1. If the number is less than a threshold T(n), the node becomes a cluster-head for the current round. The threshold is set as follows:
Fig. 1. Time Line showing the LEACH Operation where P is the desired cluster-head probability, r is the number of the current round and G is the set of nodes that have not been cluster-heads in the last 1/P rounds. Once the nodes have elected themselves to be cluster heads they broadcast an advertisement message (ADV) using non-persistent CSMA MAC protocol. Each non cluster-head node decides its cluster for this round by choosing the cluster head that requires minimum communication energy, based on the received signal strength of the advertisement from each cluster head. After each node decides to which cluster it belongs, it informs the cluster head by transmitting a join request message (Join-REQ) back to the cluster head. The cluster head node sets up a TDMA schedule and transmits this schedule to the nodes in the cluster. This ensures that there are no collisions among data messages and also allows the radio components of each non-cluster head node to be turned off at all times except during their transmit time, thus reducing the energy consumed by the individual sensors. After the TDMA schedule is known by all nodes in the cluster, the set-up phase is complete and the steady-state operation can begin. The steady-state operation is broken into frames, where nodes send their data to the cluster head at most once per frame during their allocated slot. III. MOTIVATION FOR SPATIO-TEMPORAL ADAPTION In the above approach, a node becomes a cluster-head by a stochastic mechanism of tossing biased coins. This stochastic approach doesn’t consider hotness of a region while selecting cluster-heads. Hence non cluster-head nodes belonging the hot regions, which are expected to transmit frequently, dissipate more energy in transmitting data to a remote cluster-head located far. This leads to uneven energy dissipation over the network thereby reducing the network lifetime. Secondly, LEACH assumes that every time a node becomes a cluster-head, it dissipates an equal amount of energy. This is incorrect, as cluster-heads located far from the base station spend more energy in transmitting data those located near to the base station.
3. IV. DEEAC PROTOCOL ARCHITECHTURE LEACH’s stochastic cluster-head selection is prone to producing unbalanced energy level reserves in nodes and thus increase the total energy dissipated in network. To ensure an even energy load distribution over the whole network, additional parameters including the residual energy level of candidates relative to the network and their hotness value should be considered to optimize the process of cluster-head selection. The main principle in our algorithm is to choose nodes with high residual energy and greater hotness values as cluster heads. This can be achieved by making some beneficial adjustments to the threshold T(n) proposed in LEACH. Modified T(n) is denoted in Eq. (2). Using this equation each node decides whether or not to be a cluster-head for the current round, where k is the optimal number of cluster-head nodes per round, Eres is the residual energy of the node and Eest_net is the estimate of the residual energy of the network. Hotness_factor is the relative hotness of the node with respect to the network. A. Distributive Energy Model The T(n) in Eq. (2) requires an estimate of the residual energy of the network at each node. LEACH-C [1] achieves this estimate by making each node send its current energy to the base station during the setup phase. However this approach is energy inefficient as it involves transmissions from every node to base station. DEEAC uses a novel distributed approach to estimate the residual energy of the network. During the setup phase, each node sends its residual energy to the cluster-head along with the Join-REQ. Thus at the end of the setup phase each cluster-head has the aggregate energy of its cluster. During the steady phase when the cluster-head transmits to the base station, it also transmits the average residual energy of the cluster along with the aggregated data. The base station aggregates the residual energy values received from different cluster heads to estimate the residual energy (Eest_net) of the whole network. The base station periodically broadcasts the Eest_net value updating the nodes in the network. DEEAC’s distributive approach is more energy efficient than the centralized approach used in LEACH-C as non cluster-head nodes transmit their residual energy value over much smaller distances. Also the distributive approach doesn’t necessitate separate transmissions for sending the residual values from the non cluster-head nodes to the cluster-heads or from the cluster-heads to the BS. B. Adaptive Hotness Model A cluster-head assigns a TDMA schedule to the non cluster-head nodes in its cluster. Nodes sense a physical phenomenon and report to the cluster-head during their allocated TDMA slot. LEACH assumes that sensors always transmit data to the cluster head during their allocated TDMA slot. However this assumption might not hold for the phenomenon being observed. The phenomenon under observation might have different data generation rates over different periods of time. The data generation rate may also vary across different regions at the same time instant. DEEAC uses a novel hotness approach to adapt to the temporal variations in data generation rate. The Hotness_factor for a node is its relative data generation rate to that of the network. We define the ratio R as follows:
where is number of TDMA slots used for transmission and is the number of TDMA slots allocated over a time period To. We define Hlast_5_avg as the aggregate of the last 5 vales of ratio R and Havg_node as the aggregate of all the values of R calculated. Each node in the network calculates the ratio R, Hlast_5_avg and Havg_node. The cluster-head calculates ratio R for each node in its cluster and aggregates it to R’. During the steady phase when the cluster-head transmits to the base station, it also transmits R’ along with the aggregated data. The base station aggregates the R’ values received from different cluster heads to estimate the hotness value (Havg_network) of the whole network. The base station periodically broadcasts the Havg_network value updating the nodes in the network.
Hotness_factor defined in Eq. (4) has been designed to adapt to both dynamic changes (and passive ( in the data delivery rate of the network. Hence DEAAC is able to adapt to the (4) temporal variations in data. Also according to Eq. (2), a node having high value to Hotness_factor has a better chance of becoming a cluster-head. A hot node belongs to a hot region. Thus nodes from hot regions are better placed to become cluster-heads. This enables DEEAC to adapt to the variations in data generation rate over different regions at the same instant.
4. Fig.2. Total amount of Energy dissipated in the network over time
(a) (b) Fig. 3(a) Fraction of cluster heads from hot regions. Fig. 3(b) Fraction of Energy dissipated by the nodes belonging to hot regions V. ANALYSIS AND SIMULATION OF DEEAC A. Experimental Setup We used network simulator ns-2 [18] for evaluating DEEAC and compare it to LEACH. For our experiments, we used a 100-node network where nodes are randomly distributed between (x=0, y=0) and (x=100, y=100) with a single BS at location (x=50, y=175). The bandwidth for the channel was set to 1Mb/s, each message 500 bytes long, and the packet header for each type was 25 bytes long. We use the same radio model as discussed in [1]. In this model, a radio dissipates Eelec = 50 nJ/bit in the transmitter or receiver circuitry and amp = 100 pJ/bit/m2 for the transmitter amplifier to achieve an acceptable Eb/No. The radios have power control and can expend the minimum required energy to reach the intended recipients. The radios can be turned off to avoid receiving unintended transmissions. An r2 energy loss is used due to channel transmission. Thus, to transmit a l-bit message a distance d, the radio
Fig. 4. Total amount of Data received at BS over time expends: where c is path loss exponent (usually 2 ≤ c ≤ 4). To receive this message, the radio expands: We use k, the optimal number of cluster heads per round, equal to 5 as in LEACH. LEACH [1] derives the value of k by minimizing the total energy consumption for cluster-head and non cluster-head nodes. Since we use the same energy model, using the same value of k is justified. B. Simulation Model In order to emulate spatio-temporal variations in data reporting rates over the network, we stochastically generate synthetic data-sets. At the start of experiment the network is divided into smaller hot regions. The area and location of these hot regions is decided randomly and the number of such regions varies randomly from 1 to 4. This process is repeated after every 200 seconds. Nodes belonging to a hot region report data with a higher probability i.e. (Po + ΔP) while other nodes report data with a probability Po. The values for Po and ΔP are chosen as 0.3 and 0.4 respectively. The above model is able to achieve temporal variations in data rate over the same region and also spatial variation in data reporting rate across the network at the same time instant. The results reported in the next section are an aggregate of 100 simulations. C. Results and Discussion
Results are derived from limited energy simulations where each node begins with 2J of energy. Fig. 3(a) shows a 14% increase in the fraction of cluster heads selected from hot regions and Fig. 3(b) shows 32%
6. Adaptive Clustering Protocol for distributed sensor networks”, ICON 2005 [6] Arati Manjeshwar , Dharma P. Agrawal, TEEN: ARouting Protocol for Enhanced Efficiency in Wireless Sensor Networks, Proceedings of the 15th International Parallel & Distributed Processing Symposium, p.189, April 23-27, 2001 [7] A. Manjeshwar and D. P. Agrawal, “An Efficient Sensor Network Routing Protocol (APTEEN) with Comprehensive Information Retrieval,” Proc. Second Int'l Workshop Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, Apr. 2002. [8] Ossama Younis, Sonia Fahmy, "HEED: A Hybrid, Energy- Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks," IEEE Transactions on Mobile Computing, vol. 03, no. 4, pp. 366-379, Oct., 2004. [9] Loscri' V. , Marano S. , Morabito G. , " A Two-Levels Hierarchy for Low-Energy Adaptative Clustering Hierarchy (TL-LEACH).". Proceedings "VTC2005", Dallas (USA), pp. 1809-1813, Sept, 2005 [10] Yongcai Wang, Qianchuan Zhao and Dazhong Zheng, “Energy-Driven Adaptive Clustering Data Collection Protocol in Wireless Sensor Networks”, Proceedings of the 2004 International Conference on Intelligent Mechatronics and Automation , Chengdu, China August 2004 [11] Wenwei Xue, Qiong Luo, Lei Chen, and Yunhao Liu. Contour Map Matching for Event Detection in Sensor Networks. Accepted to appear in Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 26-29, 2006. [12] Junpei Kamimura and Naoki Wakamiya and Masayuki Murata, “Energy-efficient clustering method for data gathering in sensor networks,” in Proceedings of First Workshop ON Broad-band Advanced Sensor Networks and October 2004 [13] Zengwei Zheng, Zhaohui Wu, and Huaizhong Lin. An Event- Driven Clustering Routing Algorithm for Wireless Sensor Networks. Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems. Sendai, Japan, Sep. 28 - Oct. 2, 2004. [14] S. Bandyopadhyay and E. J. Coyle, "An energy efficient hierarchical clustering algorithm for wireless sensor networks," in Proc. IEEE INFOCOM , San Francisco, CA, Apr. 2003, pp. 1713-1723. [15] M. C. Vuran, O. B. Akan, I. F. Akyildiz, “Spatio-Temporal Correlation: Theory and Applications in Wireless Sensor Networks,” Computer Networks Journal (Elsevier), vol. 45, no 3, pp. 245 -259, June 2004 [16] SunHee Yoon and Cyrus Shahabi, "Exploiting Spatial Correlation Towards an Energy Efficient Clustered AGgregation Technique (CAG)", IEEE International Conference on Communications (ICC), 16-20 May 2005, Seoul, Korea [17] Shamim Begum, Shaocheng Wang, Bhaskar Krishnamachari, Ahmed Helmy, "ELECTION: Energy-efficient and Low- latEncy sCheduling Technique for wIreless sensOr Networks," The 29th Annual IEEE Conference on Local Computer Networks (LCN), Tampa, FL, November 2004. [18] UCB/LBNL/VINT Network Simulator - ns (Version 2). http://www-mash.cs.berkeley.edu/ns/, 1998. [19] Jason. A. Pamplin, “NS2 Leach Implementation”, available at http://www.internetworkflow.com/resources/ns2leach.pdf.