Fault Tolerance Performance of Self-stabilizing Independent Set Algorithms on a Covering-Based Problem: The Case of Link Monitoring in WSNs
dc.contributor.author | Yigit, Yasin | |
dc.contributor.author | Ileri, Can Umut | |
dc.contributor.author | Dagdeviren, Orhan | |
dc.date.accessioned | 2019-10-27T10:44:16Z | |
dc.date.available | 2019-10-27T10:44:16Z | |
dc.date.issued | 2018 | |
dc.department | Ege Üniversitesi | en_US |
dc.description | 5th International Conference on Electrical and Electronics Engineering (ICEEE) -- MAY 03-05, 2018 -- Istanbul, TURKEY | en_US |
dc.description.abstract | Vertex cover (VC) is one of the most fundamental graph-theoretical problems and has been widely used in wireless sensor networks (WSNs), particularly for the link monitoring problem. It is well known that a solution to the independent set problem (IS), which is another fundamental graph-theoretical problem, is complement of a VC. Self-stabilization is an important concept for designing fault tolerance systems. There have been many self-stabilizing VC and IS algorithms in the field. Even though a self-stabilizing IS algorithm can provide VC solutions, it does not give a theoretical guarantee on approximation ratio. In this work, we focus on practical fault tolerance performance of self-stabilizing IS algorithms in case of a vertex cover problem, particularly link monitoring in WSNs. We implement all existing self-stabilizing VC and IS algorithms and make simulations assuming a WSN in which nodes run synchronously. Results show that self-stabilizing IS algorithms in general are able to find better covers than VC algorithms, as they provide roughly 15% smaller solution sets. Furthermore, IS algorithms that run under distributed scheduler converges to a desired configuration in considerably less number of rounds than VC algorithms. | en_US |
dc.description.sponsorship | IEEE | en_US |
dc.description.sponsorship | TUBITAK (Scientific and Technical Research Council of Turkey)Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [215E115, BIDEB-1001] | en_US |
dc.description.sponsorship | This study was supported by TUBITAK (Scientific and Technical Research Council of Turkey) within the scope of 215E115 numbered project grant and the Ph.D. research grant (BIDEB-1001). | en_US |
dc.identifier.endpage | 427 | en_US |
dc.identifier.isbn | 978-1-5386-6392-9 | |
dc.identifier.startpage | 423 | en_US |
dc.identifier.uri | https://hdl.handle.net/11454/30940 | |
dc.identifier.wos | WOS:000454450100085 | en_US |
dc.identifier.wosquality | N/A | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.language.iso | en | en_US |
dc.publisher | Ieee | en_US |
dc.relation.ispartof | 2018 5Th International Conference on Electrical and Electronic Engineering (Iceee) | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | self-stabilization | en_US |
dc.subject | fault tolerance | en_US |
dc.subject | wireless sensor networks | en_US |
dc.subject | vertex cover | en_US |
dc.subject | independent set | en_US |
dc.subject | distributed algorithms | en_US |
dc.subject | link monitoring | en_US |
dc.title | Fault Tolerance Performance of Self-stabilizing Independent Set Algorithms on a Covering-Based Problem: The Case of Link Monitoring in WSNs | en_US |
dc.type | Conference Object | en_US |