Mobile nodes are failure prone. An efficient check pointing technique and a failure recovery scheme together can make a Wireless Sensor Network 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 nodes 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 Genetic Algorithm 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.

Checkpoint, recovery, fault tolerance, genetic algorithm,etc

[1] Shilpa Gambhir, Er. Sonia Goyal, “Reliable task allocation in distributed mobile computing system with random node movement: Replication and Load sharing Approach”, IJARECE, vol. 3, pp. 659-663, 2014.
[2] S.E. George, I. Chen and Y.Jin , “Movement-Based Checkpointing and Logging for Recovery in Mobile Computing Systems”, June 2006.
[3] C. Huang, C. Lee, Y Yu and C Lai, “Location-aware multimedia proxy handoff over the IPv6 mobile network environment”, Journal of Systems and Software, Volume 79 , Issue 8 (August 2006) ,Pages: 1037 - 1050 ,ISSN:0164-1212
[4] R.E. Ahmed and A Khaliq, “On the Role of Base Station In Fault-Tolerant Mobile Networks”, CCECE 2004- CCGEI 2004.
[5] TY Jiang, QH Li, “An efficient recovery scheme for mobile computing system “.International Conference on Machine Learning and Cybernetics, 2003, 2-5 Nov. 2003, page(s): 2031 – 2036, Vol.4, Print ISBN: 0-7803-8131-9
[6] TYT Juang and YS Chen, “An Efficient Rollback Recovery Algorithm for Distributed Mobile Computing System”, 19th IEEE Int`l. Peformance, Computing, and Communications Conference (IPCCC-2000), Phoenix, Arizona, USA; Feb. 20~22, 2000.
[7] E .N Elnozahy, L . Alvisi., W. David,J. David “A Survey of Rollback- Recovery Protocols in Message-Passing Systems”, ACM Computing Surveys (CSUR), v.34 n.3, p.375-408, September 2002
[8] T. Park and H.Y. Yeom, ”An asynchronous recovery scheme based on optimistic message logging for mobile computing systems,” In Proc. of the 20th Int’l Conf. on Distributed Computing Systems, pp. 436-443, Apr. 2000.
[9] T.Park, N.Woo, and H.Y.Yeon , “A Region- based recovery Information Management Scheme for the Fault Tolerant Mobile Computing Systems ” Symp. on Fault Tolerant Computing Systems, pp. 294–301, Jun. 1999.
[10] C.Guohong and M. Singhal, “On Coordinated Checkpointing in Distributed Systems”, IEEE Transactions on Parallel and Distributed Systems ,Volume 9, Issue 12 (December 1998) ,Pages: 1213 – 1225, ISSN:1045-9219
[11] R. Prakash and M. Singhal, “Low-Cost Checkpointing and Failure Recovery in Mobile Computing Systems”,IEEE Transactions on Parallel and Distributed Systems, Volume 7 , Issue 10 (October 1996), Pages: 1035 - 1048 , ISSN:1045- 9219
[12] R. Koo and S. Touegt, “Checkpointing and Rollback-Recovery for Distributed Systems”, ACM Fall joint computer conference, p.1150-1158, 1996
[13] M. Satyanarayanan, “Fundamental Challenges in Mobile Computing”,PODC 1995
[14] D.K. Pradhan, P. Krishna, and N.H. Vaiday, “Recoverable mobile environment: Design and tradeoff analysis,” In Proc. of the 26th Int’l Symp. On Fault Tolerant Computing Systems, pp. 16–25, Jun.1996