Semi-randomised propagation for secure routing in Wireless Sensor Networks

Denial-of-Service attacks are a major concern in static Wireless Sensor Networks. Malicious nodes can attack the network by jamming, selectively forwarding packets, black-hole attack and spoofing. In the case of statically deployed, dense Wireless Sensor Networks which use flat routing, alternate path for secure transmission on packets across such malicious nodes have to be found. Scattering multiple copies of the packets in order to reach the sink, leads to more network and energy inefficiency. Moreover, collusion of malicious nodes is addressed vaguely by literature. In this paper, we propose a secure routing methodology which semi-randomly propagates a packet in the shortest path to the Sink by circumventing the malicious nodes. Extensive simulations show that the number of broadcast hops, activity of network and the packet drop ratio are significantly lesser for the proposed routing technique. Simulations also prove that the proposed technique handles collusion of malicious nodes more efficiently.