大规模认知无线电网络的时延分析

时延作为无线网络的最基本的性能之一,对网络信息分发、路由协议设计、节点部署等都具有重要意义。与传统的无线网络不同,认知无线电网络的频谱资源具有动态变化性,该特性会对网络时延产生极大的影响。因此,如何对动态频谱环境下的大规模认知无线电网络进行时延分析,是一项很具挑战性的课题。为此,首先对动态频谱环境进行建模,将认知用户的频谱接入过程建模为一个连续时间的马尔可夫链,并建立认知用户的生存函数来量化授权用户活动以及信道数量对频谱环境的影响;其次,将上述模型与首次通过渗流理论结合起来,研究了大规模认知无线电网络时延的伸缩规律,并获取了更为精确的时延与距离比的上限值。理论分析及仿真结果表明,动态频谱环境与密度一样会对时延产生极大影响。研究结论对认知无线电网络的设计具有重要的指导意义。     

CDCSS: cluster-based distributed cooperative spectrum sensing model against primary user emulation (PUE) cyber attacks

In cognitive radio network, the secondary users (SUs) use the spectrum of primary users for communication which arises the security issues. The status of SUs as legitimate users is compulsory for the stability of the system. This paper addresses the issue of delay caused by a band-selection decision process that directly affects the security and performance. The model cluster-based distributed cooperative spectrum sensing is proposed. In this model, cluster heads (CHs) exchange control information with other CHs and ordinary nodes. This model significantly reduced the delay, sensing, convergence, routing, in band-selection process. This also reduces the energy consumption while sensing the spectrum which seriously leads to performance upgradation. The simulated results show the improved performance of cognitive radio networks in terms of delay, packet loss ratio and bandwidth usage as compared to cluster-based cooperative spectrum sensing model. The opportunity for primary user emulation attacker is minimized as the overall delay is reduced.     

一种多信道Ad hoc认知无线电网络密钥交互协议*

针对现有密钥协商协议没有考虑Ad hoc认知无线电网络多信道这一缺陷,提出一种多信道密钥协商协议（multi channels key agreement protocol,MCKAP）,通过建立多重图和替换广播操作减少信道冲突,优化协商路径提高共享密钥协商效率,利用信道属性为节点间选择合理位置,避免主用户干扰。该方案能有效地利用多信道提高共享密钥协商效率。最后通过理论分析和仿真实验证明该协议适用于Ad hoc认知无线电网络,具有较好的执行效率。     

Cooperative detection of primary user emulation attacks in CRNs

Cognitive radio networks (CRNs) can improve the utilization of the spectrum by making use of licensed spectrum in an opportunistic manner. With such purpose, coexistence mechanisms among CRN nodes or secondary users and legitimate users of the spectrum or primary users are defined. However, due to the particular features of CRNs, new security threats arise, such as the primary user emulation (PUE) attack, which is the most challenging among all. With the aim of detecting such kind of attacks, in this paper we propose a cooperative localization method specifically suited to CRNs which relies on TDoA measurements and Taylor-series estimations. Simulations results show the goodness of the proposed method and its suitability to typical CRN scenarios.     

Adaptive Auction Framework for Spectrum Market in Cognitive Radio Networks

For the recent decade, cognitive radio networks have received much attention as an alternative to the traditional static spectrum allocation policy since the licensed spectrum channels are not being used efficiently. The most critical issue of the cognitive radio networks is how to distribute the idle spectrum channels to the secondary users opportunistically. The auction-based market is desirable for the trade of idle spectrum channels since the secondary users can purchase a channel in timely manner and the licensed primary users can earn the additional profit while not using the channels. Among the auction algorithms proposed for the spectrum market, we focus on the TASG framework, which consists of two nested auction algorithms, because it enables the group-buying of spectrum channels for the secondary users with limited budgets, and possesses many positive properties such as budget-balance, individual rationality and truthfulness. However, the TASG framework is not very attractive to the market participants since the seller earns the small revenue and the buyer has the low utility. In this paper, we propose a new auction framework for the spectrum markets, called aDaptive and Economically robust Auction-based Leasing (DEAL), that keeps all the benefits of TASG while improving the utility (or revenue) of the participants. To this end, we develop an enhanced inner-auction algorithm, called the Global Auction algorithm in our DEAL framework, and adapt the involved parameters dynamically based on the previous bids from the potential buyers. Simulation results demonstrate that our framework significantly outperforms the previous TASG.     

