Breadth-first search tree integrated vertex cover algorithms for link monitoring and routing in wireless sensor networks

Basit Öğe Kaydı
dc.authoridYIGIT, Yasin/0000-0001-5257-9382
dc.authoridDagdeviren, Orhan/0000-0001-8789-5086
dc.authorscopusid57202966651
dc.authorscopusid55750051600
dc.authorscopusid14007858600
dc.authorwosidYIGIT, Yasin/AAN-4318-2020
dc.contributor.authorYigit, Yasin
dc.contributor.authorAkram, Vahid Khalilpour
dc.contributor.authorDagdeviren, Orhan
dc.date.accessioned2023-01-12T19:54:37Z
dc.date.available2023-01-12T19:54:37Z
dc.date.issued2021
dc.departmentN/A/Departmenten_US
dc.description.abstractWireless sensor networks (WSNs) are infrastructureless networks of tiny sensor motes which can sense from the environment and can transmit the sensed data through wireless communication. Generally, the transmission ranges of sensor nodes are limited and obstacles are present in the sensing area, so multi-hop communication by utilizing routing protocols is of utmost importance. Since the wireless transmission is prone to vulnerabilities such as eavesdropping and spoofing, monitoring the network traffic by secure points is a critical mission. In this paper, we propose breadth-first search tree (BFST) based vertex cover (VC) algorithms for routing and link monitoring in WSNs. BFST provides a shortest hop routing tree for WSNs and VC is a set of nodes for covering edges (communication links) of the network where it perfectly fits for network traffic monitoring. Unlike most existing algorithms which find minimal VC in a separate procedure, the proposed algorithms construct VC during the BFST establishment phase which leads to lower energy consumption for routing and link monitoring operations. We analyze the correctness proof of the algorithms along with the time, message, space, and bit complexities. We implement the proposed algorithms with their counterparts on a testbed of IRIS motes to evaluate their performances. We find through extensive evaluations from the IRIS testbed experiments and TinyOS simulations that the proposed algorithms find smaller VC sets with up to 3.1 times lower energy consumption than the existing distributed algorithms.en_US
dc.description.sponsorshipTUBITAK (Scientific and Technical Research Council of Turkey) [215E115]en_US
dc.description.sponsorshipThe authors would like to thank TUBITAK (Scientific and Technical Research Council of Turkey) for its support of project number 215E115.en_US
dc.identifier.doi10.1016/j.comnet.2021.108144
dc.identifier.issn1389-1286
dc.identifier.issn1872-7069
dc.identifier.issn1389-1286en_US
dc.identifier.issn1872-7069en_US
dc.identifier.scopus2-s2.0-85105448074en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1016/j.comnet.2021.108144
dc.identifier.urihttps://hdl.handle.net/11454/76483
dc.identifier.volume194en_US
dc.identifier.wosWOS:000659129400003en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofComputer Networksen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectWireless sensor networksen_US
dc.subjectLink monitoringen_US
dc.subjectVertex coveren_US
dc.subjectBreadth-first search treeen_US
dc.subjectDistributed algorithmsen_US
dc.subjectEnergy efficiencyen_US
dc.titleBreadth-first search tree integrated vertex cover algorithms for link monitoring and routing in wireless sensor networksen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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