Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/10770
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dagdeviren, Z.A. | - |
dc.contributor.author | Akram, V.K. | - |
dc.contributor.author | Dagdeviren, O. | - |
dc.contributor.author | Tavli, B. | - |
dc.contributor.author | Yanikomeroglu, H. | - |
dc.date.accessioned | 2023-10-24T07:03:35Z | - |
dc.date.available | 2023-10-24T07:03:35Z | - |
dc.date.issued | 2023 | - |
dc.identifier.issn | 0890-8044 | - |
dc.identifier.uri | https://doi.org/10.1109/MNET.124.2100767 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/10770 | - |
dc.description.abstract | $k$-connectivity is a strong notion of robust connectivity. Indeed, in a $k$-connected network, each node has k disjoint paths to all the other nodes in the network. Therefore, even in the case of $\mathrm{k}-1$ node/link failure(s), a k-connected wireless sensor network (WSN) remains connected because each node still has, at least, one path to the rest of the surviving nodes. Networks with higher $k$ values are, typically, more reliable and fault tolerant than those with lower k values. In this study, we present a systematic and dedicated overview of WSN k-connectivity problem. We, first, outline the k-connectivity detection problem (i.e., determining the k value of a network). Second, we explore the k-connected network deployment problem. Third, we dissect the restoration problem that addresses the rehabilitation of a deteriorated network to restore its original k value. Built upon the provided foundations, we identify and discuss a rich set of important and promising open research problems along with pointers to possible solution approaches. © 1986-2012 IEEE. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
dc.relation.ispartof | IEEE Network | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Fault tolerance | en_US |
dc.subject | Restoration | en_US |
dc.subject | Sensor nodes | en_US |
dc.subject | Complexity theory | en_US |
dc.subject | Connected networks | en_US |
dc.subject | Fault- tolerant systems | en_US |
dc.subject | Future research directions | en_US |
dc.subject | K-connected | en_US |
dc.subject | K-connectivity | en_US |
dc.subject | k-Value | en_US |
dc.subject | K-values | en_US |
dc.subject | Resilience | en_US |
dc.subject | Time complexity | en_US |
dc.subject | Complex networks | en_US |
dc.title | K-Connectivity in Wireless Sensor Networks: Overview and Future Research Directions | en_US |
dc.type | Article | en_US |
dc.department | TOBB ETÜ | en_US |
dc.identifier.volume | 37 | en_US |
dc.identifier.issue | 3 | en_US |
dc.identifier.startpage | 140 | en_US |
dc.identifier.endpage | 145 | en_US |
dc.identifier.wos | WOS:001088198200028 | en_US |
dc.identifier.scopus | 2-s2.0-85141546463 | en_US |
dc.institutionauthor | … | - |
dc.identifier.doi | 10.1109/MNET.124.2100767 | - |
dc.authorscopusid | 55929205600 | - |
dc.authorscopusid | 55750051600 | - |
dc.authorscopusid | 14007858600 | - |
dc.authorscopusid | 55955366400 | - |
dc.authorscopusid | 6603917247 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q1 | - |
item.openairetype | Article | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
1
checked on Dec 21, 2024
WEB OF SCIENCETM
Citations
7
checked on Aug 31, 2024
Page view(s)
34
checked on Dec 16, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.