Wireless sensor networks are used for data collection and event detection in various fields such as home networks, military systems, and forest fire monitoring, and are composed of many sensor nodes and a base station. Sensor nodes have limited computing power, limited energy, are randomly distributed in an open environment that operates independently, and have difficulties in individual management. Taking advantage of those weaknesses, attackers can compromise sensor nodes for various kinds of network attacks. Several security protocols have been proposed to prevent these attacks. Most of the security protocols form routings with cluster head nodes. In the case of routing using only cluster head nodes, it is difficult to re-route when the size of the cluster is increased or the number of the surviving nodes is reduced. To prevent these attacks, the proposed scheme maintains security in a cluster-based security protocol and shows energy efficient routing using genetic algorithm by selecting the appropriate cluster head nodes and
utilizing the characteristics of the sensor node with different transmission outputs based on the distance between each node. In this paper, we use a probabilistic voting-based filtering scheme, one of the clusterbased security protocols, and the shortest path, which is a hierarchical routing protocol that the original probabilistic voting-based filtering scheme is using, to test the proposed scheme. This experiment shows the performance comparison of the routing success rate and routing cost according to the number of nodes on the field, as well as the performance comparison according to the cluster size per number of nodes.
This document presents a study on a proposed distributed attack detection algorithm using experimental and simulation analysis. The key points are:
1) The algorithm detects distributed denial of service attacks in wireless sensor networks using detector nodes that monitor traffic and reconstruct patterns to identify attacks.
2) Performance is affected by algorithmic parameters like time epoch length and number of detector nodes, and network parameters like node density and energy.
3) Simulation experiments quantify the attack detection rate, false positive/negative rates, and node energy utilization under variations in these parameters.
AN ENHANCED DETECTION AND ENERGYEFFICIENT EN-ROUTE FILTERING SCHEME IN WIRELE...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a
fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes
(MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network
energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%) against false report attacks in WSNs.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
A MULTI-PATH ROUTING DETERMINATION METHOD FOR IMPROVING THE ENERGY EFFICIENCY...ijwmn
A selective forwarding attack in mobile wireless sensor networks is an attack that selectively drops or delivers event packets as the compromised node moves. In such an attack, it is difficult to detect the compromised node compared with the selective forwarding attack occurring in the wireless sensor network
because all sensor nodes move. In order to detect selective forwarding attacks in mobile wireless sensor networks, a fog computing-based system for a selective forwarding detection scheme has been proposed. However, since the proposed detection scheme uses a single path, the energy consumption of the sensor node for route discovery when the sensor node moves is large. To solve this problem, this paper uses fuzzy
logic to determine the number of multi-paths needed to improve the energy efficiency of sensor networks. Experimental results show that the energy efficiency of the sensor network is improved by 9.5737% compared with that of the existing scheme after 200 seconds when using the proposed scheme
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
This document discusses wireless sensor networks and routing protocols for wireless sensor networks. It defines what a wireless sensor network is and its key characteristics. It then discusses objectives like understanding ad hoc network basics and various routing protocols. It covers topics like the differences between WSNs and ad hoc networks, what a network simulator is and reasons for using NS2, various routing techniques like flooding, gossiping, and hierarchical routing. It also discusses routing challenges, wireless nodes, packet transmission, applications and the future scope of WSNs.
This document presents a study on a proposed distributed attack detection algorithm using experimental and simulation analysis. The key points are:
1) The algorithm detects distributed denial of service attacks in wireless sensor networks using detector nodes that monitor traffic and reconstruct patterns to identify attacks.
2) Performance is affected by algorithmic parameters like time epoch length and number of detector nodes, and network parameters like node density and energy.
3) Simulation experiments quantify the attack detection rate, false positive/negative rates, and node energy utilization under variations in these parameters.
AN ENHANCED DETECTION AND ENERGYEFFICIENT EN-ROUTE FILTERING SCHEME IN WIRELE...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a
fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes
(MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network
energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%) against false report attacks in WSNs.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
A MULTI-PATH ROUTING DETERMINATION METHOD FOR IMPROVING THE ENERGY EFFICIENCY...ijwmn
A selective forwarding attack in mobile wireless sensor networks is an attack that selectively drops or delivers event packets as the compromised node moves. In such an attack, it is difficult to detect the compromised node compared with the selective forwarding attack occurring in the wireless sensor network
because all sensor nodes move. In order to detect selective forwarding attacks in mobile wireless sensor networks, a fog computing-based system for a selective forwarding detection scheme has been proposed. However, since the proposed detection scheme uses a single path, the energy consumption of the sensor node for route discovery when the sensor node moves is large. To solve this problem, this paper uses fuzzy
logic to determine the number of multi-paths needed to improve the energy efficiency of sensor networks. Experimental results show that the energy efficiency of the sensor network is improved by 9.5737% compared with that of the existing scheme after 200 seconds when using the proposed scheme
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
This document discusses wireless sensor networks and routing protocols for wireless sensor networks. It defines what a wireless sensor network is and its key characteristics. It then discusses objectives like understanding ad hoc network basics and various routing protocols. It covers topics like the differences between WSNs and ad hoc networks, what a network simulator is and reasons for using NS2, various routing techniques like flooding, gossiping, and hierarchical routing. It also discusses routing challenges, wireless nodes, packet transmission, applications and the future scope of WSNs.
The document summarizes the SPEED routing protocol for wireless sensor networks. SPEED aims to provide soft real-time communication by maintaining a consistent delivery speed across the network. It uses stateless non-deterministic geographic forwarding and neighborhood feedback to route packets while balancing energy consumption and avoiding congestion. Simulation results using MATLAB show that SPEED achieves low miss ratios and end-to-end delays while balancing energy usage across nodes in the network.
The document presents an overview of QoS aware routing protocols for wireless sensor networks. It discusses the EQRS protocol which uses a link cost function and path discovery phase to establish multiple paths between nodes while considering energy efficiency and QoS metrics. It also briefly describes the SAR and DAST protocols, with SAR using a table-driven approach to create multiple paths from sensors to a sink node based on energy resources and packet priority, and DAST utilizing location information and remaining energy to select paths.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document proposes a novel sleep scheduling method for event monitoring in wireless sensor networks to achieve low broadcasting delay. The method uses a level-by-level offset schedule where when a node detects a critical event, it transmits an alarm message along a predetermined path with offsets between nodes to avoid collisions. It then uses a colored connected dominant set to establish paths for the center node to broadcast the alarm to other nodes. The proposed system is intended for applications like military and forest fire monitoring where quick dissemination of alarm messages is important.
This document summarizes several energy-aware routing protocols for wireless sensor networks. It discusses classical approaches like flooding and gossiping and their deficiencies. It then describes the SPIN protocol which uses negotiations and metadata to adapt to resource constraints. Directed Diffusion is also covered, using interests, data messages, gradients, and reinforcement to set up multiple paths between sources and sinks. The document provides details on how these protocols establish and maintain paths while conserving energy in wireless sensor networks.
The document discusses secure routing protocols for wireless sensor networks. It begins by describing the components and design challenges of wireless sensor networks, including limited resources and security issues. It then discusses various attacks on wireless sensor networks like spoofing, selective forwarding, and sinkhole attacks. The document analyzes several secure routing protocols that aim to prevent such attacks, including Distributed Security Framework, Multipath Data Transfer Protocol, Secure and Energy Efficient Disjoint Route, and Bio-inspired Self-Organized Secure Autonomous Routing Protocol. It concludes by discussing future work to develop a new routing approach with low energy consumption, high delivery ratio, and strong security against possible threats.
This document presents an energy aware QoS routing protocol for wireless sensor networks. It finds the least-cost path that meets end-to-end delay requirements for real-time data using a queuing model. The protocol calculates link costs and uses a k-least cost path algorithm to find candidate routes. It then determines the optimal path's r-value, which represents the ratio of real-time to non-real-time bandwidth on each link. Simulation results show the protocol can improve QoS metrics like end-to-end delay while increasing network lifetime.
MULTI-PATH ROUTE DETERMINATION METHOD FOR NETWORK LOAD BALANCING IN FAP-BASED...ijcsit
A flooding attack in wireless sensor networks is a type of threat that shortens the lifetimes of the sensor
networks. Although flooding attack prevention techniques have been proposed, if a continuous flooding
attack occurs, the sensor node energy is depleted during detection. In this paper, we use multi-path routing
to solve this problem. In order to balance the load of the sensor node, energy balancing of the sensor node
is controlled by determining the number of pathways using fuzzy logic. By adjusting the energy balancing
of the sensor nodes, the number of energy-exhausting sensor nodes can be reduced. As a result, when a
flooding attack occurs, the energy efficiency of the sensor node is increased by determining the number of
pathways.
Energy efficient routing in wireless sensor networksSpandan Spandy
The document summarizes several energy efficient multicast routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and routing challenges. It then summarizes the following protocols: MAODV, TEEN, APTEEN, SPEED, MMSPEED, RPAR, and LEACH. For each protocol, it provides a brief overview of the protocol's design, objectives, components, and how it aims to improve energy efficiency in wireless sensor network routing. The document concludes that providing energy-efficient multicast routing is important for wireless sensor network applications and that the protocols presented aim to achieve lower energy requirements through approaches like clustering, adaptive thresholding, and congestion control.
Wireless sensor networks require a high level of security even though their resources are limited. They face many types of attacks due to their broadcast transmissions and deployment in hostile environments without physical protection. Attacks can target the information in transit, different layers of the protocol stack, and seek to overwhelm the network. While some challenges have been addressed, research is still needed to resolve conflicts between security and limited resources in wireless sensor networks.
SRWSN is a semantic routing algorithm for wireless sensor networks that aims to fulfill requests without knowing the network topology. It uses Bloom filters to reduce storage requirements and a learning table to select relevant peers for queries based on past responses. The algorithm was implemented and shown to learn from its environment, reduce storage needs by up to 92%, and improve routing efficiency through its adaptive capabilities. Further work could enhance alert management and implement location-based queries.
Node detection technique for node replication attack in mobile sensor networkRamesh Patriotic
This document proposes a new technique for detecting node replication attacks in mobile sensor networks. It summarizes existing detection methods and their limitations. The proposed method divides the network into clusters monitored by cluster heads. When a node enters a cluster, the cluster head checks its identity and velocity, which is encrypted and stored in the node. If another node in the cluster has the same identity but different velocity, it is identified as a replica. The technique aims to improve energy efficiency, detection accuracy, and reduce packet drops compared to existing centralized and distributed detection methods.
BeeSensor routing protocol for wireless sensor networkSonam Jain
This document describes a seminar submitted by Sonam Jain for their Master's degree. The seminar focuses on BeeSensor, a routing protocol for wireless sensor networks inspired by bee communication behaviors. It discusses how bees communicate through dances to share information, and how this inspired the design of BeeSensor. The document outlines the key components of BeeSensor, including the different agent roles, protocol phases, and how it evaluates performance metrics like energy efficiency and packet delivery when compared to other routing protocols like AODV.
Performance Analysis of Routing Metrics for Wireless Sensor NetworksIJMER
This document summarizes and compares various routing metrics that have been proposed for wireless sensor networks. It categorizes the routing metrics into five groups: topology based, signal strength based, active probing based, mobility aware, and energy aware. Topology based metrics like hop count consider only connectivity information without additional measurements. Signal strength and active probing based metrics directly measure link quality through signal strength or probe packets. The document provides detailed descriptions of several popular routing metrics, such as expected transmission time (ETT), medium time metric (MTM), round-trip time (RTT), and packet pair delay. It analyzes the characteristics of different routing metrics and compares their performance.
An Enhanced Detection and Energy-Efficient En-Route Filtering Scheme in Wirel...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes (MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%)
Iaetsd a survey on enroute filtering scheme inIaetsd Iaetsd
This document discusses enroute filtering schemes in wireless sensor networks to prevent false data injection attacks. It provides an overview of existing statistical enroute filtering and location-based resilient security schemes that have limitations such as threshold restrictions. The document then proposes using a cluster-based compromise resilient enroute filtering scheme where sensor nodes are organized into clusters. In this scheme, cluster heads aggregate and transmit data to base stations through forwarding nodes. This is said to provide higher security than other filtering schemes by overcoming prior limitations and disadvantages related to compromised node thresholds, non-resilience to attacks, and dependency on node localization.
Fuzzy Logic-based Efficient Message Route Selection Method to Prolong the Net...IJCNCJournal
Recently, sensor networks have been used in a wide range of applications, and interest in sensor node performance has increased. A sensor network is composed of tiny nodes with limited resources. The sensor network communicates between nodes in a configured network through self-organization. An energyefficient security protocol with a hierarchy structure with various advantages has been proposed to prolong the network lifetime of sensor networks. But due to structural problems in traditional protocols, nodes located upstream tend to consume relatively high energy compared to other nodes. A network protocol should be considered to provide minimal security and efficient allocation of energy consumption by nodes to increase the network lifetime. In this paper, we introduce a solution to solve the bottleneck problem through an efficient message route selection method. The proposed method selects an efficient messaging path using GA and fuzzy logic composed of multiple rules. Message route selection plays an important role in controlling the load balancing of nodes. A principal benefit of the proposed scheme is the potential portability of the clustering-based protocol. In addition, the proposed method is updated to find the optimal path through the genetic algorithm to respond to various environments. We demonstrated the effectiveness of the proposed method through an experiment in which the proposed method is applied to a probabilistic voting-based filtering scheme that is one of the cluster-based security schemes.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
- The document discusses a fuzzy logic-based method for efficient message routing in wireless sensor networks to prolong the network lifetime. It aims to balance energy load across nodes by selectively tagging nodes at risk of energy exhaustion and rerouting messages around them.
- It proposes using fuzzy logic to evaluate nodes based on their potential importance, energy level, and event occurrence frequency to determine tagging. Tagged nodes avoid routing traffic but still detect and generate reports.
- The method was tested by applying it to a probabilistic voting-based filtering security scheme and was shown to improve energy efficiency, node survival rate, and report transmission success compared to not tagging nodes.
A Survey of Routing Protocols for Structural Health MonitoringIJEEE
Wireless sensor networks have emerged in recent years as a promising technology that can impact the field of structural monitoring and infrastructure asset management. Various routing protocols are used to define communication among sensor nodes of the wireless sensor network for purpose of disseminating information. These routing protocols can be designed to improve the network performance in terms of energy consumption, delay and security issues. This paper discusses the requirements of routing protocol for Structural health monitoring and presents summary of various routing protocols used for WSNs for Structural health monitoring.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
The document summarizes a proposed spatial correlation-based medium access control protocol for wireless sensor networks that aims to improve energy efficiency. It discusses how sensor nodes are spatially distributed and correlated in detecting events. An iterative node selection algorithm is used to select a minimum set of representative sensor nodes based on a distortion constraint, in order to reduce redundant transmissions. The protocol uses vector quantization to calculate distances between nodes and a mobile element. It then evaluates the performance of using the DSR and AODV routing protocols with this spatial correlation-based MAC protocol in terms of energy consumption and packet drop ratio through simulations. The simulation results show that the protocol with AODV routing performs better than with DSR routing.
A FUZZY-BASED CONGESTION CONTROLLER FOR CONTROL AND BALANCE CONGESTION IN GRI...cscpconf
A Wireless Sensor Network (WSN) is deployed with a large number of sensors with limited power supply in a wide geographically area. These sensors collect information depending on application. The sensors transmit the data towards a base station called sink. Due to the relatively high node density and source-to-sink communication pattern, congestion is a critical issue in WSN. Congestion not only causes packet loss, but also leads to excessive energy
consumption as well as delay. To address this problem, in this paper we propose a new fuzzy logic based mechanism to detect and control congestion in WSN. In the proposed approach, a
Monitor Node for each grid in congestion candidate region performs a fuzzy control to avoid increasing congestion. Fuzzy controller’s inputs are continually fetched from the network by the Monitor Node. Simulation results show that our approach has higher packet delivery ratio and lower packet loss than existing approaches.
A fuzzy based congestion controller for control and balance congestion in gri...csandit
A Wireless Sensor Network (WSN) is deployed with a large number of sensors with limited
power supply in a wide geographically area. These sensors collect information depending on
application. The sensors transmit the data towards a base station called sink. Due to the
relatively high node density and source-to-sink communication pattern, congestion is a critical
issue in WSN. Congestion not only causes packet loss, but also leads to excessive energy
consumption as well as delay. To address this problem, in this paper we propose a new fuzzy
logic based mechanism to detect and control congestion in WSN. In the proposed approach, a
Monitor Node for each grid in congestion candidate region performs a fuzzy control to avoid
increasing congestion. Fuzzy controller’s inputs are continually fetched from the network by the
Monitor Node. Simulation results show that our approach has higher packet delivery ratio and
lower packet loss than existing approaches.
The document summarizes the SPEED routing protocol for wireless sensor networks. SPEED aims to provide soft real-time communication by maintaining a consistent delivery speed across the network. It uses stateless non-deterministic geographic forwarding and neighborhood feedback to route packets while balancing energy consumption and avoiding congestion. Simulation results using MATLAB show that SPEED achieves low miss ratios and end-to-end delays while balancing energy usage across nodes in the network.
The document presents an overview of QoS aware routing protocols for wireless sensor networks. It discusses the EQRS protocol which uses a link cost function and path discovery phase to establish multiple paths between nodes while considering energy efficiency and QoS metrics. It also briefly describes the SAR and DAST protocols, with SAR using a table-driven approach to create multiple paths from sensors to a sink node based on energy resources and packet priority, and DAST utilizing location information and remaining energy to select paths.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document proposes a novel sleep scheduling method for event monitoring in wireless sensor networks to achieve low broadcasting delay. The method uses a level-by-level offset schedule where when a node detects a critical event, it transmits an alarm message along a predetermined path with offsets between nodes to avoid collisions. It then uses a colored connected dominant set to establish paths for the center node to broadcast the alarm to other nodes. The proposed system is intended for applications like military and forest fire monitoring where quick dissemination of alarm messages is important.
This document summarizes several energy-aware routing protocols for wireless sensor networks. It discusses classical approaches like flooding and gossiping and their deficiencies. It then describes the SPIN protocol which uses negotiations and metadata to adapt to resource constraints. Directed Diffusion is also covered, using interests, data messages, gradients, and reinforcement to set up multiple paths between sources and sinks. The document provides details on how these protocols establish and maintain paths while conserving energy in wireless sensor networks.
The document discusses secure routing protocols for wireless sensor networks. It begins by describing the components and design challenges of wireless sensor networks, including limited resources and security issues. It then discusses various attacks on wireless sensor networks like spoofing, selective forwarding, and sinkhole attacks. The document analyzes several secure routing protocols that aim to prevent such attacks, including Distributed Security Framework, Multipath Data Transfer Protocol, Secure and Energy Efficient Disjoint Route, and Bio-inspired Self-Organized Secure Autonomous Routing Protocol. It concludes by discussing future work to develop a new routing approach with low energy consumption, high delivery ratio, and strong security against possible threats.
This document presents an energy aware QoS routing protocol for wireless sensor networks. It finds the least-cost path that meets end-to-end delay requirements for real-time data using a queuing model. The protocol calculates link costs and uses a k-least cost path algorithm to find candidate routes. It then determines the optimal path's r-value, which represents the ratio of real-time to non-real-time bandwidth on each link. Simulation results show the protocol can improve QoS metrics like end-to-end delay while increasing network lifetime.
MULTI-PATH ROUTE DETERMINATION METHOD FOR NETWORK LOAD BALANCING IN FAP-BASED...ijcsit
A flooding attack in wireless sensor networks is a type of threat that shortens the lifetimes of the sensor
networks. Although flooding attack prevention techniques have been proposed, if a continuous flooding
attack occurs, the sensor node energy is depleted during detection. In this paper, we use multi-path routing
to solve this problem. In order to balance the load of the sensor node, energy balancing of the sensor node
is controlled by determining the number of pathways using fuzzy logic. By adjusting the energy balancing
of the sensor nodes, the number of energy-exhausting sensor nodes can be reduced. As a result, when a
flooding attack occurs, the energy efficiency of the sensor node is increased by determining the number of
pathways.
Energy efficient routing in wireless sensor networksSpandan Spandy
The document summarizes several energy efficient multicast routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and routing challenges. It then summarizes the following protocols: MAODV, TEEN, APTEEN, SPEED, MMSPEED, RPAR, and LEACH. For each protocol, it provides a brief overview of the protocol's design, objectives, components, and how it aims to improve energy efficiency in wireless sensor network routing. The document concludes that providing energy-efficient multicast routing is important for wireless sensor network applications and that the protocols presented aim to achieve lower energy requirements through approaches like clustering, adaptive thresholding, and congestion control.
Wireless sensor networks require a high level of security even though their resources are limited. They face many types of attacks due to their broadcast transmissions and deployment in hostile environments without physical protection. Attacks can target the information in transit, different layers of the protocol stack, and seek to overwhelm the network. While some challenges have been addressed, research is still needed to resolve conflicts between security and limited resources in wireless sensor networks.
SRWSN is a semantic routing algorithm for wireless sensor networks that aims to fulfill requests without knowing the network topology. It uses Bloom filters to reduce storage requirements and a learning table to select relevant peers for queries based on past responses. The algorithm was implemented and shown to learn from its environment, reduce storage needs by up to 92%, and improve routing efficiency through its adaptive capabilities. Further work could enhance alert management and implement location-based queries.
Node detection technique for node replication attack in mobile sensor networkRamesh Patriotic
This document proposes a new technique for detecting node replication attacks in mobile sensor networks. It summarizes existing detection methods and their limitations. The proposed method divides the network into clusters monitored by cluster heads. When a node enters a cluster, the cluster head checks its identity and velocity, which is encrypted and stored in the node. If another node in the cluster has the same identity but different velocity, it is identified as a replica. The technique aims to improve energy efficiency, detection accuracy, and reduce packet drops compared to existing centralized and distributed detection methods.
BeeSensor routing protocol for wireless sensor networkSonam Jain
This document describes a seminar submitted by Sonam Jain for their Master's degree. The seminar focuses on BeeSensor, a routing protocol for wireless sensor networks inspired by bee communication behaviors. It discusses how bees communicate through dances to share information, and how this inspired the design of BeeSensor. The document outlines the key components of BeeSensor, including the different agent roles, protocol phases, and how it evaluates performance metrics like energy efficiency and packet delivery when compared to other routing protocols like AODV.
Performance Analysis of Routing Metrics for Wireless Sensor NetworksIJMER
This document summarizes and compares various routing metrics that have been proposed for wireless sensor networks. It categorizes the routing metrics into five groups: topology based, signal strength based, active probing based, mobility aware, and energy aware. Topology based metrics like hop count consider only connectivity information without additional measurements. Signal strength and active probing based metrics directly measure link quality through signal strength or probe packets. The document provides detailed descriptions of several popular routing metrics, such as expected transmission time (ETT), medium time metric (MTM), round-trip time (RTT), and packet pair delay. It analyzes the characteristics of different routing metrics and compares their performance.
An Enhanced Detection and Energy-Efficient En-Route Filtering Scheme in Wirel...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes (MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%)
Iaetsd a survey on enroute filtering scheme inIaetsd Iaetsd
This document discusses enroute filtering schemes in wireless sensor networks to prevent false data injection attacks. It provides an overview of existing statistical enroute filtering and location-based resilient security schemes that have limitations such as threshold restrictions. The document then proposes using a cluster-based compromise resilient enroute filtering scheme where sensor nodes are organized into clusters. In this scheme, cluster heads aggregate and transmit data to base stations through forwarding nodes. This is said to provide higher security than other filtering schemes by overcoming prior limitations and disadvantages related to compromised node thresholds, non-resilience to attacks, and dependency on node localization.
Fuzzy Logic-based Efficient Message Route Selection Method to Prolong the Net...IJCNCJournal
Recently, sensor networks have been used in a wide range of applications, and interest in sensor node performance has increased. A sensor network is composed of tiny nodes with limited resources. The sensor network communicates between nodes in a configured network through self-organization. An energyefficient security protocol with a hierarchy structure with various advantages has been proposed to prolong the network lifetime of sensor networks. But due to structural problems in traditional protocols, nodes located upstream tend to consume relatively high energy compared to other nodes. A network protocol should be considered to provide minimal security and efficient allocation of energy consumption by nodes to increase the network lifetime. In this paper, we introduce a solution to solve the bottleneck problem through an efficient message route selection method. The proposed method selects an efficient messaging path using GA and fuzzy logic composed of multiple rules. Message route selection plays an important role in controlling the load balancing of nodes. A principal benefit of the proposed scheme is the potential portability of the clustering-based protocol. In addition, the proposed method is updated to find the optimal path through the genetic algorithm to respond to various environments. We demonstrated the effectiveness of the proposed method through an experiment in which the proposed method is applied to a probabilistic voting-based filtering scheme that is one of the cluster-based security schemes.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
- The document discusses a fuzzy logic-based method for efficient message routing in wireless sensor networks to prolong the network lifetime. It aims to balance energy load across nodes by selectively tagging nodes at risk of energy exhaustion and rerouting messages around them.
- It proposes using fuzzy logic to evaluate nodes based on their potential importance, energy level, and event occurrence frequency to determine tagging. Tagged nodes avoid routing traffic but still detect and generate reports.
- The method was tested by applying it to a probabilistic voting-based filtering security scheme and was shown to improve energy efficiency, node survival rate, and report transmission success compared to not tagging nodes.
A Survey of Routing Protocols for Structural Health MonitoringIJEEE
Wireless sensor networks have emerged in recent years as a promising technology that can impact the field of structural monitoring and infrastructure asset management. Various routing protocols are used to define communication among sensor nodes of the wireless sensor network for purpose of disseminating information. These routing protocols can be designed to improve the network performance in terms of energy consumption, delay and security issues. This paper discusses the requirements of routing protocol for Structural health monitoring and presents summary of various routing protocols used for WSNs for Structural health monitoring.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
The document summarizes a proposed spatial correlation-based medium access control protocol for wireless sensor networks that aims to improve energy efficiency. It discusses how sensor nodes are spatially distributed and correlated in detecting events. An iterative node selection algorithm is used to select a minimum set of representative sensor nodes based on a distortion constraint, in order to reduce redundant transmissions. The protocol uses vector quantization to calculate distances between nodes and a mobile element. It then evaluates the performance of using the DSR and AODV routing protocols with this spatial correlation-based MAC protocol in terms of energy consumption and packet drop ratio through simulations. The simulation results show that the protocol with AODV routing performs better than with DSR routing.
A FUZZY-BASED CONGESTION CONTROLLER FOR CONTROL AND BALANCE CONGESTION IN GRI...cscpconf
A Wireless Sensor Network (WSN) is deployed with a large number of sensors with limited power supply in a wide geographically area. These sensors collect information depending on application. The sensors transmit the data towards a base station called sink. Due to the relatively high node density and source-to-sink communication pattern, congestion is a critical issue in WSN. Congestion not only causes packet loss, but also leads to excessive energy
consumption as well as delay. To address this problem, in this paper we propose a new fuzzy logic based mechanism to detect and control congestion in WSN. In the proposed approach, a
Monitor Node for each grid in congestion candidate region performs a fuzzy control to avoid increasing congestion. Fuzzy controller’s inputs are continually fetched from the network by the Monitor Node. Simulation results show that our approach has higher packet delivery ratio and lower packet loss than existing approaches.
A fuzzy based congestion controller for control and balance congestion in gri...csandit
A Wireless Sensor Network (WSN) is deployed with a large number of sensors with limited
power supply in a wide geographically area. These sensors collect information depending on
application. The sensors transmit the data towards a base station called sink. Due to the
relatively high node density and source-to-sink communication pattern, congestion is a critical
issue in WSN. Congestion not only causes packet loss, but also leads to excessive energy
consumption as well as delay. To address this problem, in this paper we propose a new fuzzy
logic based mechanism to detect and control congestion in WSN. In the proposed approach, a
Monitor Node for each grid in congestion candidate region performs a fuzzy control to avoid
increasing congestion. Fuzzy controller’s inputs are continually fetched from the network by the
Monitor Node. Simulation results show that our approach has higher packet delivery ratio and
lower packet loss than existing approaches.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A NOVEL 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.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
MODIFIED CCEF FOR ENERGY-EFFICIENCY AND EXTENDED NETWORK LIFETIME IN WSNSijujournal
The widespread application of wireless sensor networks (WNSs) is obstructed by the severely limited
energy constraints and security threat for sensor nodes. Since traditional routing and security schemes are
not suited for these networks, a large part of research focusses on energy efficient routing protocols while
extending the network lifetime. Uneven distribution of communication loads result in network partitioning.
Traditional novel en-route filtering approaches, notably commutative cipher based en-route filtering
(CCEF) saves energy by early filtering of false reports. However this approach main focus is security not
network lifetime is limited by fixed paths and underlying routing not suitable for WSNs. In order to cater
these problems we propose energy efficient routing and pre-deterministic key distribution with dynamic
path selection in CCEF. Modified CCEF (MCCEF) aims at saving energy and extending network lifetime
while maintaining filtering power as in CCEF. Experimental results demonstrate the validity of our
approach with an average of three times network lifetime extension, 5.022% energy savings, and similar
filtering power as the original scheme.
Modified ccef for energy efficiency and extended network lifetime in wsnsijujournal
The widespread application of wireless sensor networks (WNSs) is obstructed by the severely limited energy constraints and security threat for sensor nodes. Since traditional routing and security schemes are not suited for these networks, a large part of research focusses on energy efficient routing protocols while extending the network lifetime. Uneven distribution of communication loads result in network partitioning.
Traditional novel en-route filtering approaches, notably commutative cipher based en-route filtering (CCEF) saves energy by early filtering of false reports. However this approach main focus is security not network lifetime is limited by fixed paths and underlying routing not suitable for WSNs. In order to cater these problems we propose energy efficient routing and pre-deterministic key distribution with dynamic path selection in CCEF. Modified CCEF (MCCEF) aims at saving energy and extending network lifetime while maintaining filtering power as in CCEF. Experimental results demonstrate the validity of our
approach with an average of three times network lifetime extension, 5.022% energy savings, and similar filtering power as the original scheme
MODIFIED CCEF FOR ENERGY-EFFICIENCY AND EXTENDED NETWORK LIFETIME IN WSNSijujournal
The document proposes a modified version of the Commutative Cipher based En-route Filtering (CCEF) approach for wireless sensor networks called Modified CCEF (MCCEF). MCCEF aims to improve energy efficiency and significantly extend network lifetime while maintaining CCEF's filtering power. It does this through energy efficient routing that considers factors like node energy levels and attack ratios, in addition to distance. It also uses pre-deterministic key distribution and dynamic path selection. Experimental results show MCCEF achieves on average 3 times longer network lifetime, 5% more energy savings than CCEF, while providing similar filtering power.
Energy Efficient PEGASIS Routing Protocol in Wireless Sensor NetworkIRJET Journal
This document discusses the PEGASIS routing protocol for wireless sensor networks. It begins with an abstract that introduces PEGASIS as an energy-efficient chain-based hierarchical protocol. It then provides background on wireless sensor networks and discusses challenges like energy efficiency and network lifetime. It explains how PEGASIS forms chains between sensor nodes so that each node only communicates with nearby neighbors, extending network lifetime. The document compares PEGASIS to LEACH, finding that PEGASIS provides more balanced energy distribution and longer network lifetime. It then outlines the PEGASIS algorithm and discusses potential improvements like minimizing delay. Simulation results show PEGASIS increases network efficiency and lifespan over LEACH. The conclusion is that
Data gathering in wireless sensor networks using intermediate nodesIJCNCJournal
Energy consumption is an essential concern to Wireless Sensor Networks (WSNs).The major cause of the energy consumption in WSNs is due to the data aggregation. A data aggregation is a process of collecting data from sensor nodes and transmitting these data to the sink node or base station. An effective way to perform such a task is accomplished by using clustering. In clustering, nodes are grouped into clusters where a number of nodes, called cluster heads, are responsible for gathering data from other nodes, aggregate them and transmit them to the Base Station (BS).
In this paper we produce a new algorithm which focused on reducing the transmission bath between sensor nodes and cluster heads. A proper utilization and reserving of the available power resources is achieved with this technique compared to the well-known LEACH_C algorithm.
Performance Evaluation of LEACH Protocol for Wireless Sensor NetworkAM Publications
This paper gives performance of LEACH protocol. LEACH is the first network protocol that uses hierarchical
routing for wireless sensor networks to increase the life time of network. All the nodes in a network organize themselves into
local clusters, with one node acting as the cluster-head. All non-cluster-head nodes transmit their data to the cluster-head,
while the cluster-head node receive data from all the cluster members, perform signal processing functions on the data (e.g.,
data aggregation), and transmit data to the remote base station. Therefore, being a cluster-head node is much more energyintensive
than being a non-cluster-head node. Thus, when a cluster-head node dies all the nodes that belong to the cluster lose
communication ability. This paper gives performance of LEACH protocol considering parameters i) Packet Delivery Ratio ii)
Throughput iii) Delay iv) lifetime.
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.
Similar to GEOGRAPHIC INFORMATION-BASED ROUTING OPTIMIZATION USING GA FOR CLUSTER-BASED WSNS (20)
GEOGRAPHIC INFORMATION-BASED ROUTING OPTIMIZATION USING GA FOR CLUSTER-BASED WSNS
1. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June 2018
DOI: 10.5121/ijwmn.2018.10302 13
GEOGRAPHIC INFORMATION-BASED ROUTING
OPTIMIZATION USING GA FOR CLUSTER-BASED
WSNS
Sanghyeok Lim1
and Taeho Cho2
1
College of Information and Communication Engineering, Sungkyunkwan University,
Republic of Korea
2
College of Software, Sungkyunkwan University, Republic of Korea
ABSTRACT
Wireless sensor networks are used for data collection and event detection in various fields such as home
networks, military systems, and forest fire monitoring, and are composed of many sensor nodes and a base
station. Sensor nodes have limited computing power, limited energy, are randomly distributed in an open
environment that operates independently, and have difficulties in individual management. Taking
advantage of those weaknesses, attackers can compromise sensor nodes for various kinds of network
attacks. Several security protocols have been proposed to prevent these attacks. Most of the security
protocols form routings with cluster head nodes. In the case of routing using only cluster head nodes, it is
difficult to re-route when the size of the cluster is increased or the number of the surviving nodes is reduced.
To prevent these attacks, the proposed scheme maintains security in a cluster-based security protocol and
shows energy efficient routing using genetic algorithm by selecting the appropriate cluster head nodes and
utilizing the characteristics of the sensor node with different transmission outputs based on the distance
between each node. In this paper, we use a probabilistic voting-based filtering scheme, one of the cluster-
based security protocols, and the shortest path, which is a hierarchical routing protocol that the original
probabilistic voting-based filtering scheme is using, to test the proposed scheme. This experiment shows the
performance comparison of the routing success rate and routing cost according to the number of nodes on
the field, as well as the performance comparison according to the cluster size per number of nodes.
KEYWORDS
Network Protocols, Wireless Sensor Network, Network attack, Genetic algorithm, Routing
1. INTRODUCTION
Wireless sensor networks (WSNs) are used for data collection and event detection in various
fields, such as home networks, military systems, and forest fire monitoring, and are composed of
many sensor nodes and a base station (BS) [1], [2]. When an event occurs, the sensor node detects
the event, makes a report of that event and sends it over multiple hops of the sensor nodes to the
BS. However, sensor nodes are vulnerable to attack because of the disadvantages of limited
computation, limited energy, random distribution in an open environment that operates
independently, and difficulties in individual management. An attacker exploits these weaknesses
to compromise nodes and perform various kinds of attacks. These attacks reduce the energy of the
node, shorten the lifetime of the network, and prevent the detection and reporting of normal
events. Several protocols have been proposed to increase the security and lifetime of the network
by defending against such attacks [3], [4], [5], [6], [21]. These protocols form cluster-based
routing, which benefits from local management of nodes and it makes systemic report generation
possible. However, such cluster-based routing, which relies only on CH nodes for report
transmission and verification, has a significant negative impact on security considering the entire
2. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No.
network because of various attacks
downstream event detection cluster
most WSN fields, the node with the shortest distance to the BS and within the transmission range
based on the report delivery node is selected as the next transfer node.
of nodes is appropriately placed in the field
reasonable cost.
However, if the number of nodes placed in the field is insufficient or the size of the cluster is
inevitably increased due to a change
is likely to be reduced, and it becomes difficult to guarant
increases the total number of routing hops, thereby reducing the lifetime of the network.
to prevent such problems, the CHs of each event detection cluster perform
report generation, and report transmission.
among all the nodes with an appropriate geographical advantage considering the distance to the
BS and transmission power. The existing layer
security protocols implement routing
distance between nodes [7], [8]
different transmission output levels according to
the routing is constructed using
setting the appropriate output level for all nodes forming the routing.
distance of the receiving node from the initial event detection node, the
the node with the smallest distance from the BS
existing protocol randomly select the CH or select the n
experiments, we confirmed that the performance difference between the proposed scheme and the
existing scheme increases as the number of nodes decreases.
scheme based on PVFS which is
routing.
2. RELATED WORK
2.1. PVFS
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June
attacks, such as sniffing or dropping reports transmitted from the
event detection cluster. Additionally, considering the shortest path that is applied to
, the node with the shortest distance to the BS and within the transmission range
based on the report delivery node is selected as the next transfer node. When a sufficient number
ropriately placed in the field, this ensures stable routing formation and
However, if the number of nodes placed in the field is insufficient or the size of the cluster is
change in the field environment, the forwarding node candidate list
it becomes difficult to guarantee energy efficient routing
increases the total number of routing hops, thereby reducing the lifetime of the network.
to prevent such problems, the CHs of each event detection cluster perform only event detec
and report transmission. The verification node is considered
an appropriate geographical advantage considering the distance to the
The existing layer-based routing schemes applied to most
security protocols implement routing sets maximum transmission output without regard to the
], [8]. Micaz mote used in most of the security protocols
different transmission output levels according to each node’s distance [9]. In the proposed scheme,
the routing is constructed using genetic algorithm (GA) to minimize the cost of the routing by
setting the appropriate output level for all nodes forming the routing. In addition, to minimize the
ing node from the initial event detection node, the CH node was selected as
the node with the smallest distance from the BS, thereby saving the initial routing cost while
randomly select the CH or select the node with the smallest ID valu
experiments, we confirmed that the performance difference between the proposed scheme and the
existing scheme increases as the number of nodes decreases. We experimented
is one of a cluster-based security protocol using the
Figure 1. PVFS’s en-route filtering.
e 2018
14
or dropping reports transmitted from the
the shortest path that is applied to
, the node with the shortest distance to the BS and within the transmission range
a sufficient number
ensures stable routing formation and a
However, if the number of nodes placed in the field is insufficient or the size of the cluster is
forwarding node candidate list
routing. This routing
increases the total number of routing hops, thereby reducing the lifetime of the network. In order
event detection,
The verification node is considered and selected
an appropriate geographical advantage considering the distance to the
applied to most of the
without regard to the
protocols can set
In the proposed scheme,
to minimize the cost of the routing by
In addition, to minimize the
node was selected as
the initial routing cost while
ode with the smallest ID value. Through
experiments, we confirmed that the performance difference between the proposed scheme and the
our propose
shortest path
3. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June 2018
15
PVFS is a typical cluster-based security protocol. Nodes randomly placed on the field are
assigned to the same cluster within an appropriate range to detect events within the same cluster
area. At the end of the node deployment, PVFS performs network security and report
transmission in four steps.
Key distribution phase
The BS transmits to each CH a set of keys separated by a cluster size. The CH that receives the
key set distributes one key to each member node.
Selection step of the verification node
The verification node is selected by the probability based on the number of hops between the
event detection cluster and the BS, and the number of hops between the node and BS among the
CHs on the path. The CH selected as the verification node receives one of the keys of the member
nodes of the event detection cluster at random. The CH of the selected cluster in the verification
node clears all keys except its own in its own key set.
Report delivery phase
After detecting the event, the CH generates a report on the event, receives the MAC created by
the member nodes of each node, and attaches it to the report to generate the final report.
Verification step
When the verification node receives the report, it first compares its own key index with the key
index of the MAC attached to the report. If the key index overlaps, the MAC check is performed.
If the index does not overlap, the report is not verified and sent to the node on the next path. If a
normal MAC is detected as a result of the check, a normal vote is cast. If a false MAC is detected,
a false vote is cast. If the number of votes reaches a preset threshold value, the report is
discriminated as normal or false. A report that is deemed to be a normal report is then
immediately directed to the BS without any further verification steps.
2.2. Genetic Algorithm
The genetic algorithm (GA) was proposed by Holland John and takes ideas from evolutionary
processes occurring in the natural world. This kind of algorithm represents solutions to a problem
as bit strings and finds an optimal solution through evolution [10], [22], [23]. The GA unit
probabilistically selects two individuals constituting the current generation. The selection
probability for each individual is proportional to the fitness of the individual, and the child
generations consist of individuals with greater fitness than the members of the parent generation.
Selected individuals generate a new generation through child generating, mutating, and
sometimes elite choosing [11], [12]. To solve the problem of local fixation in evolution the
proposed GA uses mutation technic.
3. PROPOSED METHOD
3.1. Problem statement
3.1.1 Routing problems
A WSN with a vast land area has few obstacles between deployed nodes, and cluster-based
security protocols mainly use the shortest path based routing. In a highly selective environment,
4. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June 2018
16
this is efficient for the forwarding node in the routing formation. However, in many security
protocols, including PVFS, the selection range of the forwarding node is limited to the CH among
all nodes. Moreover, once the CH is selected, it will not be replaced by any other member node.
In the situation where the CH is being used for extortion or because of battery discharge, the
corresponding routing scheme shows a significant weakness in re-routing. In some cases, when
the next forwarding node is set based only on the distance to the BS, the selection of the
geographically optimized node cannot be performed, which results in the adverse effect of the
increased number of routing hops.
3.1.2 Delivery node selection problem within cluster-based security protocols
Most of the cluster-based protocols select only those nodes that are responsible for report delivery
among the CH nodes. There are two bottlenecks in the routing path: key storage and energy
consumption. The key storage bottleneck is a phenomenon in which the number of keys owned
by the CH for the verification of downstream nodes increases. When these CHs are compromised,
the attacker will have multiple keys and can cause a significant security problem. The bottleneck
of energy consumption is the phenomenon that the routing of the downstream nodes to the BS
proceeds through the corresponding CH. As the number of reports to be transferred to the CH
increases exponentially, the expectation of energy consumption can be greater than other nodes
and the battery will be discharged soon. The network will then have to go through the routing
again and additional energy consumption is expected.
3.1.3 Uniform output power of sensor nodes
In the existing security protocols, all nodes transmit the report to its upstream nodes with a
maximum transmission range. In actuality, it is unnecessary to communicate only with the
maximum transmission distance by disregarding the interval between each sensor node. It is
therefore useful to measure the distance between nodes and transmit them at the appropriate
output level. The distance measurement between nodes can be implemented using the RSSI value
[13], or the node attached GPS module [14]. The Micaz node, which is often used in WSNs, is a
node that can control the output of a total of 32 levels, allowing the user to set the appropriate
output value [15], [16], [17]. There are many experiments on the transmission distance according
to the output in actual situations [18], [19], [20].
3.2. System overview
The experiment of the proposed method constitutes the system based on PVFS. All key
distribution and en-route filtering procedures follow existing security protocols. After the node is
deployed, each node sends its location information to the BS. Based on this information, the BS
selects the nodes with the shortest distances from the BS itself in each cluster as CH. The
difference in geographical location in the selection of CH has no effect on the security of the
protocol. This is because in the existing security protocol, CH selection was made without taking
any other factors into account. The key distribution and verification node selection phase follows
the original protocol’s phase. Then, the intermediate delivery node is randomly selected among
all the nodes, including the cluster head node. The selection of the next forwarding node is based
on the nodes within the maximum transmission range of itself and re-divides the range based on
the distance to the BS among the nodes within its transmission range.
5. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No.
Figure 2. Range of the candidate list of the forwarding node
In Figure 2, (a), (b), and (c) are the range
nodes can be selected by the downstream
diversity of the nodes forming the routing.
information overlapping between parent chromosomes in
a next generation node having a cross
range of the forwarding node will be explained
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June
ange of the candidate list of the forwarding node.
and (c) are the ranges of the candidate list of the forwarding node.
downstream node with a larger range, resulting in an increase in the
the nodes forming the routing. However, this means that there is less genetic
information overlapping between parent chromosomes in the GA, and it is also difficult to create
a cross-point between parents. The contents of the candidate list
will be explained after dealing with the routing through the GA.
e 2018
17
of the candidate list of the forwarding node. More
, resulting in an increase in the
However, this means that there is less genetic
difficult to create
The contents of the candidate list
after dealing with the routing through the GA.
6. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No.
Figure
The GA chromosome contains the IDs of the forwarding nodes
chromosome is equal to the number of hops in each routing
is inversely proportional to the final
of the two parental chromosomes selected do not overlap, they will not have a cross
case, the parent chromosome is re
parent chromosome is large, the probability that the genetic information of each other does not
overlap increases. The proposed scheme limits the re
genetic information overlaps. When the number of re
chromosomes with the highest fitness are re
a modified version of the elitism technique used in genetic algorithms.
changed the size of the node list to increas
Additionally, we did not use the elitism technique
of the candidate list of the transfer node of
chromosome generating ability of the GA and
to re-select the routing within a short time, the scope of the candidate list can be narrowed and the
number of GA routines can be reduced to form an immediate routing
greater. Conversely, if the user wants to optimize the routing cost,
of the list and increase the number of repetitions of the GA.
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June
Figure 3. Routing optimization using the GA.
The GA chromosome contains the IDs of the forwarding nodes, and the length of each
number of hops in each routing path. The fitness of the chromosomes
is inversely proportional to the final routing cost of the chromosomes. If the genetic information
of the two parental chromosomes selected do not overlap, they will not have a cross-
case, the parent chromosome is re-selected through the same method. If the candidate to be the
parent chromosome is large, the probability that the genetic information of each other does not
The proposed scheme limits the re - election of parental chromosomes until
When the number of re-elections reaches a predetermined threshold,
chromosomes with the highest fitness are re-elected and transferred to the next generation
a modified version of the elitism technique used in genetic algorithms. Instead of
list to increase the diversity of chromosomes.
, we did not use the elitism technique that causes the fixation phenomenon.
of the candidate list of the transfer node of Figure 2 has a trade-off between the child
ability of the GA and its routing cost. Therefore, if the network user has
select the routing within a short time, the scope of the candidate list can be narrowed and the
number of GA routines can be reduced to form an immediate routing, even if the cost is slightly
Conversely, if the user wants to optimize the routing cost, the user can increase the range
number of repetitions of the GA.
e 2018
18
and the length of each
The fitness of the chromosomes
If the genetic information
-point. In this
If the candidate to be the
parent chromosome is large, the probability that the genetic information of each other does not
election of parental chromosomes until
hes a predetermined threshold,
elected and transferred to the next generation. This is
Instead of mutation, we
causes the fixation phenomenon. The size
off between the child
Therefore, if the network user has
select the routing within a short time, the scope of the candidate list can be narrowed and the
if the cost is slightly
can increase the range
7. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No.
Figure 4 shows the original routing
Route # 2 have two cross-points. These are routing information for
respectively. Thus, the child chromosome starting from
chromosome at the cross-point and forms the routing.
hops and less energy usage, and in
generation is repeated, the child route picks the optimal interval of the
eventually has less routing costs and higher expectations than the
and routing is then completed.
4. EXPERIMENTAL RESULT
4.1. Experimental environment
4.2. Assumptions
The transmission and reception costs are set to 16.25
calculated cost of voting was set to 15
nodes, which can select 32 distinct
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June
Figure 4. Route comparison.
original routing and modified routing using proposed scheme. R
points. These are routing information for Parent # 1 and
Thus, the child chromosome starting from Route # 1 changes the path of the parent
point and forms the routing. In Section A, Parent #1 routing has fewer
d less energy usage, and in Section B, Parent # 2 routing is more efficient.
generation is repeated, the child route picks the optimal interval of the parent appropriately and
eventually has less routing costs and higher expectations than the parent generation in this way
ESULT
Experimental environment
Table1. Experiment parameters
The transmission and reception costs are set to 16.25µj and 12.5µj, respectively, and the
calculated cost of voting was set to 15µj. In our experiment, Micaz motes were used as sensor
distinct output levels [9]. Experimental results show that the proposed
e 2018
19
Route # 1 and
and Parent # 2,
oute # 1 changes the path of the parent
1 routing has fewer
2 routing is more efficient. As the
parent appropriately and
parent generation in this way
j, respectively, and the
were used as sensor
Experimental results show that the proposed
8. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June 2018
20
method does not adjust the maximum output level as the conventional method does, but instead
the proposed method adjusts the maximum output level. Since the report size of the proposed
PVFS and the proposed protocol are the same, the transmission failure is not based on the size of
the report to be transmitted. To increase the reliability and realism of the experiment, experiments
were conducted based on the maximum transmittable distance table according to the node output
level. In the experiment of the proposed method, the list size is 70% of the maximum transfer
range and the number of households is set to not exceed 50 generations. Rather than focusing on
reducing routing costs, we focused on speeding up the routing updates. If the cost is less than the
existing routing, the method is applied to the network immediately without entering the next
generation so the routing can be formed more promptly.
4.3. Experimental result
Figure 5. Number of routing formation successes.
Figure 5 shows the number of routing formation successes according to the number of nodes
placed in the field. Overall, the difference in successes between the existing routing scheme and
the proposed routing scheme is approximately 25%. It is possible to confirm the consistency of
the routing formation success rate, irrespective of the number of nodes. In the conventional
scheme, regardless of the number of nodes, the node with the smallest ID in one cluster is
selected as CH, and thus does not affect the routing formation. In the case of the proposed scheme,
even if the number of nodes is reduced, the performance is constant because the number of nodes
is still high.
0
20
40
60
80
100
120
140
160
180
2000 1800 1500 1200 1000
Num
berofrouting
form
ation
success
Number of node
PVFS Proposed Scheme
9. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June 2018
21
Figure 6. Routing costs depending on the number of nodes on the field.
Figure 6 shows a comparison of the routing costs consumed by each protocol depending on the
number of nodes on the field. Comparisons were made only among successful routing cases. In
the conventional scheme, energy consumption is independent of the number of nodes, and the
number of nodes and routing cost are not related. In the case of the proposed method, as the
number of generations of GA increases, the energy consumption gradually increases. However, in
the experiment, the creation of the child chromosome for finding a better route path occurs
immediately when the energy consumption is lower than that of the conventional method. In the
energy consumption comparison experiment, the comparison with existing PVFS without the
output level difference application was performed. Moderating the output of the node shows
twice as much energy savings. In existing and proposed schemes with different output levels, the
overall cost difference is approximately 20% due to the location correction of the event detection
CH and the optimization of the routing cost optimization.
0
50
100
150
200
250
300
2000 1800 1500 1200 1000
Routing
cost(μj)
Number of nodes
PVFS PVFS2 Proposed Scheme
10. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June 2018
22
Figure 7. Number of routing successes according to the cluster size.
Figure 7 shows the number of routing successes according to the cluster size. When the cluster
size is relatively small, there is not a large difference in the number of routing successes between
the two schemes. However, as the size of the cluster increases, the number of routing successes
increases. The number of successes according to the size of the existing scheme was greatly
reduced because a node that does not reach the transmission range frequently occurs due to the
randomly set CH. Alternatively, the proposed method does not have a large drop in selectivity of
the forwarding node in the entire cluster, not just the CH. Additionally, because the algorithm is
focused on immediate routing rather than routing costs, it is expected to be less if the system is set
for cost reduction purposes.
Figure 8. Difference in routing costs according to cluster size.
100
150
200
250
300
350
400
40 43 45 47 50 53 55 57 60
Num
berofsuccess
routing
Size of clusters
PVFS Proposed Scheme
0
50
100
150
200
250
300
350
40 43 45 47 50 53 55 57 60
Routing
cost(μj)
Size of clusters
PVFS PVFS2 Proposed Scheme
11. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June 2018
23
Figure 8 shows the difference in routing costs according to cluster size. This is similar to the
figure of the routing cost according to the number of nodes, but the cluster size affects the entire
routing success failure and can be interpreted as independent of the routing cost. Routing
optimization of each node was completed without exceeding 10 generations. Routing of all CHs
took less than 1 minute based on the field where more than 2000 nodes were dispatched.
5. CONCLUSIONS
Conventional cluster-based protocols are characterized by routing proceeding through CHs only,
and the dependency on the usability of the CHs is so high that if the CHs are compromised, the
security and energy efficiency of the entire routing using the nodes are damaged. Additionally,
the higher energy usage of CH is expected when it is close to the BS. In this case, faster battery
depletion occurs within those CHs, and the network users have to reroute frequently. In addition,
there is also unnecessary energy consumption, which does not reflect the distance between nodes,
but makes all transmissions the maximum output level. To solve these problems, the proposed
scheme selects CH based on regional suitability, and selects proper delivery nodes considering
every node in the network field. Cost optimization of routing was performed using the GA to
optimize hop count and communication distance. With a proposed scheme, optimization of the
routing cost can be confirmed in the situation where the size of the cluster changes or the number
of nodes in the field changes.
ACKNOWLEDGEMENTS
This research was supported by the MISP (Ministry of Science, ICT & Future Planning), Korea,
under the National Program for Excellence in SW) (2015-0-00914) supervised by the IITP
(Institute for Information & communications Technology Promotion) (2015-0-00914).
REFERENCES
[1] Al-Karaki, Jamal N., and Ahmed E. Kamal. "Routing techniques in wireless sensor networks: a
survey." IEEE wireless communications 11.6 (2004): 6-28.
[2] Perrig, Adrian, John Stankovic, and David Wagner. "Security in wireless sensor networks."
Communications of the ACM 47.6.
[3] Li, Feng, and Jie Wu. "A probabilistic voting-based filtering scheme in wireless sensor networks."
Proceedings of the 2006 international conference on Wireless communications and mobile computing.
ACM, 2006
[4] Zhu, Sencun, et al. "An interleaved hop-by-hop authentication scheme for filtering of injected false
data in sensor networks." Security and privacy, 2004. Proceedings. 2004 IEEE symposium on. IEEE,
2004
[5] Yang, Hao, and Songwu Lu. "Commutative cipher based en-route filtering in wireless sensor
networks." Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th. Vol. 2. IEEE,
2004.
[6] Yu, Zhen, and Yong Guan. "A dynamic en-route scheme for filtering false data injection in wireless
sensor networks." Proceedings of the 3rd international conference on Embedded networked sensor
systems. ACM, 2005
[7] Geetu, Sonia Juneja. "Performance analysis of SPIN and LEACH routing protocol in
WSN."International Journal of Computational Engineering Research2.5 (2012): 1179-1185.
12. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June 2018
24
[8] Royer, Elizabeth M., and Chai-Keong Toh. "A review of current routing protocols for ad hoc mobile
wireless networks." IEEE personal communications 6.2 (1999): 46-55
[9] https://www.scribd.com/document/91069327/Micaz-Datasheet-t
[10] D. E. Golberg, "Genetic algorithms in search, optimization, and machine learning," Addion Wesley,
vol. 1989, 1989.
[11] Deb, Kalyanmoy, et al. "A fast and elitist multiobjective genetic algorithm: NSGA-II." IEEE
transactions on evolutionary computation 6.2 (2002): 182-197.
[12] Whitley, Darrell. "A genetic algorithm tutorial." Statistics and computing 4.2 (1994): 65-85.
[13] Benkic, Karl, et al. "Using RSSI value for distance estimation in wireless sensor networks based on
ZigBee." Systems, signals and image processing, 2008. IWSSIP 2008. 15th international conference
on. IEEE, 2008.
[14] Buchli, Bernhard, Felix Sutton, and Jan Beutel. "GPS-equipped wireless sensor network node for
high-accuracy positioning applications." European Conference on Wireless Sensor Networks.
Springer, Berlin, Heidelberg, 2012.
[15] Seon-Phil Kim, Namgi Kim. "Measurement and analysis of the data transmission range using the
transmission power of MICAz." Proceedings of KIIT Summer Conference. 2010
[16 Lin, Shan, et al. "ATPC: adaptive transmission power control for wireless sensor networks."
Proceedings of the 4th international conference on Embedded networked sensor systems. ACM, 2006
[17] Kyoung-Min Park, et al. "Path-Loss Measurements in Indoor Floor Environment at 2.4 GHz " The
Journal of Korean Institute of Communications and Information Sciences 42.8 (2017): 1662-1667.
[18] Mallinson, Michael, Patrick Drane, and Sajid Hussain. "Discrete radio power level consumption
model in wireless sensor networks." Mobile Adhoc and Sensor Systems, 2007. MASS 2007. IEEE
International Conference on. IEEE, 2007
[19 Kubisch, Martin, et al. "Distributed algorithms for transmission power control in wireless sensor
networks." Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE. Vol. 1. IEEE,
2003
[20] Lin, Shan, et al. "ATPC: adaptive transmission power control for wireless sensor networks."
Proceedings of the 4th international conference on Embedded networked sensor systems. ACM, 2006
[21] Ogundile, Olayinka O., and Attahiru S. Alfa. "A survey on an energy-efficient and energy-balanced
routing protocol for wireless sensor networks." Sensors 17.5 (2017): 1084.
[22] Yadav, Anju, Vipin Pal, and Ketan Jha. "A Chaotic Genetic Algorithm for Wireless Sensor
Networks." Proceedings of First International Conference on Smart System, Innovations and
Computing. Springer, Singapore, 2018.
[23] Srideviponmalar, P., V. Jawahar Senthil Kumar, and R. Harikrishnan. "Hybrid Genetic Algorithm–
Differential Evolution Approach for Localization in WSN." Intelligent Engineering Informatics.
Springer, Singapore, 2018. 263-271.
13. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 10, No. 3, June 2018
25
Authors
Sanghyeok Lim Received a B.S. degree in Digital Information Engineering from
Hanguk University of Foreign Studies in 2017, and is now working toward an M.S.
degree in the Department of Electrical and Computer Engineering at Sungkyunkwan
University.
Taeho Cho Received a Ph.D. degree in Electrical and Computer Engineering from
the University of Arizona, USA, in 1993, and B.S. and M.S. degrees in Electrical
and Computer Engineering from Sungkyunkwan University, Republic of Korea, and
the University of Alabama, USA, respectively. He is currently a Professor in the
College of Information and Communication Engineering, Sungkyunkwan
University, Korea.