A handoff based checkpointing and failure recovery scheme in mobile computing system
Suparna Biswas, Sarmistha Neogy · 2011
Mobile hosts are failure prone. An efficient checkpointing technique and a failure recovery scheme together can make a mobile computing system fault-tolerant. For efficient recovery, information of a mobile host should be kept in an organized manner. Efficiency of a recovery scheme can be measured in terms of time and cost. Mobile hosts move randomly causing handoff. Information of a single mobile host gets scattered over a number of mobile support stations that can be at closer or further distance. Recovery time and cost primarily depend on number of mobile support stations from which information to be collected as well as distance among them. Larger the distance, longer the time for communication through message passing. Number of mobile support stations from which information to be recovered and distance among them can be delimited by keeping a handoff threshold value and a distance threshold value respectively in each mobile host. Recovery scheme proposed here applies both the measures. Our work optimizes both failure-free and failure-recovery operation costs.