Paper Title
Coding Based Multiple Routing by Using Caser

Abstract
Wireless sensor networks are an important for monitoring distributed remote environments. As one of the key technologies involved in WSNs, nodes fault detection is indispensable in most WSN applications. It is well known that the distributed fault detection scheme checks out the failed nodes by exchanging data and mutually testing among neighbor nodes in this network, but 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 results demonstrate that the improved scheme performs well in the above situation and can increase the fault detection accuracy greatly. Wireless sensor-actor networks, sensors probe their surroundings and forward their data to actor nodes. Actors collaboratively respond to achieve predefined application mission. Since actors have to coordinate their operation, it is necessary to maintain a strongly connected network topology at all times. Moreover, the length of the inter-actor communication paths maybe constrained to meet latency requirement. Cost Aware Secure Routing protocol to address these two conflicting issues through two adjustable parameters: energy balance control and probabilistic based random walking. CASER has an excellent routing performance in terms of energy balance and routing path distribution for routing path security. We also proposed a non uniform energy deployment scheme to maximize the sensor network lifetime. Our analysis and simulation will showing that we can increase the lifetime and the number of messages that can be delivered under then 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 its so that it will be able to carry further load Packets on the network. This can be done by using shortest path. Prior work relies on maintaining multi hop neighbor lists and predetermines some criteria for the node�s involvement in the recovery. 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. Keywords- Cost Aware Secure Routing, Electronic Book Code, multi hop , Security, , topology, Wireless Sensor Network.