Sensor Network Security algorithm based on Evidence theory

WSN i.e. Wireless sensor network are having low cost & multi functional resources and nodes with sensors to receive & transmit the data throughout the network. These nodes are very critical to the environmental situations. Incase of very sensitive applications the matter of security is at the peak as these type of network deals with a maximum factor of interaction through network. Hence, very much sensitive to both type of attacks: external & internal. Internal attacks are more crucial in this case as we have to make interaction with the network information again & again in which that malicious node is participating every time, that is the reason, it needs hard efforts to identify the suspicious node. One more reason why it is crucial is that that suspicious node is having all the rights for accessing the information as any other network node. In this paper we will make use of a three stage model to identify the attacker node that is present in the network. Firstly, all the nodes checked for 3 properties throughput, energy, delay to guess their behavior for abnormality. Secondly, neighbor nodes are made to check their properties that there are interacting normally. Thirdly, these are again checked with the use of evidences previously obtained that they are strong enough to prove the node as attacker one. If yes the node is removed from the network. The experiments gives appropriate results with the last stage.