Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/8151
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAkram, Vahid Khalilpour-
dc.contributor.authorDagdeviren, Orhan-
dc.contributor.authorTavlı, Bülent-
dc.date.accessioned2022-01-15T12:58:47Z-
dc.date.available2022-01-15T12:58:47Z-
dc.date.issued2022-
dc.identifier.issn1063-6692-
dc.identifier.issn1558-2566-
dc.identifier.urihttps://doi.org/10.1109/TNET.2021.3104356-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/8151-
dc.description.abstractMobile sensor networks (MSNs) have emerged from the interaction between mobile robotics and wireless sensor networks. MSNs can be deployed in harsh environments, where failures in some nodes can partition MSNs into disconnected network segments or reduce the coverage area. A k-connected network can tolerate at least k-1 arbitrary node failures without losing its connectivity. In this study, we present a coverage-aware distributed k-connectivity maintenance (restoration) algorithm that generates minimum-cost movements of active nodes after a node failure to preserve a persistent k value subject to a coverage conservation criterion. The algorithm accepts a coverage conservation ratio (as a trade-off parameter between coverage and movements) and facilitates coverage with the generated movements according to this value. Extensive simulations and testbed experiments reveal that the proposed algorithm restores k-connectivity more efficiently than the existing restoration algorithms. Furthermore, our algorithm can be utilized to maintain k-connectivity without sacrificing the coverage, significantly.en_US
dc.description.sponsorshipTUBITAK (The Scientific and Technological Research Council of Turkey)Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [113E470]en_US
dc.description.sponsorshipThis work was supported by TUBITAK (The Scientific and Technological Research Council of Turkey) under Project 113E470.en_US
dc.language.isoenen_US
dc.publisherIeee-Inst Electrical Electronics Engineers Incen_US
dc.relation.ispartofIeee-Acm Transactions on Networkingen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectTopologyen_US
dc.subjectRobot sensing systemsen_US
dc.subjectMaintenance engineeringen_US
dc.subjectNetwork topologyen_US
dc.subjectUpper bounden_US
dc.subjectTime complexityen_US
dc.subjectPartitioning algorithmsen_US
dc.subjectMobile sensor networksen_US
dc.subjectk-connectivityen_US
dc.subjectdistributed algorithmen_US
dc.subjectconnectivity maintenanceen_US
dc.subjectrestorationen_US
dc.subjectreliabilityen_US
dc.subjectfault toleranceen_US
dc.subjectRestorationen_US
dc.subjectDeploymenten_US
dc.titleA Coverage-Aware Distributed K-Connectivity Maintenance Algorithm for Arbitrarily Large K in Mobile Sensor Networksen_US
dc.typeArticleen_US
dc.departmentFaculties, Faculty of Engineering, Department of Electrical and Electronics Engineeringen_US
dc.departmentFakülteler, Mühendislik Fakültesi, Elektrik ve Elektronik Mühendisliği Bölümütr_TR
dc.identifier.wosWOS:000732095600001en_US
dc.identifier.scopus2-s2.0-85113309353en_US
dc.institutionauthorTavlı, Bülent-
dc.identifier.doi10.1109/TNET.2021.3104356-
dc.authorscopusid55750051600-
dc.authorscopusid14007858600-
dc.authorscopusid55955366400-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ1-
item.openairetypeArticle-
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
Appears in Collections:Elektrik ve Elektronik Mühendisliği Bölümü / Department of Electrical & Electronics Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show simple item record



CORE Recommender

WEB OF SCIENCETM
Citations

15
checked on Dec 21, 2024

Page view(s)

80
checked on Dec 16, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.