The Design and Performance of a Checkpointing Scheme for Mobile Ad Hoc Networks

The mobile ad hoc network architecture consists of a set of mobile hosts that can communicate with each other without the assistance of a base station. This has brought a revolution in mobile computing environment as well as several challenges. Fault-tolerance is an important design issue in building a reliable mobile computing system. This paper considers checkpointing recovery services for a mobile computing system based on the mobile ad-hoc network environment. In this paper we propose a new minimum process checkpointing scheme in ad hoc networks for the Cluster Based Routing Protocol (CBRP) which belongs to a class of Hierarchical Reactive routing protocols. The protocol proposed by us is non-blocking coordinated checkpointing algorithm suitable for ad hoc environments. It produces a consistent set of checkpoints; the algorithm makes sure that only minimum number of nodes in the cluster are required to take checkpoints; it uses very few control messages. Performance analysis shows that our algorithm outperforms the existing related works and is a novel idea in the field.