scholarly journals GA-DoSLD: Genetic Algorithm Based Denial-of-Sleep Attack Detection in WSN

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Mahalakshmi Gunasekaran ◽  
Subathra Periakaruppan
Keyword(s):  
Genetic Algorithm ◽  
Network Performance ◽  
Denial Of Service ◽  
Relay Node ◽  
Base Station ◽  
Attack Detection ◽  
Sensor Nodes ◽  
Sleep Mode ◽  
Sleep Attack ◽  
Suggested Algorithm

Denial-of-sleep (DoSL) attack is a special category of denial-of-service attack that prevents the battery powered sensor nodes from going into the sleep mode, thus affecting the network performance. The existing schemes used for the DoSL attack detection do not provide an optimal energy conservation and key pairing operation. Hence, in this paper, an efficient Genetic Algorithm (GA) based denial-of-sleep attack detection (GA-DoSLD) algorithm is suggested for analyzing the misbehaviors of the nodes. The suggested algorithm implements a Modified-RSA (MRSA) algorithm in the base station (BS) for generating and distributing the key pair among the sensor nodes. Before sending/receiving the packets, the sensor nodes determine the optimal route using Ad Hoc On-Demand Distance Vector Routing (AODV) protocol and then ensure the trustworthiness of the relay node using the fitness calculation. The crossover and mutation operations detect and analyze the methods that the attackers use for implementing the attack. On determining an attacker node, the BS broadcasts the blocked information to all the other sensor nodes in the network. Simulation results prove that the suggested algorithm is optimal compared to the existing algorithms such as X-MAC, ZKP, and TE2P schemes.

Performance Analysis of RNC Clustering Protocol in Wireless Sensor Network

2019 ◽  
Vol 10 ◽  
Author(s):  
Piyush Rawat ◽  
Siddhartha Chauhan
Keyword(s):  
Energy Consumption ◽  
Network Performance ◽  
Energy Levels ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Threshold Function ◽  
Efficient Manner ◽  
Clustering Protocol

Background and Objective: The functionalities of wireless sensor networks (WSN) are growing in various areas, so to handle the energy consumption of network in an efficient manner is a challenging task. The sensor nodes in the WSN are equipped with limited battery power, so there is a need to utilize the sensor power in an efficient way. The clustering of nodes in the network is one of the ways to handle the limited energy of nodes to enhance the lifetime of the network for its longer working without failure. Methods: The proposed approach is based on forming a cluster of various sensor nodes and then selecting a sensor as cluster head (CH). The heterogeneous sensor nodes are used in the proposed approach in which sensors are provided with different energy levels. The selection of an efficient node as CH can help in enhancing the network lifetime. The threshold function and random function are used for selecting the cluster head among various sensors for selecting the efficient node as CH. Various performance parameters such as network lifespan, packets transferred to the base station (BS) and energy consumption are used to perform the comparison between the proposed technique and previous approaches. Results and Discussion: To validate the working of the proposed technique the simulation is performed in MATLAB simulator. The proposed approach has enhanced the lifetime of the network as compared to the existing approaches. The proposed algorithm is compared with various existing techniques to measure its performance and effectiveness. The sensor nodes are randomly deployed in a 100m*100m area. Conclusion: The simulation results showed that the proposed technique has enhanced the lifespan of the network by utilizing the node’s energy in an efficient manner and reduced the consumption of energy for better network performance.

scholarly journals A Secure Protocol against Selfish and Pollution Attacker Misbehavior in Clustered WSNs

Electronics ◽  
2021 ◽  
Vol 10 (11) ◽  
pp. 1244
Author(s):  
Hana Rhim ◽  
Damien Sauveron ◽  
Ryma Abassi ◽  
Karim Tamine ◽  
Sihem Guemara
Keyword(s):  
Denial Of Service ◽  
Base Station ◽  
Hierarchical Organization ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Dos Attacks ◽  
Linear Network ◽  
Secure Protocol ◽  
Misbehaving Nodes ◽  
Pollution Attacks

