基于能量收集驱动和信道感知的CRN

针对能量采集器供电的认知无线电网络进行了研究。首先,在采用离散时间马尔可夫链的建模基础上,通过分析认知用户在收集到的能量包和电池容量的限制下有效地利用能量,以最大化当前时隙的吞吐量。然后,找到多个信道的最优感知顺序和对应于该感知顺序下信道的最优传输能量集,得到使认知无线电网络在多个时隙的预期吞吐量最大化的递归表达式。最后提出了一种基于该递归表达式实现最大化预期吞吐量的算法。仿真实验结果表明,所提出的方案相比于其他方案,不仅提高了认知无线电网络的吞吐量,而且降低了主信道上的平均碰撞比。     

一种基于无线电环境地图的路由优化机制

设计认知无线网络路由算法时,需要兼顾主用户保护与路由性能两个方面。为了提高认知无线网络中次用户之间路由的端到端性能,提出了基于无线电环境地图的路由优化机制,该机制中无线电环境地图能够为次用户提供主用户保护有关的无线电环境数据。首先,无线电环境地图根据次用户的数据请求将各授权频段的可用概率与功率控制相关信息反馈到该次用户;其次,次用户可以计算出与上一跳次用户之间的链路稳定性以及传输时延;最后,目的次用户通过计算每条路由的端到端吞吐量的期望值,然后选取期望值最大的一条路由。仿真结果表明,该路由机制在平均分组投递率、平均端到端吞吐量、平均端到端时延方面均优于对比路由算法。     

安全保障：无线Mesh网络中支持QoS的DSR路由协议的改进与实现

随着无线Mesh网络传输多媒体业务需求的增加,要求网络支持服务质量（QoS）,本文基于DSR协议设计了一个支持QoS的路由协议算法QDSR（QoS-DSR）。该算法保证了数据流的带宽、时延的QoS需求,根据路径跳数和节点拥塞情况定义路由代价函数,选择最优路径。仿真结果表明,与DSR相比,QDSR提高了网络吞吐量,降低了平均端到端延时,提高了网络利用率,更好地满足业务的QoS需求,并且具有更强的适用性和可扩展性。     

具有上下文认知的高能效多径路由算法研究

针对移动Ad Hoc网络终端能量资源受限对全网路由的影响,提出了一种基于上下文认知的高能效多径Ad Hoc网络路由算法.该算法面向Ad Hoc网络环境综合考虑节点的能耗、传输路径的能耗和多径路由选择等要素.经过NS2仿真实验并且与其他相关路由算法进行比较,结果表明在相同的实验环境下,该路由算法能够有效地节约能量,降低了端到端的时延,提高网络的吞吐量.     

移动自组网AOMDV协议应对衰落改进方案

在移动自组网中,信道条件直接决定了数据包传输的可靠性.为有效应对信道衰落,提出一种基于信道状态、可实时监控链路的路由方案来改进AOMDV协议.该方案在路由寻找过程中,以信道平均无衰时间（ANFD）作为路由度量来选择稳定的链路,并采用一种根据信道状态信息抢先切换的策略来维护连接的可靠性.仿真结果表明,通过该改进方案,AOMDV协议在网络吞吐量、平均端到端时延、路由控制开销和数据包投递率等性能上均有改善.     

基于模糊推理的认知无线Mesh网络路由算法

认知无线Mesh网络中的节点能动态接入空闲频谱,然而,频谱空穴的频繁变化将导致网络路径的破坏,使得网络性能下降.提出了基于模糊推理的认知无线Mesh网络路由算法,该算法利用模糊Petri网的推理机制计算可行路径的可靠度,最终选择可靠度最高的路径和信道.仿真结果表明,认知无线Mesh网络使用推理机制的路由算法能够增加所选路由的可靠度,减少网络路径破坏数,提高网络吞吐量.     

认知无线电网络中最优分组长度设计

