{"title":"Self-Organizing Dynamic Spectrum Management for Cognitive Radio Networks","authors":"F. Khozeimeh, S. Haykin","doi":"10.1109/CNSR.2010.51","DOIUrl":null,"url":null,"abstract":"Dynamic spectrum management (DSM) is one of the key problems in the design of cognitive radio (CR) networks. It is a time-varying Dynamic spectrum management (DSM) is one of the key problems in the design of cognitive radio(CR) networks. It is a time-varying and location-dependent optimization problem, equivalent to the well-known graph-colouring problem in graph theory. This problem is known to be NP-hard and computationally challenging to solve. Accordingly, finding the exact solution for the DSM optimization problem is typically not practical. In this paper, we introduce a novel self-organizing DSM scheme, which solves the DSM problem in a decentralized manner. The use of self-organization to address the DSM problem offers several benefits: decentralization and scalability ofthe network behaviour, computational simplicity, cost-effectiveness and bandwidth conservation. In the paper, we address the underlying principles involved in the design and implementation of the self-organizing DSM as well as a software testbed for demonstrating this novel approach. Experimental results are presented to justify this new approach.and location-dependent optimization problem, equivalent to the well-known graph-colouring problem in graph theory. This problem is known to be NP-hard and computationally challenging to solve. Accordingly, finding the exact solution for the DSM optimization problem is typically not practical. In this paper, we introduce a novel self-organizing DSM scheme, which solves the DSM problem in a decentralized manner. The use of self-organization to address the DSM problem offers several benefits: decentralization and scalability ofthe network behaviour, computational simplicity, cost-effectiveness and bandwidth conservation. In the paper, we address the underlying principles involved in the design and implementation of the self-organizing DSM as well as a software testbed for demonstrating this novel approach. Experimental results are presented to justify this new approach.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 8th Annual Communication Networks and Services Research Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNSR.2010.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20
Abstract
Dynamic spectrum management (DSM) is one of the key problems in the design of cognitive radio (CR) networks. It is a time-varying Dynamic spectrum management (DSM) is one of the key problems in the design of cognitive radio(CR) networks. It is a time-varying and location-dependent optimization problem, equivalent to the well-known graph-colouring problem in graph theory. This problem is known to be NP-hard and computationally challenging to solve. Accordingly, finding the exact solution for the DSM optimization problem is typically not practical. In this paper, we introduce a novel self-organizing DSM scheme, which solves the DSM problem in a decentralized manner. The use of self-organization to address the DSM problem offers several benefits: decentralization and scalability ofthe network behaviour, computational simplicity, cost-effectiveness and bandwidth conservation. In the paper, we address the underlying principles involved in the design and implementation of the self-organizing DSM as well as a software testbed for demonstrating this novel approach. Experimental results are presented to justify this new approach.and location-dependent optimization problem, equivalent to the well-known graph-colouring problem in graph theory. This problem is known to be NP-hard and computationally challenging to solve. Accordingly, finding the exact solution for the DSM optimization problem is typically not practical. In this paper, we introduce a novel self-organizing DSM scheme, which solves the DSM problem in a decentralized manner. The use of self-organization to address the DSM problem offers several benefits: decentralization and scalability ofthe network behaviour, computational simplicity, cost-effectiveness and bandwidth conservation. In the paper, we address the underlying principles involved in the design and implementation of the self-organizing DSM as well as a software testbed for demonstrating this novel approach. Experimental results are presented to justify this new approach.