The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
On the Complexity of Connectivity in Cognitive Radio Networks Through Spectrum Assignment
[article]
2013
arXiv
pre-print
Cognitive Radio Networks (CRNs) are considered as a promising solution to the spectrum shortage problem in wireless communication. In this paper, we initiate the first systematic study on the algorithmic complexity of the connectivity problem in CRNs through spectrum assignments. We model the network of secondary users (SUs) as a potential graph, where two nodes having an edge between them are connected as long as they choose a common available channel. In the general case, where the potential
arXiv:1301.0995v1
fatcat:obz7xuzpmfguroegwd36wqy75q