Download now Free registration required
The k-connectivity of cognitive radio networks is discussed in this paper. By combining asymptotic k-connectivity and percolation, the authors define that the cognitive radio networks are k-connected if there exists an infinite k-connected component in the secondary network. Connectivity in large scale wireless ad hoc networks finds its application in many areas such as sensor networks, and has been widely studied for nodes with homogeneous distribution. Two different approaches are used in these studies: asymptotic connectivity and percolation. The asymptotic connectivity means that all nodes in the network are connected with high probability (whp) when the number of nodes goes to infinity.
- Format: PDF
- Size: 262.51 KB