By Topic

A Checkpointing and Recovery Algorithm Based on Location Distance, Handoff and Stationary Checkpoints for Mobile Computing Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Basu, S. ; Sch. of Inf. Technol. (SIT), West Bengal Univ. of Technol. (WBUT), Kolkata, India ; Palchaudhuri, S. ; Podder, S. ; Chakrabarty, M.

In this paper we present a checkpointing and failure recovery algorithm suited to mobile computing systems. A survey of mobile systems and the algorithms that are presently available is made to gather the essential knowledge about how these systems work. This includes study and analysis of existing checkpointing & recovery algorithms to identify their relative advantages & disadvantages. The existing algorithms suffers from problems like overhead involved in taking checkpoints and time to recover from a failure in an attempt to make a trade-off between efficiency and reliability. Hence we have attempted to develop an algorithm to solve these problems as far as possible. Our proposed algorithm has three subparts - a checkpointing scheme, a failure recovery scheme and authentication scheme for a mobile host.

Published in:

Advances in Recent Technologies in Communication and Computing, 2009. ARTCom '09. International Conference on

Date of Conference:

27-28 Oct. 2009