认知无线电网络双天线多信道MAC协议

在认知无线电网络中,媒体接入控制(MAC)协议的主要功能包括信道感知、选择和接入控制,其中感知时间和传输时间的长度对网络的性能有着重要的影响。在动态无线网络环境下,如何合理分配感知时间和传输时间是个挑战性问题。提出了一种双天线多信道分布式认知无线电MAC（TM-MAC）协议,不需要在传输之前对信道进行感知。节点可以在其它节点传输数据的同时对频谱资源进行检测,然后利用空闲的频谱资源通信。建立了数学模型分析在饱和网络状况下MAC协议的吞吐量。仿真分析表明TM-MAC协议能够有效提高网络的吞吐量。     

Spectrum Allocation for Cognitive Radio Networks Using the Fireworks Algorithm

The fireworks algorithm features a small number of parameters, remarkable optimization ability, and resistance to a local optimum. Based on the graph coloring model, the fireworks algorithm is introduced for the first time to solve the spectrum allocation problem for cognitive radio networks, thus maximizing utility and fairness of spectrum allocation. Two-layer binary coding is adopted for individual fireworks. The first layer refers to the coding of cognitive users used to determine channels that can be connected with the user. The second layer refers to the auxiliary coding of channels responsible for addressing mutual interference among multiple cognitive users when they connect with the same channel at the same time. Explosion operator, mutation operator, and the selection operation are designed to allocate the spectrum for the cognitive radio network. Simulation results demonstrate superiority and efficiency of the proposed algorithm in terms of spectrum allocation.     

Call admission control policies in cellular wireless networks with spectrum renting

Radio spectrum is scarce and precious resource in wireless networks. To efficiently utilize radio spectrum, a wireless network can rent radio channels from another wireless network and returns back the rented channels when the rented channels are required to be withdrawn. The rental and withdrawal of radio channels result in two phenomena: (i) variable number of radio channels in a wireless network and (ii) call dropping due to the channel withdrawal. Call admission control aims to provide good quality-of-services for mobile users while efficiently utilize radio channels. Many call admission control policies in the previous literatures were studied without the two phenomena. In this paper, we study three call admission control policies, namely, fixed-reservation policy, single-threshold policy and multiple-threshold policy in a wireless network which rents channels from another wireless network. We develop numerical analyses to analyze and compare the performances of the three call admission control policies. Numerical results show that the multiple-threshold policy produces higher throughput than the single-threshold and fixed-reservation policies under the same constraint of quality-of-services.     

认知无线Mesh网络中基于概率的贪婪频谱决策技术研究

