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
Question requires you to submit a proposal based on the research report topic you will be addressing in the second assignment.  Note:  before commencing research on the topic, y

B a s i c functions of e-mail system are given as follows: C o mp o sition refers to the procedure of creating messages and the answers. Though any text editor can be

Question: (a) Describe how IPSec provides data source authentication. (b) Which protocol can be used to provide limited traffic analysis confidentiality? Why is it "limite

Question (a) In relation to a TCP segment structure, provide the fields responsible for: i. Connection Management ii. Flow Control iii. Error Control iv. Reliable, in-order

SDES encryption and decryption

You are an IT Security administrator in a banking organization. Your organization hired an outside IT firm to do a proof of Concept for new equipment which is a computer based syst

Question (a) Estimate the average throughput between two hosts given that the RTT for a 100 bytes ICMP request-reply is 1 millisecond and that for a 1500 bytes is 2 millisecon

Question 1 a) Explain how CSMA/CD works. b) Describe the term "exponential back-off". c) Describe the differences between "circuit switching" and "packet switching". d) Th

Problem (a) Describe RSA algorithm with an example. (b) Answer the following RSA encryption, given the values of the primes are: p = 17, q = 11 and choosing e = 7. (c)

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