Summary: We propose a minimum-process coordinated checkpointing algorithm for deterministic mobile distributed systems, where no useless checkpoints are taken, no blocking of processes takes place, and anti-messages of very few messages are logged during checkpointing. We also address the related issues like: failures during checkpointing disconnections, concurrent initiations of the algorithm and maintaining exact dependencies among processes.