为满足不同种类多媒体应用的服务质量需求,研究了一个多等级多信道认知无线电网络中的资源分配问题。根据时延和吞吐量为该网络模型定义一个效用函数并最大化这个效用函数的期望值。首先用不考虑传输功率分配的"浪费功率的方式"设计分组长度。然后在选择分组长度时考虑传输功率分配提出一种基于贪婪算法的改进方式,得到了最优分组长度和相应的传输功率。MATLAB的仿真结果表明,在传输功率受限下,当达到相同效用值时,改进方式和"浪费功率的方式"相比能减小传输功率,并取得更加合理的分组长度,而且能更好地满足带宽需求,这是由于改进方式不仅考虑了各个信道上数据包的到达时间间隔,还考虑了信道增益。     

认知中继网络中的信道分配方法研究

认知中继网络中,对信道进行分配可以有效地提高端到端吞吐量。对三节点认知中继网络下的信道分配进行了研究。中继节点采用解码转发协议时,提出了一种次优的分配方法,将信道按信道增益排序,然后逐个地分配中继信道。中继节点采用放大转发协议时,给出了最优的信道分配方法,提出了一种次优的信道分配方法。次优方法逐个地比较中继信道采用传统协作方式传输时的端到端吞吐量、分配为双跳信道S-R和R-D链路时的端到端吞吐量完成分配。和最优方法相比,两种次优方法以较小的性能损失换取了计算复杂度的降低。给出了数值仿真,比较了两种传输方式下的端到端吞吐量性能,验证了以上方法的有效性。通过对比仿真时间,比较了最优方法和次优方法的计算复杂度。给定信道总数,对次优方法下信道分配后的比例进行了仿真,发现待分配中继信道以1/3的比例分配为直传信道;而在放大转发下,待分配中继信道几乎不被分配为双跳信道。      

认知无线电网络中最稳定频谱分配算法

认知无线电网络中,主用户和认知用户的行为均会给认知节点间的频谱分配带来重大影响。在考虑认知用户间相互干扰时,提出了认知用户可用信道的潜在竞争节点数这一概念。在此基础上,将主用户对认知用户的影响考虑进去,定义了信道稳定度并将其作为衡量频谱质量的一个新的度量衡,以及给出了最稳定信道分配算法。性能评估的结果表明,最稳定信道分配算法可以有效的降低端到端平均时延以及显著的提高端到端吞吐量。     

分布式多网关无线mesh网公平协作路由算法

现有的协作路由协议不能公平地分配无线网络资源,无法满足网络最小流的吞吐量需求。将多并发流的协作路由问题形式化成一个最大化网络整体效用的凸优化问题,并基于对偶分解和子梯度,提出一种分布式的多网关无线mesh网公平协作路由算法FCRMG。实验结果表明,与基于期望传输时间的非协作路由和基于竞争感知的协作路由相比,FCRMG算法在保证网络吞吐量的前提下,能显著提高最小业务流的吞吐量。     

Stability-based routing,link scheduling and channel assignment in cognitive radio mobile ad-hoc networks

One fundamental issue in cognitive radio mobile ad hoc networks (CR-MANETs) is the selection of a stable path between any source and destination node to reduce the end-to-end delay and energy consumption arisen from route reconstruction. In this way, we analyse the link stability by calculating the link life time that is dependent on failures caused by secondary users’ (SUs) movements and primary users’ (PUs) activities. We propose a joint stability-based routing, link scheduling and channel assignment (SRLC) algorithm in CR-MANETs, which is benefited from considering the link life time, amount of interference imposed on PUs and energy consumption. The proposed algorithm selects a frequency channel/time slot in a way that channel utilization and previous behaviours of SUs and PUs, are taken into account. In the proposed SRLC, the concept of load balancing is applied by avoiding to route packets through SUs with insufficient energy. The effectiveness of the proposed algorithm is verified by evaluating the aggregate interference energy, end-to-end delay, goodput and the energy usage per packet transmission under three different scenarios. The results show our proposed scheme finds better routes compared to the recently proposed joint stable routing and channel assignment protocol.

     

MAC Protocol for Opportunistic Cognitive Radio Networks with Soft Guarantees

