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
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.
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
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
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.
A QoI Based Energy Efficient Clustering for Dense Wireless Sensor Networkijassn
In a wireless sensor network Quality of Information (QoI), Energy Efficiency, Redundant data avoidance,
congestion control are the important metrics that affect the performance of wireless sensor network. As
many approaches were proposed to increase the performance of a wireless sensor network among them
clustering is one of the efficient approaches in sensor network. Many clustering algorithms concentrate
mainly on power Optimization like FSCH, LEACH, and EELBCRP. There is necessity of the above
metrics in wireless sensor network where nodes are densely deployed in a given network area. As the nodes
are deployed densely there is maximum possibility of nodes appear in the sensing region of other nodes. So
there exists an option that nodes have to send the information that is already reached the base station by its
own cluster members or by members of other clusters. This mechanism will affect the QoI, Energy factor
and congestion control of the wireless sensor networks. Even though clustering uses TDMA (Time Division
Multiple Access) for avoiding congestion control for intra clustering data transmission, but it may fail in
some critical situation. This paper proposed a energy efficient clustering which avoid data redundancy in a
dense sensor network until the network becomes sparse and hence uses the TDMA efficiently during high
density of the nodes.
Optimizing the Performance of I-mod Leach-PD Protocol in Wireless Sensor Netw...ijsrd.com
Wireless Sensor Networks (WSNs) is a networks of thousands of inexpensive miniature devices capable of computation, communication and sensing. WSN is being been attracting increasing interest for supporting a new generation of ubiquitous computing systems with great potential for many applications such as surveillance, environmental monitoring, health care monitoring or home automation. In the near future, wireless sensor network is expected to consists of thousand of inexpensive nodes, each having sensing capability with limited computational and communication power which enables to deploy large scale sensor networks. Large scale WSN is usually implemented as a cluster network. Clustering sensors into groups, so that sensors communicate information only to cluster-heads and then the cluster-heads communicate the aggregated information to the base station, saves energy and thus prolongs network lifetime. LEACH (Low Energy Adaptive Clustering Hierarchy) protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, how to adjust threshold based on the residual energy, and the measurement of energy required for transmission, based on the distance of cluster head from the base station, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of residual energy and required energy, and the time length of each round are deduced, thereby modifying the threshold value calculation. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.
Wireless sensor 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.
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
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
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.
A QoI Based Energy Efficient Clustering for Dense Wireless Sensor Networkijassn
In a wireless sensor network Quality of Information (QoI), Energy Efficiency, Redundant data avoidance,
congestion control are the important metrics that affect the performance of wireless sensor network. As
many approaches were proposed to increase the performance of a wireless sensor network among them
clustering is one of the efficient approaches in sensor network. Many clustering algorithms concentrate
mainly on power Optimization like FSCH, LEACH, and EELBCRP. There is necessity of the above
metrics in wireless sensor network where nodes are densely deployed in a given network area. As the nodes
are deployed densely there is maximum possibility of nodes appear in the sensing region of other nodes. So
there exists an option that nodes have to send the information that is already reached the base station by its
own cluster members or by members of other clusters. This mechanism will affect the QoI, Energy factor
and congestion control of the wireless sensor networks. Even though clustering uses TDMA (Time Division
Multiple Access) for avoiding congestion control for intra clustering data transmission, but it may fail in
some critical situation. This paper proposed a energy efficient clustering which avoid data redundancy in a
dense sensor network until the network becomes sparse and hence uses the TDMA efficiently during high
density of the nodes.
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.
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
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.
Low-energy adaptive clustering hierarchy ("LEACH") is a TDMA-based MAC protocol which is integrated with clustering and a simple routing protocol in wireless sensor networks (WSNs)
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.
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.
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.
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
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.
Low-energy adaptive clustering hierarchy ("LEACH") is a TDMA-based MAC protocol which is integrated with clustering and a simple routing protocol in wireless sensor networks (WSNs)
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.
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.
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.
O primeiro passo, para uma empresa que quer enfrentar o aquecimento global está na auto-avaliação de seus impactos destrutivos nos ecossistemas. Utilizar cada vez menos recursos naturais é o ponto de partida para uma atitude sustentável
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...CSCJournals
The objective of this paper is to develop a mechanism to increase the lifetime of homogeneous wireless sensor networks (WSNs) through minimizing long range communication, efficient data delivery and energy balancing. Energy efficiency is a very important issue for sensor nodes which affects the lifetime of sensor networks. To achieve energy balancing and maximizing network lifetime we divided the whole network into different clusters. In cluster based architecture, the role of aggregator node is very crucial because of extra processing and long range communication. Once the aggregator node becomes non functional, it affects the whole cluster. We introduced a candidate cluster head node on the basis of node density. We proposed a modified cluster based WSN architecture by introducing a server node (SN) that is rich in terms of resources. This server node (SN) takes the responsibility of transmitting data to the base station over longer distances from the cluster head. We proposed cluster head selection algorithm based on residual energy, distance, reliability and degree of mobility. The proposed method can save overall energy consumption and extend the lifetime of the sensor network and also addresses robustness against even/uneven node deployment.
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.
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.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...chokrio
The major challenge for wireless sensor networks is energy consumption minimization. Wireless transmission consumes much more of energy. In the clustered network, a few nodes become cluster heads which causes the energetic heterogeneity. Therefore the behavior of the sensor network becomes very unstable. Hence, the need to apply the balancing of energy consumption across all nodes of the heterogeneous network is very important to prevent the death of those nodes and thereafter increase the
lifetime of the network. DEEC (Distributed Energy Efficient Clustering) is one of routing protocols
designed to extend the stability time of the network by reducing energy consumption. A disadvantage of
DEEC, which doesn’t takes into account the cluster size and the density of nodes in this cluster to elect the
cluster heads. When multiple cluster heads are randomly selected within a small area, a big extra energy
loss occurs. The amount of lost energy is approximately proportional to the number of cluster heads in this
area. In this paper, we propose to improve DEEC by a modified energy efficient algorithm for choosing
cluster heads that exclude a number of low energy levels nodes due to their distribution density and their
dimensions area. We show by simulation in MATLAB that the proposed approach increases the number of
received messages and prolong the lifetime of the network compared to DEEC. We conclude by studying
the parameters of heterogeneity that proposed technique provides a longer stability period which increases
by increasing the number of nodes which are excluded from the cluster head selection.
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.
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.
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.
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.
Data Collection Method to Improve Energy Efficiency in Wireless Sensor NetworkKhushbooGupta145
Wireless Sensor Networks (WSNs) are generally self-organized wireless ad hoc networks which incorporate a huge number of sensor nodes which are resource constraint. Among the tasks of WSN, one most essential task is to collect the data
and transmits the gathered data to a distant base station (BS). The effectiveness of WSNs can be calculated in terms of network lifetime. Data collection is a frequent operation but analytical and critical operation in many WSN’s
application. To prolong network lifetime innovative technique that can improve
energy efficiency are highly required. This paper presents a survey for
designing Energy Efficient Data Collection Methods used for prolonging network lifetime in Wireless Sensor Network (WSN). The study highlights the importance of different Data conditions for various purposes like emergency response, medical monitoring, military applications, surveillance in volcanic or
remote regions, etc. Different Data Collection methods like data aggregation clusters, data aggregation trees, network coding, correlation dominating set etc. are considered in detail in this study. Furthermore, a comparison of different Data Collection Method based on the network lifetime, energy efficiency,
complexity of the algorithm, transmission cost and fusion cost is done.
Analysis of Packet Loss Rate in Wireless Sensor Network using LEACH ProtocolIJTET Journal
Abstract: Wireless sensor network (WSN) is used to collect and send various kinds of messages to a base station (BS). Wireless sensor nodes are deployed randomly and densely in a target region, especially where the physical environment is very harsh that the macro-sensor counterparts cannot be deployed. Low Energy Adaptive Clustering Hierarchical (LEACH) Routing protocol builds a process where it reduces the Packet Loss Rate from 100 % to 55% .Simulations are carried out using NS2 simulator.
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor NetworksCSCJournals
A wireless sensor network (WSN) consists of large number of sensor nodes where each node operates by a finite battery for sensing, computing, and performing wireless communication tasks. Energy aware routing and MAC protocols were proposed to prolong the lifetime of WSNs. MAC protocols reduce energy consumption by putting the nodes into sleep mode for a relatively longer period of time; thereby minimizing collisions and idle listening time. On the other hand, efficient energy aware routing is achieved by finding the best path from the sensor nodes to the Base Sta-tion (BS) where energy consumption is minimal. In almost all solutions there is always a tradeoff between power consumption and delay reduction. This paper presents an improved hierarchical coordination for data gathering (HCDG) routing schema for WSNs based on multi-level chains formation with data aggregation. Also, this paper provides an analytical model for energy consumption in WSN to compare the performance of our proposed HCDG schema with the near optimal energy reduction methodology, PEGASIS. Our results demonstrate that the proposed routing schema provides relatively lower energy consumption with minimum delay for large scale WSNs.
Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical issue that degrades the network performance. Recharging and providing security to the sensor devices is very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an important and suitable approach to increase energy efficiency and transmitting secured data which in turn enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC) works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all the cluster heads are formed at a time and selected on rotation based on considering the highest energy of the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access (CSMA), a contention window based protocol is used at the MAC layer for collision detection and to provide channel access prioritization to HWSN of different traffic classes with reduction in End to End delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the cluster head for transmission without depleting the energy. Simulation parameters of the proposed system such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing system.
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical
issue that degrades the network performance. Recharging and providing security to the sensor devices is
very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an
important and suitable approach to increase energy efficiency and transmitting secured data which in turn
enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC)
works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the
rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the
network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on
the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all
the cluster heads are formed at a time and selected on rotation based on considering the highest energy of
the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum
flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access
(CSMA), a contention window based protocol is used at the MAC layer for collision detection and to
provide channel access prioritization to HWSN of different traffic classes with reduction in End to End
delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the
cluster head for transmission without depleting the energy. Simulation parameters of the proposed system
such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing
system.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
Search and Society: Reimagining Information Access for Radical Futures
Dc31712719
1. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 1, January -February 2013, pp.712-719
Energy And Time Delay Efficient Wireless Sensor Network By
Least Spanning Tree Algorithm: A Survey
Priya1, Satyesh Sharan Singh2, Mukesh Kumar3, Rohini Saxena4,
1
PG Student ECE, SHIATS(Deemed-to-be-university), U.P., India,
2
PG Student ECE, SHIATS (Deemed-to-be-university), U.P., India,
3
Assistant professor, ECE, SHIATS (Deemed-to-be-university), U.P., India,
4
Assistant professor, ECE, SHIATS (Deemed-to-be-university), U.P., India,
Abstract
In this paper we are going to survey the use the available bandwidth and energy efficiently.
different type of topology and techniques for Energy usage is an important issue in the design of
making an energy efficient WSN with least time WSNs which typically depends on portable energy
delay approach .WSNs are used in defense field sources like batteries for power .WSNs is large scale
where lest time delay and life of sensors are most networks of small embedded devices, each with
important because the life of solider are depends sensing, computation and communication
on fast information transmission . Hence energy capabilities. They have been widely discussed in
and time delay are very scarce resources for such recent years. Coverage is one of the most important
sensor systems and has to be managed wisely in challenges in the area of sensor networks. Since the
order to extend the life of the sensors and energy of sensors are limited, it is vital to cover the
minimizing time delay for the duration of a area with fewer sensors. Generally, coverage in
particular mission. In past a lot of cluster based sensor networks is divided into area coverage, point
algorithm and techniques were used. In this coverage, and boundary coverage subareas.
paper we also find out all type of algorithm, Coverage does not ensure connectivity of nodes.. In
their application and limitation and present WSNs the sensor
techniques to overcome the problems of low nodes are often grouped into individual disjoint sets
energy and time delay of sensor and compare called a cluster, clustering is used in WSNs, as it
them with least spanning tree based algorithms provides network scalability, resource sharing and
and techniques . efficient use of constrained resources that gives
network topology stability and energy saving
Keywords: Wireless sensor networks, energy attributes. Clustering schemes offer reduced
efficient clustering, LEACH, energy efficient communication overheads, and efficient resource
algorithms, least spanning tree algorithm. allocations thus decreasing the overall energy
consumption and reducing the interferences among
1. INTRODUCTION sensor nodes. A large number of clusters will
Advances in sensor technology, low-power congest the area with small size clusters and a very
electronics, and low-power radio frequency (RF) small number of clusters will exhaust the cluster
design have enabled the development of small, head with large amount of messages transmitted
relatively inexpensive and low-power sensors, from cluster members. In this paper we are going to
called microsensors[1] The emerging of low power, survey different types of energy efficient and
light weight, small size and wireless enabled sensors coverage efficient wireless sensor network.
has encouraged tremendous growth of wireless
sensors for different application in diverse and 2. SURVEY
inaccessible areas, such as military, petroleum and 2.1 LEACH [Low Energy Adaptive Clustering
weather monitoring. These inexpensive sensors are Hierarchy][4] and Its Descendant
equipped with limited battery power and therefore One of the well known clustering protocols
constrained in energy [4]. One of the fundamental called LEACH[Low Energy Adaptive Clustering
problems in wireless sensor network is to maximize Hierarchy][2]. LEACH is a cluster-based protocol
network lifetime and time delay in data that includes distributed cluster formation in which
transmission. Network lifetime is defined as the the nodes elect themselves as cluster heads with
time when the first node is unable to send its data to some probability. The algorithm is run periodically
base station. Data aggregation reduces data traffic and the probability of becoming a cluster head for
and saves energy by combining multiple incoming each period is chosen to ensure that every node
packets to single packet when sensed data are highly becomes a cluster head at least once within 1/P
correlated. In a typical data gathering application, rounds, where P is the predetermined percentage of
each node sends its data to the base station, that can cluster heads. LEACH organizes its operation into
be connected via a wireless network. These rounds, where each round consists of a setup phase
constraints require innovative design techniques to where clusters are formed and a steady state phase
712 | P a g e
2. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 1, January -February 2013, pp.712-719
that consists of data communication process. determined. MS-Leach is based on the critical value.
LEACH provides significant energy savings and Simulation results clearly show that MS-Leach
prolonged network lifetime over conventional outperforms at most by 200% in term of network
multihop routing schemes, such as the Minimum lifetime. It is proposed as future work its
Transmission Energy (MTE)[2] routing protocol. relationship between multi-hop and single-hop
transmissions will be analyzed in-depth in various
2.1.1 LEACH-C [5] protocols and new mechanisms of routing will be
However, LEACH does not guarantee that developed.
the desired number of cluster heads is selected and
cluster heads are not evenly positioned across the
network. A further improvement of this protocol 2.1.5 LEACH-Heterogeneous [7]
known as LEACH-C[4]. In this paper, LEACH-HPR introduced an
In LEACH-C, the cluster formation is done energy efficient cluster head election method and
at the beginning of each round using a centralized using the improved Prim algorithm to construct an
algorithm by the base station. The base station uses inter-cluster routing in the heterogeneous WSN.
the information received from each node during the Simulation results show LEACH-HPR is more
setup phase to find a predetermined number of efficient to reduce and balance energy consumption
cluster heads and configures the network into and hence enhance the lifetime of WSN
clusters. The cluster groupings are then chosen to
minimize the energy required for non-cluster head 2.2 Power-Efficient Gathering in Sensor
nodes to transmit their data to their respective Information Systems [PEGASIS][8]
cluster heads. Results in[4] have shown that the Another clustering protocol which aims to
overall performance of LEACH-C is better than enhance the network lifetime is (PEGASIS)[5].
LEACH due to improved cluster formation by the Power-Efficient Gathering in Sensor Information
base station. Moreover, the number of cluster heads Systems (PEGASIS) uses a greedy algorithm to
in each round of LEACH-C is equal to the desired organize nodes into a chain, so that each node
optimal value, whereas for LEACH the number of transmits and receives from only one of its
cluster heads varies from round to round due to the neighbors. In each round, a randomly chosen node
lack of global coordination among nodes. from the chain will transmit the aggregated data to
the base station and reduce the number of nodes that
2.1.2 LEACH-Fixed on of cluster[6] communicate directly with the base station.
LEACH-F is an algorithm in which the
number of clusters will be fixed throughout the 2.3Hausdroff Clustering [16]
network lifetime and the cluster heads rotated within Authors considered that, once cluster
its clusters. Long term phase of LEACH-F is formations take place it’s remaining same
identical to that of LEACH. LEACH-F have some throughout the network lifetime. This algorithm
limitation because it may or may not be provided maximizes the lifetime of each cluster in order to
energy saving and this protocol does not provide the increase the life time of the system. Cluster life time
flexibility to sensor nodes mobility or sensor nodes can be enhanced by rotating the role of cluster heads
being removed or added from the sensor networks (CHs) among the nodes in the cluster. Cluster heads
selection basically based on the residual energy of
2.1.3 LEACH-Energy Threshold [6] the sensor nodes and it also used the proximity of
In this cluster will change only when one neighbors as a secondary criterion for enhancing
of the following conditions is satisfied: first, Energy energy efficiency and further prolong the network
consumed by anyone of the cluster head nodes lifetime. The Hausdroff clustering algorithm is
(CHs) reach energy threshold (ET) in one round. equally applicable for both uniform and nonuniform
Second, every sensor node should know the energy sensor node initial energy distribution.
threshold (ET) value. If in initial phase, anyone of
the cluster head nodes dies. If any sensor node acts 2.4 PDCH: Pegasis Algorithm Improving Based
as a cluster head node (CHs) in a certain round, it on Double Cluster Head [20]
should have the energy dissipated value and Authors proposed an algorithm based on
compares the dissipated value with the energy hierarchical chain topology and this algorithm using
threshold (ET) value. bottom level cluster head and super level cluster
head to improve the load balance. In the hierarchical
2.1.4 MS-LEACH [Multi-hop and Single hop- structure, base station (BS) is the center of a circle.
Low Energy Adaptive Clustering Hierarchy][6] The BS will predefine the number of levels and
In this paper the authors have analyzed the every node's distance to BS decided the level which
problem of energy consumption of the single-hop it belongs to. Every node receives the signal from
and multi-hop transmissions in a single cluster. the BS, then according to the signal strength to
Finally a critical value of the cluster area size is detect the distance to BS. PDCH outperform to
713 | P a g e
3. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 1, January -February 2013, pp.712-719
PEGASIS algorithm and it is also useful for large
networks.
2.5 Base station Controlled Dynamic Protocol
[BCDCP][9]
An approach called Base station Controlled
Dynamic Protocol (BCDCP)[7] is proposed which
produces clusters of equal size to avoid cluster head
overload and to ensure similar power dissipation of
nodes.
2.6 EECS: Energy Efficient Clustering Schemes
[12]
Authors proposed an algorithm in which
cluster formation is different from LEACH protocol.
In LEACH protocol cluster formation takes place on
the basis of a minimum distance of nodes to their
corresponding cluster head. In EECS, dynamic
sizing of clusters takes place which is based on
cluster distance from the base station. The results
are an algorithm that addresses the problem that
clusters at a greater distance from the sink requires
more energy for transmission than those that are
closer. Ultimately it provides equal distribution of
energy in the networks, resulting in network
lifetime. Thus main advantage of this algorithm is
the full connectivity can be achieved for a longer
duration. So we can say it provides reliable sensing
capabilities at a larger range of networks for a
longer period of time. It provides a 35 percent
improvement in network life time over LEACH
algorithm.
2.7 EEUC: Energy Efficient Unequal Clustering
[14]
This scheme is distance based scheme
similar to EECS and it also required that every node
has global identification such as its locations and
distances to the base station. Hotspot is the main
problem in WSNs because of multi hopping that
occurs when CHs closer to the sink tend to die faster
compare to another node in the WSNS, because they
relay much more traffic than remote nodes. This
algorithms partition the all nodes into clusters of
unequal size, and clusters closer to the sink have
smaller sizes than those farther away from the sink.
Thus cluster heads (CHs) closer to the sink can
conserved some energy for the inter-cluster data
forwarding. Energy consumed by cluster heads per
round in EEUC much lower than that of LEACH
standard but similar to HEED protocol.
2.8 BARC: Battery Aware Reliable Clustering
[15] Fig-1 Different types of cluster based technique
In this clustering algorithm authors used
mathematical battery model for implementation in
WSNs. With this battery model authors proposed a
new Battery Aware Reliable Clustering (BARC)
algorithm for WSNs. It improves the performance
over other clustering algorithms by using Z-MAC
714 | P a g e
4. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 1, January -February 2013, pp.712-719
and least spanning tree for wireless sensor network
to prolong network lifetime and shorten path while
and it rotates the cluster heads according to emphasizing energy conservation at the same time.
battery recovery schemes. A BARC algorithm Clustering includes partitioning stage and choosing
consists of two stages per round for selection of stage, namely, partitions the multi-hop network and
cluster heads: initialization or setup and steady state. then chooses cluster-heads, cluster-head is
In this formation of cluster, take place by electing a responsible for receiving, sending and maintaining
set of CHs. BARC enhances the network lifetime information in its cluster. Then all cluster-heads will
greatly compare to other clustering algorithms. construct a least spanning tree to prolong network
lifetime ,save energy and shorten path. Simulation
2.9 PSO-Clustering [22] results show that the system’s performance have
In this paper authors proposed PSO- further improved by using clustering and least
clustering which have four variants of PSO: PSO- spanning tree, It is a promising approach and
TVIW (PSO with time varying inertia weight), deserves more future research.
PSO-TVAC (PSO with time varying acceleration
constants), HPSO-TVAC (hierarchical PSO-TVAC) 3. MAIN THEORY
and PSO-SSM (PSO with supervisor student mode) THE Minimum Spanning Tree (MST)
for energy aware clustering in WSNs. This method that is an important and commonly
algorithm is applicable only when each node has occurring primitive in the design and operation of
fixed Omni-directional transmission range, the data and communication networks. For instance, in
sensor field should be mapped into a 2-Dimensional ad hoc sensor networks, MST is the optimal routing
space and nodes are randomly distributed. After tree for data aggregation [2]. Traditionally, the
deployment of the nodes, the nodes are static and efficiency of distributed algorithms is measured by
the positions of the nodes are known to the base the running time and the number of messages
station. The base station runs the clustering exchanged among the computing nodes, and a lot of
algorithm and updates nodes about their cluster- research has gone into the design of algorithms that
head and all nodes should have same transmission are optimal with respect to such criteria.
ranges and hardware configurations. Cluster based spanning tree can improve
lifetime of the network and also gives the shortest
2.9.1 PSO-C: Centralized-PSO [23] path for minimum propagation delay. Clustering
Authors proposed centralized-PSO includes partitioning stage and choosing stage,
algorithms, in which the nodes which have energy namely, partitions the multi-hop network and then
above average energy resource are elected as the chooses cluster-heads, cluster-head is responsible
cluster heads. In this authors also compare this for receiving , sending and maintaining information
algorithm with LEACH protocol and with LEACH- in its cluster. Then all cluster-heads will construct a
C. Simulation results show that PSO outperform to least spanning tree to prolong network lifetime ,save
LEACH and LEACH-C in term of network life time energy and shorten path. Paper review results show
and throughput etc. It also outperforms GA and K- that the system’s performance have further
means based clustering algorithms. improved by using clustering and least spanning
tree, It is a promising approach and deserves more
2.9.2 Distributed PSO[23] future research. Sensors and cluster-heads are
PSO control algorithm try to minimize assumed to be stationary or limited moving inside
radio power while ensuring connectivity of the clusters. Sensors receive commands from and send
network. In this paper author proposed an important data to its cluster-head, which does pre-processing
metric for a sensor network topology that involve for the data and forward them to other cluster-heads.
consideration of hidden nodes and asymmetric links. A cluster-head is located within the communication
It minimizes the number of hidden nodes and range of all the sensors of its cluster and can
asymmetric links at the expense of increasing the communicate with its neighbour cluster-heads.
transmit power of a subset of the nodes may in fact Since a cluster-head forwards traffic to other cluster-
increase the longevity of the sensor network. Author heads with longer distance as compared to its
explores a distributed evolutionary approach to sensing nodes, in some applications it is more
optimize this new metric. Author generates powerful than the sensing nodes in terms of energy,
topologies with fewer hidden nodes and asymmetric bandwidth and memory [11,12], while others select
links than a comparable algorithm and presents cluster–heads from the deployed sensors [13,14].
some results that indicate that his topologies deliver When a cluster-head is under failure due to
more data and last longer. insufficient power, another cluster-head will be
selected among the sensors(assume a sensor can
2.10. Least Spanning Tree based clustering[21] adjust its transmission power to a larger value (for
In this paper, Authors proposed an novel relaying requirement) once it is selected as a cluster-
energy-efficient routing protocol based on clustering head. The details on transmission power control
715 | P a g e
5. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 1, January -February 2013, pp.712-719
issues are referenced in for example [15,16]). The
cluster-based architecture raises many interesting 2 2
issues such as cluster formation, cluster-head Where di ,j = Xi − XJ + Yi − YJ
selection and cluster maintenances, which are
beyond the scope of this work. Here, The jth cluster-head as the receiver, the power
we only focus on modelling the traffic consumed by this communication is then simply as
behaviour along with the multi-hop cluster-heads by the Eq (4)
least spanning tree. The system model consists of
five parts: (1) constructing cluster-head part, in each Er (j , i) = er B Ai (4)
area dynamic constructing a cluster head according
to the remainder energy.(2) constructing least By combining Eq. (1) to Eq. (4) we can
spanning tree, according to the cluster-head, sink make a cluster-based WSN model. We know the
will dynamic construct least spanning tree to energy consumed at the cluster head is much larger
achieve maximum lifetime and prolong network than that at individual sensing node. The reason is as
lifetime.(3)sensing part, the sensors around the follows: (1) the cluster-head needs to relay all the
target area are responsible for probing the traffic of the cluster; (2) for each data unit, the
target/event and send the collected data to their cluster-head needs to transmit longer distance due to
cluster-head; (4) relaying part, the collected data are transmission between clusters, while the sensing
relayed among the cluster-heads by least spanning nodes just transmit data inside the cluster. In view of
tree until to the sink; (5) sink, the sink performs this, let Ep and Ec be, respectively, the current
system-level data analysis and process for an overall energy and clustering energy(Ec is fixed), after a
situation awareness. period of time, the ith cluster-head has transmits
The energy model based on the given energy information n1 times and has receives information
equation: n2 times before T1(suppose the energy of the ith
cluster-head is not lower than the threshold and the
Et (i) = (et + ed r n )B (1) information unit is A Erlang ) .the remainder energy
of the ith cluster-head at T1 is then simply as the Eq
Where et is the energy/bit consumed by the (5) .
transmitter electronics (including energy costs of in
per strongly dominates other node functions such as n n
Ep (i)=Ep (i) – k=1 Et (i , k) - l=1 Et (i , l) - Ec
1 2
fact duty cycling due to finite start-up time), and ed ×ni ..(5)
accounts for energy dissipated in the transmit op-
where i,j,k is respectively denote cluster-head, ni is
amp (including op-amp inefficiencies). Both et and the clustering time in cluster i before T1
ed are properties of the transceiver used by the By Ep(5),we can compute the remainder energy, if
nodes, r is the transmission range used. The Ep(i) is lower than Ev, then modify the information
parameter n is the power index for the channel path table of the ith cluster-head: set flag=0; broadcast
loss of the antenna. B is the bit rate of the radio and information to it’s children, .also inform the
is a fixed Topology management provides the neighbor jth cluster-head doesn’t transmits
distributed parameter in our study information to it, and let ith cluster-head i is in the
sleeping state; else the ith cluster-head may go along
On the receiving side, a fixed amount of the next clustering
power is required to capture the incoming radio or transmitting or receiving. According to Prim
signal where er is the energy/bit consumed by the algorithm, suppose undirected graph G (V,E,D)
receiver electronics used by the node. Typical ,where V is the set of cluster-heads and the number
numbers for currently available radio transceivers is N, E is the set of connections of cluster-head, and
are et= 50× 10-9J/bit, er=50×10-9 J/bit, ed=100× D is the distance of cluster-heads, the process of
10-12J/bit/m (for n=2) and B=1 Mbit/s [18]. constructing least spanning tree as illustrated below:
Initializatio:V1=Sink, E′=null, ,and V2=V-V1.
Er (j) = er B (2) • Set a edge: which has minimum distance from
Sink to one cluster-head (suppose is Vi),where Vi is
Now let us consider one-hop directly connected to Sink, then set,V1={Sink,vi},
communication in a finite one dimensional network E ′ ={(Sink,vi)} , V2=V2-V1.
from the ith cluster-head to the jth cluster-head • For each cluster-head Vk in V1 do :select a
across a distance di,j. If the ith cluster-head will minimum distance dk,j,which Vk∈V1,Vj∈ V2 and
generate A Erlang and the distance of the ith cluster- e′=(Vk,Vj) ∈E ,but is not∈E′, then V1=V1∪Vj,
head and the jth cluster-head is dij,so the power E′={(Vk,Vj)} ∪e′, V2=V2-Vj.
consumed by this communication is then simply as • if V2 is empty then end, else go to (3).
the Eq. (3).
Et (i , j) = (et + ed dnj ) B Ai
i (3)
716 | P a g e
6. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 1, January -February 2013, pp.712-719
Sink Sink
(a)The least spanning tree before (b)The least spanning tree after
Re-clustering Re-clustering
Fig-2 The least Spanning Tree
When a cluster-head’s energy is lower than REFERENCES
threshold, then first renewably select a node as new
cluster-head in the cluster, second renewably [1] I.F. Akyildiz, W. Su, Y.
execute constructing least spanning tree algorithm, Sankarasubramaniam,(2000) E.
so a new constructing least spanning tree has Cayirci,Wireless sensor networks: a
constructed, all sensing information can be send to survey, Computer Networks 38 393–422.J.
Sink along the new least spanning tree, this Clerk Maxwell, A Treatise on Electricity
algorithm can efficient shorten path and prolong and Magnetism, 3rd ed., vol. 2. Oxford:
network lifetime. As illustrated in Fig.1. Fig.1(a) Clarendon, 1892, pp.68–73.
show the initial least spanning tree, after some time [2] M. Ilyas, I. Mahgoub,(2000) Handbook of
,if the power of C1’s cluster head is lower threshold Sensor Networks:Compact Wireless and
,nodes in C1 will execute re-clustering to choose a Wired Sensing Systems, CRC Press,New
new cluster-head, this time system will execute York .
constructing least spanning tree algorithm, and make [3] W. Ye, J. Heidemann, D. Estrin,(2000)
a new least spanning tree as Fig.1(b).we can know Medium access control with coordinated
the total-path of new least spanning tree is shorter adaptive sleeping for wireless sensor
than old least spanning tree. networks, IEEE/ACM Transactions on
Networking 12 (3) 493–506.
3. CONCLUSION [4] W.B. Heinzelman, A. Chandrakasan, H.
Balakrishnan,(2000)Energy effcient
From the literature review of cluster based communication protocol for wireless
Minimum Spanning Tree and other cluster based microsensor networks, in: IEEE Hawaii Int.
algorithm we have a lot of advantages of cluster Conf. on System Science, Hawaii, USA,,
based Minimum Spanning Tree over other pp. 1–10.
algorithm. Since with cluster based Minimum [5] W. R Heinzelman, A. P Chandrakasan, and
Spanning Tree we can add more application of other H. Balakrishnan,(2000),
algorithm such as power gathering and distributed “Energyefficient communication protocol
least spanning tree. By these applications we can for wireless microsensor networks,” in
improve the efficiency of WSN and also reduce the Proceedings of the 33rd Hawaii
power delay of the information and increase the International Conference on System
range of sensor nodes. Sciences.
717 | P a g e
7. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 1, January -February 2013, pp.712-719
[6] I. F. Akyilldiz, W. Su, Y. Hawaii International Conference on System
Sankarasubramaniam and E. Cayirci, Sciences.
(2002), “A survey on sensor networks,” [17] S.Lindsey,C.S.Raghavendra, (2004)
IEEE Communications Magazine, pp. PEGASIS:power efficient gathering in
102−114. sensor information systems, in: Proc. of the
[7] W. B Heinzelman, A. P Chandrakasan, and IEEE Aerospace Conference, Big Sky,
H. Balakrishnan,(2002), “An application- Montana .
specific protocol architecture for wireless [18] M. Kubisch, H. Karl, A. Wolisz, L. Zhong,
microsensor networks,” IEEE Transactions J. Rabaey,(2004) Distributed algorithms for
on Wireless Communications, vol. 1, no. 4, transmission power control in wireless
pp. 660-70. sensor networks, in: IEEE Wireless
[8] S. Lindsey, C.S. Raghavendra,(2001) Communications and Networking
PEGASIS: power efficient gatheringin Conference (WCNC04), New Orleans .
sensorinformationsystems,in: [19] V. Kawadia, P.R. Kumar, (2004)Principles
IEEEAerospace Conf., Montana, Canada, and protocols for power control in ad hoc
pp. 1–6. networks, IEEE J. Select. Areas Commun.
[9] S.J. Baek, G. Veciana, X. Su,(2002) 23 (1)76–88.
Minimizing energy consumption in [20] J. Haapola, Z. Shelby, C.A. Pomalaza-
largescale sensor networks through Ra′ez, P. Ma¨ho¨nen,(2005) Cross layer
distributed data compression and energy analysis of multi-hop wireless
hierarchical aggregation, IEEE Journal on sensor networks, in:Proceedings of the
Selected Area in Communications 22 (6) European Workshop on Wireless Sensor
1130–1140. Networks, Istanbul, Turkey.
[10] Wei-Tsung Su , Ko-Ming Chang, Yau- [21] Q.Gao,K.J.Blow,D.J.Holding et,(2007)
Hwang Kuo, (2002)eHIP: An Radio range adjustment for energy efficient
energyefficient hybrid intrusion prohibition wireless sensor networks[EB/OL].
system for cluster-based wireless sensor www.elsevier.com /locate/adhoc, in: Ad
networks, Computer Networks 51 1151– Hoc Networks 42006,75–82.
1168. [22] J. Kennedy and R. C. Eberhart, “Particle
[11] A. Manjeshwar, D.P. Agrawal,(2002) swarm optimization, (1995),” IEEE
TEEN: a routing protocol or enhanced International Conference on Neural
efficiency in wireless sensor networks, in: Networks, vol.4, pp. 1942-1948, Perth,
15th IEEE Parallel and Distributed Australia.
Processing Symposium, San Francisco, [23] X. Co, H. Zhang, J. Shi, and G.Cui
USA, pp. 2009–2015. “Cluster heads election analysis for multi-
[12] Jain-Shing Liu , Chun-Hung Richard Lin, hop wireless sensor networks based on
(2002) Energy-efficiency clustering weighted graph and particle swarm
protocol in wireless sensor networks. Ad optimization”. In IEEE fourth International
Hoc Networks 3 371– 388. Conference on computing, 7, 599–603.
[13] Shensheng Tang, Wei Li,(2002) QoS
supporting and optimal energy allocation
for a cluster based wireless sensor network.
Computer Communications , pp:2569–
2577.
[14] M. Younis, M. Youssef, K. Arisha,(2002)
Energy-aware routing in clusterbased
sensor networks, in: Proc. of the 10th
IEEE/ACM Sym. onModeling, Analysis
and Simulation of Computer and
TelecomSystems (MASCOTS’02), Fort
Worth, TX.
[15] L. Subramanian, R.H. Katz,(2004) An
architecture for building self configurable
systems, in: Proc. of IEEE/ACM Workshop
on Mobile Ad Hoc Networking and
Computing, Boston, MA.
[16] W.R. Heinzelman, A. Chandrakasan, H.
Balakrishnan,(2004) Energy-efficient
communication protocol for wireless
sensor networks, in Proc. of the 33rd
718 | P a g e
8. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 1, January -February 2013, pp.712-719
BIOGRAPHIES
Priya is PG Student in the
Department of Electronics &
Communication Engineering in
SHIATS, Allahabad. She received
her B.Tech. Degree in Electronics
Communication System
Engineering from SIET, Greater
Noida in 2007. She is pursuing M.Tech in Wireless
communication Engineering in SHIATS, Allahabad.
Her research is focused on Wireless Sensor Network
and Computer Networks.
Satyesh Sharan Singh is PG
Student in the Department of
Electronics & Communication
Engineering in SHIATS,
Allahabad. He received his
B.Tech. Degree in Electronics and
Communication Engineering from
SIET, Greater Noida in 2007.He
has three year industrial experience in navigation
field. He is pursuing M.Tech in Wireless
Communication Engineering in SHIATS,
Allahabad. His research is focused on Wireless
Sensor Network and Computer Networks.
Mukesh Kumar is working as a
Asst. Prof. in the Department of
Electronics & Communication
Engineering in SHIATS,
Allahabad. He received his
M.Tech. Degree in Advanced
Communication System
Engineering from SHIATS, Allahabad in 2010. His
research is focused on Wireless Sensor Network and
Computer Networks Microwave Engineering, as
well as Optical fiber communication.
Rohini Saxena is working as a
Asst. Prof. in the Department of
Electronics & Communication
Engineering in SHIATS,
Allahabad. She received her M.Tech. Degree in
Advanced Communication System Engineering
from SHIATS, Allahabad in 2009. Her research is
focused on Microwave Engineering, Wireless
Sensor Network and Computer Networks and
Mobile communication.
719 | P a g e