Malicious node detection mechanisms, Computer Network Security

Many applications are vulnerable to intrusion attacks and can provide misleading reports about misbehaving nodes. Some of the mechanisms under such a category include the Bayesian fault recognition algorithm which relies on the spatial relationship of environmental conditions. Other schemes which have been tried but failed include the autoregression technique which relies on the strength of the signal transmitting data, the network voting algorithm, and the weighted trust evaluation based on trust levels on a hierarchical network. All the above mechanisms have suffered various weaknesses when used in WSN.

The mechanisms integrated into the WSN network with triple key management scheme to provide a complete secure network uses a Dual Threshold. In this context, α1 and α2 defined with appropriate trust values are used. The mechanism has been proven to provide enhanced node detection performance. The mechanism operates by enabling each sensor node in the wireless network to have trust values updated each time an event occurs to provide the correct report.

1303_Malicious node detection mechanisms.png

Figure: Weighted diagram of WSN nodes

A study by Lazos and Poovendran shows that the weighted graph illustrated above shows that weight wij, has values that range between 0 and 1 etc. A typical example where wij =1. Here, Lazos and Poovendran show that the corresponding nodes have trust value is vj as shown above. On the other hand, when the value of wij is equal to zero, there is no trust value and a flag Fi is set to 1. The node is faulty. Detections can be based on distributed events based on the dual threshold technique. As mentioned above, there are two thresholds, α1 and α2; with α1 being used to detect an event while ensuring a low false alarm rate exists. On the other hand, the threshold α2 helps nodes that are on or near the boundary region of an event to pass the test reflecting accurately the level of detection as illustrated in figure 4 below.

1021_Malicious node detection mechanisms1.png

Figure: Binary detection of malicious nodes

Posted Date: 7/27/2013 6:22:11 AM | Location : United States







Related Discussions:- Malicious node detection mechanisms, Assignment Help, Ask Question on Malicious node detection mechanisms, Get Answer, Expert's Help, Malicious node detection mechanisms Discussions

Write discussion on Malicious node detection mechanisms
Your posts are moderated
Related Questions
a) Calculate the CRC for the frame below: Frame: 1101011011 Generator: 10011 Message after appending 4 zero bits: 11010110110000 b) OSI refers to a system in which any

(a) Using Fermat's theorem, find 3 201 mod 11. (b) Explain how the Diffie-Hellman key agreement protocol works and what its purpose and main properties are. Consider a Dif

Question: (a) Distinguish between a mobile agent "state" and "code". (b) Differentiate between "weak" and "strong" mobility. (c) Mobile agent systems are known to have

Write Pseudocode for the password guessing algorithm: Consider the following authentication protocol: Client Transmission Host

#questioAn elliptic curve y^2=x^3+ax+b(mod29) includes points P=(7, 15) and Q=(16, 13) a)Determine the equation of the crve b) Determine all values of x for which there is no point

THREADS AND ATTACKS Threat is an object, person, or other entity which represents a constant danger to an asset. To make sound decisions about information security, management s

attacks on crytography

i have an idea of clustering in wsns . where each and every sensor node use the reputation scheme and while clustering provide help against the selfishness atatck of the sensor nod

Spambot Detection: The  previous studies in this field  have focused on content and meta-content based features.  The main assumption in this area of spam detection of late is

The best results obtained in the PIIT classes have been when the technique has been used in tutorial groups, rather than have students submit individual reflections on particular c