• DocumentCode
    3533435
  • Title

    BAR: Bandwidth-aware opportunistic localized-routing for cognitive radio networks

  • Author

    Tung Thanh Le ; Pham Tran Ann Quang ; Soo Young Shin ; Dong-Sung Kim

  • Author_Institution
    Dept. of IT Convergence Eng., Kumoh Nat. Inst. of Technol., Gumi, South Korea
  • fYear
    2012
  • fDate
    3-7 Dec. 2012
  • Firstpage
    937
  • Lastpage
    942
  • Abstract
    In this paper, we propose the bandwidth-aware localized-routing that can sense the available spectrum bands within two-hop neighboring for choosing the highly opportunistic routes. Based on the mixed-integer linear programming (MILP) and through our proposed algorithm, we can determine the maximum of minimization bandwidth possible of links pairs through bandwidth approximation of relaxed variables, leading to reduce the computational complexity in the network. This allows selected routes corresponding to maximize bandwidths possible between CR users, which are based on behaviors of primary services, can be utilized the links pairs effectively. Simulation results show the efficiency of our proposed algorithm in CRNs.
  • Keywords
    cognitive radio; integer programming; linear programming; telecommunication network routing; BAR; bandwidth approximation; bandwidth aware opportunistic localized routing; cognitive radio networks; computational complexity; minimization bandwidth; mixed integer linear programming; opportunistic routes; Approximation algorithms; Bandwidth; Computational complexity; Interference; Routing; Simulation; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Globecom Workshops (GC Wkshps), 2012 IEEE
  • Conference_Location
    Anaheim, CA
  • Print_ISBN
    978-1-4673-4942-0
  • Electronic_ISBN
    978-1-4673-4940-6
  • Type

    conf

  • DOI
    10.1109/GLOCOMW.2012.6477702
  • Filename
    6477702