5 research outputs found

    Clone Detection for Efficient System in WSN using AODV

    Get PDF
    Wireless sensor is wide deployed for a spread of application, starting from surroundings observance to telemedicine and objects chase, etc. For value effective sensing element placement, sensors are usually not tamperproof device and are deployed in places while not observance and protection, that creates them at risk of fully different attacks. As an example, a malicious user may compromise some sensors and acquire their private information. Then, it?ll duplicate the detectors and deploy clones in an exceedingly wireless sensor network (WSN) to launch a spread of attack that?s mentioned as clone attack. Because the duplicated sensors have an equivalent information, e.g., code and crypto graphical information, captured from legitimate sensors that may merely participate in network operation and launch attacks. Because of the low value for sensing components duplication and preparation, clone attacks became one in all the foremost essential security issues in WSNs. Thus, it?s essential to effectively detect clone attacks therefore to ensure healthy operation of WSNs

    A Distributed Clone Detection Protocol Considering Clone Detection Probability, Network Lifetime and Data Buffer Storage

    Get PDF
    We propose an energy-efficient location-aware clone location convention in thickly conveyed WSNs, which can ensure successful clone attack recognition and keep up attractive system lifetime. In particular, we misuse the area data of sensors and haphazardly select witnesses situated in a ring zone to check the authenticity of sensors and to report identified clone attacks. The ring structure encourages vitality productive information sending along the way towards the witnesses and the sink. We hypothetically demonstrate that the proposed convention can accomplish 100 percent clone identification likelihood with trustful witnesses. We additionally broaden the work by concentrate the clone identification execution with untrustful witnesses and demonstrate that the clone recognition likelihood still methodologies 98 percent when 10 percent of witnesses are traded off

    Clone Detection for Efficient System in WSN Using AODV

    Get PDF
    Wireless sensor networks accommodate a whole lot to thousands of sensor nodes and are wide employed in civilian and security applications. One in every of the intense physical attacks faced by the wireless sensor network is node clone attack. So 2 node clone detection protocols area unit introduced via distributed hash table and arbitrarily directed exploration to detect node clones. The previous primarily based on a hash table value that is already distributed and provides key based facilities like checking and caching to observe node clones. The later one is exploitation probabilistic directed forwarding technique and border determination. The simulation results for storage consumption, communication value and detection chance is completed exploitation NS2 and obtained arbitrarily directed exploration is that the best one having low communication value and storage consumption and has smart detection chance

    A Randomized Countermeasure Against Parasitic Adversaries in Wireless Sensor Networks

    No full text
    Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker called parasitic adversary, who seeks to exploit sensor networks by obtaining measurements in an unauthorized way. As a countermeasure, we first employ a randomized key refreshing: with low communication cost, it aims at confining (but not eliminating) the effects of the adversary. Moreover, our low-complexity solution, GossiCrypt, leverages on the large scale of sensor networks to protect data confidentiality, efficiently and effectively. GossiCrypt applies symmetric key encryption to data at their source nodes and re-encryption at a randomly chosen subset of nodes en route to the sink. The combination of randomized key refreshing and GossiCrypt protects data confidentiality with a probability of almost 1; we show this analytically and with simulations. In addition, the energy consumption of GossiCrypt is lower than a public-key based solution by several orders of magnitude

    A randomized countermeasure against parasitic adversaries in wireless sensor networks

    No full text
    corecore