Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

A Fault Node Recovery Algorithm to Improve the Life Span of WSNs

K.Bichya , , , ,
Assistant Professor, Telangana, India

This paper proposes a fault node recovery algorithm to enhance the lifetime of WSNs when a rate of the sensor node shuts down. This algorithm is concentrated around the assessment spread algorithm solidified with the inherited figuring. The algorithm can realize less substitution of sensor nodes and more reused guiding ways. In this proposed algorithm assembles the amount of element nodes up to 8.7 times, diminishes the rate of data adversity by pretty about 99%, and abatements the rate of essentialness usage by pretty much 32%. Sensors in WSNs are having inclination to fail, in light of the imperativeness weariness, fittings disillusionments, regular conditions etc. Inadequacy strength is one of the essential issues in WSNs. The current inadequacy safety instruments either consume immense extra essentialness to distinguish and recover from the disillusionments or need to use additional fittings and programming resources. The proposed algorithm enhances the lifetime of a sensor nodes close down and it depends on after venturing stool dispersal Algorithm joined with the inherited computation. It can achieve less supplanting of sensor nodes with more reused guiding ways moreover manufactures the amount of element nodes, diminish the rate of data disaster with diminished imperativeness use.

K.Bichya ."A Fault Node Recovery Algorithm to Improve the Life Span of WSNs". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.6, Issue 04,pp.289-297 , April - 2019, URL :,

Keywords : Genetic algorithm, hierarchal gradient diffusion, grade diffusion, wireless sensor networks, Grade diffusion algorithm.

[1] Sony Jia, Wang Bailing, Ping Xiyar, Li Jianfeng and Zhong cheng, “A Recovery Based on Minimum Distance redundant Nodes Fault Management in WSNs,” International Journal of control and automation, vol 6,No.2 April 2013. 
[2] Muhammed Asim, Hala Mokhtar and Madjid Merabti, “A self-managing fault management mechanism for wireless sensor networks,” International Journal of Wirele& Mobile Networks (IJWMN) Vol.2, No.4, November 2010 
[3]  C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed diffusion for wireless sensor networking,” IEEE/ACM Trans.Netw., vol. 11, no. 1, pp. 2–16, Feb. 2003.  
[4] D. Desovski, Y. Liu, and B. Cukic. Linear randomized voting algorithm for fault tolerant sensor fusion and the corresponding reliability model. In IEEE International Symposium on Systems Engineering, pages 153–162, October 2005. 
[5] M. Ding, D. Chen, K. Xing, and X. Cheng. Localized fault-tolerant event boundary detection in sensor networks. In INFOCOM, 2005. 
[6] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar. Next century challenges: scalable coordination in sensor networks. In MobiCom ’99: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, pages 263– 270,New York, NY, USA, 1999. ACM Press. 
[7] C.-L. Fok, G.-C. Roman, and C. Lu. Mobile Agent Middleware for Sensor Networks: an Application Case Study. In Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN), 2005. 
[8] C. Frank and K. Romer. Algorithms for Generic Role Assignment ¨in Wireless Sensor Networks. In Proceedings of the 3rd international conference on Embedded networked sensor systems, pages 230–242, 2005. 
[9] D. Ganesan, R. Govindan, S. Shenker, and D. Estrin. HighlyResilient,Energy-Efficient Multipath Routing in Wireless Sensor Networks. Mobile Computing and Communications Review, 1(2),1997. 
[10] R. Guerraoui and A. Schiper. Fault-Tolerance by Replication in Distributed Systems. In Proceedings of the 1996 Ada-Europe International Conference on Reliable Software Technologies, pages 38–57, 1996. 
[11] G. Gupta and M. Younis. Fault-Tolerant Clustering of Wireless Sensor Networks. Wireless Communications and Networking, 3:1579–1584, 2003. 
[12] I. Gupta, D. Riordan, and S. Sampalli. ClusterHead Election Using Fuzzy Logic for Wireless Sensor Networks. In Proceedings of the 3rd Annual Communication Networks and Services Research Conference, pages 255–260, 2005. 
[13] S. Harte and A. Rahman. Fault Tolerance in Sensor Networks Using Self-Diagnosing Sensor Nodes. In The IEE International Workshop on Intelligent Enviroment, pages 7–12, June 2005. 
[14] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan.Energy-Efficient Communication Protocol for Wireless Microsensor Networks. In Proceedings of the 33rd Hawaii International Conference on System Sciences, volume 8, page 8020, 2000. 
[15] C.-Y. Koo. Broadcast in Radio Networks Tolerating Byzantine Adversarial Behavior. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 
275–282, 2004.  
[16] F. Koushanfar, M. Potkonjak, and A. SangiovanniVincentell. Faul Tolerance Techniques for Wireless Ad hoc Sensor Networks. In Proceedings of IEEE Sensors, volume 2, pages 1491–1496, 2002. 
[17] B. Krishnamachari and S. Iyengar. Distributed Bayesian Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks. IEEE Transactions on Computers, 53:241–250,March 2004. 
[18] L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4:382–401, 1982. 
[19] K. Langendoen, A. Baggio, and O. Visser. Murphy loves potatoes: experiences from a pilot sensor network deployment in precision agriculture. In IPDPS 20th International Parallel and Distributed Processing Symposium, 2006.


Download :

Refbacks : Currently there are no Refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal