Performance Evaluation of Capacitated Vertex Cover Algorithms for Security Applications in Wireless Sensor Networks

Basit Öğe Kaydı
dc.authoridChallenger, Moharram/0000-0002-5436-6070
dc.authoridYIGIT, Yasin/0000-0001-5257-9382
dc.authorscopusid57202966651
dc.authorscopusid55929205600
dc.authorscopusid14007858600
dc.authorscopusid55910368200
dc.authorwosidChallenger, Moharram/E-2164-2014
dc.contributor.authorYigit, Yasin
dc.contributor.authorDagdeviren, Zuleyha Akusta
dc.contributor.authorDagdeviren, Orhan
dc.contributor.authorChallenger, Moharram
dc.date.accessioned2023-01-12T20:01:21Z
dc.date.available2023-01-12T20:01:21Z
dc.date.issued2021
dc.departmentN/A/Departmenten_US
dc.description7th International Conference on Electrical, Electronics and Information Engineering (ICEEIE) -- OCT 02, 2021 -- Malang, INDONESIAen_US
dc.description.abstractMonitoring the links of wireless sensor networks (WSNs) is a very crucial operation to detect security attacks targeted to the legitimate nodes in internet of things. To achieve this, identifying the monitor nodes (secure points) among the nodes in a WSN and assigning their links are of utmost importance. Vertex cover is a popular problem in the areas of graph theory, approximation algorithms and optimization. Vertex coveris a set of nodes where an edge (link) is incident to at least one of nodes in this set. Hence, vertex cover can be used as the set of the monitor nodes. Capacitated vertex cover, which restricts the edge count that a node can cover, is a specialized version of the vertex cover problem. It provides energy-efficient link monitoring by restricting the link count. In this study, we evaluate capacitated vertex cover algorithms in terms of the cardinality of vertex cover, running time, and approximation ratio. To the best of our knowledge, this is the first evaluation in this manner. Firstly, we theoretically analyze the capacitated vertex cover algorithms, then implement these algorithms in SageMath language that is utilized for solving linear programming and mathematical problems. From our obtained extensive measurement results, we reveal that Naor 8-approximation algorithm performs best having the lowest approximation ratio with 1.13 by selecting 1.12 times fewer vertices in the feasible execution time, although its approximation ratio is worse than the others.en_US
dc.description.sponsorshipIEEE Indonesia Sect,Univ Negeri Malang,Inovasi Bernasen_US
dc.description.sponsorshipTUBITAK [215E115]en_US
dc.description.sponsorshipWe would like to thank TUBITAK for the grant no 215E115.en_US
dc.identifier.doi10.1109/ICEEIE52663.2021.9616719
dc.identifier.endpage624en_US
dc.identifier.isbn978-1-6654-3232-0
dc.identifier.scopus2-s2.0-85123644570en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage619en_US
dc.identifier.urihttps://doi.org/10.1109/ICEEIE52663.2021.9616719
dc.identifier.urihttps://hdl.handle.net/11454/77465
dc.identifier.wosWOS:000863571700114en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIeeeen_US
dc.relation.ispartof2021 7th International Conference On Electrical, Electronics And Information Engineering (Iceeie 2021)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectWireless Sensor Networksen_US
dc.subjectInternet of Thingsen_US
dc.subjectCapacitated Vertex Coveren_US
dc.subjectLink Monitoringen_US
dc.subjectSecurityen_US
dc.subjectOptimizationen_US
dc.titlePerformance Evaluation of Capacitated Vertex Cover Algorithms for Security Applications in Wireless Sensor Networksen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu