The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
In the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
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.
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.
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.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
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.
Wireless sensor networks have recently come into prominence because they hold the
potential to revolutionize many segments. The Wireless Sensor Network (WSN) is made up of a
collection of sensor nodes, which were small energy constrained devices. Routing technique is one of
the research area in wireless sensor network. So by designing an efficient routing protocol for
reducing energy consumption is the important factor. In this paper, a brief introduction to routing
challenges in WSN have been mentioned. This paper also provides the basic classification of routing
protocols in WSNs along with the most energy efficient protocol named LEACH along with its
advantages and disadvantages. This paper also focus on some of the improved version of LEACH
protocol.
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.
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.
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.
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.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
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.
Wireless sensor networks have recently come into prominence because they hold the
potential to revolutionize many segments. The Wireless Sensor Network (WSN) is made up of a
collection of sensor nodes, which were small energy constrained devices. Routing technique is one of
the research area in wireless sensor network. So by designing an efficient routing protocol for
reducing energy consumption is the important factor. In this paper, a brief introduction to routing
challenges in WSN have been mentioned. This paper also provides the basic classification of routing
protocols in WSNs along with the most energy efficient protocol named LEACH along with its
advantages and disadvantages. This paper also focus on some of the improved version of LEACH
protocol.
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
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.
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
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
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.
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
Data Dissemination in Wireless Sensor Networks: A State-of-the Art SurveyCSCJournals
A wireless sensor network is a network of tiny nodes with wireless sensing capacity for data collection processing and further communicating with the Base Station this paper discusses the overall mechanism of data dissemination right from data collection at the sensor nodes, clustering of sensor nodes, data aggregation at the cluster heads and disseminating data to the Base Station the overall motive of the paper is to conserve energy so that lifetime of the network is extended this paper highlights the existing algorithms and open research gaps in efficient data dissemination.
Every cluster comprise of a leader which is known as cluster head. The cluster head will be chosen by the sensor nodes in the individual cluster or be pre-assigned by the user. The main advantages of clustering are the transmission of aggregated data to the base station, offers scalability for huge number of nodes and trims down energy consumption. Fundamentally, clustering could be classified into centralized clustering, distributed clustering and hybrid clustering. In centralized clustering, the cluster head is fixed. The rest of the nodes in the cluster act as member nodes. In distributed clustering, the cluster head is not fixed. The cluster head keeps on shifting form node to node within the cluster on the basis of some parameters. Hybrid clustering is the combination of both centralized clustering and distributed clustering mechanisms. This paper gives a brief overview on clustering process in wireless sensor networks. A research on the well evaluated distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH) and its followers are portrayed artistically. To overcome the drawbacks of these existing algorithms a hybrid distributed clustering model has been proposed for attaining energy efficiency to a larger scale.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
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.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
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.
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
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.
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
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
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.
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
Data Dissemination in Wireless Sensor Networks: A State-of-the Art SurveyCSCJournals
A wireless sensor network is a network of tiny nodes with wireless sensing capacity for data collection processing and further communicating with the Base Station this paper discusses the overall mechanism of data dissemination right from data collection at the sensor nodes, clustering of sensor nodes, data aggregation at the cluster heads and disseminating data to the Base Station the overall motive of the paper is to conserve energy so that lifetime of the network is extended this paper highlights the existing algorithms and open research gaps in efficient data dissemination.
Every cluster comprise of a leader which is known as cluster head. The cluster head will be chosen by the sensor nodes in the individual cluster or be pre-assigned by the user. The main advantages of clustering are the transmission of aggregated data to the base station, offers scalability for huge number of nodes and trims down energy consumption. Fundamentally, clustering could be classified into centralized clustering, distributed clustering and hybrid clustering. In centralized clustering, the cluster head is fixed. The rest of the nodes in the cluster act as member nodes. In distributed clustering, the cluster head is not fixed. The cluster head keeps on shifting form node to node within the cluster on the basis of some parameters. Hybrid clustering is the combination of both centralized clustering and distributed clustering mechanisms. This paper gives a brief overview on clustering process in wireless sensor networks. A research on the well evaluated distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH) and its followers are portrayed artistically. To overcome the drawbacks of these existing algorithms a hybrid distributed clustering model has been proposed for attaining energy efficiency to a larger scale.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
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.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
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.
This paper considers a heterogeneous network of energy constrained sensors deployed over a region. Each
Normal sensor node in a network is systematically gathering and transmitting sensed data to the clusterhead,
and then cluster head sending data to a base station (via intermediate cluster- heads). This paper
focuses on reducing the energy consumption and hence improving lifetime of wireless sensor Networks.
Clustering sensor node is an effective topology for the energy constrained networks. So energy saving
algorithm has been developed in which clusters are formed considering a subset of high energy nodes as a
cluster-head and another subset of powerful nodes is ask to go to sleep. When Cluster heads deplete their
energy another subset of nodes becomes active and acts as a cluster head. Proposed approach is
implemented in MATLAB, Simulation results shows that it can prolong the network lifetime than LEACH
protocol, and achieves better performance than the existing clustering algorithms such as LEACH.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
Analysis of different hierarchical routing protocols of wireless sensor networkeSAT Journals
Abstarct Wireless sensored network is nowadays very popular in the field of research because world is now switching faster from wired communication to the wireless communication. It is used in environment monitoring, habitat monitoring, battlefield etc. WSN is made up of tiny sensor nodes which senses the data and communicate to the base station via other nodes.WSN networks are data-centric rather than node centric. So, main issues in WSN networks are energy consumption of network, lifetime of a network, delay, latency, quality of service etc.WSN has defined many routing protocols for the network. The main challenge in WSN is to design a routing protocol which gives the maximum energy efficient routing because nodes in sensored network are equipped with the battery. So, as time passes the battery of nodes will decrease so in turn network lifetime will decreases. There are many routing protocols which are classified as their working and their application to different conditions. This paper describes a brief information about routing protocols. The main focus of this paper is to give the comparison of different hierarchical routing protocols. Keywords: Leach, Pegasis,Teen/Apteen, WSN
Analysis of different hierarchical routing protocols of wireless sensor networkeSAT Publishing House
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
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.
Review of Various Enhancements of Modified LEACH for Wireless Sensor Networkijsrd.com
Wireless sensor network depends on the nodes have limited energy, memory, computational power, range and it is important to increase energy efficiency by saving the battery power so as to extend of the life time of the given wireless sensor network deployment. In wireless sensor network, data is measured by node and same is send to base station at regular interval. Clustering sensor nodes is an effective technique in wireless sensor network. Different protocols are used for energy consumption in which Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is the first hierarchal cluster based routing protocol successfully used in the wireless sensor network. In this paper, various enhancements used in the original leach protocol are studied.
WIRELESS SENSOR NETWORK CLUSTERING USING PARTICLES SWARM OPTIMIZATION FOR RED...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality. The most important issue in this type of networks is energy constraints. In this area several researches have been done from which clustering is one of the most effective solutions. The goal of clustering is to divide network into sections each of which has a cluster head (CH). The task of cluster heads collection, data aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF, PSO-MV) in terms of network lifetime and energy consumption.
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.
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor node creates challenges for routing in WSNs. The research work presents the organized and detailed description of energy conservation method for WSNs. In the proposed method reclustering and multihop data transmission processes are utilized for data reporting to base station by sensor node. The accurate use of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for longer times inside the cluster. The result shows that the proposed clustering approach has higher stable region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy Adaptive Clustering Hierarchy (LEACH) for WSNs.
Similar to SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORK (20)
Trend-Based Networking Driven by Big Data Telemetry for Sdn and Traditional N...ijngnjournal
Organizations face a challenge of accurately analyzing network data and providing automated action based on the observed trend. This trend-based analytics is beneficial to minimize the downtime and improve the performance of the network services, but organizations use different network management tools to understand and visualize the network traffic with limited abilities to dynamically optimize the network. This research focuses on the development of an intelligent system that leverages big data
telemetry analysis in Platform for Network Data Analytics (PNDA) to enable comprehensive trendbased networking decisions. The results include a graphical user interface (GUI) done via a web application for effortless management of all subsystems, and the system and application developed in
this research demonstrate the true potential for a scalable system capable of effectively benchmarking the network to set the expected behavior for comparison and trend analysis. Moreover, this research provides a proof of concept of how trend analysis results are actioned in both a traditional network and a software-defined network (SDN) to achieve dynamic, automated load balancing.
TREND-BASED NETWORKING DRIVEN BY BIG DATA TELEMETRY FOR SDN AND TRADITIONAL N...ijngnjournal
Organizations face a challenge of accurately analyzing network data and providing automated action
based on the observed trend. This trend-based analytics is beneficial to minimize the downtime and
improve the performance of the network services, but organizations use different network management
tools to understand and visualize the network traffic with limited abilities to dynamically optimize the
network. This research focuses on the development of an intelligent system that leverages big data
telemetry analysis in Platform for Network Data Analytics (PNDA) to enable comprehensive trendbased networking decisions. The results include a graphical user interface (GUI) done via a web
application for effortless management of all subsystems, and the system and application developed in
this research demonstrate the true potential for a scalable system capable of effectively benchmarking
the network to set the expected behavior for comparison and trend analysis. Moreover, this research
provides a proof of concept of how trend analysis results are actioned in both a traditional network and
a software-defined network (SDN) to achieve dynamic, automated load balancing.
PERFORMANCE PREDICTION OF 5G: THE NEXT GENERATION OF MOBILE COMMUNICATIONijngnjournal
The 5G standard is a mobile communication of the 5th generation, which presupposes an increase of the information exchange speed up to 10 Gbit/s. It is 30 times quicker than the speed of 4G network. It is a new stage in the development of technologies connecting society. This standard will provide an unlimited access to the network for individual users and devices. When developing the 5G standard, the advanced opportunities of LTE and HSPA, as well as other technologies of a radio access focused on the solution of specific objectives are considered. The main advantage of the mass introduction of the 5G communication development represents the so-called Internet of Things (IoT). There the devices and not people will be the main consumers of traffic. The functional requirements of5G networks, their speed, and its traffic parameters for HD video services and massifs of M2M-devices are analyzed in the paper. They will have been the most demandedones by 2020.
PERFORMANCE EVALUATION OF VERTICAL HARD HANDOVERS IN CELLULAR MOBILE SYSTEMSijngnjournal
With the rapid increase of new and diverse cellular mobile services, the overlapping of cells has become typical in the majority of the coverage area of the network. Vertical handovers occur between two layers of cells when a user is switched from one layer to the other. In this paper we investigate the influence of network parameters on vertical hard handover performance in a cell environment. The work considers two layers of cells: a layer of macrocells and a layer of microcells. Handover requests enter the macrocell from neighbor macrocells and from microcells that belong to a different layer. Using Markov chain analysis and simulation we calculate network performance parameters such as mean queue delay, handover dropping probability and channel utilization. We also compare the handover performance for the macrocell and macrocell traffic separately. Our results show the influence of total channels, maximum queue size and handover request arrival rate on handover performance. They also show that when the traffic from each layer is treated with equal priority in the system, the performance of each layer is comparable.
PERFORMANCE EVALUATION OF VERTICAL HARD HANDOVERS IN CELLULAR MOBILE SYSTEMSijngnjournal
With the rapid increase of new and diverse cellular mobile services, the overlapping of cells has become typical in the majority of the coverage area of the network. Vertical handovers occur between two layers of cells when a user is switched from one layer to the other. In this paper we investigate the influence of network parameters on vertical hard handover performance in a cell environment. The work considers two layers of cells: a layer of macrocells and a layer of microcells. Handover requests enter the macrocell from neighbor macrocells and from microcells that belong to a different layer. Using Markov chain analysis and simulation we calculate network performance parameters such as mean queue delay, handover dropping probability and channel utilization. We also compare the handover performance for the macrocell and macrocell traffic separately. Our results show the influence of total channels, maximum queue size and handover request arrival rate on handover performance. They also show that when the traffic from each layer is treated with equal priority in the system, the performance of each layer is comparable.
COMPARISON OF RADIO PROPAGATION MODELS FOR LONG TERM EVOLUTION (LTE) NETWORKijngnjournal
This paper concerns about the radio propagation models used for the upcoming 4th Generation (4G) of cellular networks known as Long Term Evolution (LTE). The radio wave propagation model or path loss model plays a very significant role in planning of any wireless communication systems. In this paper, a comparison is made between different proposed radio propagation models that would be used for LTE, like Stanford University Interim (SUI) model, Okumura model, Hata COST 231 model, COST Walfisch-Ikegami & Ericsson 9999 model. The comparison is made using different terrains e.g. urban, suburban and rural area.SUI model shows the lowest path lost in all the terrains while COST 231 Hata model illustrates highest path loss in urban area and COST Walfisch-Ikegami model has highest path loss for suburban and rural environments.
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...ijngnjournal
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The objective of any routing protocol is to have packet delivered with least possible cost in terms of receiving power, transmission power, battery energy consumption and distance. All these factors basically effect the establishment of link between the mobile nodes and liability and stability of these links. In this paper, we implement a data link quality scheme on two protocols ODMRP and ADMR and compare them on the bases link quality and link stability.
The Performance of a Cylindrical Microstrip Printed Antenna for TM10 Mode as...ijngnjournal
A temperature is one of the parameters that have a great effect on the performance of microstrip antennas for TM10 mode at 2.4 GHz frequency range. The effect of temperature on a resonance frequency, input impedance, voltage standing wave ratio, and return loss on the performance of a cylindrical microstrip printed antenna is studied in this paper. The effect of temperature on electric and magnetic fields are also studied. Three different substrate materials RT/duroid-5880 PTFE, K-6098 Teflon/Glass, and Epsilam-10 ceramic-filled Teflon are used for verifying the new model.
Optimization of Quality of Service Parameters for Dynamic Channel Allocation ...ijngnjournal
As the spectrum for wireless transmission gets crowded due to the increase in the users and applications, the efficient use of the spectrum is a major challenge in today’s world. A major affecting factor is the inefficient usage of the frequency bands. Interference in the neighboring cells affects the reuse of the frequency bands. In this paper, some of the quality of service parameters such as residual bandwidth, number of users, duration of calls, frequency of calls and priority are considered. This paper presents work based on the optimization of dynamic channel allocation using genetic algorithm (GA). This attempts to allocate the channel to users such that overall congestion in the network is minimized by reusing already allocated frequencies. The working of Genetic Algorithm which is used in the optimization procedure is also explained. The optimized channel is then compared with a non-optimized channel to check the efficiency of the genetic algorithm.
PURGING OF UNTRUSTWORTHY RECOMMENDATIONS FROM A GRIDijngnjournal
In grid computing, trust has massive significance. There is lot of research to propose various models in providing trusted resource sharing mechanisms. The trust is a belief or perception that various researchers have tried to correlate with some computational model. Trust on any entity can be direct or indirect. Direct trust is the impact of either first impression over the entity or acquired during some direct interaction. Indirect trust is the trust may be due to either reputation gained or recommendations received from various recommenders of a particular domain in a grid or any other domain outside that grid or outside that grid itself. Unfortunately, malicious indirect trust leads to the misuse of valuable resources of the grid. This paper proposes the mechanism of identifying and purging the untrustworthy recommendations in the grid environment. Through the obtained results, we show the way of purging of untrustworthy entities.
A SURVEY ON DYNAMIC SPECTRUM ACCESS TECHNIQUES FOR COGNITIVE RADIOijngnjournal
Cognitive radio (CR) is a new paradigm that utilizes the available spectrum band. The key characteristic of CR system is to sense the electromagnetic environment to adapt their operation and dynamically vary its radio operating parameters. The technique of dynamically accessing the unused spectrum band is known as Dynamic Spectrum Access (DSA). The dynamic spectrum access technology helps to minimize unused spectrum bands. In this paper, main functions of Cognitive Radio (CR) i.e. spectrum sensing, spectrum management, spectrum mobility and spectrum sharing are discussed. Then DSA models are discussed along with different methods of DSA such as Command and Control, Exclusive-Use, Shared Use of Primary Licensed User and Commons method. Game-theoretic approach using Bertrand game model, Markovian Queuing Model for spectrum allocation in centralized architecture and Fuzzy logic based method are also discussed and result are shown.
HYBRID LS-LMMSE CHANNEL ESTIMATION Technique for LTE Downlink Systemsijngnjournal
In this paper, we propose to improve the performance of the channel estimation for LTE Downlink systems under the effect of the channel length. As LTE Downlink system is a MIMO-OFDMA based system, a cyclic prefix (CP) is inserted at the beginning of each transmitted OFDM symbol in order to mitigate both intercarrier interference (ICI) and inter-symbol interference (ISI). The inserted CP is usually equal to or longer than the channel length. However, the cyclic prefix can be shorter because of some unforeseen channel behaviour. Previous works have shown that in the case where the cyclic prefix is equal to or longer than the channel length, LMMSE performs better than LSE but at the cost of computational complexity .In the other case, LMMSE performs also better than LS only for low SNR values. However, LS shows better performance for LTE Downlink systems for high SNR values. Therefore, we propose a hybrid LS-LMMSE channel estimation technique robust to the channel length effect. MATLAB Monte –Carlo simulations areused to evaluate the performance of the proposed estimator in terms of Mean Square Error (MSE) and Bit Error Rate (BER) for 2x2 LTE Downlink systems.
SERVICES AS PARAMETER TO PROVIDE BEST QOS : AN ANALYSIS OVER WIMAXijngnjournal
In this paper it is proposed to provide the QoS to the user by using the degradation of service under hostile environment being itself be a parameter to improve the QoS. Here the relation between the service and environment of its best performance drawn on the basis of simulation and analysis .The service then taken as a parameter to decide present environment of the user and to take measurable steps to improve the QoS either doing handover to nearby station or increasing power or to provide some marginal bandwidth etc.All analysis done over a WiMax network i.e. being designed and simulated using the Qualnet wireless simulator.
ENSURING QOS GUARANTEES IN A HYBRID OCS/OBS NETWORKijngnjournal
The bursting aggregation assembly in edge nodes is one of the key technologies in OBS (Optical Burst Switching) network, which has a direct impact on flow characteristics and packet loss rate. An optical burst assembly technique supporting QoS is presented through this paper, which can automatically adjust the threshold along with the increasing and decreasing volume of business, reduce the operational burst, and generate corresponding BDP (Burst Data Packet) and BCP (Burst Control Packet). In addition to the burst aggregation technique a packet recovery technique by restoration method is also described. The data packet loss due to the physical optical link failure is not currently included in the QoS descriptions. This link failure is also a severe problem which reduces the data throughput of the transmitter node. A mechanism for data recovery from this link failure is vital for guaranteeing the QoS demanded by each user. So this paper will also discusses a specific protocol for reducing the packet loss by utilizing the
features of both optical circuit switching (OCS) and Optical Burst switching (OBS) techniques
SECURITY ANALYSIS AND DELAY EVALUATION FOR SIP-BASED MOBILE MASS EXAMINATION ...ijngnjournal
IP Multimedia Subsystem (IMS) is considered to be one of the important features in Mobile Next Generation Networks (MNGN). It adds value to the mobile services and applications by integrating mobile network resources, such as location, billing and authentication. This is achieved by enabling a third party access to network resources. In previous work [1] we have presented a testbed to be used as platform for testing mobile application prior to actual deployment. We have chosen a novel IMS based MObile Mass EXamination (MOMEX) system to showcase the benefit of designing an IMS based mobile application. We identify two aspects essential to of the application namely security threats and delay analysis. In this paper we identify MOMEX security threats and suggest strategies to mitigate system vulnerabilities. We then
evaluate the performance of MOMEX system in terms of delay and security threats and vulnerabilities. The results presented show system performance limitation and tradeoffs.
OPTIMIZATION OF QOS PARAMETERS IN COGNITIVE RADIO USING ADAPTIVE GENETIC ALGO...ijngnjournal
Genetic algorithm based optimization rely on explicit relationships between parameters, observations and criteria. GA based optimization when done in cognitive radio can provide a criteria to accommodate the secondary users in best possible space in the spectrum by interacting with the dynamic radio environment at real time. In this paper we have proposed adaptive genetic algorithm with adapting crossover and mutation parameters for the reasoning engine in cognitive radio to obtain the optimum radio configurations. This method ensure better controlling of the algorithm parameters and hence the increasing the performance. The main advantage of genetic algorithm over other soft computing techniques is its multi – objective handling capability. We focus on spectrum management with a hypothesis that inputs are provided by either sensing information from the radio environment or the secondary user. Also the QoS requirements condition is also specified in the hypothesis. The cognitive radio will sense the radio frequency parameter from the environment and the reasoning engine in the cognitive radio will take the required decisions in order to provide new spectrum allocation as demanded by the user. The transmission parameters which can be taken into consideration are modulation method, bandwidth, data rate, symbol rate, power consumption etc. We simulated cognitive radio engine which is driven by genetic algorithm to determine the optimal set of radio transmission parameters. We have fitness objectives to guide one system to an optimal state. These objectives are combined to one multi – objective fitness function using weighted sum approach so that each objective can be represented by a rank which represents the importance of each objective. We have transmission parameters as decision variables and environmental parameters are used as inputs to the objective function. We have compared the proposed adaptive genetic algorithm (AGA) with conventional genetic algorithm (CGA) with same set of conditions. MATLAB simulations were used to analyze the scenarios
HIGH PERFORMANCE ETHERNET PACKET PROCESSOR CORE FOR NEXT GENERATION NETWORKSijngnjournal
As the demand for high speed Internet significantly increasing to meet the requirement of large data transfers, real-time communication and High Definition ( HD) multimedia transfer over IP, the IP based network products architecture must evolve and change. Application specific processors require high
performance, low power and high degree of programmability is the limitation in many general processor based applications. This paper describes the design of Ethernet packet processor for system-on-chip (SoC) which performs all core packet processing functions, including segmentation and reassembly, packetization classification, route and queue management which will speedup switching/routing performance making it
more suitable for Next Generation Networks (NGN). Ethernet packet processor design can be configured for use with multiple projects targeted to a FPGA device the system is designed to support 1/10/20/40/100 Gigabit links with a speed and performance advantage. VHDL has been used to implement and simulated the required functions in FPGA
ESTIMATION AND COMPENSATION OF INTER CARRIER INTERFERENCE IN WIMAX PHYSICAL L...ijngnjournal
WiMAX is Wireless Interoperability for Microwave Access has emerged as a promising solution for transmission of higher data rates for fixed and mobile applications. IEEE 802.16d and e are the standards proposed by WiMAX group for fixed and mobile. As the wireless channel have so many limitation Such as Multipath, Doppler spread, Delay spread and Line Of Sight (LOS)/Non Line Of Sight (NLOS) components. To attain higher data rates the Multi Carrier System with Multiple Input and Multiple Output (MIMO) is incorporated in the WiMAX. The Orthogonal Frequency Division Multiplexing (OFDM) is a multi carrier technique used with the WiMAX systems. In OFDM the available spectrum is split into numerous narrow band channels of dissimilar frequencies to achieve high data rate in a multi path fading environment. And all these sub carriers are considered to be orthogonal to each other. As the number of sub carriers is increased there is no guarantee of sustained orthogonality, i.e. at some point the carriers are not
independent to each other, and hence where the orthogonality can be loosed which leads to interference and also owing to the synchronization between transmitter and receiver local oscillator, it causes interference known as Inter Carrier Interference (ICI). The systems uses MIMO-OFDM will suffer with the effects of ICI and Carrier Frequency Offset (CFO) “ε”. However these affect the power leakage in the midst of sub carriers, consequently degrading the system performance. In this paper a new approach is proposed in order to reduce the ICI caused in WiMAX and improve the system performance. In this scheme at the transmitter side the modulated data and a few predefined pilot symbols are mapped onto the non
neighboring sub carriers with weighting coefficients of +1 and -1. With the aid of pilot symbols the frequency offset is exactly estimated by using Maximum Likelihood Estimation (MLE) and hence can be minimized. At demodulation stage the received signals are linearly combined along with their weighted
coefficients and pilot symbols, called as Pilot Aided Self Cancellation Method (PASCS). And also to realize the various wireless environments the simulations are carried out on Stanford University Interim (SUI) channels. The simulation results shows that by incorporating this method into WiMAX systems it performs better when the Line Of Sight (LOS) component is present in the transmission and also it improves the Bit Error Rate (BER) and Carrier to Interference Ratio (CIR). The CIR can be improved 20 dB. In this paper the effectiveness of PASCS scheme is compared with the Self Cancellation Method (SCM). It provides accurate estimation of frequency offset and when residual CFO is less significant the ICI can be diminished successfully.
OPTIMUM EFFICIENT MOBILITY MANAGEMENT SCHEME FOR IPv6 ijngnjournal
Mobile IPv6 (MIPv6) and Hierarchical Mobile IPv6 (HMIPv6) both are the mobility management solutions proposed by the Internet Engineering Task Force (IETF) to support IP Mobility. It’s been an important issue, that upon certain condition, out of MIPv6 and HMIPv6 which one is better. In this paper an Optimum Efficient Mobility Management (OEMM) scheme is described on the basis of analytical model which shows that OEMM Scheme is better in terms of performance and applicability of MIPv6 and HMIPv6. It shows that which one is better alternative between MIPv6 and HMIPv6 and if HMIPv6 is adopted it chooses the best Mobility Anchor Point (MAP). Finally it is illustrated that OEMM scheme is
better than that of MIPv6 and HMIPv6.
INVESTIGATION OF UTRA FDD DATA AND CONTROL CHANNELS IN THE PRESENCE OF NOISE ...ijngnjournal
In this paper, the main aim is to design and simulate UTRA FDD control channel in the presence of noise and wireless channel by using FDD library/Matlab box set that can be used to design and implement some
systems. Moreover, a test and verification of the library is achieved with different channel models such as Additive White Gaussian Noise (AWGN), fading and moving channel models. FDD library are employed to design whole transmitter and receiver. Then we had tested AWGN channel and some other channel models.
Also we illustrated what are control channels DCCH and the other one as understanding the whole system. Moreover, the standards have been covered as well as implemented the whole transmit and receive chain plus the generation of DPCH, DPCCH channel. we had tested the performance against the AWGN noise.
Then we have studied different channel models that are defined in the standard, used the few of them like the fading channel and moving channel. We have tried to compare the performance in terms of Monte Carlo simulation by producing the BER curves. We have also change some channel parameters like phase, number of multipaths and we have tried to see the performance of the model in the presence of actual channel model.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Water Industry Process Automation and Control Monthly - May 2024.pdf
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORK
1. International Journal of Next-Generation Networks (IJNGN) Vol.8, No.1, March 2016
DOI : 10.5121/ijngn.2016.8102 13
SIMULATION BASED ANALYSIS OF CLUSTER-BASED
PROTOCOL IN WIRELESS SENSOR NETWORK
Tarun Sharma1, Harsukhpreet Singh2, Anurag sharma3
Dept” of Computer Science & Engineering, CT Institute of Technology & Research1
Dept” of Electronics & Communication Engineering, CT Institute of Technology &
Research 2,3,Jalandhar, Punjab,India1,2,3
ABSTRACT
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
KEYWORDS
Wireless sensor networks, energy efficiency, Clustering, LEACH protocol
1. INTRODUCTION
A wireless sensor network is complete up of a huge quantity of sensor nodes and a sink [2]. The
WSN is self-confident of sensor nodes from hundreds or thousands and every node is coupled to
one sensor nodes. A wireless sensor network entire up of a large number of nodes extend over a
precise area. A sensor node self-confident of the sensor, actuators, memory, a mainframe and
they do have communication aptitude. All the sensor nodes are permitted to communicate in the
course of a wireless intermediary. The wireless standard is of infrared, radio frequency that
having no wired tie friendly. So the sensor nodes are deployed in a random conduct and it make
ad-hoc network because they can discuss themselves [1]. If the node is unable to converse with
other nodes of the network through a direct link, it means the node is out of range. In such
kind of networks data broadcast from one node to another is perform via in the middle of
nodes. This idea is referred as multi- hoping. All sensors nodes work helpfully to serve the
requests [4].
1.1Energy Consumption Issues
The chief complicatedness in WSN, sensor node have classified battery life because the sensor
nodes size is small so battery size, processor, storage liberty for data, these all are small as sensor
nodes. So the main central point on lessening energy expenses in wireless sensor networks. In
2. International Journal of Next-Generation Networks (IJNGN) Vol.8, No.1, March 2016
14
WSN a package of sensed information and routing in order has to be send which after have some
time constraint so that information can be employable before any disaster occurs e.g.
manufacturing monitoring, apparatus Monitoring etc. In WSN the power authority utilization is
much better-quality data communication then internal processing. So, Energy preservation in
WSN is the need to the address [3]. The Wireless sensor is flat to node stop working due to
power hitting. In order to supply a reliable examine through a network, the network should be
celebrity adjusting and must have elastic properties as requisite from point in time to time. A
classified contact node may meet failure due to imperfect battery subsistence. In such case the
network protocol should be logical enough to such collapse to keep the network organized many
techniques are proposed for energy concession, clustering is single of them. The cluster heads
are voted periodically such that members of a cluster can converse with their cluster heads. These
cluster heads send data documented from its members to a base station. The multi-clustering
can also be used. The cluster head should have to be rotated for the complementary of energy
and then there will be an equal heaviness on every node. The energy expenditure can be strong
[3]. Energy plays a vital task in wireless sensor networks because nodes are battery operated.
Therefore numerous protocols have been proposed in order to diminish the energy consumption
of these nodes such as LEACH [6], PAMAS [5].
LEACH is conscious as the most fashionable routing protocol that exploit cluster based
routing in order to weaken the energy consumption, in this paper suggest a development on
the LEACH protocol that supplementary recover the power consumption, simulation results
express out that our protocol outperforms LEACH protocol in term of energy consumption
and overall throughput. LEACH is “Low Energy Adaptive Clustering Protocol” [10]. LEACH
form clusters and selects randomly cluster Heads for each cluster. Non- cluster heads sense the
data and broadcast this data to cluster head, and then cluster head combined the data and forward
this data to sink. The principle of this protocol is that it assigns overall energy consumption of the
network uniformly to each node by selecting periodically different nodes as a cluster head. There
are two phases of LEACH that are Setup phase and Steady state phase. In set up phase, clusters
are shaped and cluster heads are chosen. In steady state phase, data from non-cluster heads is
transmitted to sink. The sensor nodes communicate with cluster heads with allotted time using
TDMA. Cluster heads are arbitrarily chosen in each round. LEACH operation is divided into
several rounds. Each round begins with set-up phase. In this clusters are structured. LEACH set a
threshold value T(n) and then sensor node I generate a random number between 0 and 1. If the
random number is < T(n), the node will become cluster head for the current round and ordinary
nodes link the cluster and become cluster members [6].
T (n) = p/1-p ×( r mod p-1 )
p is a probability of node to be selected as a cluster head, r is a number of rounds passed, G is a
selection of ordinary nodes. Once a node become cluster head never become cluster head once
more, only the node which have not become the cluster head and have elevated energy can
become cluster head at r+1.When cluster head assigns time slots to the members using TDMA
then it shifted to the steady state phase. After a shift in steady-state phase, members sent data
to cluster heads; cluster head procedure the data and then send data sequence to the base station.
After this round, it turn to next round and begin reconstruction new round. compensation of
LEACH are that LEACH is completely distributed. LEACH does not necessitate the control
information from the base station and the nodes do not require information of the global network
in order for LEACH to work. LEACH reduces communication energy by 8 times as contrast to
straight broadcast and smallest amount transmission energy routing. Disadvantages of LEACH
are that the cluster heads are chosen arbitrarily. So the distribution of cluster heads cannot be
ensured. In this protocol, the nodes with low energy have the same precedence as the nodes
having high energy and nodes having low energy can become cluster heads [10].
3. International Journal of Next-Generation Networks (IJNGN) Vol.8, No.1, March 2016
15
In section ii presents the connected works, In section iii initiate problem formulation, In
section iv Simulation Setup, In section v result and discussion and section vi conclude the paper.
Figure1: LEACH protocol Architecture
2. LITERATURE REVIEW
A majority beneficial energy-saving spare organization, including spare collection and
named it LEACH-SM protocol (modified form of prominent LEACH protocol) was deliberate
by Baker B. et al.; (2014).In this author available a quantitative difference of energy
consumption and WSN lifetime for both mentioned protocols [6].
Genetic algorithm and optimization of LEACH protocol that are worn on LEACH protocol and
compare both domino effect on the basis of rounds that was discussed by Yadav S. et al.;
(2014). This comparison was based on optimal thresholding probability for cluster structure.
Finally, after comparison finds LEACH- GA method outperforms MTE, DT and LEACH in terms
of network lifetime, use for optimal vigor- efficient clustering [11].
The two significant clustering protocols, namely LEACH and LEACH-C (centralized), using
NS2 tool for numerous chosen scenarios, and study of simulation results against chosen
performance metrics with latency and network lifetime was planned by Nayak P.et al.;
(2014). As a conclusion of surveillance from results, it can be mentioned that LEACH can be
favored if restricted harmonization of nodes in clustering without involving to BS is of tall
priority than other factors like declaration over the desired number of clusters etc.; and LEACH-
C can be designated when centralized and deterministic approach jacket complete network is
unsurprising still bringing in enlarged network lifetime and desired number of clusters [7].
The tailored version of LEACH protocol called V-LEACH protocol and the contrast of LEACH
protocol with V-LEACH protocol was designed by Alhawat A. et al.;(2013). from the
simulation results were, first the numeral of busy nodes is more than the unique LEACH.
Second the figure of dead nodes is less than the unique LEACH protocol. Network life-time is
enlarged by 49.37% then original LEACH [6].
4. International Journal of Next-Generation Networks (IJNGN) Vol.8, No.1, March 2016
16
Energy-LEACH protocol improves the CH selection procedure. It makes the lingering energy of
nodes as the major metric which decides whether the nodes twist into CH or not after the first
round. It same as LEACH protocol was projected by Xianging F. et al. ;( 2007). E-LEACH is
alienated into rounds, in the first round, every node has the alike likelihood to turn into CH, that
mean nodes are randomly chosen as CHs, In the next rounds, the left behind energy of
each node is dissimilar after one round e-mail and taken into account for the collection of the
CHs. That mean nodes have extra energy will develop into a CHs rather than nodes with fewer
energy [6].
A novel version of LEACH called two-level LEACH was planned by Loscri V. In this protocol,
CH collects data from other cluster members as exclusive LEACH, but rather than transport data
to the BS openly, it uses one of the CHs that mendacity between the CH and the BS as a transmit
station [8].
In LEACH, each CH straight communicates with BS no matter the distances between CH and BS
It will guzzle a lot of its energy if the distance is distant. So conquer this drawback multihop-
LEACH protocol was proposed by Zhou H. It selects a best possible path between the CH and
the BS through other CHs and use these CHs as a relay station to televise data over through them
[6].
3. PROBLEM FORMULATION
In this work, LEACH protocol has been worn for clustering in which cluster heads are preferred
on the basis of distance and energy.
• In LEACH protocol Cluster head straight communiqué with BS no matter the distance
between Cluster head and the base station; it will use a group of its energy if the distance
is far [13].
• Due to far distance packet does not arrive at the destination because CHs straight
communicate with sink there is no inter-cluster communication, and this needs high
trans-mission power due to this node dies earlier before transmission.
4. SIMULATION SET UP
In this section, we evaluate the performance of LEACH protocol using NS2 tool. NS2 is used as
simulation podium. NS is a distinct event simulator, where the go forward of time depends on the
timing of events which are preserve by the scheduler. NS simulator is depending on two
languages: C++, and an OTcl (an object-oriented tool command language).
5. International Journal of Next-Generation Networks (IJNGN) Vol.8, No.1, March 2016
17
Table 1: NS-2 simulation parameters
Parameter settings
Simulation Area 500*500 meters
No of nodes 41
Channel Type Channel/wireless
Antennae model Antenna/omni antenna
Energy model battery
Interface queue Type Queue/Droptail/Priqueue
Link layer type LL
Initial energy 100
Routing protocol AODV
Traffic Source CBR
Type of MAC IEEE 802.11
Packet size 1000 bytes
The C++ defines the interior instrument of the simulation objects, the OTcL sets up simulation
by assembling and configuring the objects and scheduling discrete events. The OTcL are linked
together using TclCL [12]. The experiments are performed with a diverse number of nodes
placed in a 500m *500m field. Each sensor nodes is assumed to have an initial energy of 100
joules. The general simulation parameters are
To evaluate the performance of LEACH protocol using parameters such as Energy consumption,
Packet loss, End to End delay, Throughput and control overhead. Figure 2, shows energy
consumption graph, in this graph 100 joules energy is to be addicted in 10 seconds because
every cluster heads in LEACH protocol immediately communication with BS no stuff the
distance between Cluster head and the base station; it will use a lot of its energy if the
remoteness is far [13]. In figure 3, shows the packet loss graph, In this graph 16 number of the
packet is lost in 10 seconds because in LEACH protocol CHs minter cluster communication, and
this needs high trans-mission power due to this node dies earlier before transmission, packet does
not reach the destination [14,15].
In Figure 4, shows End to End Delay graph, in this graph to increase the time delay is high due
to high overhead which is a limitation of LEACH protocol [16]. In Figure 5, shows the
throughput graph, in this graph 12 packet delivered in 10 seconds because due to high packet
loss, delay, and control overhead so that the overall efficiency of the network is decreased [16].
In Figure 6, shows the control overhead. In this graph overhead is giant because in LEACH
protocol extra overheads due to cluster head change and calculation leading to energy
incompetence for dynamic clustering in large networks [17].
6. International Journal of Next-Generation Networks (IJNGN) Vol.8, No.1, March 2016
18
Figure 2: Energy consumption graph of LEACH Protocol
Figure 3: packet losses graph of LEACH protocol
7. International Journal of Next-Generation Networks (IJNGN) Vol.8, No.1, March 2016
19
Figure 4 : End to End Delay of LEACH protocol
Figure 5:Throughput graph of LEACH protocol
8. International Journal of Next-Generation Networks (IJNGN) Vol.8, No.1, March 2016
20
Figure 6: Control overhead in LEACH protocol
6. CONCLUSION AND FUTURE WORK
The conclusion of this paper is to apply and evaluate the performance of LEACH protocol
using QoS parameters such as energy consumption, packet loss, End-to End-Delay, Throughput,
and Control Overhead. The energy consumption of LEACH is very high because each cluster
heads straight communiqué with BS no material the distance between Cluster head and the base
station; it will use a group of its energy if the remoteness is far. Due to far distance packet does
not arrive at the sink, packet loss problem is occurred so the overall performance of the
networks is decreased. With the outcome obtained in this paper, a further issue worthy of
consideration with RFID protocol can be done named as R- LEACH protocol. The design system
can be extended using R-LEACH protocol; Of course, since we have focused only on LEACH
protocol in this paper, the diagnosis can be done using R- LEACH protocol. We would like to
consider these issues in subsequent work.
ACKNOWLEDGEMENT
I hereby acknowledge that the above-referred work is my own research work and I am entirely
responsible for any kind of misuse of material. I thank my mentor Er. Harsukh Singh to guide
and encourage me and for putting all her valuable time for me to get the desired output.
9. International Journal of Next-Generation Networks (IJNGN) Vol.8, No.1, March 2016
21
REFERENCES
[1] S. Pant, N. Chauhan,P. Kumar, “Effective Cache based Policies in Wireless Sensor Networks:
A Survey,” International. Journal of Computer Application., vol. 11, no. 10, pp. 17–21, 2010.
[2] I. Akyildiz, W. Su, Y. Sankarasubramaniam,E. Cayirci, “Wireless sensor networks: a survey,”
Comput. Networks, vol. 38, pp. 393–422, 2002.
[3] D. Zhang, G. Li, K. Zheng, X. Ming, Z. H. Pan, “An energy-balanced routing method based on
forward-aware factor for wireless sensor networks,” IEEE TRANSACTIONS ON INDUSTRIAL
INFORMATICS, vol. 10, no. 1, pp. 766–773,2014.
[4] L. Jian-qi, C. Bin-fang, W. Li, W. Wen-Hu, “Energy optimized approach based on clustering routing
protocol for wireless sensor networks,” 2013 25th Chinese Control Decision. Conference, pp. 3710–
3715, 2013.
[5] S. Singh and C. S. Raghavendra, “PAMAS---power aware multi-access protocol with
signalling for ad hoc networks,” ACM SIGCOMM Computer. Communication. Review., vol. 28,
pp. 5–26, 1998.
[6] Yassein, “Improvement on LEACH Protocol of Wireless Sensor Network (VLEACH),” International.
Journal of Digital Content Technology and its Application, vol. 3, pp. 132–136, 2009.
[7] P. Nayak and D. Ph, “Comparison of Routing Protocols in WSN using NetSim Simulator : LEACH
Vs LEACH-C,” vol. 106, no. 11, pp. 1–6, 2014.
[8] A. Kaur and A. Grover, “LEACH and Extended LEACH Protocols in Wireless Sensor
Network-A Survey,” International. Journal of Computer Application vol. 116, no. 10, pp. 1–5, 2015.
[9] D. Xu and J. Gao, “Comparison Study to Hierarchical Routing Protocols in Wireless Sensor
Networks,” Procedia Environmental Science,Elsevier, vol. 10, pp. 595–600, 2011.
[10] S. Yadav and S. S. Yadav, “Review for Leach Protocol in WSN,” International Journal of Recent
Development in Engineering and Technology vol. 2, no 6, pp. 69–71, 2014.
[11] A. Ahlawat and V. Malik, “An extended vice-cluster selection approach to improve v leach protocol
in WSN,” 3rd Third International Conference on Advanced Computing & Communication
Technologies, ACCT, pp. 236–240, 2013.
[12] N. Singh, P. Rajeshwar, L. Dua, and V. Mathur, “Network Simulator NS2-2 .35,” International
Journal of Advanced Research in Computer Science and Software Engineering vol. 2, no. 5, pp. 224–
228, 2012.
[13] R. Ramesh, R. M. D. Charaan, N. T. M. Kumar, and E. Uma, “Implementation of Load Balancing in
Leach Protocol for Wireless Sensor Networks,”2nd international conference on emerging trends in
Engineering and technology,London(U.K) , pp. 80–84, 2014.
[14] R. Kumar, “Analysis and Enhancement of Adaptive Packet Technique in Wireless Sensor Network,”
vol. 24, no. 5, pp. 227– 230, 2015.
[15] Gagandeep kaur , poonam arora, “To Reduce the Packet Collision by Using Adaptive Technique in
WSN, International Journal of Advanced Research in Electrical Electronics
andInstrumentationEngineering” Vol. 3, pp. 11336–11341, 2014.
[16] L. Y. Barai, “Performance Evaluation of LEACH Protocol for Wireless Sensor Network,” vol. 1, no.
6, pp. 141–145, 2014.
[17] Singh S. & Singh G., “A Noble Routing Protocol for Vehicular Adhoc Networks with Less
RoutingOverheads,”International Journal of Future Generation Communication and Networking,
Vol. 7, no.5,pp23-34,2014.