By Topic

Low-cost coordinated nonblocking checkpointing in 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
$33 $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

3 Author(s)
Weigang Ni ; Dept. of Comput. Sci., Alabama Univ., Tuscaloosa, AL, USA ; S. V. Vrbsky ; S. Ray

A mobile computing system consists of mobile and stationary nodes. Checkpointing in mobile systems faces many new challenges, such as low wireless bandwidth, frequent disconnections and lack of stable storage at mobile nodes. Previously proposed checkpoint algorithms for mobile environments do not take into consideration the coordinating message overhead of the mobile participants. In this paper, we propose a new checkpoint algorithm for mobile distributed systems. Our algorithm is nonblocking and minimizes the number of checkpoint participants. We propose a new idea called proxy coordinator. By using proxy coordinator, mobile participants' coordinating message overhead is minimized to O(1), which can otherwise be as high as O(n) in other proposed algorithms.

Published in:

Computers and Communication, 2003. (ISCC 2003). Proceedings. Eighth IEEE International Symposium on

Date of Conference:

30 June-3 July 2003