{"title":"Spectrum assignment in infrastructure based cognitive radio networks","authors":"Zhang Tao, Bin Wang, Zhiqiang Wu","doi":"10.1109/NAECON.2009.5426650","DOIUrl":null,"url":null,"abstract":"Spectrum assignment is an important research problem in cognitive radio networks. Different from the conventional spectrum assignment algorithms which are mainly designed for ad hoc networks, in this paper, a new spectrum assignment algorithm for infrastructure based cognitive radio networks is proposed. This algorithm aims at maximizing the average bandwidth per flow, and avoiding the spectrum waste by idle secondary basestations. We have performed packet-level simulation studies to compare the performance of our proposed algorithm with two graph-coloring based algorithms. The simulation results show that our algorithm can dramatically improve network throughput, decrease the average packet delay, and average packet drop ratio.","PeriodicalId":305765,"journal":{"name":"Proceedings of the IEEE 2009 National Aerospace & Electronics Conference (NAECON)","volume":"175 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the IEEE 2009 National Aerospace & Electronics Conference (NAECON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAECON.2009.5426650","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14
Abstract
Spectrum assignment is an important research problem in cognitive radio networks. Different from the conventional spectrum assignment algorithms which are mainly designed for ad hoc networks, in this paper, a new spectrum assignment algorithm for infrastructure based cognitive radio networks is proposed. This algorithm aims at maximizing the average bandwidth per flow, and avoiding the spectrum waste by idle secondary basestations. We have performed packet-level simulation studies to compare the performance of our proposed algorithm with two graph-coloring based algorithms. The simulation results show that our algorithm can dramatically improve network throughput, decrease the average packet delay, and average packet drop ratio.