{"title":"机会通道接入下基于k-hop邻居知识的CRN聚类","authors":"R. Misra, R. Yadav","doi":"10.1504/IJCNDS.2017.10007987","DOIUrl":null,"url":null,"abstract":"Cognitive radio networks (CRNs) enables cognitive users (CUs) to use available spectrum of primary users (PUs) using innovative techniques. On appearance of PUs, the available channel of CUs at different position may have different available channels which changes dynamically over time. Due to temporal and spatial variations of opportunistic channel availability, to ensure connectivity and robustness in CRN is of great research interests. We have proposed novel approach of k-hop neighbour knowledge-based clustering algorithm which guarantees robustness in CRN and converges in O(n2m), for n CUs and m clusters in the network. We have evaluated for varying 3-hop, 4-hop, … k-hop through simulation which shows that our scheme achieves 25%-30% more numbers of outward common channels and outperforms in terms of inner common channel index, outward common channel index, number of isolated nodes, throughput and frequency of route discovery compared to the competitive approaches.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"k-hop neighbour knowledge-based clustering in CRN under opportunistic channel access\",\"authors\":\"R. Misra, R. Yadav\",\"doi\":\"10.1504/IJCNDS.2017.10007987\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cognitive radio networks (CRNs) enables cognitive users (CUs) to use available spectrum of primary users (PUs) using innovative techniques. On appearance of PUs, the available channel of CUs at different position may have different available channels which changes dynamically over time. Due to temporal and spatial variations of opportunistic channel availability, to ensure connectivity and robustness in CRN is of great research interests. We have proposed novel approach of k-hop neighbour knowledge-based clustering algorithm which guarantees robustness in CRN and converges in O(n2m), for n CUs and m clusters in the network. We have evaluated for varying 3-hop, 4-hop, … k-hop through simulation which shows that our scheme achieves 25%-30% more numbers of outward common channels and outperforms in terms of inner common channel index, outward common channel index, number of isolated nodes, throughput and frequency of route discovery compared to the competitive approaches.\",\"PeriodicalId\":209177,\"journal\":{\"name\":\"Int. J. Commun. Networks Distributed Syst.\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Commun. Networks Distributed Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJCNDS.2017.10007987\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Commun. Networks Distributed Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJCNDS.2017.10007987","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
k-hop neighbour knowledge-based clustering in CRN under opportunistic channel access
Cognitive radio networks (CRNs) enables cognitive users (CUs) to use available spectrum of primary users (PUs) using innovative techniques. On appearance of PUs, the available channel of CUs at different position may have different available channels which changes dynamically over time. Due to temporal and spatial variations of opportunistic channel availability, to ensure connectivity and robustness in CRN is of great research interests. We have proposed novel approach of k-hop neighbour knowledge-based clustering algorithm which guarantees robustness in CRN and converges in O(n2m), for n CUs and m clusters in the network. We have evaluated for varying 3-hop, 4-hop, … k-hop through simulation which shows that our scheme achieves 25%-30% more numbers of outward common channels and outperforms in terms of inner common channel index, outward common channel index, number of isolated nodes, throughput and frequency of route discovery compared to the competitive approaches.