Evaluating Fault Tolerance Properties of Self-Stabilizing Matching Algorithms in Wireless Sensor Networks

Ileri, Can Umut; Dağdeviren, Orhan

doi:10.1109/blackseacom.2018.8433708

Cited by 1 publication

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We implement algorithms on the self-stabilizing simulator proposed in [ 47 ]. The simulator has been written with the widely used programming language Python.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…Each vertex of the given graph G(V,E) is scattered to a 2D area A . The sizes of the randomly generated WSNs vary from 50 to 300 (with 50 steps), in which the nodes are considered connected if the Euclidean distance between two of them is smaller than their transmission range r , as applied in [ 47 ]. WSNs are classified for various densities that have three, five, seven and nine average degrees.…”

Section: Performance Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

Self-Stabilizing Capacitated Vertex Cover Algorithms for Internet-of-Things-Enabled Wireless Sensor Networks

Yigit

Dağdeviren

Challenger

2022

Sensors

Self Cite

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) achieving environmental sensing are fundamental communication layer technologies in the Internet of Things. Battery-powered sensor nodes may face many problems, such as battery drain and software problems. Therefore, the utilization of self-stabilization, which is one of the fault-tolerance techniques, brings the network back to its legitimate state when the topology is changed due to node leaves. In this technique, a scheduler decides on which nodes could execute their rules regarding spatial and temporal properties. A useful graph theoretical structure is the vertex cover that can be utilized in various WSN applications such as routing, clustering, replica placement and link monitoring. A capacitated vertex cover is the generalized version of the problem which restricts the number of edges covered by a vertex by applying a capacity constraint to limit the covered edge count. In this paper, we propose two self-stabilizing capacitated vertex cover algorithms for WSNs. To the best of our knowledge, these algorithms are the first attempts in this manner. The first algorithm is stabilized under an unfair distributed scheduler (that is, the scheduler which does not grant all enabled nodes to make their moves but guarantees the global progress of the system) at most O(n2) step, where n is the count of nodes. The second algorithm assumes 2-hop (degree 2) knowledge about the network and runs under the unfair scheduler, which subsumes the synchronous and distributed fair scheduler and stabilizes itself after O(n) moves in O(n) step, which is acceptable for most WSN setups. We theoretically analyze the algorithms to provide proof of correctness and their step complexities. Moreover, we provide simulation setups by applying IRIS sensor node parameters and compare our algorithms with their counterparts. The gathered measurements from the simulations revealed that the proposed algorithms are faster than their competitors, use less energy and offer better vertex cover solutions.

show abstract

“…We implement algorithms on the self-stabilizing simulator proposed in [ 47 ]. The simulator has been written with the widely used programming language Python.…”

Section: Performance Evaluationmentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%