Energy efficient fault tolerance multi-path routing
introduction Recent technological improvements have made the deployment of small, inexpensive, low-power, distributed devices, which are capable of local processing and wireless communication, a reality . Such devices are called as sensor nodes. Thus, a sensor network can be described as a collection of sensor nodes which co-ordinate to perform some specific action. Unlike traditional networks, sensor networks depend on dense deployment and coordination to carry out their tasks.
Scope We
propose to develop an energy efficient fault-tolerant multi path routing technique which utilizes multiple paths between source and the sink. This protocol is intended to provide a reliable transmission environment with low energy consumption, by efficiently utilizing the energy availability and the available bandwidth of the nodes to identify multiple routes to the destination.
Project outcome We
have proposed an Energy efficient faulttolerant multi path routing technique which utilizes multiple paths between source and the sink. This protocol is intended to provide a reliable transmission environment with low energy consumption, by efficiently utilizing the energy availability and the available bandwidth of the nodes to identify multiple routes to the destination.
Technologies used Routing Protocols can be broken down based on following techniques: Flooding: SPIN (SPIN-1 and SPIN-2) Gradient: Directed Diffusion, GRAB Clustering: LEACH , TTDD, Geographic: GPSR, GAF, GEAR
Existing system
LEACH [Low Energy Adaptive Clustering Hierarchy] is a cluster based protocol. The distribution of energy load amid the sensor nodes in the network is done in a uniform fashion with the aid of randomized rotation.
Proficient information distribution can be achieved in an energy-constrained wireless sensor network with the aid of SPIN [Sensor Protocols for Information via Negotiation].
SPIN [Sensor Protocols for Information via Negotiation] works on basis of controlled flooding that incorporates solving flooding problems such as Implosion, Detection of overlapping agents, and Blindness.
Proposed system In
Proposed System, this multi path protocol institutes node-disjoint paths.
The
construction of node-disjoint paths is made through succeeding calculation of the node-disjoint, shortest in number of hops, using the route discovery provided network connectivity information.
To
achieve energy efficiency, our protocol selects the paths based on the available bandwidth and residual energy of the nodes.
Future scope In
future in case of some unexpected link or route failure, the algorithm selects the path with the next highest ARR, from the list of available paths.
Performance of the system The
construction of node-disjoint paths is made through succeeding calculation of the node-disjoint, shortest in number of hops, using the route discovery provided network connectivity information. To achieve energy efficiency, our protocol selects the paths based on the available bandwidth and residual energy of the nodes.