针对数据库驱动认知无线电网络(cognitive radio networks)存在的位置隐私泄露风险,提出两种攻击方法:覆盖交集攻击和频道切换攻击,可根据二级用户(secondary user,SU)频道使用情况,在不直接获取查询信息中的位置信息的前提下,间接推断S...针对数据库驱动认知无线电网络(cognitive radio networks)存在的位置隐私泄露风险,提出两种攻击方法:覆盖交集攻击和频道切换攻击,可根据二级用户(secondary user,SU)频道使用情况,在不直接获取查询信息中的位置信息的前提下,间接推断SU位置。为应对上述攻击,提出查询信息盲化机制来实现隐私保护的频谱查询,同时对频道选择方案进行优化使得SU能够最大程度地保护自身位置隐私。根据真实数据进行的攻击实验提高了对SU的定位精度,基于模拟数据的隐私保护方案验证实验证明了本文提出的保护方案的有效性和效率。展开更多
One critical issue for routing in cognitive radio ad hoc networks (CRAHNs) is how to select a reliable path for forwarding traffic. This is because mobility may cause radio links to break frequently. The reliability o...One critical issue for routing in cognitive radio ad hoc networks (CRAHNs) is how to select a reliable path for forwarding traffic. This is because mobility may cause radio links to break frequently. The reliability of a path depends on the availability of those links that constitutes the path. In this letter, we present a novel approach to predict the probability of the availability of the link between two cognitive radio nodes. The prediction is achieved by estimating the link activation and spectrum activation probabilities. Our prediction is verified by simulation and proved to be accurate. This study can provide reliability assurance on dynamic routing for cognitive radio ad hoc networks.展开更多
提出了基于静态、半静态和动态频谱资源共性特征指标的频谱可用性定义方法,并借鉴改进的最大加权时延优先(modified largest weight delay first,M-LWDF)算法的QoS需求定义方法,定义了用户的业务需求指标。在此基础上,提出了结合频谱可...提出了基于静态、半静态和动态频谱资源共性特征指标的频谱可用性定义方法,并借鉴改进的最大加权时延优先(modified largest weight delay first,M-LWDF)算法的QoS需求定义方法,定义了用户的业务需求指标。在此基础上,提出了结合频谱可用性和用户业务需求的频谱分配方法和二次分配方法,其核心思想是将用户需求和频谱资源的可用性按照一定的方式量化,再采用简单的按大小一一对应的方式进行分配。与随机分配方案、先静后动的频谱分配方案的仿真对比表明,本方案在平均失败次数、平均总速率等性能方面具有明显的改善。展开更多
文摘针对数据库驱动认知无线电网络(cognitive radio networks)存在的位置隐私泄露风险,提出两种攻击方法:覆盖交集攻击和频道切换攻击,可根据二级用户(secondary user,SU)频道使用情况,在不直接获取查询信息中的位置信息的前提下,间接推断SU位置。为应对上述攻击,提出查询信息盲化机制来实现隐私保护的频谱查询,同时对频道选择方案进行优化使得SU能够最大程度地保护自身位置隐私。根据真实数据进行的攻击实验提高了对SU的定位精度,基于模拟数据的隐私保护方案验证实验证明了本文提出的保护方案的有效性和效率。
文摘One critical issue for routing in cognitive radio ad hoc networks (CRAHNs) is how to select a reliable path for forwarding traffic. This is because mobility may cause radio links to break frequently. The reliability of a path depends on the availability of those links that constitutes the path. In this letter, we present a novel approach to predict the probability of the availability of the link between two cognitive radio nodes. The prediction is achieved by estimating the link activation and spectrum activation probabilities. Our prediction is verified by simulation and proved to be accurate. This study can provide reliability assurance on dynamic routing for cognitive radio ad hoc networks.
文摘提出了基于静态、半静态和动态频谱资源共性特征指标的频谱可用性定义方法,并借鉴改进的最大加权时延优先(modified largest weight delay first,M-LWDF)算法的QoS需求定义方法,定义了用户的业务需求指标。在此基础上,提出了结合频谱可用性和用户业务需求的频谱分配方法和二次分配方法,其核心思想是将用户需求和频谱资源的可用性按照一定的方式量化,再采用简单的按大小一一对应的方式进行分配。与随机分配方案、先静后动的频谱分配方案的仿真对比表明,本方案在平均失败次数、平均总速率等性能方面具有明显的改善。
