IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v29y2015i2d10.1007_s10878-013-9605-0.html
   My bibliography  Save this article

On the complexity of connectivity in cognitive radio networks through spectrum assignment

Author

Listed:
  • Hongyu Liang

    (IIIS, Tsinghua University)

  • Tiancheng Lou

    (Google Inc.)

  • Haisheng Tan

    (IIIS, Tsinghua University)

  • Yuexuan Wang

    (IIIS, Tsinghua University)

  • Dongxiao Yu

    (The University of Hong Kong)

Abstract

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 graph is arbitrary and the 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 where 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 the special cases in which the potential graph is complete, a tree, or a graph with bounded treewidth, we prove the problem is NP-complete and fixed-parameter tractable when parameterized by the number of channels. Exact algorithms are also derived to determine the connectability of a given cognitive radio network.

Suggested Citation

  • Hongyu Liang & Tiancheng Lou & Haisheng Tan & Yuexuan Wang & Dongxiao Yu, 2015. "On the complexity of connectivity in cognitive radio networks through spectrum assignment," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 472-487, February.
  • Handle: RePEc:spr:jcomop:v:29:y:2015:i:2:d:10.1007_s10878-013-9605-0
    DOI: 10.1007/s10878-013-9605-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9605-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-013-9605-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Shasha Li & Xueliang Li, 2012. "Note on the hardness of generalized connectivity," Journal of Combinatorial Optimization, Springer, vol. 24(3), pages 389-396, October.
    2. Hongjie Du & Weili Wu & Shan Shan & Donghyun Kim & Wonjun Lee, 2012. "Constructing weakly connected dominating set for secure clustering in distributed sensor network," Journal of Combinatorial Optimization, Springer, vol. 23(2), pages 301-307, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tian Liu & Zhao Lu & Ke Xu, 2015. "Tractable connected domination for restricted bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 247-256, January.
    2. Yan Zhang & Hongzhi Wang & Hong Gao & Jianzhong Li, 2016. "Efficient accuracy evaluation for multi-modal sensed data," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1068-1088, November.
    3. Hongwei Du & Panos Pardalos & Weili Wu & Lidong Wu, 2013. "Maximum lifetime connected coverage with two active-phase sensors," Journal of Global Optimization, Springer, vol. 56(2), pages 559-568, June.
    4. Li, Shasha & Zhao, Yan & Li, Fengwei & Gu, Ruijuan, 2019. "The generalized 3-connectivity of the Mycielskian of a graph," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 882-890.
    5. Lily Chen & Xueliang Li & Mengmeng Liu & Yaping Mao, 2017. "A solution to a conjecture on the generalized connectivity of graphs," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 275-282, January.
    6. Zhao, Shu-Li & Hao, Rong-Xia & Wei, Chao, 2022. "Internally disjoint trees in the line graph and total graph of the complete bipartite graph," Applied Mathematics and Computation, Elsevier, vol. 422(C).
    7. Li, Hengzhe & Ma, Yingbin & Yang, Weihua & Wang, Yifei, 2017. "The generalized 3-connectivity of graph products," Applied Mathematics and Computation, Elsevier, vol. 295(C), pages 77-83.
    8. Gao, Hui & Lv, Benjian & Wang, Kaishun, 2018. "Two lower bounds for generalized 3-connectivity of Cartesian product graphs," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 305-313.
    9. Li, Shasha & Tu, Jianhua & Yu, Chenyan, 2016. "The generalized 3-connectivity of star graphs and bubble-sort graphs," Applied Mathematics and Computation, Elsevier, vol. 274(C), pages 41-46.
    10. Shasha Li & Wei Li & Yongtang Shi & Haina Sun, 2017. "On minimally 2-connected graphs with generalized connectivity $$\kappa _{3}=2$$ κ 3 = 2," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 141-164, July.
    11. Li, Hengzhe & Wang, Jiajia, 2018. "The λ3-connectivity and κ3-connectivity of recursive circulants," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 750-757.
    12. Zhao, Shu-Li & Hao, Rong-Xia, 2019. "The generalized 4-connectivity of exchanged hypercubes," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 342-353.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:29:y:2015:i:2:d:10.1007_s10878-013-9605-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.