Secure and energy efficient routing algorithm for wireless sensor networks

Abstract

In a large scale sensor network, minimum spanning tree is evaluated to route data to a sink node in a hop by hop manner. But in this route any node can be compromised or a compromised node can be included and it can inject false data or it can alter the existing data. Therefore, to provide a security we use a COmpromised nOde Locator protocol (COOL) by which we can remove compromised node from the network. When a compromised node is detected then this protocol prevents further damages from misbehaved node and forms a reliable and energy saving sensor network. Thus in our proposed algorithm, we make a path using minimum spanning tree and maintains security (COOL protocol) in wireless sensor networks. Thus, by combining both (MST and COOL protocol) we creates a secure and energy conserving environment in which sensor nodes can communicate through the sink node which is the node whom all nodes send the data through routing. Also we can check the node consistency using the hash values.