IV. PROPOSED SYSTEM
The proposed work provides solution for the two problems in the existing method. In the proposed work, light weight PLGP [3] based method, mainly focused on avoiding vampire attacks in the discovery phase of PLGP by checking signal strength of the nodes which transmit the group joining messages. A vampire would send high energy signal so as to suppress the group joining messages of other node. So avoid a node which sends at high signal strength. Function modification of discovery phase (node) defines this concept. Another focus is to reduce overhead of PLGPa [1] by using single encryption instead of chain of encryption.
Proposed method concept
In this novel technique the attestation method is as shown below:
1. Encrypt
…show more content…
443
In the 3rd step it will verify
– If not source(i.e. other than 0.0.0.0) OR
– If ‘a’ is null & not neighbor ‘s’ OR
– If not verified ‘a’ THEN return(/*drop*/)
– Current node will be then previous one (0.0.0.1 is previous and current will be 0.0.1.0)
If not neighbor OR not progressing, THEN return(/*drop*/)
Closest next node of ‘s’ is assigned to ‘c’ (if ‘all is well’ then c=0.0.0.1 )
Old ‘p’ is appended key & assigned to ‘P’ (‘p’ is appended with c’s key)
Forward (P, c) if they are neighbor (‘P’ is forwarded to neighbor ‘c’)
Otherwise forward(P, c) to next hop which is non neighbor} Fig. Snapshots of PROPOSED SYSTEM
VI.RESULT AND COMPARATIVE ANALYSIS
Vampire attacks possess a serious threat to security of wireless sensor network. The proposed work has been compared based on various parameters. The various parameters used are energy consumption, average throughput, average delay etc. Every node is having own energy at initial stage. Energy consumed by the nodes while forwarding
every other node that receives them from the neighbors of S, until they arrive at the destination. When reactive routing protocols such as DSR or
The CSC consists of a sequence of four steps which are executed in sequence: \textit{(i)} Nodes use their maximum transmission power to connect to their neighboring nodes; \textit{(ii)} CC-links are established to increase connectivity; \textit{(iii)} The resulting topology from steps 1 and 2 are combined and we use topology control to select the routes towards the sink node that reduce the number of hops to reach the sink node.
/* The add back node function adds link at back of list. In this function a new node n is used and data is taken into data part of n. Condition for whether
Exercise 2.3.5: It would take 2 messages using a hub, but only 1 if using a switch. Adding node E will not have an effect on the network.
where $W_D(H_{i,j}$) is the minimum power consumption of the node $v_i$ to communicate with the farthest node in $H_{i,j}$, and $W_{CC}(H_{i,j}$) is the minimum power consumption of the node $v_i$ to
Proposed algorithm consider three types of nodes every type have different initial energy level. normal nodes have E_0 energy. m advanced nodes have a times energy more than normal nodes with E_0 (1+a) energy level. m_0 super nodes have b times energy more than normal nodes with E_0 (1+b) energy level, where a and b are energy factors. As N is the number of total nodes in network, then for number of normal nodes, advanced nodes and super nodes N(1-m) , Nm〖(1-m〗_0) and Nmm_0 in the network, respectively.
The attacker correlates the packet transmission times of each node and traces the packets hop-by-hop from its source to its destination. The intuition here is that under normal scenarios, each intermediate forwarder will forward a packet towards its destination without adding additional delay or packet mixing. Privacy can be enhanced when each forwarder node adds a random delay before transmitting the packet ~\cite{zhang2012, shao2008} or route the packets to fake destinations~\cite{deng2005}.
In this example, here node A wants to send data packets to node D and starts to find the shortest path for its destination, so if node D is a malicious node then it will show that it has active route to the specified destination. It will then send the response In the example, data packets transfer in a hierarchic data center network. The link capacity is 1000 kb/s. The number on each is the traffic load. The distribution of traffic is based on equal cost multi-path (ECMP). In figure 8, we can see that the 3). Congestions
Being proactive, AODV doesn’t need all its nodes in a network to maintain the routes to destinations rather request a route only when needed i.e., only the nodes which are communicating would require to maintain the route. Also AODV uses sequence numbers to avoid routing loops like in DSDV. Whenever a node needs to communicate with another node, a route has to be found and for that purpose Route Request (RREQ) message is broadcasted to all its neighbors till it reaches the destination node or route to destination. A temporary route table entry in initiated by the RREQ messages throughout the network. Once the destination or a route is found, Route Reply (RREP) message is sent back to source by unicasting along the temporary reverse path of the received RREQ message. RREP message initiates in creating a routing table entries for the destination in intermediate nodes on its way back to source. After certain amount of time these routing table entries expire. Neighbors are detected by periodic HELLO messages (a special RREP message). If a node A does not receive HELLO messages from a neighbor B through which it sends traffic, it assumes that a link is broken and the failure indication is forwarded to its active neighbors. When this message reaches the sources, then either they request a new route by sending new RREQ messages or stop sending data. HELLO messages and the
In simulated network the source node designated as1 initiates the routing procedure by sending RREQ or Route Request message to its surrounding nodes. The RREQ message sent by the source node is denoted in the color green. The other RREQ messages are shown in cyan, yellow, black etc. The source node 1 is sending the RREQ message to its neighbour nodes 5, 6, 9, 11 and 13 and the links are formed shown by the green line. Every time node 5,6,9,11,13 is sending the RREQ message to its neighbour and the links are formed.
Security is always the main issue for a network, when it is a wireless system the security becomes the main concern for a user. A wireless P2P network is suffering from mainly two security attacks i) Virus Attack ii) Intruders. Intruder does not only mean it want to hack the private information over the network, it also include to use a node bandwidth and increase the Delay of Service for other host over the network. This work is basically based on such type of attack. There are some system that exists on same attack model by comparing the hop time and some other means. But in all such system the Detection system is performed on a centralized system. We are proposing and intelligent predictive system
Using the provided network diagram, write a program that finds the shortest path routing using the Bellman-Ford algorithm. Your program should represent the fact that your node is U. Show how the iterative process generates the routing table for your node. One of the keys to your program will be in determining when the iterative process is done.
• Back propagation: The aftereffect of the reproduced playout is spread promptly from the chose node go down to the root hub. When the selection step increasing with visit counts, the data follow to be updated along the tree for selected node. [3]
as input and each edge will fall in one of the five cases. Let us say that the edge arrived has first node named as u and second edge as v.
Group key management plays an important role in group communication. A common group key is required for individual users in the group for secure multicast communication. Group key have to be updated frequently whenever member joins and leaves in order to provide forward and backward secrecy. Forward secrecy ensures that an expelled member cannot gather information about future multicast communication and backward secrecy ensures that a joining member cannot gather information about past multicast communication [11]. For