scholarly journals Intrusion Detection Algorithm for Packet Loss Minimization in Wireless Sensor Networks

Wireless Sensor Network consists of a greater number of sensor nodes and recent advance is in wireless communications and it serves a backbone for controlling the real time applications. It consists of group of sensor nodes and that is sense the information from the event area and it is passes through the base station and which it reacts according to environment and to provide a large-scale monitoring and sensor measurement in a high temporal and the spatial resolution. The researcher uses a different algorithm in that they use a distributed energy fuzzy logic to reduce a packet loss. Wireless Sensor Networks are unprotected to many kinds of the security threats which can decrease the performance of network and cause the sensors to send wrong data to destination. The hostile node in the network is working as an attacker node and it takes all the information packets which is delivered through them. In this paper we propose an intrusion detection system algorithm against the packet dropping. Intrusion detection algorithm solves the problem by analyzing the network by detecting the abnormal node. Then the abnormal node is corrected into normal node with the help of intrusion detection algorithm.

Author(s):  
Dina M. Ibrahim ◽  
Nada M. Alruhaily

With the rise of IOT devices and the systems connected to the internet, there was, accordingly, an ever-increasing number of network attacks (e.g. in DOS, DDOS attacks). A very significant research problem related to identifying Wireless Sensor Networks (WSN) attacks and the analysis of the sensor data is the detection of the relevant anomalies. In this paper, we propose a framework for intrusion detection system in WSN. The first two levels are located inside the WSN, one of them is between sensor nodes and the second is between the cluster heads. While the third level located on the cloud, and represented by the base stations. In the first level, which we called light mode, we simulated an intrusion traffic by generating data packets based on TCPDUMP data, which contain intrusion packets, our work, is done by using WSN technology. We used OPNET simulation for generating the traffic because it allows us to collect intrusion detection data in order to measure the network performance and efficiency of the simulated network scenarios. Finally, we report the experimental results by mimicking a Denial-of-Service (DOS) attack. <em> </em>


21st century is considered as the era of communication, and Wireless Sensor Networks (WSN) have assumed an extremely essential job in the correspondence period. A wireless sensor network is defined as a homogeneous or heterogeneous system contains a large number of sensors, namely called nodes used to monitor different environments in cooperatives. WSN is composed of sensor nodes (S.N.), base stations (B.S.), and cluster head (C.H.). The popularity of wireless sensor networks has been increased day by day exponentially because of its wide scope of utilizations. The applications of wireless sensor networks are air traffic control, healthcare systems, home services, military services, industrial & building automation, network communications, VAN, etc. Thus the wide range of applications attracts attackers. To secure from different types of attacks, mainly intruder, intrusion detection based on dynamic state context and hierarchical trust in WSNs (IDSHT) is proposed. The trust evaluation is carried out in hierarchical way. The trust of sensor nodes is evaluated by cluster head (C.H.), whereas the trust of the cluster head is evaluated by a neighbor cluster head or base station. Hence the content trust, honest trust, and interactive trust are put forward by combining direct evaluation and feedback based evaluation in the fixed hop range. In this way, the complexity of trust management is carried in a hierarchical manner, and trust evaluation overhead is minimized.


2018 ◽  
Vol 7 (4.5) ◽  
pp. 657
Author(s):  
Jayashree Agarkhed ◽  
Gauri Kalnoor

Design of an intrusion detection system in the sensor network to improve the behavior of the network is the major challenge is theVariety of intrusion detection mechanisms are being used now a days, to provide security in Wireless Sensor networks (WSN). Since WSN works with set of tiny nodes called as sensor nodes, there are high chances of intrusions for malicious attacks. WSN is deployed in medium open to many users wherever possible. A multiple sensing environment of WSN consists of sensors which acts as agents called as multi agents system for detecting an intruder. Ant colony is an effective approach where each agent communicate with each other for updating the information of intruder to the colony administration. The multi agents based system is best phenomenon suitable for optimization of ant colony. In this approach, the ants form a colony where it goes for search continuously until an intruder is found and once searched, it returns back with the best shortest path available with path traces stored in its database for its future reference. An optimized multi agent approach using ant colony is proposed for detection of lightweight intruders for WSN to protect against harmful malicious attacks.  


2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Ranjeeth Kumar Sundararajan ◽  
Umamakeswari Arumugam

In wireless sensor network (WSN), the sensors are deployed and placed uniformly to transmit the sensed data to a centralized station periodically. So, the major threat of the WSN network layer is sinkhole attack and it is still being a challenging issue on the sensor networks, where the malicious node attracts the packets from the other normal sensor nodes and drops the packets. Thus, this paper proposes an Intrusion Detection System (IDS) mechanism to detect the intruder in the network which uses Low Energy Adaptive Clustering Hierarchy (LEACH) protocol for its routing operation. In the proposed algorithm, the detection metrics, such as number of packets transmitted and received, are used to compute the intrusion ratio (IR) by the IDS agent. The computed numeric or nonnumeric value represents the normal or malicious activity. As and when the sinkhole attack is captured, the IDS agent alerts the network to stop the data transmission. Thus, it can be a resilient to the vulnerable attack of sinkhole. Above all, the simulation result is shown for the proposed algorithm which is proven to be efficient compared with the existing work, namely, MS-LEACH, in terms of minimum computational complexity and low energy consumption. Moreover, the algorithm was numerically analyzed using TETCOS NETSIM.


2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Bishan Ying

The nature of wireless sensor networks (WSNs) makes them very vulnerable to adversary's malicious attacks. Therefore, network security is an important issue to WSNs. Due to the constraints of WSN, intrusion detection in WSNs is a challengeable task. In this paper, we present a novel intrusion detection mechanism for WSNs, which is composed of a secure data communication algorithm and an intrusion detection algorithm. The major contribution of this paper is that we propose an original secure mechanism to defend WSNs against malicious attacks by using the information generated during data communication. The approach is able to protect the data communication in a WSN even if some sensor nodes are compromised by adversary. The proposed approach is easy to be implemented and performed in resource-constrained WSN. We also evaluate the proposed approach by a simulation experiment and analyze the simulation results in detail.


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Ming Xia ◽  
Peiliang Sun ◽  
Xiaoyan Wang ◽  
Yan Jin ◽  
Qingzhang Chen

Localization is a fundamental research issue in wireless sensor networks (WSNs). In most existing localization schemes, several beacons are used to determine the locations of sensor nodes. These localization mechanisms are frequently based on an assumption that the locations of beacons are known. Nevertheless, for many WSN systems deployed in unstable environments, beacons may be moved unexpectedly; that is, beacons are drifting, and their location information will no longer be reliable. As a result, the accuracy of localization will be greatly affected. In this paper, we propose a distributed beacon drifting detection algorithm to locate those accidentally moved beacons. In the proposed algorithm, we designed both beacon self-scoring and beacon-to-beacon negotiation mechanisms to improve detection accuracy while keeping the algorithm lightweight. Experimental results show that the algorithm achieves its designed goals.


Sign in / Sign up

Export Citation Format

Share Document