Dynamic Security in Wireless Networks by Using Multiple Path Routing Algorithm

Abstract

Wireless sensor networks (WSN) has two basic attacks while transferring packets from source to destination. They are Compromise Node (CN) attack and Denial of Service (DOS) attack. CN will cooperate with the hacker so that they can find the paths of neighbour routes easily, in DOS the hacker finds the node and block the information. In both CN and DOS black holes are generated which will not transmit the received packets. To overcome these attacks in WSN randomized multiple path algorithm is used. So, every node in the network receives the packets and retransmits it once. Even though the hacker finds the randomized multiple path routes they cannot point out the routes traversed by each packet which is not feasible. By using this algorithm the routes become highly dispersive and it becomes energy efficient. In the proposed system the black holes formed in CN and DOS are overcome by using DSDV (Destination Sequenced Distance Vector Routing) and RIP(Routing Information Protocol)protocols. Instead of selecting pre-computed set of routes, multiple paths are set by the nodes randomly. So, at each time the information packets are send in different paths by which the packets can be sent securely. Large numbers of routes are generated for each source and destinations where the hackers cannot hack the packets easily. Thus, it is difficult for the hackers to compromise or jam all possible routes from source to destination which is practically infeasible.