Wireless sensor networks (WSNs) have been widely used for applications in numerous fields. One of the main challenges is the limited energy resources when designing secure routing in such networks. Hierarchical organization of nodes in the network can make efficient use of their resources. In this case, a subset of nodes, the cluster heads (CHs), is entrusted with transmitting messages from cluster nodes to the base station (BS). However, the existence of selfish or pollution attacker nodes in the network causes data transmission failure and damages the network availability and integrity. Mainly, when critical nodes like CH nodes misbehave by refusing to forward data to the BS, by modifying data in transit or by injecting polluted data, the whole network becomes defective. This paper presents a secure protocol against selfish and pollution attacker misbehavior in clustered WSNs, known as (SSP). It aims to thwart both selfish and pollution attacker misbehaviors, the former being a form of a Denial of Service (DoS) attack. In addition, it maintains a level of confidentiality against eavesdroppers. Based on a random linear network coding (NC) technique, the protocol uses pre-loaded matrices within sensor nodes to conceive a larger number of new packets from a set of initial data packets, thus creating data redundancy. Then, it transmits them through separate paths to the BS. Furthermore, it detects misbehaving nodes among CHs and executes a punishment mechanism using a control counter. The security analysis and simulation results demonstrate that the proposed solution is not only capable of preventing and detecting DoS attacks as well as pollution attacks, but can also maintain scalable and stable routing for large networks. The protocol means 100% of messages are successfully recovered and received at the BS when the percentage of lost packets is around 20%. Moreover, when the number of misbehaving nodes executing pollution attacks reaches a certain threshold, SSP scores a reception rate of correctly reconstructed messages equal to 100%. If the SSP protocol is not applied, the rate of reception of correctly reconstructed messages is reduced by 90% at the same case.

Novel Energy Aware Algorithm to Design Multilayer Architecture for Dense Wireless Sensor Networks

2016 ◽  
pp. 79-114
Author(s):  
Naveen Chilamkurti ◽  
Sohail Jabbar ◽  
Abid Ali Minhas
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Architecture ◽  
Network Performance ◽  
Data Dissemination ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Unbalanced Load

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.

Novel Energy Aware Algorithm to Design Multilayer Architecture for Dense Wireless Sensor Networks

2020 ◽  
pp. 372-399
Author(s):  
Naveen Chilamkurti ◽  
Sohail Jabbar ◽  
Abid Ali Minhas
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Architecture ◽  
Network Performance ◽  
Data Dissemination ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Unbalanced Load

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.

A Heuristic Optimized Algorithm for Energy Optimization in Wireless Sensor Networks

2010 ◽  
Vol 34-35 ◽  
pp. 1019-1023
Author(s):  
Zhao Feng Yang ◽  
Ai Wan Fan
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Optimal Algorithm ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Battery Capacity

Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions including computation capability and battery capacity. In this paper we propose an optimal algorithm with genetic algorithm taken into consideration, and compare it with three well known and widely used approaches, i.e., LEACH and LEACH-C, in performance evaluation. Experimental results show that the proposed approach increases the overall network lifetime, and data delivery at the base station than the other routing protocols. Key words: Wireless sensor networks, base station, heuristic optimized genetic algorithm, low energy adaptive clustering hierarchy

scholarly journals Designing Efficient Sinkhole Attack Detection Mechanism in Edge-Based IoT Deployment

Sensors ◽  
2020 ◽  
Vol 20 (5) ◽  
pp. 1300
Author(s):  
Sumit Pundir ◽  
Mohammad Wazid ◽  
Devesh Pratap Singh ◽  
Ashok Kumar Das ◽  
Joel J. P. C. J. P. C. Rodrigues ◽  
...  
Keyword(s):  
Network Performance ◽  
False Positive Rate ◽  
Security Analysis ◽  
Base Station ◽  
Attack Detection ◽  
Delivery Ratio ◽  
Performance Parameters ◽  
Detection Mechanism ◽  
Detection Scheme ◽  
Edge Based

The sinkhole attack in an edge-based Internet of Things (IoT) environment (EIoT) can devastate and ruin the whole functioning of the communication. The sinkhole attacker nodes ( S H A s) have some properties (for example, they first attract the other normal nodes for the shortest path to the destination and when normal nodes initiate the process of sending their packets through that path (i.e., via S H A ), the attacker nodes start disrupting the traffic flow of the network). In the presence of S H A s, the destination (for example, sink node i.e., gateway/base station) does not receive the required information or it may receive partial or modified information. This results in reduction of the network performance and degradation in efficiency and reliability of the communication. In the presence of such an attack, the throughput decreases, end-to-end delay increases and packet delivery ratio decreases. Moreover, it may harm other network performance parameters. Hence, it becomes extremely essential to provide an effective and competent scheme to mitigate this attack in EIoT. In this paper, an intrusion detection scheme to protect EIoT environment against sinkhole attack is proposed, which is named as SAD-EIoT. In SAD-EIoT, the resource rich edge nodes (edge servers) perform the detection of different types of sinkhole attacker nodes with the help of exchanging messages. The practical demonstration of SAD-EIoT is also provided using the well known NS2 simulator to compute the various performance parameters. Additionally, the security analysis of SAD-EIoT is conducted to prove its resiliency against various types of S H A s. SAD-EIoT achieves around 95.83 % detection rate and 1.03 % false positive rate, which are considerably better than other related existing schemes. Apart from those, SAD-EIoT is proficient with respect to computation and communication costs. Eventually, SAD-EIoT will be a suitable match for those applications which can be used in critical and sensitive operations (for example, surveillance, security and monitoring systems).

