感知无线电ad hoc网络基于干扰的路由

感知无线电技术作为一种新兴技术,通过时间和空间维度上的频谱空洞的利用能很好地提高频谱利用率。感知无线电的路由不同于传统的路由度量,因为次用户从时间和空间上都不能对主用户造成干扰。在感知无线电ad hoc网络环境下,选取了干扰作为路由的度量,并将干扰分为系统内干扰(次用户自身之间的干扰)和系统间干扰(次用户对主用户的干扰)。在已有的ad hoc网络干扰路由协议的基础上对干扰权重做出改进,并提出新的基于系统间路由干扰(对主用户干扰最小化)和基于联合系统内和系统间干扰的路由协议。仿真结果表明,该干扰模型符合感知无线电移动ad hoc网络的特性。     

基于扩散机制的分布式宽带压缩频谱感知算法

针对认知无线电网络共享频谱资源的特征,本文提出一种基于扩散机制的分布式宽带压缩频谱感知方法。该算法包含两个工作阶段。在第一个阶段,每个认知用户对观测信号进行压缩感知和独立重构,产生本地频谱估计;在第二阶段,各个认知用户根据扩散机制协作更新频谱估计信息,实现最优估计。仿真结果表明,该算法与一致性分布式压缩频谱感知方法相比,可以快速增强认知无线电网络频谱感知能力,可应用于动态拓扑结构的认知无线电网络。     

基于DOA估计的认知无线网络频谱感知

认知无线电技术中频谱感知性能的优劣直接影响认知通信系统的性能。针对该特点提出了认知无线电网络中基于波达方向（ DOA)估计的主用户频谱感知模型,即单主用户多次用户和多主用户多次用户的系统模型,选取基于特征分解的多重信号分类（ MUSIC)算法分析两种模型的感知性能,包括虚警概率、漏检概率、最小总错误概率、算法复杂度等,获得了闭值表达式,最后在两种模型下对算法进行了仿真。仿真结果表明：各参数主要影响虚警概率,而漏检概率几乎不受影响,验证了方法的有效性。     

基于加权平均一致算法的宽带压缩频谱感知

在认知无线电(CR)网络中进行频谱共享接入,首要的任务是进行频谱感知,并发现频谱空洞。基于认知无线网络中信号频域的固有稀疏性,本文结合了压缩感知(CS)技术与加权平均一致(weighted average consensus)算法,建立了分布式宽带压缩频谱感知模型。频谱感知分为两个阶段,在感知阶段,各个CR节点对接收到的主用户信号进行压缩采样以减少对宽带信号采样的开销和复杂度,并做出本地频谱估计;在信息融合阶段,各CR节点的本地频谱估计结果以分布式的方式进行信息融合,并得到最终的频谱估计结果,获得分集增益。仿真结果表明,结合压缩感知与加权平均一致算法增强了频谱感知的性能,比在相同的CR网络中使用平均一致算法时有了性能上的提升。      

分布式压缩感知实现宽带频谱感知的方法

频谱感知的第一步就是采集无线信号进行分析,越来越高的采样率成为宽带频谱感知研究中的难点。实际通信中主用户占用频谱具有稀疏特性,符合压缩感知理论的前提条件。因此,本文利用分布式压缩感知实现宽带频谱感知,提出基于差分信号分布式压缩感知（DS_DCS）的加权宽带频谱感知算法。该算法针对宽带频谱采样率高的问题,利用压缩感知技术降低采样率,同时引入差分处理方法降低计算复杂度;又针对单点检测带来的深衰落、隐节点以及抗噪声能力差等问题,采用分布式感知系统进行多节点协同检测并利用信噪比的估计对信号进行加权处理。仿真证明,该算法能有效降低各节点采样率,大幅提高系统检测概率,显著改善系统对噪声的鲁棒性。      

基于Dempster-Shafer证据理论的协同频谱感知算法

