Increasing life-time of wireless sensor network using energy-efficient and fault tolerance algorithms

Energy-efficiency ofwireless sensor networks (WSN) becomes an essential issue in the research area. This is because of the energy constraints in WSN that depend on a battery, which is difficult to replace or recharge; therefore, multiple clustering algorithms were proposed to achieve efficiency in u...

Full description

Saved in:
Bibliographic Details
Published inIndonesian Journal of Electrical Engineering and Computer Science Vol. 23; no. 2; p. 1093
Main Authors Sabah, Sama Hussam, Croock, Muayad Sadik
Format Journal Article
LanguageEnglish
Published 01.08.2021
Online AccessGet full text
ISSN2502-4752
2502-4760
2502-4760
DOI10.11591/ijeecs.v23.i2.pp1093-1099

Cover

More Information
Summary:Energy-efficiency ofwireless sensor networks (WSN) becomes an essential issue in the research area. This is because of the energy constraints in WSN that depend on a battery, which is difficult to replace or recharge; therefore, multiple clustering algorithms were proposed to achieve efficiency in using the available energy as much as possible. This paper proposed energy-efficient and fault-tolerance algorithms that enhance thelow energy adaptive clustering hierarchy (LEACH) protocol by three algorithms. The first focuses on selecting the best cluster head and the second focuses on minimizing the required nodes within the same cluster. Simultaneously, the third fault tolerance algorithm uses software engineering techniques like sleep schedules to increase network lifetime as much as possible. The testing results of the proposed algorithms prove the claim of enhancing the lifetime of WSN. In order to check improvement of lifetime of WSN we have compered the results of the proposed algorithms with standered algorthim. The results show prove the claim of enhancing the life-time of WSN, where the total lifetime of WSN rise from about 550 rounds to reach 4100 when utilized self-checking process and rised up to 5200 after enhance minimum distans.
ISSN:2502-4752
2502-4760
2502-4760
DOI:10.11591/ijeecs.v23.i2.pp1093-1099