• DocumentCode
    615985
  • Title

    Connectivity of two nodes in cognitive radio ad hoc networks

  • Author

    Jianwei Liu ; Qixun Zhang ; Yuchi Zhang ; Zhiqing Wei ; Sisi Ma

  • Author_Institution
    Key Lab. of Universal Wireless Commun., Beijing Univ. of Posts & Telecommun., Beijing, China
  • fYear
    2013
  • fDate
    7-10 April 2013
  • Firstpage
    1186
  • Lastpage
    1191
  • Abstract
    This paper analyzes the connectivity of cognitive radio networks. The connectivity of cognitive network which is more consistent with reality is redefined in our article and the closed-form formula of relation between connectivity and density of PUs, density of SUs, and transmission radius of SU is given. Specifically, the impact of correlation of adjacent nodes for connectivity of cognitive radio ad hoc network is illustrated. On the basis of Random geometric graph and probability theory, a novel method that divides connectivity of cognitive radio ad hoc network into topological connectivity and physical connectivity is proposed to derive the close-form formula. We prove theoretically that once the density of secondary users is large enough and the transmission radius is appropriate, the probability of cognitive network connectivity tends to a stable non-zero value under the condition that density of primary users is small.
  • Keywords
    ad hoc networks; cognitive radio; graph theory; probability; PU; SU; close-form formula; closed-form formula; cognitive network connectivity; cognitive radio ad hoc networks; physical connectivity; probability theory; random geometric graph; secondary users; stable non-zero value; topological connectivity; Ad hoc networks; Cognitive radio; Correlation; FCC; Interference; Routing; Ad hoc network; Cognitive radio network; Connectivity; Probability; Scaling law;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications and Networking Conference (WCNC), 2013 IEEE
  • Conference_Location
    Shanghai
  • ISSN
    1525-3511
  • Print_ISBN
    978-1-4673-5938-2
  • Electronic_ISBN
    1525-3511
  • Type

    conf

  • DOI
    10.1109/WCNC.2013.6554732
  • Filename
    6554732