Cognitive radio (CR) is the key enabling technology for an efficient dynamic spectrum access. It aims at exploiting an underutilized licensed spectrum by enabling opportunistic communications for unlicensed users. In this work, we first develop a distributed cognitive radio MAC (COMAC) protocol that enables unlicensed users to dynamically utilize the spectrum while limiting the interference on primary (PR) users. The main novelty in COMAC lies in not assuming a predefined CR-to-PR power mask and not requiring active coordination with PR users. COMAC provides a statistical performance guarantee for PR users by limiting the fraction of the time during which the PR users' reception is negatively affected by CR transmissions. To provide such a guarantee, we develop probabilistic models for the PR-to-PR and the PR-to-CR interference under a Rayleigh fading channel model. From these models, we derive closed-form expressions for the mean and variance of interference. Empirical results show that the distribution of the interference is approximately lognormal. Based on the developed interference models, we derive a closed-form expression for the maximum allowable power for a CR transmission. We extend the min-hop routing to exploit the available channel information for improving the perceived throughput. Our simulation results indicate that COMAC satisfies its target soft guarantees under different traffic loads and arbitrary user deployment scenarios. Results also show that exploiting the available channel information for the routing decisions can improve the end-to-end throughput of the CR network (CRN).     

End-to-end throughput improvement for single radio multi-channel multi-path wireless mesh networks: a cross layer design

The distinguished feature of fixed backbone nodes in the wireless mesh networks (WMNs) can be utilized to design an efficient cross layer which cooperates routing and scheduling schemes for increasing end-to-end throughput. With only single radio nodes, by well designing the scheduling and routing schemes for multiple paths, we show that WMN can gain more throughput and reduce communication interference. Much of recent work has focused on those issues applied for “multi-channel, multi-path” environment using multi-radios that is costly and much more complex for implementation. Also, almost all of the proposals work on layer 2 or layer 3 separately that cannot support each other in performing efficiently. Instead, our paper introduces a cross-layer design with new routing algorithm that can balance the numbers of multi-paths and the needed transmission data in each communication session. We also propose a new channel scheduling and queuing models in MAC layer compatible with routing scheme and define a threshold with an effective algorithm to choose the optimal number of disjoint paths for routing scheme. The simulation results show that our multi-path routing scheme performs better than previous proposals in term of throughput improvement which can directly reduce the time of each communication session, especially in case of big size data transmission.     

Resource allocation in orthogonal frequency division multiple access‐based cognitive radio systems with minimum rate constraints

In this paper, resource allocation problem in orthogonal frequency division multiple access‐based cognitive radio (CR) systems to maintain minimum transmission rate constraints of CR users (CRUs) with the specified interference thresholds is investigated. Firstly, a single primary user (PU) CR system is considered, and a suboptimal resource allocation algorithm to maximize the sum transmission rate of all CRUs is proposed. Secondly, the single‐PU scenario is extended to multiple‐PU case, and an asymptotically optimal resource allocation algorithm is proposed using dual methods subject to constraints on both interference thresholds of PUs and total transmit power of all CRUs. Analysis and numerical results show that, in contrast to classical resource allocation algorithms, the proposed algorithm can achieve higher transmission rate and guarantee each CRU's minimum transmission rate in both scenarios. Copyright © 2012 John Wiley & Sons, Ltd.     

Cognitive radio intelligent-MAC (CR-i-MAC): channel-diverse contention free approach for spectrum management

Cognitive radio was introduced to fill up the imbalance between spectrum scarcity and spectrum underutilization. So to make such an ideology work, a network which can utilize all the available channel in the best efficient manner, without causing any harmful interface to primary user (PU) and maintaining the Quality of Service (QoS) for cognitive user (CU) is required. In both Mesh as well as ad-hoc networks, effective utilization of the white-spaces by the CUs maintaining the QoS for both primary and CU is a challenging task due to the frequent and instant change in their channel status. In this paper an intelligent-MAC (i-MAC) for cognitive radio (CR) using two transceivers based on hybrid approach of combination of cooperative decision and contention-free approach is proposed. Cooperative decision, to overcome hidden node or the case when there is no common channel between the CU’s and contention-free approach, to solve the issues in contention mechanism, where same channel is selected simultaneously by multiple CU’s. Proposed CR-i-MAC permits an effective dynamic spectrum access to CUs without effecting the QoS for PU’s. The simulative performance analysis of proposed CR-i-MAC is tested in various critical cases like multi-channel single-radio and multi-channel multi-radio over different on demand routing protocols like dynamic source routing, ad-hoc on demand distance vector and weighted cumulative expected transmission time using network simulator (NS-2). The performance of the network is measured on the basis of parameters like throughput, delay and interference. The analysis of the simulation results shows that the proposed CR-i-MAC outperforms various other CR MAC’s in terms of both increased throughput and reduced delays thereby making the system stable and efficient.     

