机会通道接入下基于k-hop邻居知识的CRN聚类

R. Misra, R. Yadav
{"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}
引用次数: 1

摘要

认知无线网络(crn)通过创新技术使认知用户(cu)能够利用主用户(pu)的可用频谱。在pu的外观上,不同位置的cu的可用通道可能有不同的可用通道,这些可用通道随时间动态变化。由于机会信道可用性的时空变化,确保CRN中的连通性和鲁棒性是一个重要的研究课题。我们提出了一种新的基于k-hop邻居知识的聚类算法,该算法保证了网络中n个cu和m个簇在CRN中的鲁棒性,并在O(n2m)内收敛。我们通过仿真对不同的3跳、4跳、…k跳进行了评估,结果表明,与竞争方法相比,我们的方案实现了25%-30%的外向公共信道数量,并且在内部公共信道索引、外向公共信道索引、隔离节点数量、吞吐量和路由发现频率方面都优于竞争方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信