The document describes a proposed secure clustering protocol for wireless sensor networks that aims to reduce energy consumption while satisfying security needs. The protocol has four phases: 1) Preparation, where keys are distributed and dynamic clusters are formed based on signal strength. Nodes send identifiers to the base station. 2) Aggregator selection, where a node is selected in each cluster as the data aggregator. 3) Data aggregation, where non-aggregator nodes send data to the aggregator node. 4) Data gathering, where aggregator nodes send aggregated data to the base station. The goal is to distribute workload, reduce transmissions, and hide the identities of aggregator nodes to protect against attacks.
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.
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
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Review and Performance Comparison of Distributed Wireless Reprogramming Proto...IOSR Journals
Abstract:A Reprogramming service should be efficient, reliable and secured in Wireless sensor network.
Wireless reprogramming for wireless sensor network emphasize over the process of changing or improving the
functionality of simulation or existing code. For challenging and on demand security purpose, secure and
distributed routing protocols such as SDRP and ISDRP were developed. This paper reviews and compares the
propagation delay for two reprogramming protocols, SDRP and ISDRP, which based on hierarchy of energies
in network. Both are based on identity-based cryptography. But in the improved protocol the keys are
distributed to the network as per the sorting and communication capabilities to improve the broadcast or
communication nature of the network. Moreover, ISDRP demonstrates the security concepts, which deals over
the key encryption properties using heap sort algorithm and the confidentiality parameter is enhanced by
changing the private key values after certain interval of time for cluster head in respect to different public keys.
The ISDRP shows high efficiency rate clearly with the throughput and propagation results by implementation in
practice over SRDP.
Keywords: identity-based cryptography,ISDRP, heapsort algorithm, Reprogramming, SDRP, Wireless sensor
network.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
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.
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
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Review and Performance Comparison of Distributed Wireless Reprogramming Proto...IOSR Journals
Abstract:A Reprogramming service should be efficient, reliable and secured in Wireless sensor network.
Wireless reprogramming for wireless sensor network emphasize over the process of changing or improving the
functionality of simulation or existing code. For challenging and on demand security purpose, secure and
distributed routing protocols such as SDRP and ISDRP were developed. This paper reviews and compares the
propagation delay for two reprogramming protocols, SDRP and ISDRP, which based on hierarchy of energies
in network. Both are based on identity-based cryptography. But in the improved protocol the keys are
distributed to the network as per the sorting and communication capabilities to improve the broadcast or
communication nature of the network. Moreover, ISDRP demonstrates the security concepts, which deals over
the key encryption properties using heap sort algorithm and the confidentiality parameter is enhanced by
changing the private key values after certain interval of time for cluster head in respect to different public keys.
The ISDRP shows high efficiency rate clearly with the throughput and propagation results by implementation in
practice over SRDP.
Keywords: identity-based cryptography,ISDRP, heapsort algorithm, Reprogramming, SDRP, Wireless sensor
network.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
AN ENERGY-EFFICIENT AND SCALABLE SLOTBASED PRIVACY HOMOMORPHIC ENCRYPTION SCH...ijassn
With the advent of Wireless Sensor Networks (WSN) and its immense popularity in a wide range of applications, security has been a major concern for these resource-constraint systems. Alongside security, WSNs are currently being integrated with existing technologies such as the Internet, satellite, Wi-Max, WiFi, etc. in order to transmit data over long distances and hand-over network load to more powerful devices. With the focus currently being on the integration of WSNs with existing technologies, security becomes a major concern. The main security requirement for WSN-integrated networks is providing end-to-end security along with the implementation of in-processing techniques of data aggregation. This can be achieved with the implementation of Homomorphic encryption schemes which prove to be computationally inexpensive since they have considerable overheads. This paper addresses the ID-issue of the commonly used Castelluccia Mykletun Tsudik (CMT) [12] homomorphic scheme by proposing an ID slotting mechanism which carries information pertaining to the security keys responsible for the encryption of individual sensor data. The proposed scheme proves to be 93.5% lighter in terms of induced overheads and 11.86% more energy efficient along with providing efficient WSN scalability compared to the existing scheme. The paper provides analytical results comparing the proposed scheme with the existing scheme thus justifying that the modification to the existing scheme can prove highly efficient for resourceconstrained WSNs.
A N E NERGY -E FFICIENT A ND S CALABLE S LOT - B ASED P RIVACY H OMOMOR...ijassn
With the advent of Wireless Sensor Networks (WSN) a
nd its immense popularity in a wide range of
applications, security has been a major concern for
these resource-constraint systems. Alongside secur
ity,
WSNs are currently being integrated with existing t
echnologies such as the Internet, satellite, Wi-Max
, Wi-
Fi, etc. in order to transmit data over long distan
ces and hand-over network load to more powerful dev
ices.
With the focus currently being on the integration o
f WSNs with existing technologies, security becomes
a
major concern. The main security requirement for WS
N-integrated networks is providing end-to-end
security along with the implementation of in-proces
sing techniques of data aggregation. This can be
achieved with the implementation of Homomorphic enc
ryption schemes which prove to be computationally
inexpensive since they have considerable overheads.
This paper addresses the ID-issue of the commonly
used Castelluccia Mykletun Tsudik (CMT) [12] homomo
rphic scheme by proposing an ID slotting
mechanism which carries information pertaining to t
he security keys responsible for the encryption of
individual sensor data. The proposed scheme proves
to be 93.5% lighter in terms of induced overheads a
nd
11.86% more energy efficient along with providing e
fficient WSN scalability compared to the existing
scheme. The paper provides analytical results compa
ring the proposed scheme with the existing scheme
thus justifying that the modification to the existi
ng scheme can prove highly efficient for resource-
constrained WSNs.
The Wireless Sensor Network is one of the most significant purposes behind the accomplishment of long range wireless communication. Frequent connectivity failures are occurred in the sensor-organised network due to obstruction, snags, message drop because of node energy depletion; obstacle and so forth. The total communication gets collapsed if there any lessening in the nature of correspondence or quality between the sensor nodes or from the sensor nodes to the sink nodes and this prompts to connection failures. To overcome the frequent connectivity failures we propose Diminishing Connectivity Failures by Auto-Reconfiguration in WSN (DCFA). This scheme provides steadfast routes to reduce the connectivity failure and improve the network performance.
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
In this paper, we explored the possibility of using Genetic Algorithm (GA) being used in Wireless Sensor Networks in general with
specific emphasize on Fault tolerance. In Wireless sensor networks, usually sensor and sink nodes are separated by long communication
distance and hence to optimize the energy, we are using clustering approach. Here we are employing improved K-means clustering algorithm to
form the cluster and GA to find optimal use of sensor nodes and recover from fault as quickly as possible so that target detection won’t be
disrupted. This technique is simulated using Matlab software to check energy consumption and lifetime of the network. Based on the
simulation results, we concluded that this model shows significant improvement in energy consumption rate and network lifetime than other
method such as Traditional clustering or Simulated Annealing
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.
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.
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.
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.
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
EFFICIENT REBROADCASTING USING TRUSTWORTHINESS OF NODE WITH NEIGHBOUR KNOWLED...ijiert bestjournal
Mobile Ad hoc network is an infrastructure less communication network with limited resources. To maintain virtual
infrastructure for communication broadcasting mechanisms is used. Due to lack of energy efficiency in Mobile Ad
hoc network, there is a need to develop an efficient broadcasting model which enhances energy efficiency. Also
nodes with malicious behaviour cause an internal threat that disobeys the standard and degrades the performance of
routing protocols. This paper introduced an enhanced rebroadcasting algorithm, where rebroadcasting decision for
next hop is immediate or delayed on the basis of trust value and energy level of particular node. This approach helps
to decrease number of rebroadcast, energy consumption and also enhances security. The decision is made with trust
value associated with node, their remaining energy and total number of uncovered nodes.
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.
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
This presentation is all about the wireless sensor networks, how they collect data using aggregation, and how they evaluate or calculate the parameters
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.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
AN ENERGY-EFFICIENT AND SCALABLE SLOTBASED PRIVACY HOMOMORPHIC ENCRYPTION SCH...ijassn
With the advent of Wireless Sensor Networks (WSN) and its immense popularity in a wide range of applications, security has been a major concern for these resource-constraint systems. Alongside security, WSNs are currently being integrated with existing technologies such as the Internet, satellite, Wi-Max, WiFi, etc. in order to transmit data over long distances and hand-over network load to more powerful devices. With the focus currently being on the integration of WSNs with existing technologies, security becomes a major concern. The main security requirement for WSN-integrated networks is providing end-to-end security along with the implementation of in-processing techniques of data aggregation. This can be achieved with the implementation of Homomorphic encryption schemes which prove to be computationally inexpensive since they have considerable overheads. This paper addresses the ID-issue of the commonly used Castelluccia Mykletun Tsudik (CMT) [12] homomorphic scheme by proposing an ID slotting mechanism which carries information pertaining to the security keys responsible for the encryption of individual sensor data. The proposed scheme proves to be 93.5% lighter in terms of induced overheads and 11.86% more energy efficient along with providing efficient WSN scalability compared to the existing scheme. The paper provides analytical results comparing the proposed scheme with the existing scheme thus justifying that the modification to the existing scheme can prove highly efficient for resourceconstrained WSNs.
A N E NERGY -E FFICIENT A ND S CALABLE S LOT - B ASED P RIVACY H OMOMOR...ijassn
With the advent of Wireless Sensor Networks (WSN) a
nd its immense popularity in a wide range of
applications, security has been a major concern for
these resource-constraint systems. Alongside secur
ity,
WSNs are currently being integrated with existing t
echnologies such as the Internet, satellite, Wi-Max
, Wi-
Fi, etc. in order to transmit data over long distan
ces and hand-over network load to more powerful dev
ices.
With the focus currently being on the integration o
f WSNs with existing technologies, security becomes
a
major concern. The main security requirement for WS
N-integrated networks is providing end-to-end
security along with the implementation of in-proces
sing techniques of data aggregation. This can be
achieved with the implementation of Homomorphic enc
ryption schemes which prove to be computationally
inexpensive since they have considerable overheads.
This paper addresses the ID-issue of the commonly
used Castelluccia Mykletun Tsudik (CMT) [12] homomo
rphic scheme by proposing an ID slotting
mechanism which carries information pertaining to t
he security keys responsible for the encryption of
individual sensor data. The proposed scheme proves
to be 93.5% lighter in terms of induced overheads a
nd
11.86% more energy efficient along with providing e
fficient WSN scalability compared to the existing
scheme. The paper provides analytical results compa
ring the proposed scheme with the existing scheme
thus justifying that the modification to the existi
ng scheme can prove highly efficient for resource-
constrained WSNs.
The Wireless Sensor Network is one of the most significant purposes behind the accomplishment of long range wireless communication. Frequent connectivity failures are occurred in the sensor-organised network due to obstruction, snags, message drop because of node energy depletion; obstacle and so forth. The total communication gets collapsed if there any lessening in the nature of correspondence or quality between the sensor nodes or from the sensor nodes to the sink nodes and this prompts to connection failures. To overcome the frequent connectivity failures we propose Diminishing Connectivity Failures by Auto-Reconfiguration in WSN (DCFA). This scheme provides steadfast routes to reduce the connectivity failure and improve the network performance.
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
In this paper, we explored the possibility of using Genetic Algorithm (GA) being used in Wireless Sensor Networks in general with
specific emphasize on Fault tolerance. In Wireless sensor networks, usually sensor and sink nodes are separated by long communication
distance and hence to optimize the energy, we are using clustering approach. Here we are employing improved K-means clustering algorithm to
form the cluster and GA to find optimal use of sensor nodes and recover from fault as quickly as possible so that target detection won’t be
disrupted. This technique is simulated using Matlab software to check energy consumption and lifetime of the network. Based on the
simulation results, we concluded that this model shows significant improvement in energy consumption rate and network lifetime than other
method such as Traditional clustering or Simulated Annealing
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.
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.
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.
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.
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
EFFICIENT REBROADCASTING USING TRUSTWORTHINESS OF NODE WITH NEIGHBOUR KNOWLED...ijiert bestjournal
Mobile Ad hoc network is an infrastructure less communication network with limited resources. To maintain virtual
infrastructure for communication broadcasting mechanisms is used. Due to lack of energy efficiency in Mobile Ad
hoc network, there is a need to develop an efficient broadcasting model which enhances energy efficiency. Also
nodes with malicious behaviour cause an internal threat that disobeys the standard and degrades the performance of
routing protocols. This paper introduced an enhanced rebroadcasting algorithm, where rebroadcasting decision for
next hop is immediate or delayed on the basis of trust value and energy level of particular node. This approach helps
to decrease number of rebroadcast, energy consumption and also enhances security. The decision is made with trust
value associated with node, their remaining energy and total number of uncovered nodes.
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.
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
This presentation is all about the wireless sensor networks, how they collect data using aggregation, and how they evaluate or calculate the parameters
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.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
IMPLEMENTATION OF SECURITY PROTOCOL FOR WIRELESS SENSORijcsa
Intrusion Detection is one of the methods of defending against these attacks. In the proposed a security protocol for homogeneous wireless sensor network; network with all nodes are of same type. Clustering is used to improve the energy efficiency. Zone-Based Cluster Protocol (ZBCA) is used for selection of cluster head which is effective in scalability and energy consumption. Single hop technique is used for
communication within normal nodes and cluster head to base station. Simulation of proposed algorithm is performed in MATLAB. Sleep Deprivation Attack has been analyzed where attacker changes the environmental values by an artificial event. Attacker produces an event in environment due to which nodes have to sense the environment more than once in the same round that increase the power consumption of
the node. This interrupt reduces the network life time as nodes are not allowed to go in sleep mode and they are not able to perform their function of data collection and reporting to Cluster head and Base Station properly. Proposed protocol identifies this attack and prevents it from happening by solating the attacker node.
CAMP: cluster aided multi-path routing protocol for the wireless sensor, according to an article written by "Mohit Sajwan1 • Devashish Gosain2 • Ajay K. Sharma1
EFFICIENT HIERARCHICAL ROUTING PROTOCOL IN SENSOR NETWORKSijassn
Wireless sensor network (WSN) is the network of hundreds and thousands of micro-sensor nodes,
connecting each other by a wireless medium.WSN provide reliable sensing of the environment, detecting
and reporting events to the sink. One of the most important constraints of WSN is energy consumption.
Since the micro sensors are small in dimension, batteries are necessary to produce power to the network. In
this paper, we have proposed an algorithm for hierarchy based protocols of wireless sensor networks,
which consist of two groups of sensor nodes in a single cluster node. Each cluster consists of a three cluster
head. The event driven data sensing mechanism is used in this paper and this sensed data is transmitted to
the master section head. The gathered data is transmitted to the sink via mobile agent. Hence efficient way
of data transmission is possible with larger group of nodes. In this approach of using hierarchy based
protocols; the lifetime of the sensor network is increased. This paper proposes an innovative approach of
cluster head election. The results are compared with LEACH protocol and proved to be energy efficient.
An Analytical Model of Latency and Data Aggregation Tradeoff in Cluster Based...ijsrd.com
Sensor networks are collection of sensor nodes which co-operatively send sensed data to base station. As sensor nodes are battery driven, an efficient utilization of power is essential in order to use networks for long duration. Therefore it is needed to reduce data traffic inside sensor networks, thereby reducing the amount of data that is needed to send to base station. The main goal of data aggregation algorithms is to gather and aggregate data in an energy efficient manner so that network lifetime is enhanced. In wireless sensor network, periodic data sampling leads to enormous collection of raw facts, the transmission of which would rapidly deplete the sensor power. A fundamental challenge in the design of wireless sensor networks (WSNs) is to maximize their lifetimes. Data aggregation has emerged as a basic approach in WSNs in order to reduce the number of transmissions of sensor nodes, and hence minimizing the overall power consumption in the network. Data aggregation is affected by several factors, such as the placement of aggregation points, the aggregation function, and the density of sensors in the network. In this paper, an analytical model of wireless sensor network is developed and performance is analyzed for varying degree of aggregation and latency parameters. The overall performance of our proposed methods is evaluated using MATLAB simulator in terms of aggregation cycles, average packet drops, transmission cost and network lifetime. Finally, simulation results establish the validity and efficiency of the approach.
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNIJCNCJournal
In this article it has presented leach extended hierarchical 3-level clustered heterogeneous and dynamics
algorithm. On suggested protocol (LEH3LA) with planning of selected auction cluster head, and
alternative cluster head node, problem of delay on processing, processing of selecting members, decrease
of expenses, and energy consumption, decrease of sending message, and receiving messages inside the
clusters, selecting of cluster heads in large sensor networks were solved. This algorithm uses hierarchical
heterogeneous network (3-levels), collective intelligence, and intra-cluster interaction for communications.
Also it will solve the problems of sending data in Multi-BS mobile networks, expanding inter-cluster
networks, overlap cluster, genesis orphan nodes, boundary change dynamically clusters, using backbone
networks, cloud sensor. Using sleep/wake scheduling algorithm or TDMA-schedule alternative cluster head
node provides redundancy, and fault tolerance. Local processing in cluster head nodes, and alternative
cluster head, intra-cluster and inter-cluster communications such as Multi-HOP cause increase on
processing speed, and sending data intra-cluster and inter-cluster. Decrease of overhead network, and
increase the load balancing among cluster heads. Using encapsulation of data method, by cluster head
nodes, energy consumption decrease during sending data. Also by improving quality of service (QoS) in
CBRP, LEACH, 802.15.4, decrease of energy consumption in sensors, cluster heads and alternative cluster
head nodes, cause increase on lift time of sensor networks.
Energy Proficient and Security Protocol for WSN: A Reviewtheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Theoretical work submitted to the Journal should be original in its motivation or modeling structure. Empirical analysis should be based on a theoretical framework and should be capable of replication. It is expected that all materials required for replication (including computer programs and data sets) should be available upon request to the authors.
The International Journal of Engineering & Science would take much care in making your article published without much delay with your kind cooperation
AggreLEACH: Enhance Privacy Preserving in Wireless Sensor Networkijsrd.com
Privacy preservation is an important issue in today's context of extreme penetration of internet and mobile technology. It is more important in the case of wireless sensor network where collected data often requires in network processing and collaborative computing. Security is always booming in wireless sensor network. Privacy preserving data aggregation emerged as an important concern in designing data aggregation algorithm. Encryption schemes that support operation over cipher text are of utmost for wireless sensor networks & especially in LEACH protocol. The salient limit of LEACH is energy. Due to this limitation, it seems important to design Confidentiality scheme for WSN so that sensing data can be transmitted to the receiver securely and efficiently and the energy consumed must be minimum hence we proposed AggreLEACH in which confidentiality scheme i.e. holomorphic encryption is added to LEACH protocol. In holomorphic encryption data can be aggregated without decryption and hence less energy consumption. The objective is to provide secure data transmission between sensor node and aggregator. Simulation result are obtain in terms of two metrics- total energy Consumed of node, life-time of node. It is observed that the performance of AggreLEACH compare to LEACH. We have performed theoretical analysis as well as simulation to check the performance in terms of accuracy, complexity and security.
The popularity of Wireless Sensor Networks (WSN) have increased rapidly and tremendously due to the vast potential of the sensor networks to connect the physical world with the virtual world. Since sensor devices rely on battery power and node energy and may be placed in hostile environments, so replacing them becomes a difficult task. Thus, improving the energy of these networks i.e. network lifetime becomes important. The thesis provides methods for clustering and cluster head selection to WSN to improve energy efficiency using fuzzy logic controller. It presents a comparison between the different methods on the basis of the network lifetime. It compares existing ABC optimization method with BFO algorithm for different size of networks and different scenario. It provides cluster head selection method with good performance and reduced computational complexity. In addition it also proposes BFO as an algorithm for clustering of WSN which would result in improved performance with faster convergence.
A LOW-ENERGY DATA AGGREGATION PROTOCOL USING AN EMERGENCY EFFICIENT HYBRID ME...IJCNCJournal
Recent wireless sensor network focused on developing communication networks with minimal power and cost. To achieve this, several techniques have been developed to monitor a completely wireless sensor network. Generally, in the WSN network, communication is established between the source nodes and the destination node with an abundant number of hops, an activity which consumes much energy. The node existing between source and destination nodes consumes energy for transmission of data and maximize network lifetime. To overcome this issue, a new Emergency Efficient Hybrid Medium Access Control (EEHMAC) protocol is presented to reduce consumption of energy among a specific group of WSNs which will increase the network lifetime. The proposed model makes a residual battery is utilized for effective transmission of data with minimal power consumption. Compared with other models, the experimental results strongly showed that our model is not only able to reduce network lifetime but also to increase the overall network performance.
An Efficient Approach for Data Gathering and Sharing with Inter Node Communi...cscpconf
In today’s era Wireless sensor networks (WSNs) have emerged as a solution for a wide range of
applications. Most of the traditional WSN architectures consist of static nodes which are densely deployed
over a sensing area. Recently, several WSN architectures based on mobile elements (MEs) have been
proposed. Most of them exploit mobility to address the problem of data collection in WSNs. The common
drawback among them is to data sharing between interconnected nodes. In this paper we propose an
Efficient Approach for Data Gathering and Sharing with Inter Node Communication in Mobile-Sink. Our
algorithm is divided into seven parts: Registration Phase, Authentication Phase, Request and Reply Phase,
Setup Phase, Setup Phase (NN), Data Gathering, and Forwarding to Sink. Our approach provides an
efficient way to handle data in between the intercommunication nodes. By the above approach we can
access the data from the node which is not in the list, by sharing the data from the node which is
approachable to the desired node. For accessing and sharing we need some security so that the data can
be shared between authenticated nodes. For this we use two way security approach one for the accessing
node and other for the sharing.
Similar to DESIGNING SECURE CLUSTERING PROTOCOL WITH THE APPROACH OF REDUCING ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORKS (20)
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
"Impact of front-end architecture on development cost", Viktor TurskyiFwdays
I have heard many times that architecture is not important for the front-end. Also, many times I have seen how developers implement features on the front-end just following the standard rules for a framework and think that this is enough to successfully launch the project, and then the project fails. How to prevent this and what approach to choose? I have launched dozens of complex projects and during the talk we will analyze which approaches have worked for me and which have not.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
When stars align: studies in data quality, knowledge graphs, and machine lear...
DESIGNING SECURE CLUSTERING PROTOCOL WITH THE APPROACH OF REDUCING ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORKS
1. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
DOI : 10.5121/ijcnc.2013.5403 31
DESIGNING SECURE CLUSTERING PROTOCOL WITH
THE APPROACH OF REDUCING ENERGY
CONSUMPTION IN WIRELESS SENSOR NETWORKS
Sanaz Sadeghi1
and Behrouz Sadeghi2
1
Department of Computer Engineering, Ferdowsi University of Mashhad, Iran
Sanaz.sadeghi.stu@gmail.com
2
Department of Computer Engineering, Payam noor University of Taybad, Iran
Sadehghi.b@pnurazavi.ac.ir
ABSTRACT
In recent years, many researchers have focused on wireless sensor networks and their applications. To
obtain scalability potential in these networks most of the nodes are categorized as distinct groups named
cluster and the node which is selected as cluster head or Aggregation Node offers the operation of data
collection from other cluster nodes and aggregation and sending it to the rest of the network. Clustering
and data aggregation increase network scalability and cause that limited resources of the network are used
well. However, these mechanisms also make several breaches in the network, for example in clustered
networks cluster head nodes are considered Desirable and attractive targets for attackers since reaching
their information whether by physical attack and node capturing or by other attacks, the attacker can
obtain the whole information of corresponding cluster. In this study secure clustering of the nodes are
considered with the approach of reducing energy consumption of nodes and a protocol is presented that in
addition to satisfying Advanced security needs of wireless sensor networks reduces the amount of energy
consumption by the nodes. Due to network clustering there is scalability potential in such a network and
According to frequent change of cluster head nodes load distribution is performed in the cluster and
eventually increase the network lifetime.
KEYWORDS
Secure clustering, attack, remaining energy, dynamic clustering and data aggregation
1. INTRODUCTION
Nowadays, wireless sensor network are increasingly becoming important in different military and
civilian applications. With the recent advances in wireless communication technologies, Wireless
sensor networks had a huge leap forward compared with traditional sensor networks. A wireless
sensor network has a number of wireless nodes which are set on an unprotected area near or
inside the targets that want to see their status as dense. These wireless nodes alternatively sense
the targets' status, process the obtained data and then transfer them to a base station. All sensor
nodes cooperate with each other to make a communication network in order to present reliable
network services. Cooperation between sensor nodes is important in WSN due to 2 reasons:
1- Data gathered by some sensor nodes can provide a valuable inference about the
environment.
2- Cooperation between sensor nodes can create compromise between Communication costs
and computation energy.
Since it may be possible that data obtained from sensor node be completely coordinate with its
neighbors' data, data aggregation can reduce extra information transmitted in the network. We
know that energy consumed for the transfer of one bit data is equal to energy required for a
2. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
32
number of computational operations in a sensor processor. When the base station is far applying
regional data aggregation instead of direct communication has considerable advantages. Also
nodes' clustering creates a topology control approach to reduce transmission overheads and
applies data aggregation among a number of sensor nodes; therefore it is vital for facilitating the
practical layout and performance of wireless sensor networks.
Since wireless sensor nodes are usually arranged in open and unprotected environments which
don't have physical protection, they are inherently more vulnerable to malware attacks
particularly in enemy environment like Battlefield traditional security mechanisms are not
directly available for these networks because their Unique constraints are not considered. It is
very difficult to design security mechanisms or protocols which are both efficient in the case of
energy and powerful in the case of security to protect sensor network against malware attacks. In
this case secure clustering means Robustness against attacks. Based on the amount of resources
and knowledge of the attacker, these attacks may have different goals. For example the primary
goal may be the reduction of the efficiency of gathering data sensed by sensor nodes or complete
disrupting in the operation of sensor networks. This goal can be fulfilled by whether preventing
algorithm ending or confusing nodes about their responsibilities in the network. Mutually, the
goal of an attacker may be predicting network structure, namely predicting cluster head nodes or
nodes which may be allocated to a cluster head node as a member. This may be possible by for
example hearing the packages sent by nodes during the process of cluster head selection or by
extracting information from parameters which are generally available. Received information can
be used for attacks which target cluster heads or nodes. Of course it is clear that the attacks which
target cluster head are more effective than those which attack nodes randomly. Obviously, since
sensor networks often work in Hostile environments none of them can neglect the security
viewpoint in designing protocol of selecting cluster head. Also, as sensor nodes are nourished by
battery they have very limited energy capacity. These limitations cause many challenges in the
field of developing hard ware, software, designing architectures and network protocols for sensor
networks. To increase effective lifetime of sensor network, energy efficiency should be
considered in all aspects of designing sensor networks. Organizing nodes in separate groups for
preventing extra data transfer is a method for reducing nodes' energy consumption but on the
other hand the problem of clustering is that cluster heads requiring operations such as gathering
data from other nodes and their aggregation and sending them to base station have the most
energy consumption so some protocols are suggested to overcome this problem in which by
Intermittent change of cluster heads the amount of consumed energy is distributed in a cluster and
Workload and the most energy consumption won't be limited to aggregate nodes or cluster heads.
On the other hand, based on their application wireless sensor network nodes are arranged in the
environment randomly and without exact engineering and scheduling and network topology is
continuously changed due to Node failures, node Damaged, adding new nodes to the network
node energy drain or channel fading so we should also consider this condition that in some
applications organizing nodes in Fixed and static clusters without considering network dynamism
make designed protocols impractical and useless. Therefore in designing protocol for wireless
sensor networks some arrangements should be considered in this field.
2. RELATED WORKS
Investigating the history of this subject and considering the properties that a protocol should have
in order to be more secure and considering offensive models defined for different types of
enemies, the protocols raised in the field of secure clustering are organized based on how much
they satisfy these needs and how many mechanisms are generally used to satisfy these needs.
Protocols proposed in [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13] satisfy the properties of completion,
evolution, adaptation and non manipulation of role and allocation Facing Passive attacker but they
3. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
33
have Weaknesses facing active and aggressive attackers and in the case of these attacks just the
properties of completion and evolution are met. As an example of such protocols Reliable
clustering protocol suggested in [8] provides a hierarchy of clustering against cluster head failures
in underwater sensor networks. This proposed algorithm is applicable not only in underwater
sensor networks but also in all wireless sensor networks. This protocol selects a primary cluster
head and a Backup for each cluster member to prevent re clustering in the case of failure. The
network has Homogeneous sensor nodes which are located in one of the following conditions
during clustering process: cluster head, cluster member or candidate for cluster head. At first each
node is in the state of being candidate for cluster head. Protocol is divided in to 3 steps:
Initialization, clustering and completion. In the initialization step each node finds its one hop
neighbors and keeps a set of discovered neighbors which include neighbors which are still in the
state of being candidate for cluster head. In this set each node creates all possible cluster heads
combinations, namely if each node has n discovered neighbor it will create 2n
potential cluster.
Among all potential clusters each candidate selects one cluster as its Eligible cluster with the
average minimum cost and use a Function based on energy consumption and energy remained
from cluster head members to calculate its costs. In addition to the protocols' capabilities
discussed in the previous part, the protocol proposed in [14] also provides compatibility feature in
facing active attacker and Allocation indiscrimination in facing both active and passive enemies.
In [14] the writers proposed SecLEACH as Promotion protocol of the known clustering LEACH
[15]. The main idea of LEACH is to validate the cluster head advertising messages by the help of
base station and using Massage Authentication Code for all messages exchanged in the protocol.
Other methods used are One-way key chains with delayed key disclosure suggested in [16] and
Prior distribution of the random key suggested in [17]. Some protocols like those suggested in
[18, 19, 20, 21] in addition to the capabilities of protocols of 2-2, also satisfy the feature of
unpredictability of role in facing passive attacker although this set of protocols don't satisfy the
features of compatibility and Allocation indiscrimination in facing active enemies.
In the protocol proposed in [19] it is supposed that all nodes are homogeneous and simultaneously
connect each other under a model and time is divided in to rounds. In this protocol each message's
length is limited to O(log n) and can contain Fixed number of node identifiers. The algorithm is
divided in to 2 phases. In the first phase a dominant set of cluster heads are selected and in the
second phase this set is expanded to a k times dominant set in which each node is covered by at
least k cluster heads. The first part of the algorithm is done by repetitive reduction of active
nodes. In the second part of the algorithm the number of neighboring cluster heads of all nodes
are investigated. If this number c is less than k, the specified node selects kc normal neighboring
nodes randomly to become its cluster heads and inform these nodes about this event. Otherwise, if
sufficient number of cluster heads were selected, the algorithm is finished. The protocol proposed
in [22] satisfies all criteria facing passive attacker and also facing active attacker satisfies
compatibility and unpredictability. The writers suggested a cluster head selection protocol in [22]
which aims at preventing that a passive attacker predicts and diagnoses the role and allocation of
nodes. The general idea of this suggested algorithm is that Observable behavior of nodes is
identical from the view of all nodes, this idea is attained by coding all messages of the protocol
and it is necessary that all nodes send same number of messages by a random combination.
Therefore, for a passive attacker no node is distinguishable from other nodes which means that
the protocol doesn't leak out any information about the role and the way of nodes' allocation to
cluster heads. The protocols proposed in [23, 24] are the Most advanced security protocols
provided. Protocol [24] even facing an aggressive attacker satisfies compatibility conditions and
provides protection about the information of the nodes' role. An example of these protocols is
[23] which hides the identity of aggregated node from those who Eavesdrop from outside and the
nodes which have been captured. Two data aggregation and query protocols have been also
proposed which let aggregated nodes receive and aggregate the information of other nodes and
4. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
34
send data to the main station without leaking the information out of network. Secure data
aggregation protocol is formed of 4 phases: primary preparation, in this phase the required secure
communication channel is created. The phase of selecting aggregating node, in this phase we
should assure that no cluster is without aggregated node. Data aggregation phase which should be
able to send information to aggregating node without letting other nodes understand which node
is aggregation node. And query phase in which for example a mobile operator may decide to do
inquiry on data.
3. EXISTING CHALLENGES
With the developments of wireless sensor networks and increasing of usage and performance of
these networks in different applications, establishing security in several usage of wireless sensor
networks is undeniable, for example in a network of gathering sensitive military information, if
these information were accessible to all and if these information were exchanged without
applying security mechanisms, in practice this kind of network is not practical.
In the existing protocols in secure clustering, some of the exclusive characteristics of these
networks that are not negligible are not considered, for example, hard energy constraints, and
memory limitation of sensor nodes, so defining a secure clustering protocol with considering
these constraints is very necessary.
In most existing algorithms, since the cluster head elects in probabilistic manner, maybe the
elected cluster heads are so near to each other so we should consider some special parameters in
this decision process.
With considering the last protocols like LEACH [15] in that the nodes remaining energy was not
considered in election method, maybe nodes with little remained energy becomes cluster head
that causes decreasing in network lifetime.
According to probability election of the cluster heads, it is possible that the nodes in edge of the
network or in regions that the density of nodes is low, selects as cluster heads so that the other
nodes associated with these nodes should use more energy to send/receive data from these cluster
heads.
4. ASSUMPTIONS, LIMITATIONS
A wireless sensor network is usually made of a number of multi-purpose cheap sensor nodes with
low power which are arranged in the desired region. These sensor nodes are small in size but are
equipped with embedded microprocessors and radio transmitters and receivers so they have not
only sensor ability but also the ability of data processing and communication. They communicate
in short distances by wireless media and work together for a common duty like environmental
monitoring, war zone monitoring and controlling industrial process. Wireless sensor networks
have some unique properties and limitation compared with traditional wireless communications
networks:
Supplying energy for sensor nodes by battery. Sensor nodes are usually nourished by battery.
Most of the times sensor nodes are arranged in harsh environments or war zones so changing or
recharging of their batteries is difficult and even impossible.
Severe limitations in energy, computations and memory. Sensor nodes are very limited in the case
of energy capacities, computations and storage.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
35
Configurations. Sensor nodes are usually arranged randomly and without exact scheduling. After
primary arrangement, sensor nodes should be able to configure themselves independently inside
communication network.
Unreliable sensor nodes. Sensor nodes are usually arranged in harsh environments or war zones
without supervision and are vulnerable to physical damages.
Frequent topology change. Network topology is frequently changed due to node failure, node
damage, adding new nodes to network, node energy drain or channel fading.
Data redundancy. In most of sensor network applications, sensor nodes are arranged in the
desired region and work together for a common purpose. Therefore data sensed by several sensor
nodes surely have a level of redundancy or Solidarity.
Numeral data. Since in most of the applications of sensor network sensor nodes are distributed in
the environment in order to monitor it and gather information about the region's status, in
designing this protocol it is supposed that sensed data are numeral and sense and send quantities
such as temperature, humidity and alike.
Simulation. Due to high cost and Unavailability of required equipments and time limitation for
practical Implementation of the proposed protocol, finally the result is investigated as simulated.
The above mentioned items are unique properties and limitations which should be considered in
the field of protocol design for sensor networks.
5. The Secure Clustering Protocol
With considering the challenges and specific limitations of the network, the proposed secure
clustering protocol consists of four phases of preparation, aggregator selection, data aggregation
and data gathering.
5.1 The First Phase-Preparation
This phase is the initiation of the algorithm execution and has three steps. The target of this phase
is preparation, establishing a secure channel and determining the communication network
topology.
The first step of this phase is distribution of keys among the nodes. These keys are used for
having secure communication among nodes and base station. In this algorithm, to establish a
secure node to base station communication, each node has a common key with base station.
Also for authenticating the broadcast messages, the one way key chain is used. In one way key
chain ζ is the generator that only the base station knows its value. From this generator and the
production function f the chain of keys produce.
This function has the one way property, it means that we have:
F ( ) =
So for authenticating the base station broadcast messages, kj
is sent and because the f function is
saved in all nodes, with finding the output of the function with previous value of kj
and
comparing with present kj
, the nodes check the authentication of the base station.
Because with considering the nodes statically, they may be forced to send their sensed data to
nodes far from them, it can cause wasting lots of energy; the second step of this phase is
formation dynamic clusters. In this step, some random nodes broadcast some identifiers. The
6. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
36
Nodes receiving this message, store the strongest signal strength of the received identifier, this
identifier shows that the nodes with same identifier are closer and better selections for formation
of the same cluster. In this step actually the closed nodes are identified and at last of this step all
the nodes send their identifier securely to the base station with their common key with base
station.
In the third step of the first phase, nodes organized in a logical ring. A ring is a path between the
nodes in which every node is visited at least one time. It is possible in large rings with lots of
nodes that some nodes be visited more than once that causes communication overhead in the
network. However, in this protocol our idea is not restricted to the way of ring creation and in this
step we just need that a logical ring being established between the closer nodes specified in
previous step. So each node should just know his next hop that is his right neighbor in the ring
and this neighbor must be accessible from that node.
5.2 The Second Phase- Aggregator Election
The main goal of this phase is that from the nodes within a ring, one or more nodes be selected as
the data aggregator of the cluster and collect, aggregate and store the sensed data of the ring,
while the identity of these nodes to the rest of the cluster nodes and the base station remains
unknown. This phase consists of two steps. In first step, each node decides whether it wants to be
an aggregator or no locally. In previous works in this field, this decision was made just in
probabilistic manner, while with strong energy limitations of sensor nodes, in this protocol there
are parameters that help this decision be made better.
In this step, one node which is chosen randomly starts calculating its chance of being aggregator.
To do this, it sends the triple of its id, its remaining energy and a counter that at first is set to one,
to its right neighbor in the ring. Each node with receiving this message adds its remaining energy
to the one in the message and increases the counter one unit and forwards it to its right neighbor.
This process continues in the ring till the message arrives to the starter node (the initiator id is
sent over the message). This node calculates the average remaining energy of the ring by dividing
the sum of the remained energy to the counter and forwards this value one round more in the ring.
Every node calculates its chance of being aggregator by this value proportionally, so to increase
throughput and prolonged network lifetime, this election is done not probability but with
considering the specifications of the node. The equations below show these processes.
Eavg= (e/counter) (2)
Pr∼ (e- Eavg) (3)
In the second step of the second phase, in order to prevent of not having aggregator in the cluster,
the nodes must run a specific process that make sure that in this ring there is selected at least one
aggregator node and also the identity of this(these) aggregator node(s) are still unknown. This
step can be done by the protocol presented in [25].
5.3 The Third Phase- Data Aggregation
In this phase the process of how data is forwarded in the ring without knowing the identity of the
aggregators is specified. This procedure uses directly the ring topology which was formed in
preparation phase. The starter node starts the aggregation by sending its sensed data as a token to
its right neighbor. With receiving the token each node, adds its data to the token and forward it to
its neighbor. When the starter receives the token again, it forwards this value again in the ring and
so the aggregator(s) can save the aggregated data.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
37
Figure1. Data aggregation
5.4 The Fourth Phase- Data Collection
The final goal of a sensor network is forwarding sensed data to the base station. This sending may
be on demand of the base station that is called query-driven. The purpose of this protocol is that
the requested data of the base station being provided while aggregator node's identity still remains
unknown. In the solution presented in this issue, it is need that the base station places in the
frequency range of one of the nodes inside the ring. To establish a secure connection and to
authenticate the base station to each node, a one-way key chain that was described in the first
phase is used. After base station selects one node randomly, it sends its query to the selected
node. Once, for example, node A become sure of the identity of the base station forwards the
query into the ring, each node receives the query if it is a non aggregator node just encrypt a
nonsense data and forward it and if the node is aggregator it also adds the aggregated data to it.
This process can be summarized as follows:
Figure2. Data collection function
With receiving the message from node A, the base station can easily reproduce the hash values,
because it shares key with all the nodes in the ring. So with subtracting the hash values from the
final R, cM is got where c is the number of aggregator nodes within the cluster and M is the
measured data. Given that the base station doesn’t know the number of aggregator nodes in the
ring, with selecting the appropriate value of c, the original c can be found. With respect to the
range of measured values, it is easily proved [23] that in this area there is only one value for c that
we have:
6. EVALUATION RESULTS
At the end to compare the proposed protocol in this paper with other protocols presented in this
field, we use evaluation metrics that were introduced in [1].
Relating to security, and in order to find how much secure this protocol is, the below parameters
are used.
6.1 Termination
The termination property requires the protocol to terminate in a limited time, so in this way to
meet this property dead-locks or infinite waiting times are not allowed. In this protocol since the
selection process lasts in finite time, it meets this property.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
38
6.2 Completeness
The completeness property can be interpreted only if the termination property is met, and requires
every terminated node to have its role.
6.3 Consistency
According to the consistency property, if the node’s role is that of a cluster member, then the
node should be associated with a cluster head that further believes itself as cluster head. As a
counterexample, if a cluster member node thinks that it is associated with node B, and node B
does not believe itself to be cluster head, then the protocol is not consistent.
6.4 Non-manipulability
Two different kinds of non-manipulability property can be defined, role non-manipulability and
association non-manipulability. These properties state that the adversary should not be able to
alter the role or the association of the sensor nodes during the election process. This property is
important, because if an adversary could alter its role or association, then he could, for example,
force a node controlled by him to become cluster head all the time. Hence, he could take over the
control of a significant part of the sensor network and the whole cluster of that cluster head. And
also, the enemy could force it’s under controlled nodes to always become a cluster member, thus
it can help the enemy for saving energy of its nodes.
6.5 Unpredictability
Unpredictability makes the adversary incapable of precisely determining the identity of the cluster
head before the election process; this goal is to prevent the adversary from predicting the
upcoming cluster head, since that node may become the primary target of attacks.
6.6 Unidentifiability
Unidentifiability is very similar to unpredictability with this difference that it allows the adversary
to observe the election process and nevertheless the enemy would not be able in detecting the
roles of the nodes and also the association of the nodes that means which node is belong to which
cluster.
With introducing these parameters and with analyzing our presented protocol, we can claim that
this protocol meets all the security requirements and have met the six properties defined so far
with respect to all kinds of adversaries like passive adversary, active adversary and compromised
enemy.
7. CONCLUSIONS
The principle of the proposed protocol is to establish a secure network and provides a secure
protocol in wireless sensor networks, and this protocol works unlike previous approaches that
only consider security as an important issue, and they did not consider the severe limitations of
sensor nodes. These regardless of the characteristics of sensor nodes, would result that these
secure protocols don’t have good performance in practice, so with proposing this protocol, high
security of the network in special and sensitive applications is completely provided and also the
energy consumption of the nodes is considered specially.
9. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
39
In the previous protocols it was assumed that the clusters that are going to integrate their data
securely are static, while this assumption imposes sever limitations to the network in practice and
is inconsistent with lots of applications of these networks that the nodes are distributed in the
environment randomly and unplanned. Because in previous approaches the nodes that were
known as the neighbors statically, maybe place very far from each other after deployment, but
they are forced to have communication because they are their right neighbor. So in this protocol
in the second step of the first phase, dynamic clustering is fully presented to solve this problem.
In the second phase of the proposed protocol which is aggregator election, the idea is that the
nodes within a cluster make decision that whether they want to be aggregator or not with
considering consciously, not just by probability. They consider their remaining energy in making
this decision and in this case this protocol besides to high security, consider the limitations of the
network and so help prolonging the network life. And also with studying many of the techniques
in this regard, in presenting this protocol the top features for securing a cluster formation in face
of active, passive and even compromised adversary is considered and is tried that in some steps of
the protocol, some of these ideas being used. So this protocol is a combination of the best ideas
with new our new approaches to fix their defects. Thus in this protocol besides the lower energy
consumption and longer network lifetime, there are no information leakage to the out of the
network and all the messages are sent confidentially and all the senders of the messages are also
authenticated.
ACKNOWLEDGEMENTS
I would like to express my deep gratitude to Professor Mohammad Hossein Yaghmaee
Moghaddam and Dr. Hossein Deldari, my research supervisors, for their patient guidance,
enthusiastic encouragement and useful critiques of this research work.
I would also like to extend my thanks to the technicians of the IPPBX laboratory of the Computer
department of Ferdowsi University of Mashhad for their help in offering me the resources in
doing the work.
Finally, I wish to thank my parents and my dear husband for their support and encouragement
throughout my study.
REFERENCES
[1] Peter Schaffer, K´aroly Farkas, Ad´am Horv´ath, Tam´as Holczer, Levente Butty´an, 2012: Secure and
reliable clustering in wireless sensor networks. Preprint submitted to Elsevier Computer Networks,
January 20, 2012.
[2] S. Basagni, C. Petrioli, R. Petroccia, Fail-Safe Hierarchical Organization for Wireless Sensor Networks,
in: Proceedings of the Military Communications Conference (MILCOM 2007), Orlando, FL, USA.
[3] L. Butty´an, P. Schaffer, PANEL: Position-Based Aggregator Node Election in Wireless Sensor
Networks, in: Proceedings of the 4th IEEE International Conference on Mobile Ad-hoc and Sensor
Systems (MASS 2007), Pisa, Italy.
[4] L. Butty´an, P. Schaffer, PANEL: Position-based aggregator node election in wireless sensor networks,
International Journal of Distributed Sensor Networks 2010 (2010).
[5] M. Demirbas, A. Arora, V. Mittal, FLOC: A Fast Local Clustering Service for Wireless Sensor
Networks, in: Proceedings of the Workshop on Dependability Issues in Wireless Ad Hoc Networks and
Sensor Networks (DIWANS 2004), Florence, Italy.
[6] G. Gupta, M. Younis, Fault-Tolerant Clustering of Wireless Sensor Networks, in: Proceedings of the
IEEE Wireless Communication and Networks Conference (WCNC 2003), New Orleans, LA, USA.
[7] K. Wang, S. Ayyash, T. Little, P. Basu, Attribute-Based Clustering for Information Dissemination in
Wireless Sensor Networks, in: Proceedings of the 2nd Annual IEEE Communications Society
Conference on Sensor and Ad Hoc Communications and Networks (SECON 2005), Santa Clara, CA,
USA.
10. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
40
[8] P. Wang, C. Li, J. Zheng, H. Mouftah, A Dependable Clustering Protocol for Survivable Underwater
Sensor Networks, in: Proceedings of the IEEE International Conference on Communications (ICC
2008), Beijing, China.
[9] O. Younis, S. Fahmy, P. Santi, An Architecture for Robust Sensor Network Communications,
International Journal of Distributed Sensor Networks 1 (2005) 305–327.
[10] H. Zhang, A. Arora, GS3: Scalable Self-Configuration and Self-Healing in Wireless Networks, in:
Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002),
Monterey, CA, USA.
[11] Q. Dong, D. Liu, Resilient cluster leader election for wireless sensor networks, in: Proceedings of the
6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications
and Networks (SECON 2009), IEEE, pp. 1–9 .
[12] Y.-J. Han, M.-W. Park, T.-M. Chung, SecDEACH: Secure and resilient dynamic clustering protocol
preserving data privacy in WSNs, in: Proceedings of International Conference on Computational
Science and Its Applications (ICCSA 2010), pp. 142–157 .
[13] P. Nie, Z. Jin, Y. Gong, Mires++: a reliable, energy-aware clustering algorithm for wireless sensor
networks, in: Proceedings of the 13th ACM international conference on Modeling, analysis, and
simulation of wireless and mobile systems (MSWIM 2010), pp. 178–186.
[14] L. B. Oliveira, A. Ferreira, M. A. Vilaca, H. C. Wong, M. Bern, R. Dahab, A. A. F. Loureiro,
SecLEACH – On the security of clustered sensor networks, Signal Processing 87 (2007) 2882–2895 .
[15] W. Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy-Efficient Communication Protocol for
Wireless Micro sensor Networks, in: Proceedings of the Hawaii International Conference on System
Sciences (HICSS 2000), Maui, Hawaii, USA.
[16] A. Perrig, R. Szewczyk, J. D. Tygar, V.Wen, D. E. Culler, SPINS: Security protocols for sensor
networks, Wireless Networks 8 (2002) 521–534.
[17] L. Eschenauer, V. D. Gligor, A key-management scheme for distributed sensor networks, in: ACM
Conference on Computer and Communications Security (CCS 2002 (.
[18] M. Sirivianos, D. Westhoff, F. Armknecht, J. Girao, Non-Manipulable Aggregator Node Election
Protocols for Wireless Sensor Networks, in: Proceedings of the 5th International Symposium on
Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt 2007), Limassol,
Cyprus.
[19] F. Kuhn, T. Moscibroda, R. Wattenhofer, Fault-Tolerant Clustering in Ad Hoc and Sensor Networks,
in: Proceedings of the 26th International Conference on Distributed Computing Systems (ICDCS 2006),
Lisbon, Portugal.
[20] G. Wang, G. Cho, Secure cluster head election using mark based exclusion in wireless sensor networks,
IEICE Transactions (2010) 2925–2935.
[21] G.Wang, G. Cho, Secure cluster head sensor elections using signal strength estimation and ordered
transmissions, Sensors 9 (2009) 4709–4727.
[22] L. Butty´an, T. Holczer, Private cluster head election in wireless sensor networks, in: Proceedings of the
IEEE Workshop on Wireless and Sensor Network Security (WSNS 2009).
[23] L. Butty´an, T. Holczer, Perfectly anonymous data aggregation in wireless sensor networks, in:
Proceedings of The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS
2010), IEEE, San Francisco, 2010.
[24] T. Holczer, L. Butty´an, Anonymous aggregator election and data aggregation in wireless sensor
networks, International Journal of Distributed Sensor Networks (2011) 1–19. Article ID 828414.
[25] D. Boyle, T. Newe, Securing Wireless Sensor Networks: Security Architectures, Journal of Networks 3
(2008) 65–77.
Sanaz Sadeghi was born on June 1988 in Mashhad, Iran. She received the BS degree in computer
engineering from the computer department, Ferdowsi University of Mashhad, Mashhad, Iran, in
2010. She is a MS student in computer engineering at computer department, Ferdowsi University of
Mashhad. Her research interests are in computer networks, wireless sensor networks and network
security.
Behrouz Sadeghi was born on June 1982 in Mashhad, Iran. He has the MS degree in computer
software engineering. He is now a teacher in department of computer and Information Technology
in faculty of computer Software, Payam Noor University of Taybad, Iran. His research interests are
in distributed computing, grid resource management and wireless sensor networks.