Randomized Routing for Wireless Sensor Networks: Optimized Security and Energy Efficiency

A Wireless Sensor Network (WSN) is a wireless network consisting of spatially distributed autonomous devices that use sensors to monitor physical or environmental conditions. Sensor nodes are battery-powered and are expected to operate without attendance for a relatively long period of time. So they must be energy efficient. Sensor networks are also highly susceptible to security attacks. There are mainly two types of attacks on WSNs. They are compromised node attack and denial- of- service attack. To counter these attacks, randomized multi- path mechanism is used. The main advantage of this method is that randomly disjoint multi-path routing does not have a fixed candidate route for selection. Therefore, it is able to ensure that adversaries can not know the routes even if they obtain the routing algorithms in advance. However, this method do not consider the network lifetime of WSNs, which may lead to a high probability of sensor nodes outage and cause a cessation of normal operations. So there is a need to maximize security and make this method energy efficient. In this paper we propose a method that makes the randomized multi- path routing energy efficient and also increases the network security.