• Home
  • About
  • Policies
  • Contact
    • Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
Advanced Search
View Item 
  •   Home
  • Mühendislik Fakültesi / Faculty of Engineering
  • Bilgisayar Mühendisliği / Computer Engineering
  • Makaleler / Articles
  • View Item
  •   Home
  • Mühendislik Fakültesi / Faculty of Engineering
  • Bilgisayar Mühendisliği / Computer Engineering
  • Makaleler / Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

More Benefits of Adding Sparse Random Links to Wireless Networks: Yet Another Case for Hybrid Networks

Thumbnail
View/Open
More Benefits of Adding Sparse Random Links to Wireless Networks Yet Another Case for Hybrid Networks.pdf (3.654Mb)
Author
Erçal, Güneş
Type
Article
Date
2012
Language
en_US
Metadata
Show full item record
Abstract
We theoretically and experimentally analyze the process of adding sparse random links to random wireless networks modeled as a random geometric graph. While this process has been previously proposed, we are the first to prove theoretical bounds on the improvement to the graph diameter and random walk properties of the resulting graph as a function of the frequency of wires used, where this frequency is diminishingly small. In particular, given a parameter k controlling sparsity, any node has a probability of 1/k(2)nr(2) for being a wired link station. Amongst the wired link stations, we consider creating a random 3-regular graph superimposed upon the random wireless network to create model G(1), and alternatively we consider a sparser model G(2) as well, which is a random 1-out graph of the wired links superimposed upon the random wireless network. We prove that the diameter for G(1) is O(k + log(n)) with high probability and the diameter for G(2) is O(k log(n)) with high probability, both of which exponentially improve the Theta(root n/logn) diameter of the random geometric graph around the connectivity threshold, thus also inducing small-world characteristics as the high clustering remains unchanged. Further, we theoretically demonstrate that as long as k is polylogarithmic in the network size, G(1) has rapidly mixing random walks with high probability, which also exponentially improves upon the mixing time of the purely wireless random geometric graph, which yields direct improvement to the performance of distributed gossip algorithms as well as normalized edge connectivity. Finally, we experimentally confirm that the algebraic connectivities of both G(1) and G(2) exhibit significant asymptotic improvement over that of the underlying random geometric graph. These results further motivate future hybrid networks and advances in the use of directional antennas.
Subject
eigenvalues
graphs
özdeğerler
grafikler
URI
http://hdl.handle.net/11413/1701
Collections
  • Makaleler / Articles [100]
  • WoS Publications [1016]

İstanbul Kültür University

Hakkında |Politika | Kütüphane | İletişim | Send Feedback | Admin

Istanbul Kültür University, Ataköy Campus E5 Karayolu Üzeri Bakırköy 34158, İstanbul / TURKEY
Copyright © İstanbul Kültür University

Creative Commons Lisansı
IKU Institutional Repository, Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.

Designed by  UNIREPOS

İKU Kütüphane


Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsTypeLanguageBy PublisherRightsPubmedScopusWoSThis CollectionBy Issue DateAuthorsTitlesSubjectsTypeLanguageBy PublisherRightsPubmedScopusWoS

My Account

Login

İstanbul Kültür University

Hakkında |Politika | Kütüphane | İletişim | Send Feedback | Admin

Istanbul Kültür University, Ataköy Campus E5 Karayolu Üzeri Bakırköy 34158, İstanbul / TURKEY
Copyright © İstanbul Kültür University

Creative Commons Lisansı
IKU Institutional Repository, Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.

Designed by  UNIREPOS