认知无线电网络的主要和次要社会活动感知路由

Junling Lu, Zhipeng Cai, Xiaoming Wang, Lichen Zhang, Peng Li, Zaobo He
{"title":"认知无线电网络的主要和次要社会活动感知路由","authors":"Junling Lu, Zhipeng Cai, Xiaoming Wang, Lichen Zhang, Peng Li, Zaobo He","doi":"10.1109/IIKI.2016.88","DOIUrl":null,"url":null,"abstract":"In cognitive radio networks(CRNs), efficient spectrum access is challenging and whitespace are necessary for communicating pairs, including Primary Users (PUs) and Secondary Users (SUs). In the existing works, available whitespace is determined by PUs' social activities, which has drawn much attention and been investigated. In reality, SUs need to compete with each other in obtaining accessible whitespace. To the best of our knowledge, the modeling and integration of SUs' social activities have not been considered in real whitespace analysis. Inspired by this motivation, we propose an solution aiming to attaining accessible whitespace, which considers the available whitespace determined by primary activities and the competitions based on secondary activities. Furthermore, we take a spectrum aware routing, including accessible whitespace and routing convergence, as an example to demonstrate the advantage of this proposed solution. The simulation experiments conducted on real world datasets verify the difference between available whitespace and accessible whitespace, and also show the adaptiveness of the proposed algorithm in terms of average delivery ratio and average delay.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Primary and Secondary Social Activity Aware Routing for Cognitive Radio Networks\",\"authors\":\"Junling Lu, Zhipeng Cai, Xiaoming Wang, Lichen Zhang, Peng Li, Zaobo He\",\"doi\":\"10.1109/IIKI.2016.88\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In cognitive radio networks(CRNs), efficient spectrum access is challenging and whitespace are necessary for communicating pairs, including Primary Users (PUs) and Secondary Users (SUs). In the existing works, available whitespace is determined by PUs' social activities, which has drawn much attention and been investigated. In reality, SUs need to compete with each other in obtaining accessible whitespace. To the best of our knowledge, the modeling and integration of SUs' social activities have not been considered in real whitespace analysis. Inspired by this motivation, we propose an solution aiming to attaining accessible whitespace, which considers the available whitespace determined by primary activities and the competitions based on secondary activities. Furthermore, we take a spectrum aware routing, including accessible whitespace and routing convergence, as an example to demonstrate the advantage of this proposed solution. The simulation experiments conducted on real world datasets verify the difference between available whitespace and accessible whitespace, and also show the adaptiveness of the proposed algorithm in terms of average delivery ratio and average delay.\",\"PeriodicalId\":371106,\"journal\":{\"name\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIKI.2016.88\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIKI.2016.88","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在认知无线电网络(crn)中,有效的频谱接入是一个挑战,并且通信对(包括主用户(pu)和从用户(su))需要空白。在现有的作品中,可用的空白空间是由pu的社交活动决定的,这引起了人们的广泛关注和研究。实际上,在获取可访问的空白时,su需要相互竞争。据我们所知,在实际的空白分析中还没有考虑到SUs社会活动的建模和集成。在这一动机的启发下,我们提出了一种以获得可访问空白为目标的解决方案,该方案考虑了由主要活动确定的可用空白和基于次要活动的竞争。此外,我们以频谱感知路由为例,包括可访问的空白和路由收敛,以证明所提出的解决方案的优势。在真实数据集上进行的仿真实验验证了可用空白和可访问空白之间的差异,也证明了所提算法在平均传输比和平均延迟方面的自适应性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Primary and Secondary Social Activity Aware Routing for Cognitive Radio Networks
In cognitive radio networks(CRNs), efficient spectrum access is challenging and whitespace are necessary for communicating pairs, including Primary Users (PUs) and Secondary Users (SUs). In the existing works, available whitespace is determined by PUs' social activities, which has drawn much attention and been investigated. In reality, SUs need to compete with each other in obtaining accessible whitespace. To the best of our knowledge, the modeling and integration of SUs' social activities have not been considered in real whitespace analysis. Inspired by this motivation, we propose an solution aiming to attaining accessible whitespace, which considers the available whitespace determined by primary activities and the competitions based on secondary activities. Furthermore, we take a spectrum aware routing, including accessible whitespace and routing convergence, as an example to demonstrate the advantage of this proposed solution. The simulation experiments conducted on real world datasets verify the difference between available whitespace and accessible whitespace, and also show the adaptiveness of the proposed algorithm in terms of average delivery ratio and average delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信