Dynamic performance of an attacker replacement algorithm for wireless sensor networks

In the recent years Wireless Sensor Networks (WSN) has become the very interesting and challenging area for the effective rapid data transmission. The efficiency and the throughput of the wireless network should be high. Sometime it is necessary to select the best/correct adjacent node to transmit the data without any loss. To disrupt communication between the nodes various types of attackers are available in the networks. Here proposed a new approach called Attacker Replacement Algorithm (ARA) to detect the attacker in the network and to replace the attacker node by a new substitute node with the help of nearby base stations. After the replacement of the node, the effective communication takes place through the replaced node. Then several parameters are analyzed with and without the replacement of attacker node. And found it to be better after the replacement of node by using Attacker Replacement Algorithm (ARA).