Loading…
K-connectivity of cognitive radio networks
The fc-connectivity of cognitive radio networks is discussed in this paper. By combining asymptotic k-connectivity and percolation, we define that the cognitive radio networks are k-connected if there exists an infinite k-connected component in the secondary network. Utilizing continuum percolation...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The fc-connectivity of cognitive radio networks is discussed in this paper. By combining asymptotic k-connectivity and percolation, we define that the cognitive radio networks are k-connected if there exists an infinite k-connected component in the secondary network. Utilizing continuum percolation theory, we prove that the secondary network is k-disconnected if secondary users' density λ s |
---|---|
ISSN: | 1550-3607 1938-1883 |
DOI: | 10.1109/ICC.2012.6363648 |