The effects of random geometric graph structure and clustering on localizability of sensor networks

Basit Öğe Kaydı
dc.contributor.authorEren, Tolga
dc.date.accessioned2020-06-25T18:22:34Z
dc.date.available2020-06-25T18:22:34Z
dc.date.issued2017
dc.departmentKırıkkale Üniversitesi
dc.descriptionEren, Tolga/0000-0001-5577-6752
dc.description.abstractGraph rigidity provides the conditions of unique localizability for cooperative localization of wireless ad hoc and sensor networks. Specifically, redundant rigidity and 3-connectivity are necessary and sufficient conditions for unique localizability of generic configurations. In this article, we introduce a graph invariant for 3-connectivity, called 3-connectivity index. Using this index along with the rigidity and redundancy indices provided in previous work, we explore the rigidity and connectivity properties of two classes of graphs, namely, random geometric graphs and clustered graphs. We have found out that, in random geometric graphs and clustered graphs, it needs significantly less effort to achieve 3-connectivity once we obtain redundant rigidity. In reconsidering the general conditions for unique localizability, the most striking finding in random geometric graphs is that it is unlikely to observe a graph, in which 3-connectivity is satisfied before the graph becomes redundantly rigid. Therefore, in random geometric graphs, it is more likely sufficient to test only 3-connectivity for unique localizability. On the contrary to random geometric graphs, our findings indicate that 3-connectivity may be satisfied before the graph becomes redundantly rigid in clustered graphs, which means that, in clustered graphs, we have to test both redundant rigidity and 3-connectivity for unique localizability.en_US
dc.identifier.citationEren T. The effects of random geometric graph structure and clustering on localizability of sensor networks. International Journal of Distributed Sensor Networks. 2017;13(12).en_US
dc.identifier.doi10.1177/1550147717748898
dc.identifier.issn1550-1477
dc.identifier.issue12en_US
dc.identifier.scopus2-s2.0-85039842476
dc.identifier.scopusqualityQ1
dc.identifier.urihttps://doi.org/10.1177/1550147717748898
dc.identifier.urihttps://hdl.handle.net/20.500.12587/6808
dc.identifier.volume13en_US
dc.identifier.wosWOS:000418648900001
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSage Publications Incen_US
dc.relation.ispartofInternational Journal Of Distributed Sensor Networks
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectUnique localizability in cooperative localization of wireless sensor networksen_US
dc.subjectunique localizability of wireless sensor networksen_US
dc.subjectunique network localizabilityen_US
dc.subjectcooperative localization of sensor networksen_US
dc.subjectgraph rigidityen_US
dc.titleThe effects of random geometric graph structure and clustering on localizability of sensor networksen_US
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
The effects of random geometric graph structure and clustering on localizability of sensor networks.pdf
Boyut:
2.3 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin/Full Text
İndir

Koleksiyon

WOS İndeksli Yayınlar Koleksiyonu
Makale Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu