Mahsa Shafiee, A. J. Jahromi, H. Nia, Negin Sokhandan
{"title":"Ant Colony Optimization approach to interference minimizing code assignment in cognitive CDMA networks","authors":"Mahsa Shafiee, A. J. Jahromi, H. Nia, Negin Sokhandan","doi":"10.1109/SARNOF.2011.5876441","DOIUrl":null,"url":null,"abstract":"In this paper we focus on the problem of code assignment to cognitive users in a synchronous underlay network using Code Division Multiple Access (CDMA) scheme. No knowledge of the spreading codes used by the primary CDMA network is available to the cooperative secondary users a priori, other than the spreading factor. An evolutionary algorithm of relatively low complexity order is proposed based on Ant Colony Optimization (ACO) for assigning spreading codes to secondary users such that the mutual interference between existing secondary and primary users is minimized. This is accomplished at the secondary fusion center by minimizing the mean square cross-correlation between the candidate codes and the matrix which includes all independently received signals by the cooperative secondary users. Simulation results show that performance of the ACO-based method can converge to the optimal interference minimizing code assignment method while the complexity order is significantly reduced.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"34th IEEE Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2011.5876441","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper we focus on the problem of code assignment to cognitive users in a synchronous underlay network using Code Division Multiple Access (CDMA) scheme. No knowledge of the spreading codes used by the primary CDMA network is available to the cooperative secondary users a priori, other than the spreading factor. An evolutionary algorithm of relatively low complexity order is proposed based on Ant Colony Optimization (ACO) for assigning spreading codes to secondary users such that the mutual interference between existing secondary and primary users is minimized. This is accomplished at the secondary fusion center by minimizing the mean square cross-correlation between the candidate codes and the matrix which includes all independently received signals by the cooperative secondary users. Simulation results show that performance of the ACO-based method can converge to the optimal interference minimizing code assignment method while the complexity order is significantly reduced.