ALGORITHM FOR DYNAMIC NODE EVENTS IN WIRELESS SENSOR NETWORKS

Seminar on ALGORITHM FOR DYNAMIC NODE EVENTS IN WIRELESS SENSOR NETWORKS : Wireless sensor networks are becoming networks, a number of applications in all areas, because of their low cost and low power consumption. As these networks allow wireless communication open, they are routing attacks in which the opponent masquerades as a legitimate node to its neighbor nodes to ensure that it is "better" packages on the path, and drop the packets are delivered in countries neighboring nodes. In addition, communications nodes, the access network is broken, because this activity node malignant. These networks also face problems such as opening node dynamic events, such as hubs and nodes connected to the deaths, which represent challenges, such as detecting whether a node is alive or dead, and keep in touch with the nodes.
In this paper, to overcome all the above problems, we developed algorithms for Carter (Secure Unicast Messaging Protocol), as well as the implementation of Merkel hash trees to protect unicast messages and communication group of nodes in levels depending on the number of hops that allows uninterrupted communication. The main advantage of sink is that it requires storage of information such as node of other protocols.
well behaved nodes, causing large holes in the middle of detection. Sometimes, because of this activity on the link between nodes is disconnected or can cause the death of a node. The adversary is able to develop lists of results from other nodes in the network by the commitment of individual nodes, since most network protocols require a sensor node to store the ID of its parent node. Two of these attacks are the level of routing black holes and worm attacks.