Abstract
Cognitive Radio Networks (CRNs) are considered as a promising solution to the spectrum shortage problem in wireless communication. In this paper, we address the algorithmic complexity of the connectivity problem in CRNs through spectrum assignment. We model the network of secondary users (SUs) as a potential graph, where if two nodes have an edge between them, they are connected as long as they choose a common available channel. In the general case, where the potential graph is arbitrary and SUs may have different number of antennae, we prove that it is NP-complete to determine whether the network is connectable even if there are only two channels. For the special case when the number of channels is constant and all the SUs have the same number of antennae, which is more than one but less than the number of channels, the problem is also NP-complete. For special cases that the potential graph is complete or a tree, we prove the problem is NP-complete and fixed-parameter tractable (FPT) when parameterized by the number of channels. Furthermore, exact algorithms are derived to determine the connectivity.
This work was supported in part by the National Basic Research Program of China Grant 2011CBA00300, 2011CBA00302, the National Natural Science Foundation of China Grant 61073174, 61033001, 61061130540, and the Hi-Tech research and Development Program of China Grant 2006AA10Z216.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bahl, P., Chandra, R., Moscibroda, T., Murty, R., Welsh, M.: White space networking with Wi-Fi like connectivity. In: ACM SIGCOMM (2009)
Cayley, A.: A theorem on trees. Quarterly Journal on Pure and Applied Mathematics 23, 376–378 (1889)
Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.: Gossiping in a Multi-channel Radio Network. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 208–222. Springer, Heidelberg (2007)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1998)
Gabow, H.N., Myers, E.W.: Finding all spanning trees of directed and undirected graphs. SIAM J. Comput. 7(3), 280–287 (1978)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)
Hopcroft, J.E., Karp, R.M.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)
Lu, D., Huang, X., Li, P., Fan, J.: Connectivity of large-scale cognitive radio ad hoc networks. In: IEEE INFOCOM (2012)
Ren, W., Zhao, Q., Swami, A.: Connectivity of cognitive radio networks: Proximity vs. opportunity. In: ACM CoRoNet (2009)
Ren, W., Zhao, Q., Swami, A.: Power control in cognitive radio networks: How to cross a multi-lane highway. IEEE JSAC 27(7), 1283–1296 (2009)
Shukla, A.B.: A short proof of Cayley’s tree formula. arXiv:0908.2324v2
Wang, B., Liu, K.J.R.: Advances in cognitive radio networks: A survey. IEEE J. Selected Topics in Signal Processing 5(1), 5–23 (2011)
Xu, C., Huang, J.: Spatial spectrum access game: nash equilibria and distributed learning. In: ACM MobiHoc (2012)
Yuan, Y., Bahl, P., Chandra, R., Moscibroda, T., Wu, Y.: Allocating dynamic time-spectrum blocks in cognitive radio networks. In: ACM MobiCom (2007)
Zhou, X., Gandhi, S., Suri, S., Zheng, H.: ebay in the sky: Strategyproof wireless spectrum auctions. In: ACM MobiCom (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liang, H., Lou, T., Tan, H., Wang, A.Y., Yu, D. (2013). Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignment. In: Bar-Noy, A., Halldórsson, M.M. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2012. Lecture Notes in Computer Science, vol 7718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36092-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-36092-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36091-6
Online ISBN: 978-3-642-36092-3
eBook Packages: Computer ScienceComputer Science (R0)