{"title":"基于完美感知的多通道机会频谱接入网中的信道选择","authors":"Xin Liu, B. Krishnamachari, Hua Liu","doi":"10.1109/DYSPAN.2010.5457885","DOIUrl":null,"url":null,"abstract":"We study optimal transmission strategies in multi-channel cognitive radio networks where one secondary user (SU) opportunistically accesses multiple orthogonal channels that are owned and utilized by primary users (PU). In dynamic spectrum access networks, the protection of PU's is vital, since no PU would accommodate SU access to its own detriment. Therefore the objective of the problem we study is to maximize the SU throughput while protecting PUs on all channels. At a given time, the SU decides if it transmits and if so on which PU channel it should transmit on in order to protect PU performance. We use a constraint on the expected PU packet collision probability as the protection metric. We consider a general setting where the PUs are unslotted and may have different idle/busy time distributions and protection requirements. Under general idle time distributions, we determine the form of the SU optimal access policy. We also study the special case where PUs have independent, exponentially distributed idle time. For this case, we formulate a linear program that yields an optimal randomized strategy for the secondary user, and also present a tunable heuristic which allows for a tradeoff between complexity and throughput performance.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"Channel Selection in Multi-Channel Opportunistic Spectrum Access Networks with Perfect Sensing\",\"authors\":\"Xin Liu, B. Krishnamachari, Hua Liu\",\"doi\":\"10.1109/DYSPAN.2010.5457885\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study optimal transmission strategies in multi-channel cognitive radio networks where one secondary user (SU) opportunistically accesses multiple orthogonal channels that are owned and utilized by primary users (PU). In dynamic spectrum access networks, the protection of PU's is vital, since no PU would accommodate SU access to its own detriment. Therefore the objective of the problem we study is to maximize the SU throughput while protecting PUs on all channels. At a given time, the SU decides if it transmits and if so on which PU channel it should transmit on in order to protect PU performance. We use a constraint on the expected PU packet collision probability as the protection metric. We consider a general setting where the PUs are unslotted and may have different idle/busy time distributions and protection requirements. Under general idle time distributions, we determine the form of the SU optimal access policy. We also study the special case where PUs have independent, exponentially distributed idle time. For this case, we formulate a linear program that yields an optimal randomized strategy for the secondary user, and also present a tunable heuristic which allows for a tradeoff between complexity and throughput performance.\",\"PeriodicalId\":106204,\"journal\":{\"name\":\"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DYSPAN.2010.5457885\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DYSPAN.2010.5457885","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Channel Selection in Multi-Channel Opportunistic Spectrum Access Networks with Perfect Sensing
We study optimal transmission strategies in multi-channel cognitive radio networks where one secondary user (SU) opportunistically accesses multiple orthogonal channels that are owned and utilized by primary users (PU). In dynamic spectrum access networks, the protection of PU's is vital, since no PU would accommodate SU access to its own detriment. Therefore the objective of the problem we study is to maximize the SU throughput while protecting PUs on all channels. At a given time, the SU decides if it transmits and if so on which PU channel it should transmit on in order to protect PU performance. We use a constraint on the expected PU packet collision probability as the protection metric. We consider a general setting where the PUs are unslotted and may have different idle/busy time distributions and protection requirements. Under general idle time distributions, we determine the form of the SU optimal access policy. We also study the special case where PUs have independent, exponentially distributed idle time. For this case, we formulate a linear program that yields an optimal randomized strategy for the secondary user, and also present a tunable heuristic which allows for a tradeoff between complexity and throughput performance.