A joint sensing and transmission power control policy for RF energy harvesting cognitive radio networks

We consider a radio frequency energy harvesting cognitive radio network in which a secondary user (SU) can opportunistically access channel to transmit packets or harvest radio frequency energy when the channel is idle or occupied by a primary user. The channel occupancy state and the channel fading state are both modeled as finite state Markov chains. At the beginning of each time slot, the SU should determine whether to harvest energy for future use or sense the primary channel to acquire the current channel occupancy state. It then needs to select an appropriate transmission power to execute the packet transmission or harvest energy if the channel is detected to be idle or busy, respectively. This sequential decision‐making, done to maximize the SU's expected throughput, requires to design a joint spectrum sensing and transmission power control policy based on the amount of stored energy, the retransmission index, and the belief on the channel state. We formulate this as a partially observable Markov decision process and use a computationally tractable point‐based value iteration algorithm. Section 5 illustrate the significant outperformance of the proposed optimal policy compared with the optimal fixed‐power policy and the greedy fixed‐power policy.     

Jointly optimal routing and scheduling in packet ratio networks

A multihop packet radio network is considered with a single traffic class and given end-to-end transmission requirements. A transmission schedule specifies at each time instant the set of links which are allowed to transmit. The purpose of a schedule is to prevent interference among transmissions from neighboring links. Given amounts of information are residing initially at a subset of the network nodes and must be delivered to a prespecified set of destination nodes. The transmission schedule that evacuates the network in minimum time is specified. The decomposition of the problem into a pure routing and a pure scheduling problem is crucial for the characterization of the optimal transmission schedule     

Improving Water-Filling Algorithm to Power Control Cognitive Radio System Based Upon Traffic Parameters and QoS

Cognitive radio scenario is based upon the ability to determine the radio transmission parameters from its surrounding environment. Power allocation in cognitive radio systems improves secondary network capacity subject to primary receiver interference level threshold. In this paper, statistical property of the injected interference power in primary user channel is used to establish the container bottom for each subcarrier employing water filling algorithm. In other words, the container bottom level of each subcarrier depends on the injected interference in primary user (PU) (most probably from the overloaded neighbor subcarriers). Traffic statistical parameters are also employed to formulate power allocation problem. Within this context, quality of service constraint is considered also to improve performance of power allocation algorithm. Simulation Results show that the injected interference in PU is decreased while the secondary user capacity improves. Indeed, the proposed algorithm is more compatible than a waterfilling algorithm with cognitive radio system constraints.     

Power-Efficient Spatial Reusable Channel Assignment Scheme in WLAN Mesh Networks

Interference has strong effect on the available bandwidth of wireless local area network (WLAN) based mesh networks. The channel assignment problem for multi-radio multi-channel multihop WLAN mesh networks is complex NP-hard, and channel assignment, routing and power control are tightly coupled. To mitigate the co-channel interference and improve capacity in multi-channel and multi-interface WLAN mesh networks, a power-efficient spatial reusable channel assignment scheme is proposed, which considers both channel diversity and spatial reusability to reduce co-channel interference by joint adjusting channel, transmission power and routing. In order to assign channel appropriately, an efficient power control scheme and a simple heuristic algorithm is introduced to achieve this objective, which adjust the channel and power level of each radio according to the current channel conditions so as to increase the opportunity of channel spatial reusability. The proposed channel assignment scheme also takes load, capacity and interference of links into consideration. Simulation results show the effectiveness of our approach and demonstrate that the proposed scheme can get better performance than other approaches in terms of throughput, blocking ratio, energy consumption and end-to-end delay.