scholarly journals Cluster Head Relocation Based on Selfish Herd Hypothesis for Prolonging the Life Span of Wireless Sensor Networks

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 403 ◽  
Author(s):  
Goran Popovic ◽  
Goran Djukanovic ◽  
Dimitris Kanellopoulos
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Network Performance ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Total Energy Consumption ◽  
Selfish Herd

Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed of several sensor nodes, one of them selected as the cluster head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or another CH. In such a hierarchical WSN, some nodes are possibly moveable or nomadic (relocated periodically), while others are static. The mobility of sensor nodes can improve network performance and prolong network lifetime. This paper presents the idea of mobile, solar-powered CHs that relocate themselves inside clusters in such a way that the total energy consumption in the network is reduced and the network lifetime is extended. The positioning of CHs is made in each round based on a selfish herd hypothesis, where the leader retreats to the center of gravity. Based on this idea, the CH-active algorithm is proposed in this study. Simulation results show that this algorithm has benefits in terms of network lifetime and in the prolongation of the duration of network stability period.

scholarly journals Energy-efficient genetic algorithm variants of PEGASIS for 3D Wireless Sensor Networks

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Aaqil Somauroo ◽  
Vandana Bassoo
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Residual Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Delay Performance

Due to its boundless potential applications, Wireless Sensor Networks have been subject to much research in the last two decades. WSNs are often deployed in remote environments making replacement of batteries not feasible. Low energy consumption being of prime requisite led to the development of energy-efficient routing protocols. The proposed routing algorithms seek to prolong the lifetime of sensor nodes in the relatively unexplored area of 3D WSNs. The schemes use chain-based routing technique PEGASIS as basis and employ genetic algorithm to build the chain instead of the greedy algorithm. Proposed schemes will incorporate an energy and distance aware CH selection technique to improve load balancing. Clustering of the network is also implemented to reduce number of nodes in a chain and hence reduce delay. Simulation of our proposed protocols is carried out for homogeneous networks considering separately cases for a static base-station inside and outside the network. Results indicate considerable improvement in lifetime over PEGASIS of 817% and 420% for base station inside and outside the network respectively. Residual energy and delay performance are also considered.

Efficient Power Control and Clustering Method Based on Hybrid Clonal Genetic Algorithm in Wireless Sensor Networks

2012 ◽  
Vol 263-266 ◽  
pp. 889-897
Author(s):  
Xiang Xian Zhu ◽  
Su Feng Lu
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Clonal Selection ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Clonal Selection Algorithm ◽  
Clustering Methods

Wireless sensor networks (WSNs) lifetime for large-scale surveillance systems is defined as the time span that all targets can be covered. How to manage the combination of the sensor nodes efficiently to prolong the whole network’s lifetime while insuring the network reliability, it is one of the most important problems to research in WSNs. An effective optimization framework is then proposed, where genetic algorithm and clonal selection algorithm are hybridized to enhance the searching ability. Our goal can be described as minimizing the number of active nodes and the scheduling cost, thus reducing the overall energy consumption to prolong the whole network’s lifetime with certain coverage rate insured. We compare the proposed algorithm with different clustering methods used in the WSNs. The simulation results show that the proposed algorithm has higher efficiency and can achieve better network lifetime and data delivery at the base station.

scholarly journals Genetic algorithm based protocols to select cluster heads and find multi-hop path in wireless sensor networks: review

2018 ◽  
Vol 218 ◽  
pp. 03019 ◽  
Author(s):  
Mohammed Al-Shalabi ◽  
Mohammed Anbar ◽  
Tat-Chee Wan
Keyword(s):  
Genetic Algorithm ◽  
Optimization Technique ◽  
Specific Area ◽  
Modern Technology ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Path Finding ◽  
Radio Communication ◽  
Cluster Heads

A wireless sensor network (WSN) is a modern technology in radio communication. A WSN comprises a number of sensor nodes that are randomly spread in a specific area for sensing and monitoring physical attributes that are difficult to monitor by humans, such as temperature, fire, and pressure. Many problems, including data transmission, power consumption and selecting cluster heads, may occur due to the nature of WSNs. Various protocols have been conducted to resolve these issues. Most of the proposed protocols are based on the Genetic Algorithm as an optimization technique to select the Cluster Heads (CHs) or to find a multi-hop path for sending the data from the CHs to the Base Station (BS). This paper presents a comprehensive study of the protocols for WSNs that are proposed to come up with these issues. This study emphasises on CHs selection protocols and multi-hop path finding protocols and their strengths and weaknesses. A new taxonomy is presented to discuss these protocols on the basis of different classes. A complete comparison of the main features and behaviors of the protocols is conducted. This study will give basic guidelines for the researchers those have a motivation to develop a new CHs selection protocol or a multi-hop path finding protocol.

Sign in / Sign up

Export Citation Format

Share Document