Abstract
In this paper, the cross-layer design routing in cognitive radio(CR) networks is studied. We propose a colored multigraph based model for the temporarily available spectrum bands, called spectrum holes in this paper. Based on this colored multigraph model, a polynomial time algorithm with complexity O(n 2) is also proposed to develop a routing and interface assignment, where n is the number of nodes in a CR network. Our algorithm optimizes the hop number of routing, meanwhile, the adjacent hop interference (AHI) is also optimized locally.
Similar content being viewed by others
References
FCC Spectrum Policy Task Force, Report of spectrum efficiency working group, Nov. 2002. http://www.fcc.gov/sptf/files/SEWGFinalReport1.pdf.
Xin, C. (2005). A novel layered graph model for topology formation and routing in dynamic spectrum access networks. IEEE DySPAN, pp. 308–317, November 2005.
Akyildiz I.F., Lee W.Y., Vuran M.V., Mohanty S. (2006) NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey. Computer Networks 50: 2127–2159
Wang, Q., & Zheng, H. (2006). Route and spectrum selection in dynamic spectrum network. IEEE Consumer Communications and Networking Conference (CNCC), January 2006.
Zheng, H., & Peng, C. (2005). Collaboration and fairness in opportunistic spectrum access. IEEE ICC, pp. 3132–3136, May 2005.
Bondy, J. A., & Murty, S. R. (1976). Graph theory with applications. The Macmillan Press Ltd.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhou, X., Lin, L., Wang, J. et al. Cross-layer Routing Design in Cognitive Radio Networks by Colored Multigraph Model. Wireless Pers Commun 49, 123–131 (2009). https://doi.org/10.1007/s11277-008-9561-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-008-9561-7