DESIGN AND PERFORMANCE ANALYSIS OF COORDINATED CHECKPOINTING ALGORITHMS FOR DISTRIBUTED MOBILE SYSTEMS

Checkpointing is an efficient fault tolerance technique used in distributed systems. Mobile computing raises many new issues, such as high mobility, lack of stable storage on mobile hosts (MHs), low bandwidth of wireless channels, limited battery life and disconnections that make the traditional checkpointing protocols unsuitable for such systems. Several checkpointing algorithms have been reported in the literature. In this paper, we analyze some of existing coordinated checkpointing algorithms on the basic of blocking time, synchronization message overhead, number of processes required to checkpoint, number of useless checkpoint, piggybacked information messages onto computation messages and concurrent execution. We also proposed an efficient checkpointing algorithm to reduce the checkpointing overheads. Our checkpoint algorithm does not have any synchronization message overhead as it uses time to indirectly coordinate to create the consistent cut in distributed mobile system without increasing the number of checkpoints..