Project Login
Registration No:
Password:
MAIL ALERTS SMS ALERTS
 
     
   
     

A TRIGGER IDENTIFICATION SERVICE FOR DEFENDING REACTIVE JAMMERS IN WSN

Platform : java

IEEE Projects Years : 2012 - 13

A TRIGGER IDENTIFICATION SERVICE FOR DEFENDING REACTIVE JAMMERS IN WSN

 

During the last decade, Reactive Jamming Attack has emerged as a greatest security threat to wireless sensor networks, due to its mass destruction to legitimate sensor communications and difficulty to be disclosed and defended. Considering the specific characteristics of reactive jammer nodes, a new scheme to deactivate them by efficiently identifying all trigger nodes, whose transmissions invoke the jammer nodes, has been proposed and developed. Such a trigger-identification procedure can work as an application-layer service and benefit many existing reactive-jamming defending schemes. In this paper, on the one hand, we leverage several optimization problems to provide a complete trigger-identification service framework for unreliable wireless sensor networks. On the other hand, we provide an improved algorithm with regard to two sophisticated jamming models, in order to enhance its robustness for various network scenarios. Theoretical analysis and simulation results are included to validate the performance of this framework.

 

Existing System:

 

The last decade, the security of wireless sensor networks (WSNs) has attracted numerous attentions, due to its wide applications in various monitoring systems and invulnerability toward sophisticated wireless attacks.

 

Among these attacks, jamming attack where a jammer node disrupts the message delivery of its neighboring sensor nodes with interference signals, has become the most critical threat to WSNs. Thanks to the efforts of researchers toward this issue, as summarized in, various efficient defense strategies have been proposed and developed.

 

However, a reactive variant of this attack, where jammer nodes stay quite until an ongoing legitimate transmission (even has a single bit) is sensed over the channel, emerged  recently and called for stronger defending system and more efficient detection schemes. Existing countermeasures against Reactive Jamming attacks consist of jamming (signal) detection and jamming mitigation.

 

 

 

 

 

Proposed System:

 

We present an application-layer real-time trigger-identification service for reactive-jamming in wireless sensor networks, which promptly provides the list of trigger-nodes using a lightweight decentralized algorithm, without introducing neither new hardware devices, nor significant message overhead at each sensor node.

 

This service exhibits great potentials to be developed as reactive jamming defending schemes. As an example, by excluding the set of trigger nodes from the routing paths, the reactive jammers will have to stay idle since transmissions can be sensed. Even though the jammers move around and detect new sensor signals, the list of trigger nodes will be quickly updated, so are the routing tables.

 

Advantages:

 

We consider the anti-jamming diversity based on the use of multiple routing paths. Using multiple-path variants of source routing protocols such as Dynamic Source Routing (DSR)

 

The jamming attacks that are easy to launch and difficult to detect and confront, since they differ from brute force attacks. The jammer controls probability of jamming and transmission range in order to cause maximal damage to the network in terms of corrupted communication links.

 

The jammer action ceases when it is detected by the network, namely by a monitoring node, and a notification message is transferred out of the jamming region.

 

The fundamental tradeoff faced by the attacker is the following: a more aggressive attack in terms of higher jamming probability or larger transmission range increases the instantaneously derived payoff but exposes the attacker to the network and facilitates its detection and later on its isolation.

 

•Buffering of packets in carried out in the edge routers rather than in the core routers.

 

•The packets are sent into the network based on the capacity of the network and hence there is no possibility of any undelivered packets present in the network.

 

•Absence of undelivered packets avoids overload due to retransmission.

 

•Fair allocation of bandwidth is ensured.

 

Software Requirements:

 

  • Core Java
  • Frond End- Swings
  • Eclipse
  • Windows XP

 

Hardware Requirements:

 

  • RAM         : 512 Mb
  • Hard Disk : 80 Gb
  • Processor  : Pentium IV

 

 

 

Modules:

 

Analysis Network

 

Routing

 

Multiple Routing

 

Attacker Model

 

Optimal Path Selection

 

Heuristic Algorithm

 

 

 

Analysis of network:

 

 

 

  • We initiate a fixed-length walk from the node. This walk should be long enough to ensure that the visited peers represent a close sample from the underlying stationary distribution.
  • We then retrieve certain information from the visited peers, such as the system details and process details.
  • It acting as source for the network .In sender used to create sends the request and received the response and destination used to received the request and send the response for the source.

 

 

 

Routing :

 

 

 

  • When the packets are sending from the source, they are transferred to the destination through the routers.
  •  Routers check for the IP address given by the source with their own IP address for the destination confirmation.

 

Multiple routing:

 

  • It is desirable to allow packets with the same source and destination to take more than one possible path. This facility can be used to ease congestion and overcome node failures.
  • To operate such a scheme consistently nodes must maintain routing tables.
  • Multipath routing allows the establishment of multiple paths between a single source and single destination node.
  • It is typically proposed in order to increase the reliability of data transmission (i.e., fault tolerance) or to provide load balancing.
  •  Load balancing is of especial importance in MANETs because of the limited bandwidth between the nodes.

 

Attacker  Model :

 

 

 

  • This module deals with the intruder identification. If an intruder enters the network group, the intruder is identified and the location of the intruder is displayed to the receiver side.
  • This is any entity that is allowed by a data server to provide content services in response to requests by clients.
  • Intermediaries include caching proxies and transforming proxies. They check for the IP address and the packet security by providing content filtering.

 

 

 

Optimal Path Selection:

 

  • OPSAM (Optimal Path Selection Algorithm for Multicast) for the static multicast routing problem and the newly defined mobile multicast routing problem.
  • The problem is modeled as one of finding the most probable feasible path, where link weights are random variables.
  • A "backward-forward" heuristic is proposed which again uses prelabeling of the graph in the backward direction followed by a forward search that attempts to minimize an objective function.

 

Heuristic Algorithm:

 

  • The term heuristic is used for algorithms which find solutions among all possible ones, but they do not guarantee that the best will be found, therefore they may be considered as approximately and not accurate algorithms.
  • These algorithms, usually find a attackers or jamming, the solution close to the best one and they find it fast and easily.
  • The method used from a heuristic algorithm is one of the known methods, such as greediness, but in order to be easy and fast the algorithm ignores or even suppresses some of the problem's demands

 

 



NOW GET PROJECTS ! GET TRAINED ! GET PLACED !

IEEE, NON-IEEE, REAL TIME LIVE ACADEMIC PROJECTS,

PROJECTS WITH COMPLETE COURSES,SOFT SKILLS & PLACEMENTS

ALLOVER INDIA & WORLD WIDE,

HOSTEL FACILITY AVAILABLE FOR GIRLS & BOYS SEPARATELY,

CALL: 08985129129 ,  E-Mail Id: support@ascentit.in

REGISTER FOR PROJECTS NOW ! GET DISCOUNT
   
1