认知无线电网络传统的频谱决策方法中次用户根据不同的判据选择信道,会引起信道竞争和拥塞。针对认知无线Mesh网络中基于概率的频谱决策方法,提出一种贪婪信道选择算法,当发生频谱切换时,其结合改进的抢占优先(相似文献   

On neighbor discovery in cognitive radio networks

A cognitive radio node is a radio device capable of operating over multiple channels. As a result, a network consisting of one or more cognitive radio nodes can adapt to varying channel availability in its geographical region by dynamically changing the channel (or channels) nodes are using for communication.     

基于认知无线电技术的动态频谱分配方案研究

随着物联网的发展,人们能够更加方便快捷地利用智能终端,随时随地接入到无线网络中进行业务数据传输.然而,激增的移动用户数量和业务的带宽需求,使得无线频谱资源日益稀缺,现有固定式频谱分配方案面临巨大挑战.面向物联网发展,如何满足用户的高移动性和呈爆炸式增长的业务传输需求成为物联网研究的重点.认知无线电技术,一方面允许用户终端自适应感知所处环境的频谱资源空闲信息,为用户营造一个无缝的接入环境,保证用户的高移动性;另一方面通过动态频谱分配有效地解决了频谱资源稀缺和现有授权频谱资源利用率低的问题,为用户的海量数据传输提供保证.作者基于认知无线电技术,提出了一个用户终端和网络端共同参与决策的两级动态频谱分配框架结构,并提出了两级动态频谱分配方案.该方案设计包含:空闲频谱资源排序选择算法和集中式的联合优化匹配算法.通过用户终端和网络端的协同工作,文中所提出的两级动态频谱分配方案能够有效满足用户的高移动性和业务传输服务质量需求,实现空闲频谱资源利用率和频谱间切换概率的联合优化,为移动用户的海量数据传输提供保证.仿真实验结果表明,与传统图匹配方法相比较,该方案能够平均提高全网服务质量有效吞吐量70%,平均降低频谱间切换概率56%.     

System model and performance estimation of dynamic spectrum allocation strategy with multi-channel and imperfect sensing

The concept of cognitive radio networks (CRNs) is a promising candidate for enhancing the utilization of existing radio spectrum. In CRNs, secondary users (SUs) are allowed to use the spectrum unused by primary users (PUs). In order to mathematically estimate the system performance of dynamic spectrum allocation strategy with multi-channel and imperfect sensing, we propose a novel preemptive priority queueing model. We establish a discrete-time Markov chain in line with the stochastic behaviour of SU and PU packets. Then, we derive some performance measures, such as the interference rate of PU packets, the normal throughput and the average delay of SU packets. Moreover, we provide theoretical and simulation experiments to investigate the system performance. Numerical experiments show that there is a tradeoff between different performance measures when imperfect sensing is considered. Finally, we present an optimal design for setting the number of the channels in a spectrum.     

SURF: A distributed channel selection strategy for data dissemination in multi-hop cognitive radio networks

In this paper, we propose an intelligent and distributed channel selection strategy for efficient data dissemination in multi-hop cognitive radio network. Our strategy, SURF, classifies the available channels and uses them efficiently to increase data dissemination reliability in multi-hop cognitive radio networks. The classification is done on the basis of primary radio unoccupancy and of the number of cognitive radio neighbors using the channels. Through extensive NS-2 simulations, we study the performance of SURF compared to four related approaches. Simulation results confirm that our approach is effective in selecting the best channels for efficient communication (in terms of less primary radio interference) and for highest dissemination reachability in multi-hop cognitive radio networks.     

Queuing-Based Dynamic Channel Selection for Heterogeneous Multimedia Applications Over Cognitive Radio Networks

In this paper, we propose a dynamic channel-selection solution for autonomous wireless users transmitting delay-sensitive multimedia applications over cognitive radio networks. Unlike prior works that seldom consider the requirement of the application layer, our solution explicitly considers various rate requirements and delay deadlines of heterogeneous multimedia users. Note that the users usually possess private utility functions, application requirements, and distinct channel conditions in different frequency channels. To efficiently manage available spectrum resources in a decentralized manner, information exchange among users is necessary. Hence, we propose a novel priority virtual queue interface that determines the required information exchanges and evaluates the expected delays experienced by various priority traffics. Such expected delays are important for multimedia users due to their delay-sensitivity nature. Based on the exchanged information, the interface evaluates the expected delays using priority queuing analysis that considers the wireless environment, traffic characteristics, and the competing users' behaviors in the same frequency channel. We propose a dynamic strategy learning (DSL) algorithm deployed at each user that exploits the expected delay and dynamically adapts the channel selection strategies to maximize the user's utility function. We simulate multiple video users sharing the cognitive radio network and show that our proposed solution significantly reduces the packet loss rate and outperforms the conventional single-channel dynamic resource allocation by almost 2 dB in terms of video quality.      

认知无线网络中基于进化博弈的动态频谱接入*

研究了认知无线网络环境中基于价格动态性的动态频谱接入,即不同的授权网络服务商以不同的价格将空闲频谱出售给认知网络,且认知用户可以根据自己获得的报酬动态地接入不同的网络。为最大化认知网络的效用,提出了基于进化博弈的动态频谱接入方案。仿真结果表明,当认知用户群体到达进化均衡时,接入每个主网络的认知用户数量的比例达到稳定状态,最大化了认知用户和网络的效用。     

RAC: Range Adaptive Cognitive Radio Networks

In recent years, cognitive radio has received a great attention due to tremendous potential to improve the utilization of the radio spectrum by efficiently reusing and sharing the licensed spectrum bands, as long as the interference power inflicted on the primary users of the band remains below a predefined threshold level. Cognitive radio allows the secondary users in the cognitive radio network to access the licensed spectrum of the primary users opportunistically. In this paper, an autonomous distributed adaptive transmission range control scheme for cognitive radio networks which is called the RAC is proposed. The RAC considers the QoS requirements of both the primary and the secondary users simultaneously. The cognitive user's maximization of its achievable throughput without interfering the primary user by adapting transmission range of the secondary users dynamically is the key feature of the RAC. One of the advantages of using the proposed scheme is its implementation simplicity. The RAC is compared to other cognitive radio schemes in a simulation environment by using ns2. Simulations indicate that, the RAC can well fit into the mobile cognitive radio ad hoc networks and improve the network performance. Having compared to the other schemes utilizing contemporary cognitive radio technology, the RAC provides better adaptability to the environment and maximizes throughput and minimizes data delivery latency.     

被动雷达抗两点源干扰的改进聚类分析法研究

对于两点源干扰可以有效干扰被动雷达单脉冲测角系统。为了使被动雷达单脉冲测角系统在两点源干扰下能够有效测量目标的角度,在分析宽带噪声调频干扰信号通过接收机相位检波的输出特性基础上,应用聚类分析算法能够实现在一次测量中对一个干扰源角度的精确测量,同时也提出了动态测角时如上方法在两干扰源功率相近时测量角随机摆动的问题。通过"近值比较法"对传统聚类分析算法改进,有效解决了上述问题。仿真证明,改进后的聚类分析算法能够在1%的测角误差下稳定地跟踪一个干扰源的指向角,较大地改善了传统聚类算法,达到了抗两点源干扰的目的。     

Signal transmission model for the substations grounding grid

The signal of the wireless sensor network in grounding grid, owing to energy loss, network congestion, path constraints and other factors, is easy to delay even partially losing. In order to ensure that the signal can be transmitted effectively in grounding grids for the substation, this paper presents a method based on traffic model of back-off balanced multiple sensor network cooperation model. As we all know, cognitive radio (CR) technology is adopted in multi-channel wireless networks to provide enough channels for data transmission. The MAC protocols should enable the secondary users to maintain the accurate channel state information to identify and utilize the leftover frequency spectrum in a way that constrains the level of interference to the primary users. We proposed a novel cooperation spectrum sensing scheme in which the secondary users adopt backoff-based sensing policy based on the traffic model of the primary users to maximum the throughput of the network. To obtain the full accurate information of the spectrum is a difficult task so that we propose the backoff sensing as a sub-optimal strategy. Since the secondary users sense only a subset of the channels in our proposed scheme, less time is spent to get the channel state information as more time is saved for the data transmission. And while dealing the signal data, I combine the intensity transfer method instead of the priority method. This can effectively reduce the network congestion, to ensure that the main information can be transfer well. It is also very useful to signal transmission for the Multi-sensor in Substations Grounding Grid (SGG).     

Aprojected gradient based game theoretic approach for multi-user power control in cognitive radio network

The fifth generation (5G) networks have been envisioned to support the explosive growth of data demand caused by the increasing traditional high-rate mobile users and the expected rise of interconnections between human and things. To accommodate the ever-growing data traffic with scarce spectrum resources, cognitive radio (CR) is considered a promising technology to improve spectrum utilization. We study the power control problem for secondary users in an underlay CR network. Unlike most existing studies which simplify the problem by considering only a single primary user or channel, we investigate a more realistic scenario where multiple primary users share multiple channels with secondary users. We formulate the power control problem as a non-cooperative game with coupled constraints, where the Pareto optimality and achievable total throughput can be obtained by a Nash equilibrium (NE) solution. To achieve NE of the game, we first propose a projected gradient based dynamic model whose equilibrium points are equivalent to the NE of the original game, and then derive a centralized algorithm to solve the problem. Simulation results show that the convergence and effectiveness of our proposed solution, emphasizing the proposed algorithm, are competitive. Moreover, we demonstrate the robustness of our proposed solution as the network size increases.     

A secure routing scheme for mobile wireless sensor networks

Frequency-hopping (FH) is a well-known spread-spectrum method of transmitting radio signals by hopping frequency channels along a predefined hopping sequence known to both transmitter and receiver. Although FH is resistant to jamming by external malicious nodes which have no knowledge of the sequence, it is of no effect against attacks by internal compromised nodes which know the sequence. In this article, we propose a secure scheme for creating the hopping sequence for mobile wireless sensor networks. The proposed scheme is based on the idea of a statistical en-route filtering (SEF). SEF exploits collective decision making by multiple detecting nodes in the dense deployment of large sensor networks. We demonstrate the effectiveness of our scheme thorough simulations.