Abstract:-Transitive Dependencies Tracking in Minimum-Process Checkpointing Protocol for Mobile

Friday, 26 August 2011 09:52 administrator
Print PDF
Abstract- In Ad-hoc network every node is self-organized and can communicate directly with all other nodes. An Adhoc mobile network is composed of mobile terminals that communicate with each other through broadcast radio transmissions with in the transmissions power range.
Compared to the wired distributed computing system, ad-hoc wireless networks have certain new characteristics. The transient failure probability of the computing process increases greatly with the enlarging of system scale. If a failure occurs in a process and there is not an appropriate
method to protect it, more cost will be wasted for restarting the program. Coordinated checkpointing can be used to introduce fault tolerance in mobile ad-hoc wireless networks environment .In this paper we propose a new minimum process checkpointing scheme for ad-hoc networks. We
assume that Cluster Based Routing Protocol (CBRP) is used which belongs to the class of Hierarchical Reactive Routing Protocols. The number of coordinated messages between a cluster head and its ordinary members is small. The recovery scheme has no domino effect and the failure process can rollback from its latest local consistent Checkpoint.
Attachments:
Download this file (Transitive Dependencies Tracking in Minimum.pdf)Transitive Dependencies Tracking in Minimum.pdf[Pradeep Kumar Saroj, K. Susheel Kumar, Vivek Kumar Srivastava, G.C. Nandi Robotics & AI Lab, IIIT, Allahabad, India]656 Kb
Last Updated on Thursday, 20 October 2011 10:16