认知无线电的首要任务是频谱感知,单个认知用户的频谱感知结果容易受到衰落和多径的影响,本文结合证据理论研究了多个认知用户的协同频谱感知问题.为了在融合中心未知先验信息的条件下实现对授权用户的有效检测,文章基于Dempster-Shafer证据理论,对认知用户的本地感知结果提取证据,然后在融合中心进行融合并判决,提出了一种基于Dempster-Shafer证据理论的协同频谱感知算法.仿真结果表明,该算法能够在融合中心未知先验信息情况下,获得较好的频谱感知性能.     

基于信任度与信噪比的认知无线电协同频谱检测

无线网络中存在信噪比较高的恶意认知用户的情况,为了有效利用可靠的认知无线电(CR)技术用户的本地感知结果,提出了一种基于信任度的信噪比比较协同频谱感知算法,可有效剔除认知网络中存在的信噪比较高的恶意认知用户。仿真实验表明,在存在恶意认知用户的认知无线电网络中,该算法检测性能优于传统的或准则(OR)数据融合的协同频谱感知算法以及基于信噪比比较协同频谱感知算法。     

可防御SSDF攻击的宽带压缩频谱感知

SSDF（Spectrum Sensing Data Falsification）攻击是认知无线网络中对频谱感知性能危害最大的攻击方式之一。基于认知无线网络中信号频域的固有稀疏性,本文结合了压缩感知(CS)技术与平均一致(average consensus)算法,建立了可防御SSDF攻击的分布式宽带压缩频谱感知模型。本文建立了次用户的声望值指标,用以在分布式信息融合的过程中更加准确地排除潜在的恶意次用户影响。在感知阶段,各个CR节点对接收到的主用户信号进行压缩采样以减少对宽带信号采样的开销和复杂度,并做出本地频谱估计。在信息融合阶段,各CR节点的本地频谱估计结果以分布式的方式进行信息融合,排除潜在恶意次用户的影响,得到最终的频谱估计结果。仿真结果表明,本文提出的分布式频谱感知模型可以有效地抵御SSDF攻击,提高了频谱感知的性能。      

基于一致优化的分布式宽带合作频谱感知算法

在压缩采样的框架下,提出一种基于一致优化的分布式宽带频谱压缩感知算法。算法思想如下:认知无线电网络中每个认知节点首先根据压缩采样理论获取压缩采样,并恢复本地的频谱信息,然后在一跳范围内交换频谱信息。认知节点将获取的邻居节点频谱信息进行加权平均,此加权平均作为频谱恢复一致优化问题的约束,以此来降低计算开销,加速算法的收敛。优化问题通过最优交替方向乘子法迭代求解来获取整个认知无线电网络的频谱估计。给出了算法的收敛性证明,并进行了仿真实验以验证算法的有效性。     

认知无线电差分协作压缩频谱估计算法

在分布式认知无线网络场景下,针对传统协作压缩频谱估计收敛速度慢、计算复杂度高的问题,提出了一种差分协作压缩频谱估计算法用于宽带频谱感知。算法通过利用不同认知用户感知的宽带信号所满足的相同频谱支撑集特征,实现了在邻居节点感知先验信息条件下,本地认知用户基于压缩测量向量差值的宽带频谱迭代估计。仿真分析结果表明,所提算法在频谱估计精度、检测性能与计算复杂度方面均获得了明显改善。     

Enhancing cooperative spectrum sensing in cognitive radio ad hoc networks using priority-based two-stage detection model

Cooperation among unlicensed secondary users was more significant in cognitive radio ad hoc networks (CRAHNs). The main challenges of CRAHNs now a day address the main issues of spectrum scarcity and underutilization. Due to the lack of channel sensing, cooperative spectrum sensing (CSS) is the main challenge in CRAHNs. Efficient CSS is more essential to enhance the detection of performance by utilizing the theoretical studies of spatially distributed secondary users (SUs). This paper uses the priority-based two-stage detection model (PBTSDM) to analyze the cooperation strategy among secondary users (SUs) and primary users (PUs). SUs in distributed CSS sense continuously amongst themselves and take unified decision on the presence or absence of PUs by using entropy-based energy detection mechanism. The simulation results reveal that the sensing accuracy in terms of sensing time and energy efficiency (in terms of minimum energy consumption) increased significantly by using the proposed scheme.

     

CRAHNs: Cognitive radio ad hoc networks

