Novel Approach Implementation for Routing Node Failure

Wireless sensor networks (WSNs) are important for monitoring most of the distributed remote environments. Nodes fault detection is one of the key technologies involved in WSNs, is indispensable in most WSN applications. The distributed fault detection scheme checks out the failed nodes by exchanging data and mutually testing among neighbor nodes in this network The fault detection accuracy of a scheme would decrease rapidly when the number of neighbor nodes to be diagnosed is small and the node’s failure ratio is high. An improved scheme is proposed by defining new detection criteria. Simulation process demonstrate that the improved scheme performs well in the above situation and the fault detection accuracy can be increased greatly. wireless sensor-actor networks, sensors probe their surroundings and forward their data to actor nodes. The Actors respond collaboratively to achieve predefined application mission. Since the actors have to coordinate their operation, a strongly connected network topology is necessary to maintain at all times. Also, the length of the inter-actor communication paths maybe constrained to meet latency requirement. Cost-Aware SEcure Routing (CASER) is a protocol to address these two conflicting issues through two adjustable parameters: energy balance control (EBC) and probabilistic-based random walking. CASER has an excellent routing performance in terms of energy balance and routing path distribution for routing path security. A non-uniform energy deployment scheme is also proposed to maximize the sensor network lifetime. Our analysis and simulation will show that we can increase the lifetime and the number of messages that can be delivered under them on-uniform energy deployment by more than four times. CASER has flexibility to support multiple routing. The main objective to have a network which gives assurance of packet delivery and give the node time to regain is that it will be able to carry further load Packets on the network. This can be done by using shortest path. Multi-hop-based schemes often impose high node repositioning overhead and the repaired inter-actor topology using two-hop schemes may differ significantly from its prefailure status.