A Comprehensive review of self-stabilization algorithm and its applications in wireless networks

Distributed computing is a field of the vast computer science that deals with distributed systems. These systems have a significant role in computing with high efficiency. One of the important cases with a great role in distributed systems is the self-stabilizing concept. One of the new algorithms with a critical role in engineering and computer science is self-stabilization algorithm. This algorithm is known as a lightweight and convenient property relative to other classic solutions and methods of fault tolerance in obtaining fault tolerance (FT). Moreover, in terms of time and space, the art of this algorithm is that it needs less time and space. These features have made the self-stabilization algorithm highly promising for use in distributed systems that are equipped with low computing and low memory processes. Wireless sensor networks (WSNs) include many sensor nodes that can receive, collect, process and transfer data. These networks are widely used in industrial, military, and civilian uses like industrial facility management, power / engine sources monitoring, target routing, care, healthcare management, and geographic information analysis, and so on. The paper, comprehensively, discussed this algorithm and its uses in wireless networks

Keywords:

Self-stabilization algorithm , FT , convergence , wireless networks , self-stabilizing time , distributed systems