Cognitive radio (CR) technology is envisaged to solve the problems in wireless networks resulting from the limited available spectrum and the inefficiency in the spectrum usage by exploiting the existing wireless spectrum opportunistically. CR networks, equipped with the intrinsic capabilities of the cognitive radio, will provide an ultimate spectrum-aware communication paradigm in wireless communications. CR networks, however, impose unique challenges due to the high fluctuation in the available spectrum as well as diverse quality-of-service (QoS) requirements. Specifically, in cognitive radio ad hoc networks (CRAHNs), the distributed multi-hop architecture, the dynamic network topology, and the time and location varying spectrum availability are some of the key distinguishing factors. In this paper, intrinsic properties and current research challenges of the CRAHNs are presented. First, novel spectrum management functionalities such as spectrum sensing, spectrum sharing, and spectrum decision, and spectrum mobility are introduced from the viewpoint of a network requiring distributed coordination. A particular emphasis is given to distributed coordination between CR users through the establishment of a common control channel. Moreover, the influence of these functions on the performance of the upper layer protocols, such as the network layer, and transport layer protocols are investigated and open research issues in these areas are also outlined. Finally, a new direction called the commons model is explained, where CRAHN users may independently regulate their own operation based on pre-decided spectrum etiquette.     

Spectrum management in cognitive radio ad hoc networks

The problem of spectrum scarcity and inefficiency in spectrum usage will be addressed by the newly emerging cognitive radio paradigm that allows radios to opportunistically transmit in the vacant portions of the spectrum already assigned to licensed users. For this, the ability for spectrum sensing, spectrum sharing, choosing the best spectrum among the available options, and dynamically adapting transmission parameters based on the activity of the licensed spectrum owners must be integrated within cognitive radio users. Specifically in cognitive radio ad hoc networks, distributed multihop architecture, node mobility, and spatio-temporal variance in spectrum availability are some of the key distinguishing factors. In this article the important features of CRAHNs are presented, along with the design approaches and research challenges that must be addressed. Spectrum management in CRAHNs comprises spectrum sensing, sharing, decision, and mobility. In this article each of these functions are described in detail from the viewpoint of multihop infrastructureless networks requiring cooperation among users.     

Q-Learning Based Interference-Aware Channel Handoff for Partially Observable Cognitive Radio Ad Hoc Networks

Channel handoff is a crucial function for Cognitive radio ad hoc networks (CRAHNs). The ab-sence of centralized infrastructures and the limited power make the handoff design more challenging. A learning-based interference-aware handoff scheme is proposed for distributed CRAHNs. We model the channel handoff pro-cess as a Partially observable Markov decision process (POMDP) and adopt a Q-learning algorithm to find an optimal handoff strategy in a long term. The proposed algorithm obtains an efficient transmission performance by considering the interferences among SUs and PUs. To achieve PU awareness, the handoff scheme predicts the PU activities by using the historical channel usage statistics. In addition, we also propose a refined channel selection rule to compromise between learning speed and cumulative trans-mission reward. The simulation results show that the pro-posed handoff scheme can adapt to the PU activities and achieves a better performance in terms of high throughput and low collisions. And the learning process keeps a consid-erable balance between convergence time and cumulative reward.     

认知网络中基于簇结构的拓扑形成算法

在多跳的认知无线网络中,网络的拓扑发现算法都必须极其灵活以适应于环境内频谱空洞的改变。研究了认知无线电网络的基本特点,结合Ad-hoc网络簇的概念,在得到认知设备的感知结果的基础上,提出了一种适合于认知无线电网络的有效的拓扑形成算法。在提出的算法中,将可用的频谱空洞信息和节点的能量信息综合考虑,是一个组合的优化算法。     

Transmission Range-Aware Clustering for Green Cognitive Radio Ad Hoc Networks

The absence of network infrastructure and opportunistic spectrum access in cognitive radio ad hoc networks (CRAHNs) results in connectivity and stability problems. Clustering is known as an effective technique to overcome this problem. Clustering improves network performance by implementing a logical network backbone. Therefore, how to efficiently construct this backbone among CRAHNs is of interest. In this paper, we propose a new clustering algorithm for CRAHNs. Moreover, we model a novel cluster head selection function based on the channel heterogeneity in term of transmission ranges. To the best of our knowledge, this is the first attempt to model the channel heterogeneity into the clustering formation in cognitive radio networks. Simulation results show that the performance of clustering is significantly improved by the channel heterogeneity considerations.     

