A Fault Node Recovery Algorithm to Improve the Life Span of WSNs
Main Article Content
Abstract
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.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
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.
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
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.
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.
M. Ding, D. Chen, K. Xing, and X. Cheng. Localized fault-tolerant event boundary detection in sensor networks. In INFOCOM, 2005.
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.
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.
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.
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.
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.
G. Gupta and M. Younis. Fault-Tolerant Clustering of Wireless Sensor Networks. Wireless Communications and Networking, 3:1579–1584, 2003.
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.
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.
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.
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.
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.
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.
L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4:382–401, 1982.
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.