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.
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.
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.
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.
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.
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
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.
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.
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.
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.
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.
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
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.
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
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.
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
HERF: A Hybrid Energy Efficient Routing using a Fuzzy Method in Wireless Sens...ijdpsjournal
Wireless Sensor Network (WSN) is one of the major research areas in computer network field today.Data
dissemination is an important task performed by wireless sensor networks. The routing algorithms of this
network depend on a number of factors such as application areas, usage condition, power, aggregation
parameters. With respect to these factors, different algorithms are recommended. One of the most
important features of routing algorithms is their flexibility and ability to self-organize themselves
according to such parameters. The existence of flexibility in routing protocols can satisfy calls for on
demand and table driven methods. Switching between these two methods would be impossible except by
compatibility between nodes' and switcher. Energy is another significant factor in wireless sensor
networks due to limited battery power and their exchangeability. To arrive at a network with mentioned
features, we have proposed an algorithm for hybrid energy efficient routing in wireless sensor networks
which uses two algorithms, i.e. EF-Tree (Earliest-First Tree) and SID (Source-Initiated Dissemination) to
disseminate data, and employs a fuzzy method to choose cluster head, and to switch between two
methods, i.e. SID and EF-Tree. In this routing, the whole network is clustered and the appropriate clusterhead
is selected according to fuzzy variables. Then, analyzing the changes in fuzzy variables and If fuzzy,
then rule, one routing in EF-Tree or SID is chosen for information transmission. The results of
simulations indicate that HERF has improved energy efficiency.
A New Method for Reducing Energy Consumption in Wireless Sensor Networks usin...Editor IJCATR
Nowadays, wireless sensor networks, clustering protocol based on the neighboring nodes into separate clusters and fault
tolerance for each cluster exists for sensors to send information to the base station, to gain the best performance in terms of increased
longevity and maintain tolerance than with other routing methods. However, most clustering protocols proposed so far, only
geographical proximity (neighboring) cluster formation is considered as a parameter. In this study, a new clustering protocol and fault
tolerance based on the fuzzy algorithms are able to clustering nodes in sensor networks based on fuzzy logic and fault tolerance. This
protocol uses clustering sensor nodes and fault tolerance exist in the network to reduce energy consumption, so that faulty sensors
from neighboring nodes are used to cover the errors, work based on the most criteria overlay neighbor sensors with defective sensors,
distance neighbor sensors from fault sensor and distance neighbor sensors from central station is done. Superior performance of the
protocol can be seen in terms of increasing the network lifetime and maintain the best network tolerance in comparison with previous
protocols such as LEACH in the simulation results.
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.
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.
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.
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.
Ameliorate Threshold Distributed Energy Efficient Clustering Algorithm for He...chokrio
Ameliorating the lifetime in heterogeneous wireless sensor network is an important task because the sensor nodes are limited in the resource energy. The best way to improve a WSN lifetime is the clustering based algorithms in which each cluster is managed by a leader called Cluster Head. Each other node must communicate with this CH to send the data sensing. The nearest base station nodes must also send their data to their leaders, this causes a loss of energy. In this paper, we propose a new approach to ameliorate a threshold distributed energy efficient clustering protocol for heterogeneous wireless sensor networks by excluding closest nodes to the base station in the clustering process. We show by simulation in MATLAB that the proposed approach increases obviously the number of the received packet messages and prolongs the lifetime of the network compared to TDEEC protocol.
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.
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.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the
performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to
use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use
routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of
this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering
Network environment, it is divided into two virtual layers (using distance between sensor nodes and base
station) and then regarding to sensors position in each of two layers, residual energy of sensor and
distance from base station is used in clustering. In this article, we compare proposed algorithm with wellknown LEACH and ELEACH algorithms in homogenous environment (with equal energy for all sensors)
and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base
station. Results show that our proposed algorithm delivers improved performance.
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.
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.
Simulation Based Analysis of Cluster-Based Protocol in Wireless Sensor Networkjosephjonse
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.
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
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.
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
HERF: A Hybrid Energy Efficient Routing using a Fuzzy Method in Wireless Sens...ijdpsjournal
Wireless Sensor Network (WSN) is one of the major research areas in computer network field today.Data
dissemination is an important task performed by wireless sensor networks. The routing algorithms of this
network depend on a number of factors such as application areas, usage condition, power, aggregation
parameters. With respect to these factors, different algorithms are recommended. One of the most
important features of routing algorithms is their flexibility and ability to self-organize themselves
according to such parameters. The existence of flexibility in routing protocols can satisfy calls for on
demand and table driven methods. Switching between these two methods would be impossible except by
compatibility between nodes' and switcher. Energy is another significant factor in wireless sensor
networks due to limited battery power and their exchangeability. To arrive at a network with mentioned
features, we have proposed an algorithm for hybrid energy efficient routing in wireless sensor networks
which uses two algorithms, i.e. EF-Tree (Earliest-First Tree) and SID (Source-Initiated Dissemination) to
disseminate data, and employs a fuzzy method to choose cluster head, and to switch between two
methods, i.e. SID and EF-Tree. In this routing, the whole network is clustered and the appropriate clusterhead
is selected according to fuzzy variables. Then, analyzing the changes in fuzzy variables and If fuzzy,
then rule, one routing in EF-Tree or SID is chosen for information transmission. The results of
simulations indicate that HERF has improved energy efficiency.
A New Method for Reducing Energy Consumption in Wireless Sensor Networks usin...Editor IJCATR
Nowadays, wireless sensor networks, clustering protocol based on the neighboring nodes into separate clusters and fault
tolerance for each cluster exists for sensors to send information to the base station, to gain the best performance in terms of increased
longevity and maintain tolerance than with other routing methods. However, most clustering protocols proposed so far, only
geographical proximity (neighboring) cluster formation is considered as a parameter. In this study, a new clustering protocol and fault
tolerance based on the fuzzy algorithms are able to clustering nodes in sensor networks based on fuzzy logic and fault tolerance. This
protocol uses clustering sensor nodes and fault tolerance exist in the network to reduce energy consumption, so that faulty sensors
from neighboring nodes are used to cover the errors, work based on the most criteria overlay neighbor sensors with defective sensors,
distance neighbor sensors from fault sensor and distance neighbor sensors from central station is done. Superior performance of the
protocol can be seen in terms of increasing the network lifetime and maintain the best network tolerance in comparison with previous
protocols such as LEACH in the simulation results.
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.
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.
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.
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.
Ameliorate Threshold Distributed Energy Efficient Clustering Algorithm for He...chokrio
Ameliorating the lifetime in heterogeneous wireless sensor network is an important task because the sensor nodes are limited in the resource energy. The best way to improve a WSN lifetime is the clustering based algorithms in which each cluster is managed by a leader called Cluster Head. Each other node must communicate with this CH to send the data sensing. The nearest base station nodes must also send their data to their leaders, this causes a loss of energy. In this paper, we propose a new approach to ameliorate a threshold distributed energy efficient clustering protocol for heterogeneous wireless sensor networks by excluding closest nodes to the base station in the clustering process. We show by simulation in MATLAB that the proposed approach increases obviously the number of the received packet messages and prolongs the lifetime of the network compared to TDEEC protocol.
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.
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.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the
performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to
use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use
routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of
this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering
Network environment, it is divided into two virtual layers (using distance between sensor nodes and base
station) and then regarding to sensors position in each of two layers, residual energy of sensor and
distance from base station is used in clustering. In this article, we compare proposed algorithm with wellknown LEACH and ELEACH algorithms in homogenous environment (with equal energy for all sensors)
and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base
station. Results show that our proposed algorithm delivers improved performance.
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.
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.
Simulation Based Analysis of Cluster-Based Protocol in Wireless Sensor Networkjosephjonse
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.
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.
Energy aware clustering protocol (eacp)IJCNCJournal
Energy saving to prolong the network life is an important design issue while developing a new routing
protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the
network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a
homogeneous network architecture, in which all sensors have the same capabilities in terms of battery
power, communication, sensing, storage, and processing. Recently, there has been an interest in
heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new
energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is
introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal
nodes are elected with the help of a probability scheme based on residual and average energy of the
normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a
round. Advanced nodes use a separate probability based scheme for cluster head election and they will
further act as a gateway for normal cluster heads and transmit their data load to base station when they
are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during
cluster formation phase to save network energy. The performance of EACP is compared with SEP and
simulation result shows the better result for stability period, network life and energy saving than SEP.
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.
Data gathering in wireless sensor networks using intermediate nodesIJCNCJournal
Energy consumption is an essential concern to Wireless Sensor Networks (WSNs).The major cause of the energy consumption in WSNs is due to the data aggregation. A data aggregation is a process of collecting data from sensor nodes and transmitting these data to the sink node or base station. An effective way to perform such a task is accomplished by using clustering. In clustering, nodes are grouped into clusters where a number of nodes, called cluster heads, are responsible for gathering data from other nodes, aggregate them and transmit them to the Base Station (BS).
In this paper we produce a new algorithm which focused on reducing the transmission bath between sensor nodes and cluster heads. A proper utilization and reserving of the available power resources is achieved with this technique compared to the well-known LEACH_C algorithm.
IMPACTS OF STRUCTURAL FACTORS ON ENERGY CONSUMPTION IN CLUSTER-BASED WIRELESS...ijasuc
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
IMPACTS OF STRUCTURAL FACTORS ON ENERGY CONSUMPTION IN CLUSTER-BASED WIRELESS...ijasuc
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
IMPACTS OF STRUCTURAL FACTORS ON ENERGY CONSUMPTION IN CLUSTER-BASED WIRELESS...ijasuc
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
Similar to WIRELESS SENSOR NETWORK CLUSTERING USING PARTICLES SWARM OPTIMIZATION FOR REDUCING ENERGY CONSUMPTION (20)
MULTIMODAL COURSE DESIGN AND IMPLEMENTATION USING LEML AND LMS FOR INSTRUCTIO...IJMIT JOURNAL
Traditionally, teaching has been centered around classroom delivery. However, the onslaught of the
COVID-19 pandemic has cultivated usage of technology, teaching, and learning methodologies for course
delivery. We investigate and describe different modes of course delivery that maintain the integrity of
teaching and learning. This paper answers to the research questions: 1) What course delivery method our
academic institutions use and why? 2) How can instructors validate the guidelines of the institutions? 3)
How courses should be taught to provide student learning outcomes? Using the Learning Environment
Modeling Language (LEML), we investigate the design and implementation of courses for delivery in the
following environments: face-to-face, online synchronous, asynchronous, hybrid, and hyflex. A good
course design and implementation are key components of instructional alignment. Furthermore, we
demonstrate how to design, implement, and deliver courses in synchronous, asynchronous, and hybrid
modes and describe our proposed enhancements to LEML.
Novel R&D Capabilities as a Response to ESG Risks-Lessons From Amazon’s Fusio...IJMIT JOURNAL
Environmental, Social, and Governance (ESG) management is essential for transforming corporate
financial performance-oriented business strategies into Finance (F) + ESG optimization strategies to
achieve the Sustainable Development Goals (SDGs).
In this trend, the rise of ESG risks has divided firms into two categories. Former incorporates a growthmindset that creates a passion for learning, and urges it to improve itself by endeavoring Research and
development (R&D) -driven challenges, while the other category, characterized by risk aversion, avoids
challenging highly uncertain R&D activities and seeks more manageable endeavors.
This duality underscores the complexity of corporate R&D strategies in addressing ESG risks and
necessitates the development of novel R&D capabilities for corporate R&D transformation strategies
towards F + ESG optimization.
International Journal of Managing Information Technology (IJMIT) ** WJCI IndexedIJMIT JOURNAL
The International Journal of Managing Information Technology (IJMIT) is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of the strategic application of information technology (IT) in organizations. The journal focuses on innovative ideas and best practices in using IT to advance organizations – for-profit, non-profit, and governmental. The goal of this journal is to bring together researchers and practitioners from academia, government, and industry to focus on understanding both how to use IT to support the strategy and goals of the organization and to employ IT in new ways to foster greater collaboration, communication, and information sharing both within the organization and with its stakeholders. The International Journal of Managing Information Technology seeks to establish new collaborations, new best practices, and new theories in these areas.
International Journal of Managing Information Technology (IJMIT) ** WJCI IndexedIJMIT JOURNAL
The International Journal of Managing Information Technology (IJMIT) is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of the strategic application of information technology (IT) in organizations. The journal focuses on innovative ideas and best practices in using IT to advance organizations – for-profit, non-profit, and governmental. The goal of this journal is to bring together researchers and practitioners from academia, government, and industry to focus on understanding both how to use IT to support the strategy and goals of the organization and to employ IT in new ways to foster greater collaboration, communication, and information sharing both within the organization and with its stakeholders. The International Journal of Managing Information Technology seeks to establish new collaborations, new best practices, and new theories in these areas.
NOVEL R & D CAPABILITIES AS A RESPONSE TO ESG RISKS- LESSONS FROM AMAZON’S FU...IJMIT JOURNAL
Environmental, Social, and Governance (ESG) management is essential for transforming corporate
financial performance-oriented business strategies into Finance (F) + ESG optimization strategies to
achieve the Sustainable Development Goals (SDGs).
In this trend, the rise of ESG risks has divided firms into two categories. Former incorporates a growthmindset that creates a passion for learning, and urges it to improve itself by endeavoring Research and
development (R&D) -driven challenges, while the other category, characterized by risk aversion, avoids
challenging highly uncertain R&D activities and seeks more manageable endeavors.
This duality underscores the complexity of corporate R&D strategies in addressing ESG risks and
necessitates the development of novel R&D capabilities for corporate R&D transformation strategies
towards F + ESG optimization.
Building on this premise, this paper conducts an empirical analysis, utilizing reliable firms data on ESG
risk and brand value, with a focus on 100 global R&D leader firms. It analyzes R&D and actions for ESG
risk mitigation, and assesses the development of new functions that fulfill F + ESG optimization through
R&D. The analysis also highlights the significance of network externality effects, with a specific focus on
Amazon, a leading R&D company, providing insights into the direction for transforming R&D strategies
towards F + ESG optimization.
The dynamics of stakeholder engagement in F + ESG optimization are indicated with the example of
amazon's activities. Through the analysis, it became evident that Amazon's capacity encompassing growth
and scalability, specifically its ability to grow and expand, is accelerating high-level research and
development by gaining the trust of stakeholders in the "synergy through R&D-driven ESG risk
mitigation."
Finally, as examples of these initiatives, the paper discussed the Climate Pledge led by Amazon and the
transformation of Japan's management system.
A REVIEW OF STOCK TREND PREDICTION WITH COMBINATION OF EFFECTIVE MULTI TECHNI...IJMIT JOURNAL
It is important for investors to understand stock trends and market conditions before trading stocks. Both
these capabilities are very important for an investor in order to obtain maximized profit and minimized
losses. Without this capability, investors will suffer losses due to their ignorance regarding stock trends
and market conditions. Technical analysis helps to understand stock prices behavior with regards to past
trends, the signals given by indicators and the major turning points of the market price. This paper reviews
the stock trend predictions with a combination of the effective multi technical indicator strategy to increase
investment performance by taking into account the global performance and the proposed combination of
effective multi technical indicator strategy model.
INTRUSION DETECTION SYSTEM USING CUSTOMIZED RULES FOR SNORTIJMIT JOURNAL
These days the security provided by the computer systems is a big issue as it always has the threats of
cyber-attacks like IP address spoofing, Denial of Service (DOS), token impersonation, etc. The security
provided by the blue team operations tends to be costly if done in large firms as a large number of systems
need to be protected against these attacks. This leads these firms to turn to less costly security
configurations like IDS Suricata and IDS Snort. The main theme of the project is to improve the services
provided by Snort which is a tool used in creating a vague defense against cyber-attacks like DDOS
attacks which are done on both physical and network layers. These attacks in turn result in loss of
extremely important data. The rules defined in this project will result in monitoring traffic, analyzing it,
and taking appropriate action to not only stop the attack but also locate its source IP address. This whole
process uses different tools other than Snort like Wireshark, Wazuh and Splunk. The product of this will
result in not only the detection of the attack but also the source IP address of the machine on which the
attack is initiated and completed. The end product of this research will result in sets of default rules for the
Snort tool which will not only be able to provide better security than its previous versions but also be able
to provide the user with the IP address of the attacker or the person conducting the attack. The system
involves the integration of Wazuh with Snort tool in order to make it more efficient than IDS Suricata
which is another intrusion detection system capable of detecting all these types of attacks as mentioned.
Splunk is another tool used in this project which increases the firewall efficiency to pass the no. of bits to
be scanned and the no. of bits scanned successfully. Wazuh is used in this system as it is the best choice for
traffic monitoring and incident response than any other of its alternatives in the market. Since this system
is used in firms which are known to handle big amounts of data and for this purpose, we use Splunk tool as
it is very efficient in handling big amounts of data. Wireshark is used in this system in order to give the IDS
automation in its capability to capture and report the malicious packets found during the network scan. All
of this gives the IDS a capability of a low budget automated threat detection system. This paper gives
complete guidelines for authors submitting papers for the AIRCC Journals.
Artificial Intelligence (AI) has rapidly become a critical technology for businesses seeking to improve
efficiency and profitability. One area where AI is proving particularly impactful is in service operations
management, where it is used to create AI-powered service operations (AIServiceOps) that deliver highvalue services to customers. AIServiceOps involve the use of AI to automate and optimize various business
processes, such as customer service, sales, marketing, and supply chain management. The rapid
development of Artificial Intelligence has prompted many changes in the field of Information Technology
(IT) Service Operations. IT Service Operations are driven by AI, i.e., AIServiceOps. AI has empowered
new vitality and addressed many challenges in IT Service Operations. However, there is a literature gap on
the Business Value Impact of Artificial intelligence (AI) Powered IT Service Operations. It can help IT
build optimized business resilience by creating value in complex and ever-changing environments as
product organizations move faster than IT can handle. So, this research paper examines how AIServiceOps
creates business value and sustainability, basically how AIServiceOps makes the IT staff liberation from a
low-level, repetitive workout and traditional IT practices for a continuously optimized process. One of the
research objectives is to compare Traditional IT Service Operations with AIServiceOPs. This paper
provides the basis for how enterprises can evaluate AIServiceOps and consider it a digital transformation
tool. The paper presents a case study of a company that implemented AI-powered service operations
(AIServiceOps) and analyzes the resulting business outcomes. The study shows that AIServiceOps can
significantly improve service delivery, reduce response times, and increase customer satisfaction.
Furthermore, it demonstrates how AIServiceOps can deliver substantial cost savings, such as reducing
labor costs and minimizing downtime.
MEDIATING AND MODERATING FACTORS AFFECTING READINESS TO IOT APPLICATIONS: THE...IJMIT JOURNAL
Although IOT seems to be the upcoming trend, it is still in its infancy; especially in the banking industry.
There is a clear gap in literature, as only few studies identify factors affecting readiness to IOT
applications in banks in general, and almost negligible investigations on mediating and moderating
factors. Accordingly, this research aims to investigate the main factors that affect employees’ readiness to
IOT applications, while highlighting the mediating and moderating factors in the Egyptian banking sector.
The importance of Egypt stems from its high population and steady steps taken towards technology
adoption. 479 valid questionnaires were distributed over HR employees in banks. Data collected was
statistically analysed using Regression and SEM. Results showed a significant impact of ‘Security’,
‘Networking’, ‘Software Development’ and ‘Regulations’ on ‘readiness to IOT applications. Thus, the
readiness acceptance level is high‘Security’ and ‘User Intention’ were proven to mediate the relationship
between research variables and readiness to IOT applications, and only a partial moderation role was
proven for ‘Efficiency’. The study contributes to increasing literature on IOT applications in general, and
fills a gap on the Egyptian banking context in particular. Finally, it provides decision makers at banks with
useful guidelines on how to optimally promote IOT applications among employees.
EFFECTIVELY CONNECT ACQUIRED TECHNOLOGY TO INNOVATION OVER A LONG PERIODIJMIT JOURNAL
IT (Information and Communication Technology) companies are facing the dilemma of decreasing
productivity despite increasing research and development efforts. M&A (Merger and Acquisition) is being
considered as a breakthrough solution. From existing research, it has been pointed out that M&A leads to
the emergence of new innovations. Purpose of this study was to discuss the efficient ways of acquisition and
to resolve the dilemma of productivity decline by clarifying how the technology obtained through M&A
leads to the creation of new innovations. Hypothesis 1 was that the technology acquired through M&A is
utilized for innovation creation, Hypothesis 2 was that the acquired technology is utilized over a long
period of time, and Hypothesis 3 was that a long-term utilization has a positive impact on corporate
performance. The results, using sports prosthetics as a case study and using patents as a proxy variable,
confirmed all the hypotheses set. We have revealed that long-term utilization of technology obtained
through M&A is effective for creating new innovations.
International Journal of Managing Information Technology (IJMIT) ** WJCI IndexedIJMIT JOURNAL
The International Journal of Managing Information Technology (IJMIT) is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of the strategic application of information technology (IT) in organizations. The journal focuses on innovative ideas and best practices in using IT to advance organizations – for-profit, non-profit, and governmental. The goal of this journal is to bring together researchers and practitioners from academia, government, and industry to focus on understanding both how to use IT to support the strategy and goals of the organization and to employ IT in new ways to foster greater collaboration, communication, and information sharing both within the organization and with its stakeholders. The International Journal of Managing Information Technology seeks to establish new collaborations, new best practices, and new theories in these areas.
Authors are solicited to contribute to the journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of information technology and management
4th International Conference on Cloud, Big Data and IoT (CBIoT 2023)IJMIT JOURNAL
4th International Conference on Cloud, Big Data and IoT (CBIoT 2023) will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the areas of Cloud, Big Data and IoT. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of Cloud, Big Data and IoT.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in Cloud, Big Data and IoT.
TRANSFORMING SERVICE OPERATIONS WITH AI: A CASE FOR BUSINESS VALUEIJMIT JOURNAL
Artificial Intelligence (AI) has rapidly become a critical technology for businesses seeking to improve
efficiency and profitability. One area where AI is proving particularly impactful is in service operations
management, where it is used to create AI-powered service operations (AIServiceOps) that deliver highvalue services to customers. AIServiceOps involve the use of AI to automate and optimize various business
processes, such as customer service, sales, marketing, and supply chain management. The rapid
development of Artificial Intelligence has prompted many changes in the field of Information Technology
(IT) Service Operations. IT Service Operations are driven by AI, i.e., AIServiceOps. AI has empowered
new vitality and addressed many challenges in IT Service Operations. However, there is a literature gap on
the Business Value Impact of Artificial intelligence (AI) Powered IT Service Operations. It can help IT
build optimized business resilience by creating value in complex and ever-changing environments as
product organizations move faster than IT can handle. So, this research paper examines how AIServiceOps
creates business value and sustainability, basically how AIServiceOps makes the IT staff liberation from a
low-level, repetitive workout and traditional IT practices for a continuously optimized process. One of the
research objectives is to compare Traditional IT Service Operations with AIServiceOPs. This paper
provides the basis for how enterprises can evaluate AIServiceOps and consider it a digital transformation
tool. The paper presents a case study of a company that implemented AI-powered service operations
(AIServiceOps) and analyzes the resulting business outcomes. The study shows that AIServiceOps can
significantly improve service delivery, reduce response times, and increase customer satisfaction.
Furthermore, it demonstrates how AIServiceOps can deliver substantial cost savings, such as reducing
labor costs and minimizing downtime.
DESIGNING A FRAMEWORK FOR ENHANCING THE ONLINE KNOWLEDGE-SHARING BEHAVIOR OF ...IJMIT JOURNAL
The main objective of this paper is to identify the factors that influence academic staff's digital knowledgesharing behaviors in Ethiopian higher education. A structural equation model was used to validate the
research framework using survey data from 210 respondents. The collected data has been analyzed using
Smart PLS software. The results of the study show that trust, self-motivation, and altruism are positively
related to attitude. Contrary to our expectations, knowledge technology negatively affects attitude.
However, reward systems and empowerment by leaders are significantly associated with knowledgesharing intentions.Knowledge-sharing intention, in turn, was significantly related to digital knowledgesharing behavior. The contributions of this study are twofold. The framework may serve as a roadmap for
future researchers and managers considering their strategy to enhance digital knowledge sharing in HEI.
The findings will benefit academic staff and university administrations.The study will also help academic
staff enhance their knowledge-sharing practices.
BUILDING RELIABLE CLOUD SYSTEMS THROUGH CHAOS ENGINEERINGIJMIT JOURNAL
Cloud computing systems need to be reliable so that they can be accessed and used for computing at any
given point in time. The complex nature of cloud systems is the motivation to conduct research in novel
ways of ensuring that cloud systems are built with reliability in mind. In building cloud systems, it is
expected that the cloud system will be able to deal with high demands and unexpected events that affect the
reliability and performance of the system.
In this paper, chaos engineering is considered a heuristic method that can be used to build reliable cloud
systems. Chaos engineering is aimed at exposing weaknesses in systems that are in production. Chaos
engineering will help identify system weaknesses and strengths when a system is exposed to unexpected
knocks and shocks while it is in production.
Chaos engineering allows system developers and administrators to get insights into how the cloud system
will behave when it is exposed to unexpected occurrences.
A REVIEW OF STOCK TREND PREDICTION WITH COMBINATION OF EFFECTIVE MULTI TECHNI...IJMIT JOURNAL
It is important for investors to understand stock trends and market conditions before trading stocks. Both
these capabilities are very important for an investor in order to obtain maximized profit and minimized
losses. Without this capability, investors will suffer losses due to their ignorance regarding stock trends
and market conditions. Technical analysis helps to understand stock prices behavior with regards to past
trends, the signals given by indicators and the major turning points of the market price. This paper reviews
the stock trend predictions with a combination of the effective multi technical indicator strategy to increase
investment performance by taking into account the global performance and the proposed combination of
effective multi technical indicator strategy model.
NETWORK MEDIA ATTENTION AND GREEN TECHNOLOGY INNOVATIONIJMIT JOURNAL
This paper will provide a novel empirical study for the relationship between network media attention and
green technology innovation and examine how network media attention can ease financing constraints. It
collected data from listed companies in China's heavy pollution industry and performed rigorous
regression analysis, in order to innovatively explore the environmental governance functions of the media.
It found that network media attention significantly promotes green technology innovation. By analyzing the
inner mechanism further, it found that network media attention can promote green innovation by easing
financing constraints. Besides, network media attention has a significant positive impact on green invention
patents while not affecting green utility model patents.
INCLUSIVE ENTREPRENEURSHIP IN HANDLING COMPETING INSTITUTIONAL LOGICS FOR DHI...IJMIT JOURNAL
Information System (IS) research advocates employing collaborative and loose coupling strategies to address contradictory issues to address diversified actors’ interests than the prescriptive and unilateral Information Technology (IT) governance mechanisms’, yet it is rarely depicting how managers employ these strategies in Health Information System (HIS) implementation, particularly in a resource-constrained setting where IS implementation activities have highly relied on multiple international organizations resources. This study explored how managers in resource-constrained settings employ collaborative IT governance mechanisms in the case of District Health Information System 2 (DHIS2) adoption with an interpretative case study approach and the institutional logic concept. The institutional logic concept was used to identify the major actors’ logics underpinning the DHIS2 adoption. The study depicted the importance of high-level officials' distance from the dominant systemic logic to consider new alternative, and to employ inclusive IT governance mechanisms which separated resource from the system that facilitated stakeholders’ collaboration in DHIS2 adoption based on their capacity and interest.
DEEP LEARNING APPROACH FOR EVENT MONITORING SYSTEMIJMIT JOURNAL
With an increasing number of extreme events and complexity, more alarms are being used to monitor
control rooms. Operators in the control rooms need to monitor and analyze these alarms to take suitable
actions to ensure the system’s stability and security. Security is the biggest concern in the modern world. It
is important to have a rigid surveillance that should guarantee protection from any sought of hazard.
Considering security, Closed Circuit TV (CCTV) cameras are being utilized for reconnaissance, but these
CCTV cameras require a person for supervision. As a human being, there can be a possibility to be tired
off in supervision at any point of time. So, we need a system to detect automatically. Thus, we came up with
a solution using YOLO V5. We have taken a data set and used robo-flow framework to enhance the existing
images into numerous variations where it will create a copy of grey scale image, a copy of its rotation and
a copy of its blurred version which will be used to get an enlarged data set. This work mainly focuses on
providing a secure environment using CCTV live footage as a source to detect the weapons. Using YOLO
algorithm, it divides an image from the video into grid system and each grid detects an object within itself
MULTIMODAL COURSE DESIGN AND IMPLEMENTATION USING LEML AND LMS FOR INSTRUCTIO...IJMIT JOURNAL
Traditionally, teaching has been centered around classroom delivery. However, the onslaught of the
COVID-19 pandemic has cultivated usage of technology, teaching, and learning methodologies for course
delivery. We investigate and describe different modes of course delivery that maintain the integrity of
teaching and learning. This paper answers to the research questions: 1) What course delivery method our
academic institutions use and why? 2) How can instructors validate the guidelines of the institutions? 3)
How courses should be taught to provide student learning outcomes? Using the Learning Environment
Modeling Language (LEML), we investigate the design and implementation of courses for delivery in the
following environments: face-to-face, online synchronous, asynchronous, hybrid, and hyflex. A good
course design and implementation are key components of instructional alignment. Furthermore, we
demonstrate how to design, implement, and deliver courses in synchronous, asynchronous, and hybrid
modes and describe our proposed enhancements to LEML.
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.
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.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
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.
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
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.
Automobile Management System Project Report.pdfKamal Acharya
The proposed project is developed to manage the automobile in the automobile dealer company. The main module in this project is login, automobile management, customer management, sales, complaints and reports. The first module is the login. The automobile showroom owner should login to the project for usage. The username and password are verified and if it is correct, next form opens. If the username and password are not correct, it shows the error message.
When a customer search for a automobile, if the automobile is available, they will be taken to a page that shows the details of the automobile including automobile name, automobile ID, quantity, price etc. “Automobile Management System” is useful for maintaining automobiles, customers effectively and hence helps for establishing good relation between customer and automobile organization. It contains various customized modules for effectively maintaining automobiles and stock information accurately and safely.
When the automobile is sold to the customer, stock will be reduced automatically. When a new purchase is made, stock will be increased automatically. While selecting automobiles for sale, the proposed software will automatically check for total number of available stock of that particular item, if the total stock of that particular item is less than 5, software will notify the user to purchase the particular item.
Also when the user tries to sale items which are not in stock, the system will prompt the user that the stock is not enough. Customers of this system can search for a automobile; can purchase a automobile easily by selecting fast. On the other hand the stock of automobiles can be maintained perfectly by the automobile shop manager overcoming the drawbacks of existing system.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
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.
The Benefits and Techniques of Trenchless Pipe Repair.pdf
WIRELESS SENSOR NETWORK CLUSTERING USING PARTICLES SWARM OPTIMIZATION FOR REDUCING ENERGY CONSUMPTION
1. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
DOI : 10.5121/ijmit.2014.6401 1
WIRELESS SENSOR NETWORK CLUSTERING USING
PARTICLES SWARM OPTIMIZATION FOR REDUCING
ENERGY CONSUMPTION
Amin Rostami1
and Mohammad Hossin Mottar2
1Department of Computer Engineering, Ferdows Branch, Islamic Azad University,
Ferdows , Iran.
2Department of Computer Engineering, Mashhad Branch, Islamic Azad
ABSTRACT
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.
Keywords
Wireless sensor networks, clustering, Energy efficient protocols, Particles Swarm optimization algorithm,
Centralized algorithms.
1. Introduction
Wireless Sensor Networks (WSN),as one of the most important technologies of the 21 century is
discussed in this paper. These networks include many number of very small sensor nodes that are
used for collection and peripheral information processing [1].Unlike ad hoc networks that may at
the first glance very similar to the sensor networks, the nodes in the sensor network usually lack
unique addresses and which is important for information collection by the sensors. Also due to
lack of access to nodes after their disperse process, the network nodes are virtually useless and
will die after that the available energy is over. So the energy consumption issue and optimization
is one of the challenges raised in these networks. In recent years, many works have been done in
this case [6]. Distinction between traditional telecommunication networks such as cellular -
systems and mobile ad hoc networks with WSN is that the networks have unique features such as:
node density deployment, the lack of reliability of the sensor nodes and severe restrictions on
energy computing and memory [3]. The applications that have already been proposed for sensor
networks and are added day to day,can be refer to examples such as; routing in broad
geographical environments, security system, control on large structures, control on patients with
critical condition, control on environmental parameters in areas where human presence in the mis
dangerous and so on [2]. In fact, Sensor networks is the accumulation of a large number of sensor
nodes scattered in the environment. And each is autonomous and collaborated with other groups
2. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
2
to follow a particular purpose. The nodes are close together and each node can communicate with
other node and their data will be put to another node. Finally, under ambient conditions, the data
is reported to a central node. Techniques and practices used in such networks highly depend on
the nature of network usage and the network topology, atmospheric and environmental
conditions, limitations and factors affecting network performance parameters and cost. So, today
in the world wide valid universities and computer and electronics research centers, and especially
Telecommunications, WSN, is a very attractive and popular field of research[4]. Many
suggestions and researches are provided on various topics in this field.
The main goal of these efforts is to provide solutions with simple control method and low cost
which finally lead to accountability toourneeds and can be persistent against limitations such as:
bandwidth, energy, environmental interference,feeding and so on.
Also these solutions would be in accordance to our wishes and desires including the data
transmission overload reduction, survivability and high lifetime and low cost. One of the
challenges raised in the context of sensor networks is how to cluster nodes in the network since
these networks be efficient in terms of available energy and processing resources [6].
Clustering sensor networks, is an effective technique to increase the scalability and survivability
nodes, the main goal of clustering is to divide network to a set of individual and limited nodes
that can be easy controlled. by apply clustering can routing table size, repeats end messages
reiteration and energy consumption is reduced and enhance the network lifetime, until the nodes
their data transfer to the shortest distance of associated cluster heads[9].
Indeed, proposed algorithm is a centralized algorithm. That all of the main decisions performed in
base station. Such as: clustering and cluster head election. This algorithm make close itself to
optimal mood in every time of performance, automatically and if occur erratic event in network,
algorithm have this capability that decrease the effects of this problem to least quantity in whole
of network, automatically and during shortest time. Also, because collecting data is centralized
and do periodic, this algorithm is very suitable for when supervision and fined monitoring is
needed by wireless sensor network.
Rest of the paper is organized as follows:
2.Related Works
3.Network model
4. The proposed method
5. Simulation
6. Conclusion
2. RELATED WORKS
LEACH1
protocol [7] is the oldest part of the clustering algorithms in WSN which is a
hierarchical method in which the routing method uses a single step. Its main objective is to
maximize network lifetime, and distribute energy consumption across all network nodes. Nodes
per cluster Received Information sent to cluster heads and The task of cluster heads is transmitted
data to the base station. All data processing duties such as integration and collection is performed
locally by cluster head. LEACH runs during several steps with two phases.
1
Low Energy Adaptive Clustering Hierarchy
3. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
3
1. Set up phase
2. Pitch phase
In the setup phase, each node decides the cluster heads or not. each node create a random number
between 0 and 1, that is, the probability of being selected as the cluster heads. If the probability p
of node n is less than threshold T(n), the node n is a cluster head for current phase r. In which
T(n)is calculated as follow:
ݐሺ݊ሻ = ቐ
1 − ∗ ሺ݀݉ ݎ
ଵ
ሻ
, ݂݅ ݊ ∈ ܩ
0 ݐℎ݁݁ݏ݅ݓݎ
ሺ1ሻ
Where G is the set of sensor nodes that are not in 1/P cluster heads of the final round. So in the
first round 0, each node of has the same probability P for clustering head., The amount of energy
consumption during the network lifetime is effective and the algorithm is not efficient in terms of
energy consumption.
In CHEF2
protocol [5] cluster head election mechanism uses fuzzy logic. CHEF algorithm
obtains chance from two fuzzy set namely: residual energy of node and total distance between a
node with other nodes that are located at a radius r. CHEF can overcome the defects of LEACH.
This means that sensor node has more energy and has more chance of being cluster heads. the
main advantages of CHEF can be summarized as follows:
1. Amount of computational overhead is minimized by using fuzzy logic.
Cluster heads are elected locally, that reduces the overhead associated with centralized processes.
CHEF algorithm disadvantages can include:
1-CHEF algorithm employs few parameters in the election of cluster heads.
2-And the number of selected cluster heads greatly depends on the value of α:
In the TL-LEACH3
protocol [11]-It is an improvement in the basic LEACH algorithm.
The algorithm is performed in three steps:
1. CH selecting
2. Clusters formation
3. Data transmission
The algorithm uses two level cluster heads (primary and secondary).
Secondary cluster heads with other members which are located in one cluster communicate and
after data aggregation transmit them to primary cluster heads and primary cluster heads route data
to base station. The data which is sent to base station reduce energy consumption significantly but
there is a lot of overhead in the election of primary and secondary cluster heads which affects the
network lifetime.
EEHC4
Protocol [13] is a randomly distributed clustering algorithm. The EEHC algorithm
assumes that communication environment is controversy and also there is an error-free
environment. This algorithm is based on a two-stage clustering.
2
Cluster Head Election mechanism using Fuzzy logic
3
A Two -Levels Hierarchy for Low-Energy Adaptive Clustering Hierarchy
4
Energy-efficient hierarchical clustering
4. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
4
1. Single-level clustering
2. Multi-level clustering
Sensor nodes are cluster heads in hierarchical architecture. Cluster heads consume more energy
than the other sensor nodes because, cluster heads have more work to do.
Hence, it is possible that the cluster heads energy is over faster than the other sensors. EEHC
algorithm can be run periodically for load balancing or start to work when the cluster heads
energy levels falls below a certain threshold. In Genetic Algorithm for Energy Efficient Clusters
in Wireless Sensor Networks [12] fitness function calculation depends on the distance between
cluster heads nodes and base station and the purpose of applying genetic algorithms is to elect the
most appropriate cluster heads. It is a centralized method in which members of each cluster and
sending time are determined. Each cluster head directly sends information to base station.
Although this algorithm performs better than LEACH, but there is not a significant improvement,
because the computation of the fitness function is complex.
In the method of GA- MPI5
,It is proposed [14]to divide the network into several clusters, but
rather than sending data from nodes to cluster heads, they use a number of mobile agents in each
cluster. The mobile agents perform the task of data collection from nodes, data aggregation
sending them to the base station.
In this method, chromosomes are divided in two arrays:
1. Group array
2. Ordinal array
Group array includes a number of members of each cluster and ordinal array includes the nodes
that belong to each cluster. Crossover only alters the nodes in the same group and the mutation
alters the number of nodes in consistent group. In this method the purpose of using genetic
algorithms is to calculate the optimal number of mobile agents and embellishment of clusters and
is also network measurement using standard delay and does not consider the energy consumption.
Simulations show that the sensor nodes reduce energy consumption by using mobile agents [20].
In the GFCM6
protocol [21] which has actually improved FCM protocol for network clustering
with combining genetic algorithm and fuzzy methods. Genetic algorithm is used to improve FCM
method in clustering and the best cluster heads election. This method has the effectiveness in
energy consumption balance of the network, which increases the network lifetime and reduces
the energy consumption. Authors of [18] use PSO to create cluster in WSN and optimal clusters
are sorted by fitness function based on within cluster distance. In this proposal, residual energy of
nodes is ignored in the calculations, and fitness function is considered as follows:
∑ ∑ ሺd୧୨
ଶ
+
ୈౠ
మ
୬ౠ
ሻ
୬ౠ
୧ୀଵ
ୀଵ (2)
Where dij is distance between node i and cluster heads j. Dj is the distance between cluster heads j
and base station and nj is the number of nodes in each cluster. In this way, inertia coefficient
varies and the acceleration is constant. In [19] clustering wireless sensor networks based on
improved discrete particle swarm optimization is proposed which tries to solve clustering
inequality problem. In this method the number of nodes in each cluster is identical and the fitness
function is only based on communication distance. In addition, PSO inertia coefficient is
considered variable to distinguish between particles. Then the obtained cluster heads of PSO
algorithm are checked in terms of energy levels and if their residual energy is less than a
threshold value, the nearest node which its energy is higher than the threshold value will be
5
Genetic algorithm based multiple MAs itinerary planning
6
Genetic Fuzzy C-means algorithm
5. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
5
replaced. This method is compared with the LEACH show better results, although the total
residual energy of nodes and lifetime are not considered.
PSO-MV7
protocol [15] as well is based on PSO method, and since energy consumption in
cluster heads is higher than other nodes, the purpose of the approach is energy balance. In the
PSO-MV method, the 2 nodes are selected as cluster heads that is a node as main cluster heads
(MCH) and other as (VCH) and the tasks between the nodes can be categorized, where the MCH
is responsible for data collecting and transmission and VCH is responsible for inter-cluster
communications or intra –cluster communications to BS. PSO-MV clustering algorithm is based
on Routing of clusters included generation steps and transmission of data. Initialized for cluster
head this is If the node of cluster heads candidate according to the set of nodes into clusters and
threshold energy that shows to Eλ is chosen as follow:
Eλ =ሶ ∑ ܰ/݅ܧே
ୀଵ (3)
The simulation results show that date of node death in PSO–MV take more than clearly PSO, but
the weakness of this algorithm is in selection the number of cluster heads optimum.
The EECS8
protocol [16] focuses to solve the problem of clusters distance from BS. In fact, the
cluster which is far from the base station needs more energy consumption for data transmission.
For this reason ,of dynamic size to cluster is determined due to the distance of the cluster from
base stations. This algorithm makes a more uniform distribution of energy in the whole network
which leads to increasing network lifetime.
3. Network Model
• The nodes can use power control to adjust transmission power that is dependent on the
distance to the receiver.
• The Sensor nodes are stationary.
• For each node a unique identity is assigned
• The nodes are aware of self-position. (via GPS)
• The nodes are homogeneous network, it means that have identical processing potency.
• The nodes have limited energy and after disperse there is no battery charging capabilities.
• Each node has an initial value which is Emax and BS has no restrictions on energy,
memory and communication.
• Links are symmetric that is two nodes v1 and v2 can use the same transmission power to
connect.
3.1. PSO clustering problem
Two main problem of clustering using PSO method is the convergence to local optimal and slow
convergence velocity, which is tried to be solved by using two ideas of chaos theory and
acceleration strategy . In the formula of updating velocity of the cluster centers that is mentioned
in the eq. (4) updating is done for each particle for relocating the particle to the new position,
from the best answer for each particle (Pbest) and the best global solution so far (gbest) . In
7
Particle Swarm Optimization balanced energy consumption
8
Energy-Efficient Cluster-Head Selection
6. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
6
which W Inertia coefficient rate tends to previous velocity of the particle, c1ratestends to the best
local position of the particle, and c2trendsto the best global position of the particle.
In eq. (5) replacing cr instead of rr improves PSO algorithm as given:
ݒௗ
௪
= ݓ ൈ ݒௗ
ௗ
+ ܿଵ ൈ ݎ ൈ ሺܾܲ݁ݐݏௗ − ݔௗ
ௗ
ሻ + ܿଶ ൈ ݎଶ ൈ ሺܾ݃݁ݐݏௗ − ݔௗ
ௗ
ሻ (4)
ݒௗ
௪
= ݓ ൈ ݒௗ
ௗ
+ ܿଵ ൈ ܿ ൈ ሺܾܲ݁ݐݏௗ − ݔௗ
ௗ
ሻ + ܿଶ ൈ ሺ1 െ ܿሻ ൈ ሺܾ݃݁ݐݏௗ െ ݔௗ
ௗ
ሻ
ݎܥ௧ାଵ ൌ ݇ ൈ ݎܥሺ௧ሻ ൈ ሺ1 െ ݎܥሺ௧ሻሻ
In eq.(6), Crrandom value is created for each round independentlybetween 0and1.which
substitutes bothr1andr2,and parameter k is the number of predicted clusters. Using the chaos
theory in PSO population generation will result in more diverse of the algorithm.
Figure1. Chaos map [17]
As can be see in Figure 1. To achieve more optimal particle swarm optimization algorithm, chaos
theory is applied And in other change to increase the rate of convergence used acceleration
strategy therefore in this mode a number of the population which are the best toward the target
move not all population that it increases the rate of convergence [17].
4. Proposed Method
Our proposed algorithm is composed of two clustering and data transmission phases
4.1. Clustering Phase
In clustering phase, the particles are generated randomly. Then the best points are selected as the
cluster heads and other nodes which are located near each cluster head becomes the member of
the cluster and then fitness function is calculated for every cluster heads. If the fitness function is
better than global best it is substituted. This process is donefor1000generation.Theneach node
prepares a control message that contains identity and value of its residual energy and sends it
directly to the base station .The base station which receives the information performs clustering
operation.
(5)
(6)
7. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
7
4.2. Proposed Validation index
As previously mentioned, the clustering is more desirable in which intra-cluster density is higher
and in another word, the clusters are more cohesive and inter-cluster density is lower. Based on
this principle, in the proposed method to estimate the optimal number of clusters. The first Select
the number of clusters. Also to measure rate of clusters separation the different distance between
cluster than total center of data set for the number of clusters considered, and then calculated the
ratio between two, since the clustering is more desirable .The clusters are more compact and
farther apart So, for the number of clusters where the index is maximum the clustering is more
desirable and the optimal number of clusters is achieved. Validation index is
composedoftwoparts,F1andF2:
ݕݐ݈݅݀݅ܽݒ ൌ maxሺ 1ܨ + 2ܨሻ ( 7 )
Whatever the amount of the above criterion is greater clustering is better. eq.(8) denotes the F1
index and Figure 3 illustrates the cluster dispersion and density of nodes in each cluster:
F1 ൌ ሺ
௧ൈଶ
√௧ൈଶ
ሻ (8)
Inter: inter-cluster distance for which farther is better.
Intra: intra-cluster distance for which closer is better.
Figure2.Performance of the proposed index
Eq. (9),(10) denotes the intra and inter cluster separation:
(9)
In Eq. (9) the total distance between nodes in each cluster and its cluster head ia calculated in
which c is the number of clusters, N is the number of nodes, Xj is the cluster head and Xi denotes
the distance of the nodes from its relative cluster head. The intra cluster separation is shown in the
following equation:
(10)
To calculate the inter clusters separation ,the distance between the centers of the clusters and the
center of total data set is calculated. For cluster range specified the amount of this index
calculate and show in chart.
8. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
8
In the conditions in which the slope of the curve is sharper the estimate of the number of clusters
is more accurate. Then with local search around the slope the optimal number of clusters can be
reached. Eq. (11) Explains how to calculate F2.
F2= cluster heads degree+( residual energyൈ2) / centrality + distance to base station (11)
Residual energy : because of the rest energy effect in being cluster heads is more effective we
considered double its coefficients.
Cluster scale: the number of inter-cluster nodes divided by the total number of network nodes.
Moreover in the above relationship (centrality)is obtained as follows:
centerality ൌ
ට∑ ೞమ
ଵ
(12)
In which, ∑ ݀݅ݏଶ
is the sum of squared distances of nodes to cluster heads. It is assumed that each
node is aware of its position, and can calculate its distance from the base station.
F2 associated per experimental cluster heads to obtain and then its totalfor12experimental cluster
heads is summed. Using 2 coefficient for energy is due to that in discussion of election the rest
energy of cluster heads than other parameters have more important and is more effective and for a
reason we are considered double its coefficient. In F1 formula without use of value coefficient, F1
than F2 was too small and invalidity could not significant effect so, we used -
morecoefficientsthatcouldbalancebetweenF1 andF2effect is created.
.As can be seen in this experiment, when the number of clusters change from 2 to16 the slope of
our validity index change dramatically. Now with local search around the intervals, the exact
number of clusters can be achieved.
Figure3. The proposed validity index when of the number of clusters change
4.3 Data transmission phase
After cluster formation and cluster heads election of each cluster;data can be transmitted by the
normal nodes to corresponding cluster heads. In this phase, each normal node is connected to the
nearest cluster head. Cluster heads are assigned with the implementation of a TDMA schedule to
each cluster member. Each node in the allocated interval sends its data to cluster head in the form
0 5 10 15 20 25
0
50
100
150
200
250
300
350
400
9. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
of data message. The cluster heads
receiving all messages from cluster
computed.
Fig
Energy model of the proposed protocol
illustrated in Fig.4. Energy consumed
calculated as:
ܧ்ሺ,ܭ ܦሻ ൌ ቊ
.ܭ ܧሺ݇, ݀ሻ + ݇.
.ܭ ܧሺ݇, ݀ሻ + ݇
Energy consumption per K bit of data
ERx(k,d) = Erx_elc(k) = k. Eelc
In the above equations, Eelc, denoted the
number of bits is denoted as k
amplification energy is Etx_amp
that transfer factor change in it.
as follows:
ܧ ൌ 5݆݊. ܾ݅.ݐ ݉݃ݏ
International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
cluster heads aggregate and transmit data towards base
cluster member nodes. Then the energy consumption of all
Figure4. Energy consumption model [7]
proposed protocol is the same as the energy model proposed
Energy consumed per bit of data transfer on the distance d in Equation(13
ܧ்ሺܿ݀ሻ ൌ ሺ݇ሻ + ܧ்ೌ
ሺ݇, ݀ሻ
. ߝ௦௦ ݀ଶ
݂݅ ݀ ൏ ݀௦௦௩
݇. ߝ௧௪ି௬ି݀ସ
݈݁ ݁ݏ
of data is calculated as follows:
ERx(k,d) = Erx_elc(k) = k. Eelc
, denoted the energy of sending/receiving message size
number of bits is denoted as k, the distance between the transmitter and receiver is d
Etx_amp and amplifier factor and d crossover is threshold distance
energy consumption of data gathering cluster heads is
frissε
(15)
(16)
(14)
(13)
International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
9
station after
of all nodes is
proposed in [7]and
Equation(13) is
size in terms of
the transmitter and receiver is d, the
amplifier factor and d crossover is threshold distance
gathering cluster heads is calculated
10. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
10
Figure 5. Data transmission phase flowchart
5. Simulation
The algorithm is simulated using MATLAB software. The parameters used are noted in the table
1. ߝ݉andߝ݂ݏ are electronic energies, and EDA is the energy needed for data aggregation at
cluster heads.
Table1.simulation parameters
Parameter Value
ߝ݂ݏ 10 pJ/bit/m2
ߝ݉ 0.0013 pJ/bit/m4
Eelec 50/nJ/bit
EDA 5/nJ/bit/signal
Initial energy per node 0.5 j
Data packet size 4000 bit
Control packet size 200 bit
11. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
11
The first step of our purpose approach is that using PSO to find the most optimal points in area
and then the closest node to it are consider as cluster heads. we have a100 × 100 area with
100nodesrandomlydispersedand also the base station is put on the 50 × 50 coordinates. The
number of particle and the velocity is calculated with respect to the area size .Initially, minimum
particles together work is equal 20-bit and The velocity initially is equal 4.whichwascomparative
and by increase the number of current nodes in the environment are changed.
The most influential parameters in the calculation of PSO are values that must be consider for
c1, c2, w , which in more papers are considered asc1 = c2 = 2 and w = 1 . But to find more
accurate values due to their significant impact on the problem solution, we evaluated all possible
values between different intervals. After1000generations,with the cooperationof20particles
together, as you can see in Figure 6thebest value for the parameter is equal to
c1=c2=0.5andw=0.007.
Figure6. The parameter values c1,c2,w
As the result of the random motion, the particles may be out of the environment that are required
to move back into environment. We apply the support vector machine(SVM)supervised learning
method to return the particle into the environment [22].
Figure7: represents a range of educational particles
In Fig 7, there is a Xi particles outside the range that with ξi(ࣈ > ) is returned into the
environment where compared to moving the particle on the border better results will be achieved.
The next important issue is the value that should be considered for alpha. When the node energy
is less than alpha value the cluster head is replacement. To consider the optimal alpha value all
0.2
0.4
0.6
0.8
1
0.2
0.4
0.6
0.8
1
70
75
80
85
90
W
GlobalBest's Values
C1,C2
X: 0.5
Y: 0.007
Z: 89.6
Fitness
70
72
74
76
78
80
82
84
86
88
12. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
12
values between 0 and 1 with the distance of the0.1 are considered. After running four times and
averaging ,the best alpha value for 100 nodes is equal to 0.8 and for 200nodes is equal to
0.4whichcan be seen in Figure8.
Figure 8. Alpha value in two cases of100nodesand200nodes
Using the formula(11) and run it at 5000rpm for the best number of clusters is equal to 12
That at the end of the first node runs in 2959 round and half of them in 3682 round is dead.
As you can see in Figure9 that cluster heads are suitably dispersed. A point that should be noted is
that the nodes that are close to the base station and its distance to the nearest cluster heads is less,
transmit data directly to the base station and reduce energy consumption considerably.
Figure9.The number of nodes associated to each cluster
We compared the proposed algorithm with the LEACH, CHEF, PSO-MV, GFCM algorithms
which results are as follows. Figure 10shows the rate of dead nodes and network lifetime after
implementing the proposed protocols which is higher compared to LEACH, CHEF, PSO-MV,
GFCM protocols, which increases networks lifetime.
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
1500
2000
2500
3000
Alpha
FirstNodeDies(Round)
100 Nodes
200 Nodes
0 10 20 30 40 50 60 70 80 90 100
0
10
20
30
40
50
60
70
80
90
100
x
y
13. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
13
Figure 10. Comparing the proposed algorithm with four efficient algorithms, namely LEACH,
CHEF, PSO-MV, GFCM in terms of the number of dead nodes
As shown in Figure 10 the first node in the LEACH algorithm dies at 790th round and the last
dies at 1420th round, while using the proposed algorithm the first node dies in round2959 and the
last node dies in the 4150the round which is due to the selection of the best possible cluster heads.
Figure 11 denoted the energy consumed by LEACH, CHEF, PSO-MV, GFCM protocols and the
proposed algorithm in which the proposed protocol has significantly lower total energy
consumption than the other protocols.
Figure 11. Comparing the proposed algorithm with four efficient algorithms, namely LEACH, CHEF, PSO-
MV, GFCM in terms of total energy consumption
As you can see in Figure11. the slope of the proposed algorithm is softer and suitable than that of
the LEACH algorithm which lead to slower energy discharge. Therefore in LEACH 5% of
energy is lost in the 98th round and total energy is finished inthe1238th round While using the
proposed algorithm, 5% of energy is lost inthe233rd round and total energy is finished in the
3971stround, which increases of network lifetime.
6.CONCLUSIONS
In this paper, we introduce a new approach for sensor network clustering using Particle Swarm
Optimization (PSO) algorithm. The parameters which are used in the algorithm are residual
0 10 20 30 40 50 60 70 80 90 100
500
1000
1500
2000
2500
3000
3500
4000
4500
The number of dead nodes
Round
LEACH
CHEF
PSO-MV
GFCM
Proposed Algorithm
0 500 1000 1500 2000 2500 3000 3500 4000 4500 5000
0
5
10
15
20
25
30
35
40
45
50
Round
Dissipatedenergy
leach
CHEF
pso-mv
GFCM
Proposed Algorithm
14. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
14
energy, density, distance from the base station, intra-cluster distance and cluster heads distance
from each other. Our goal was to propose a new cost function to select the best cluster heads that
combine the various criteria affecting the energy efficiency of cluster heads and cluster heads
rotation among the nodes. Also, using the proposed algorithm the network coverage is evaluated
and compared with some previous methods which have proved better performance and improved
network lifetime and energy consumption.
REFERENCES
[1] Akiyldiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, A survey on sensor networks, IEEE
Communication Magazine, vol 40, 2002,pp 102–114.
[2] G. Pottie and W. Kaiser, Wireless integrated sensor networks(WINS), Communications of the ACM,
vol. 43, no. 5 , 2000,pp. 55-58.
[3] G.Hill, R. Szeweyk , A. Woo, D. Culler, S. Hollar, and K.Pister,System architecture directionsfor
networked sensors, in proceedings of the International Conference on Architectural Supportfor
programming Languages and Operating Systems (ASPLoS IX). Cambridge, MA, 2000,pp. 93-104.
[4] W. Merrill, K. Sohrabi, L. Girod , j. Elson , F. Newberg ,and W. Kaiser, Open standard development
plarroems for distributed sensor networks, in Proceedings of SPIE Unattended Ground Sensor
Technologies and Applications IV, Orlando, FL.2002,pp,327-337.
[5] J. M. Kim, S.H. Park, Y.J. Han, T.M. Chung, CHEF: cluster head election mechanism using fuzzy
logic in Wireless Sensor Networks, in: International Conference of Advanced Communication
Technology, 2008, pp. 654–659.
[6] N.Eghbali, Performance Improvement of Information Dissemination Protocols in Sensor Networks
Through Data Aggregation, Computer Engineering and Information TechnologyDepartment, 2007.
PP 1-121.
[7] W. Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy Efficient Communication Protocol
forWireless MicrosensorNetwroks (LEACH), Proceedings of 33rd hawaii international
conferencesystems science - vol.8,2004, pp 3005-3014.
[8] M. Handy , M. Haase , and D.Timmermann, Low energy adaptive clustering hierarchy with
deterministic cluster – head selection , in proceeding of IEEE, International Conference on Mobile
and wirless Communications networks, Stockholm, Sweden,2002, pp. 368-372.
[9] V. Handziski, A. Kopke, H. Karl, C. Frank, W. Drytkiewicz, Improving the Energy Efficiency of
Directed Diffusion Using Passive Clustering,” European Workshop on Wireless SensorNetworks
2004 , pp. 172–187.
[10] O.Younis and S.Fahmy,HEED:Ahybrid,energyefficient,distributed clusteringapproach for adhoc
sensor networks,IEEE Transactions on Mobile Computing,vol.3,no.4,2004,pp.366-379.
[11] V. Loscrì, G. Morabito, S. Marano, A Two-Levels Hierarchy for Low-Energy AdaptiveClustering
Hierarchy,in proceeding of IEEE 2005,pp. 1809-1813.
[12] S. Hussain, A.W. Matin, and O. Islam. Genetic algorithm for energy efficient clusters in wireless
sensor networks. In Fourth International Conference on Information Technology,2007,pp147–154.
[13] D.kumar, T.C.Aseri and R.B.Patel EEHC: Energy efficient hetergenous clustered scheme for wireless
sensor networks, ComputerCommunications,vol 32,2009,pp.662-667.
[14] K. LingaRaj, D. Aradhana and NagaveniB.Biradar. Multiple mobile agents in wireless sensor
networks using genetic algorithms. International Journal of Scientific and Engineering Research,
vol3,2012, pp1–5.
[15] H.Yua, W. Xiaohuia PSO-based Energy-balanced Double Cluster-heads Clustering Routing for
wireless sensor networks ,Procedia Engineering, vol 15 ,2011, pp.3073 – 3077.
[16] S.-H. Hong, B.-K. Kim and J.-M. Gil An Algorithm for an Energy-Efficient Smart Sensor with
EECS Routing Protocol in Wireless Sensor Networks, Springer Science Business Media Dordrecht
2012, pp. 685–692.
[17] Li-Yeh Chuang a, Chih-Jen Hsiao b, Cheng-Hong Yang, Chaotic particle swarm optimization for data
clustering,Elsevier, 2011. PP 109-115.
[18] S.M. Guru, S.K. Halgamuge, and S. Fernando. Particle swarm optimisers for cluster formation in
wireless sensor networks. In Proceedings of the International Conference on Intelligent Sensors,
Sensor Networks and Information Processing,2005,pp 319–324.
[19]J. Hou, X. Fan, W. Wang, J.Jie, and Y. Wang. Clustering strategy of wireless sensor networks
15. International Journal of Managing Information Technology (IJMIT) Vol.6, No.4, November 2014
15
based on improved discrete particle swarm optimization.In The Sixth International Conference on
NaturalComputation (ICNC), vol 7,2010,pp3866–3870.
[20] B.Solaiman , A. Sheta , Computational Intelligence for Wireless Sensor Networks: Applications and
Clustering Algorithms,International Journal of Computer Applications ,Vol 73 ,2013, pp0975 - 8887.
[21] S . He , Y , Dai , R , Zhun , S , Zhao , A Clustering Routing Protocol for Energy Balanc of WSN
based on Genetic Clustering Algorithm , International Conference on Future Computer Supported
Eduction ,2012, pp 788-793
[22] J.Weston and C. Watkins, Multi-class support vector machines, Technical Report CSDTRDepartment
of Computer Science, Royal Holloway, University of London,Egham, 1998, pp98-104.