Connectivity Analysis of Cognitive Radio Ad-Hoc Networks with Multi-Pair Primary Networks

In this paper, we study the connectivity of cognitive radio ad-hoc networks (CRAHNs) where primary users (PUs) and secondary users (SUs) are randomly distributed in a given area following a homogeneous Poisson process. Moreover, for the sake of more realistic CRAHNs, contrary to previous works in th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Sensors (Basel, Switzerland) Switzerland), 2019-01, Vol.19 (3), p.565
Hauptverfasser: Dung, Le The, Choi, Seong-Gon
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we study the connectivity of cognitive radio ad-hoc networks (CRAHNs) where primary users (PUs) and secondary users (SUs) are randomly distributed in a given area following a homogeneous Poisson process. Moreover, for the sake of more realistic CRAHNs, contrary to previous works in the literature, we consider the case that primary network is comprised of multiple communication pairs which are spatial-temporal distributed in the network area. We also take into consideration the differences in transmission range and interference range of both PUs and SUs. The connectivity of such CRAHN is studied from three viewpoints. First, we mathematically analyze the probability of isolated secondary transmitter and secondary receiver. Second, we derive the approximation expression of the link probability between two adjacent SUs. Third, we investigate the path connectivity between two arbitrary SUs by using the simulation analysis approach. The correctness of our mathematical expressions is confirmed by comparing analytical results with simulation results. The results in this paper provide insights into how multiple communication pairs in primary network affect the connectivity of secondary network, which can be useful guidelines for the design of CRAHNs.
ISSN:1424-8220
1424-8220
DOI:10.3390/s19030565