9,278 research outputs found

    CPMTS: Catching packet modifiers with trust support in wireless sensor networks

    Get PDF
    Security in wireless sensor networks is critical due to its way of open communication. Packet modification is a common attack in wireless sensor networks. In literature, many schemes have been proposed to mitigate such an attack but very few detect the malicious nodes effectively. In the proposed approach, each node chooses the parent node for forwarding the packet towards sink. Each node adds its identity and trust on parent as a routing path marker and encrypts only the bytes added by node in packet before forwarding to parent. Sink can determine the modifiers based on trust value and node identities marked in packet. Child node observes the parent and decides the trust on parent based on successful and unsuccessful transactions. Data transmission is divided into multiple rounds of equal time duration. Each node chooses the parent node at the beginning of a round based on its own observation on parent. Simulated the algorithm in NS-3 and performance analysis is discussed. With the combination of trust factor and fixed path routing to detect malicious activity, analytical results show that proposed method detect modifiers efficiently and early, and also with low percentage of false detection

    Intrusion-aware Alert Validation Algorithm for Cooperative Distributed Intrusion Detection Schemes of Wireless Sensor Networks

    Get PDF
    Existing anomaly and intrusion detection schemes of wireless sensor networks have mainly focused on the detection of intrusions. Once the intrusion is detected, an alerts or claims will be generated. However, any unidentified malicious nodes in the network could send faulty anomaly and intrusion claims about the legitimate nodes to the other nodes. Verifying the validity of such claims is a critical and challenging issue that is not considered in the existing cooperative-based distributed anomaly and intrusion detection schemes of wireless sensor networks. In this paper, we propose a validation algorithm that addresses this problem. This algorithm utilizes the concept of intrusion-aware reliability that helps to provide adequate reliability at a modest communication cost. In this paper, we also provide a security resiliency analysis of the proposed intrusion-aware alert validation algorithm.Comment: 19 pages, 7 figure

    Resilient networking in wireless sensor networks

    Get PDF
    This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focus at the network layer in particular, and an analysis of the behavior of four particular routing protocols is provided to determine their inherent resiliency to insider attacks. The protocols considered are: Dynamic Source Routing (DSR), Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing (RWR)

    Detection techniques of selective forwarding attacks in wireless sensor networks: a survey

    Full text link
    The wireless sensor network has become a hot research area due its wide range of application in military and civilian domain, but as it uses wireless media for communication these are easily prone to security attacks. There are number of attacks on wireless sensor networks like black hole attack, sink hole attack, Sybil attack, selective forwarding attacks etc. in this paper we will concentrate on selective forwarding attacks In selective forwarding attacks, malicious nodes behave like normal nodes and selectively drop packets. The selection of dropping nodes may be random. Identifying such attacks is very difficult and sometimes impossible. In this paper we have listed up some detection techniques, which have been proposed by different researcher in recent years, there we also have tabular representation of qualitative analysis of detection techniquesComment: 6 Page

    FALSE MISBEHAVIOUR ELIMINATION IN WATCHDOG MONITORING SYSTEM USING CHANGE POINT IN A WIRELESS SENSOR NETWORK

    Get PDF
    Wireless Sensor Networks are to be widely deployed in the near future for data monitoring in commercial, industrial and military applications. Though much research has focused on making these networks feasible and useful security has received very little attention. Sensor networks are exposed to variety of attacks like eavesdropping, message tampering, selective forward, gray hole attack, and Wormhole and Sybil attacks. Watchdog is a kind of behaviour monitoring mechanism which is the base of many trust systems in Ad hoc and Wireless Sensor Network. Current watchdog mechanism only evaluates its next-hop’s behaviour and propagates the evaluation result to other nodes by broadcasting, which is neither energy efficient nor attack resilient. The fundamental problem of secure neighbour discovery is studied which is importunate in protecting the network from different forms of attacks. In this paper an improved watchdog monitoring mechanism is proposed by using the process of change point detection. By implementing this change point detection algorithm in watchdog mechanism, the limitations of the existing watchdog mechanism are overcome. From this the exact malicious node can be found out and the data will be routed through a secure path bypassing the malicious node. Finally to analyze the efficiency of this algorithm, the results obtained from the proposed algorithm and the existing algorithms are compared

    Quarantine region scheme to mitigate spam attacks in wireless sensor networks

    Get PDF
    The Quarantine Region Scheme (QRS) is introduced to defend against spam attacks in wireless sensor networks where malicious antinodes frequently generate dummy spam messages to be relayed toward the sink. The aim of the attacker is the exhaustion of the sensor node batteries and the extra delay caused by processing the spam messages. Network-wide message authentication may solve this problem with a cost of cryptographic operations to be performed over all messages. QRS is designed to reduce this cost by applying authentication only whenever and wherever necessary. In QRS, the nodes that detect a nearby spam attack assume themselves to be in a quarantine region. This detection is performed by intermittent authentication checks. Once quarantined, a node continuously applies authentication measures until the spam attack ceases. In the QRS scheme, there is a tradeoff between the resilience against spam attacks and the number of authentications. Our experiments show that, in the worst-case scenario that we considered, a not quarantined node catches 80 percent of the spam messages by authenticating only 50 percent of all messages that it processe
    corecore