Skip to Main Content
Notice of Violation of IEEE Publication Principles
"An Adaptive Index-based Algorithm using Time-coordination in Mobile Computing"
by Yanping Gao, Changhui Deng, Yandong Che
in the Proceedings of the 2008 International Symposium on Information Processing (ISIP 08), May 2008, pp. 578 - 585
After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.
This paper contains significant portions of original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.
Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:
"On Mobile Checkpointing using Index and Time Together"
by Awadhesh Kumar Singh,
in the Proceedings of World Academy of Science, Engineering and Technology, Vol 26, December 2007 pp.144-151
Checkpointing is one of the commonly used techniques to provide fault-tolerance in distributed systems so that the system can operate even if one or more components have failed. However, mobile computing systems are constrained by low bandwidth, mobility, lack of stable storage, frequent disconnections and limited battery life. Hence, checkpointing protocols having lesser number of synchronization messages and fewer checkpoints are preferred in mobile environment. There are two different approaches, although not orthogonal, to checkpoint mobile computing systems namely, time-based and index-based. Our protocol is an integration of these two approaches, though not first of its kind. In the present exposition, an index-based checkpointing protocol has been developed, which uses time to indirectly coordinate the creation of consistent globa- l checkpoint for mobile computing systems. The proposed algorithm is non-blocking, adaptive, and does not use any control message. Compared to other contemporary checkpointing algorithms, it is computationally more efficient because it takes lesser number of checkpoints and does not need to compute dependency relationships.