A mobile computing system is a distributed system in which the hosts could move from one location to another while maintaining connectivity with other hosts. Mobile hosts have small memory, a power limitation, and communicate over low bandwidth wireless communication links. Mobile hosts have also mobility, disconnection, vulurability of disk storage. It is known that synchronous checkpointing is not suitable for mobile systems since it involves high communication cost over a low bandwidth network. Neither, Asynchronous checkpointing is not suitable because multiple checkpoints need to be stored in the stable storage and also some or all of the checkpoints taken may be useless for constructing consistent global checkpoints. In this thesis, we propose efficient checkpointing and recovery algorithm for mobile computing systems. A MSS(mobile support station), by virtue of being a static host, has access to stable storage(disk) and is also a more powerful machine in terms of computing and communication capacity. AP(application program) is executing in a MH(mobile host). AP only logs its local state, send it to local MSS. MSS maintains sended messages and local states information in stable storage about its local APs. Each MSS coordinates with CMS(control message for synchronization) for local checkpointing and global checkpointing. Hence wireless communication connection between MH and MSS is reduced, the volume of dada that transfer from AP to MSS. We present a reclamation method to obtain storage space for MSS. Recovery algorithm restore all the processes to a consistent global state when a process fails.