Energy Efficient Survivable Path Routing in Wireless Sensor Network

Recently there has been a lot of interest in building and deploying sensor networks. These networks are composed of a high number of very simple nodes where most of them have to perform the function of a router also. Energy consumption of these nodes is important as the power supplies of the node is provided by limited batteries, which circumscribe the lifetime of the links as well as whole networks. Therefore controlling the energy usage of network sensor node is critical for long lifespan of the network. Since the sensor nodes are acting like routers as well, the choice of routing algorithm would have a major role in the energy consumption control. As the well-known routing protocols use the optimized path, it will degrade the energy level of the nodes in that particular path. But instead energy efficient algorithms will overcome this problem. So through this research we are trying to design an energy efficient survivable path routing protocol for Wireless Sensor Networks which is efficient in term of the energy usage of the whole network such that the network will not get disconnected because of the energy depletion of its nodes. Still there are so many routing algorithms in this field we are trying for a protocol in the real time network where the traffic is more and also congested by so many data sources sending their packets to the base station at the same time. We are proposing a protocol which selects the path with a high survivability factor at the same time it should try to select the one which has less interference from the other nodes as well as the environment. For selecting the next hop node, our algorithm uses a criterion which is a function of the signal-to-interference-noise-ratio of the link between those two, the survivability factor the path from that node to the destination, and the geographic distance from that node to the destination