认知无线电网络被动监测的鲁棒最优频谱巡逻

Jiachen Li, Jing Xu, Wei Liu, Shimin Gong, K. Zeng
{"title":"认知无线电网络被动监测的鲁棒最优频谱巡逻","authors":"Jiachen Li, Jing Xu, Wei Liu, Shimin Gong, K. Zeng","doi":"10.1109/CIT.2017.63","DOIUrl":null,"url":null,"abstract":"Passive spectrum monitoring is important for network diagnosis and radio frequency management in spectrum-sharing wireless networks, i.e., cognitive radio network. Most of the related work focused on the sniffer-channel assignment problem, i.e, assigning proper operational channel to wireless sniffers with the aim of tracking and capturing the target signals or data packets. These approaches were usually designed for the scenarios in which the malicious or suspect wireless users are known. In this paper, we focus on the problem of spectrum patrolling, in which the sniffers have no specific targets, but try to patrol the interested temporal, spatial or spectrum areas. Once the periodicity or regularity of the wireless traffics is identified, a patrol path will be developed for routine patrolling. The path planning problem is formulated as a robust reward maximization problem with uncertain channel information. We propose an algorithm to determine the optimal solution and validate it through numerical simulations. Simulation results show that our proposed algorithm can achieve the maximal reward even with unknown information of the user activities.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Robust Optimal Spectrum Patrolling for Passive Monitoring in Cognitive Radio Networks\",\"authors\":\"Jiachen Li, Jing Xu, Wei Liu, Shimin Gong, K. Zeng\",\"doi\":\"10.1109/CIT.2017.63\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Passive spectrum monitoring is important for network diagnosis and radio frequency management in spectrum-sharing wireless networks, i.e., cognitive radio network. Most of the related work focused on the sniffer-channel assignment problem, i.e, assigning proper operational channel to wireless sniffers with the aim of tracking and capturing the target signals or data packets. These approaches were usually designed for the scenarios in which the malicious or suspect wireless users are known. In this paper, we focus on the problem of spectrum patrolling, in which the sniffers have no specific targets, but try to patrol the interested temporal, spatial or spectrum areas. Once the periodicity or regularity of the wireless traffics is identified, a patrol path will be developed for routine patrolling. The path planning problem is formulated as a robust reward maximization problem with uncertain channel information. We propose an algorithm to determine the optimal solution and validate it through numerical simulations. Simulation results show that our proposed algorithm can achieve the maximal reward even with unknown information of the user activities.\",\"PeriodicalId\":378423,\"journal\":{\"name\":\"2017 IEEE International Conference on Computer and Information Technology (CIT)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Computer and Information Technology (CIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIT.2017.63\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Computer and Information Technology (CIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIT.2017.63","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在频谱共享无线网络即认知无线网络中,无源频谱监测对网络诊断和射频管理具有重要意义。大多数相关工作都集中在嗅探器信道分配问题上,即为无线嗅探器分配适当的操作信道,以跟踪和捕获目标信号或数据包。这些方法通常是为已知恶意或可疑无线用户的场景而设计的。本文主要研究频谱巡逻问题,即嗅探器没有特定目标,而是在感兴趣的时间、空间或频谱区域进行巡逻。一旦确定了无线通信量的周期性或规律性,就可以制定巡逻路径进行日常巡逻。将路径规划问题表述为具有不确定通道信息的鲁棒奖励最大化问题。我们提出了一种确定最优解的算法,并通过数值模拟对其进行了验证。仿真结果表明,该算法在用户活动信息未知的情况下也能获得最大的奖励。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robust Optimal Spectrum Patrolling for Passive Monitoring in Cognitive Radio Networks
Passive spectrum monitoring is important for network diagnosis and radio frequency management in spectrum-sharing wireless networks, i.e., cognitive radio network. Most of the related work focused on the sniffer-channel assignment problem, i.e, assigning proper operational channel to wireless sniffers with the aim of tracking and capturing the target signals or data packets. These approaches were usually designed for the scenarios in which the malicious or suspect wireless users are known. In this paper, we focus on the problem of spectrum patrolling, in which the sniffers have no specific targets, but try to patrol the interested temporal, spatial or spectrum areas. Once the periodicity or regularity of the wireless traffics is identified, a patrol path will be developed for routine patrolling. The path planning problem is formulated as a robust reward maximization problem with uncertain channel information. We propose an algorithm to determine the optimal solution and validate it through numerical simulations. Simulation results show that our proposed algorithm can achieve the maximal reward even with unknown information of the user activities.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信