A column generation method for spatial TDMA scheduling in ad hoc networks

An ad hoc network can be set up by a number of units without the need of any permanent infrastructure. Two units establish a communication link if the channel quality is sufficiently high. As not all pairs of units can establish direct links, traffic between two units may have to be relayed through other units. This is known as the multi-hop functionality. In military command and control systems, ad hoc networks are also referred to as multi-hop radio networks.

Spatial TDMA (STDMA) is a scheme for access control in ad hoc networks. STDMA improves TDMA by allowing simultaneous transmission of multiple units. In this paper, we study the optimization problem of STDMA scheduling, where the objective is to find minimum-length schedules. Previous work for this problem has focused on heuristics, whose performance is difficult to analyze when optimal solutions are not known. We develop novel mathematical programming formulations for this problem, and present a column generation solution method. Our numerical experiments show that the method generates a very tight bound to the optimal schedule length, and thereby enables optimal or near-optimal solutions. The column generation method can be used to provide benchmarks when evaluating STDMA scheduling algorithms. In particular, we use the bound obtained in the column generation method to evaluate a simple greedy algorithm that is suitable for distributed implementations.     

Graph cut based clustering for cognitive radio ad hoc networks without common control channels

Clustering is an efficient tool to improve the routing and data transmission performance in large scale networks. However, in cognitive radio ad hoc networks (CRAHNs), clustering design is challenging due to the dynamic spectrum access and the blind information environment. In this paper, we propose a novel distributed clustering algorithm for CRAHNs, where neither a dedicated common control channel (CCC) nor prior topology information is required. First, a neighbor discovery protocol without relying on CCC is proposed to construct the local topology. Then, we model the network as a undirected graph and formulate the clustering process as a graph cut problem. We design a mincut based heuristic algorithm to approximate the optimal clustering solution. After this, we also present a synchronize protocol to achieve the global consistency of cluster memberships. Finally, we propose a proactive cluster maintenance mechanism to reduce the interferences caused by PU activities. We validate our work through comparisons with other clustering methods. The simulation results show that, by adjusting the cluster structure according to the changing spectrum, the proposed method reduces the interference and improves the network efficiency.     

Ad hoc技术

Ad　hoc技术是从无线移动Ad　hoc网络(WMANET)抽象出来的一个一般性概念，该项技术所标称的是自组识、多跳的一个临时分布式系统，是一种网络构架技术。它要面临多项难题。本文就是从OSI模型的角度把Ad　hoc技术分层介绍，最后给出了一种WMANET应用方案。     

Improving handoff performance by utilizing ad hoc links in multi-hop cellular systems

Handoff performance is a critical issue for mobile users in wireless cellular networks, such as GSM networks, 3G networks, and next generation networks (NGNs). When ad hoc mode is introduced to cellular networks, multi-hop handoffs become inevitable, which brings in new challenging issues to network designers, such as how to reduce the call dropping rate, how to simplify the multi-hop handoff processes, and how to take more advantage of ad hoc mode for better resource management, and most of these issues have not been well addressed as yet. In this paper, we will address some of the issues and propose a scheme, Ad-hoc-Network–Embedded handoff Assisting Scheme (ANHOA), which utilizes the self-organizing feature of ad hoc networks to facilitate handoffs in cellular networks and provide an auxiliary way for mobile users to handoff across different cells. Moreover, we also propose a scheme enabling each BS to find the feasible minimum reservation for handoff calls based on the knowledge of adjacent cells’ traffic information. Due to the use of multi-hop connections, our scheme can apparently alleviate the reservation requirement and lower the call blocking rate while retaining higher spectrum efficiency. We further provide a framework for information exchange among adjacent cells, which can dynamically balance the load among cells. Through this study, we demonstrate how we can utilize ad hoc mode in cellular systems to significantly improve the handoff performance.