• DocumentCode
    3523739
  • Title

    IMS: Interference minimization scheme for cognitive radio networks using Hungarian algorithm

  • Author

    Aslam, Sana ; Shahid, A. ; Kyung-Geun Lee

  • Author_Institution
    Dept. of Inf. & Commun. Eng., Sejong Univ., Seoul, South Korea
  • fYear
    2012
  • fDate
    12-14 Dec. 2012
  • Firstpage
    17
  • Lastpage
    21
  • Abstract
    The cognitive radio (CR) seems to be an optimal transmission system which can achieve higher throughput efficiency by exploiting the best areas of the radio spectrum. However, the CR should obey the interference limit in order to protect the transmission of the primary radios (PRs). In this paper, we introduce an innovative channel allocation scheme that minimizes the interference caused by the transmission of the cognitive radio (CR) on the on-going communication of the primary radio (PR). We implement the channel allocation problem as an assignment problem and employ the Hungarian algorithm for its optimal solution under the objective of minimizing the overall interference to the users of the primary networks. Simulation results show that our scheme out-performs the existing scheme in minimizing the overall interference value. Moreover, we show the variations in the overall interference value based on the availability of channels and distance between the PRs and CRs.
  • Keywords
    channel allocation; cognitive radio; interference suppression; radio spectrum management; Hungarian algorithm; IMS; assignment problem; channel allocation; cognitive radio network; interference minimization; optimal transmission system; primary radio; radio spectrum; Bipartite graph; Channel allocation; Cognitive radio; Interference; Resource management; Sensors; Simulation; channel allocation Hungarian algorithm; cognitive radio; primary radio;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Future Generation Communication Technology (FGCT), 2012 International Conference on
  • Conference_Location
    London
  • Print_ISBN
    978-1-4673-5859-0
  • Type

    conf

  • DOI
    10.1109/FGCT.2012.6476564
  • Filename
    6476564