认知无线网络随机接入MAC协议建模与性能分析

该文采用马尔科夫链构建了认知无线网络随机接入MAC协议的数学模型,提出了一种协议分析的理论方案。该方案建立了信道的三状态马尔科夫链模型,通过引入授权信道限制率和稳态可用授权信道数的概念,解决了信道状态时变特性给理论分析带来的挑战;建立了基于离散2维马尔科夫链的信道协商模型,并考虑控制信道容量限制等约束条件,给出了协议饱和吞吐量的理论分析算法。仿真验证了所提方案的有效性,分析了协议性能与网络参数之间的数值关系。     

星形无线网络专用MAC协议SNS-MAC

通过对现有几种流行的MAC的协议进行分析总结,提出一种旨在最大限度提高能量效率的星形网络专用MAC协议——SNS MAC协议,使无线网络在工业现场中能够延长寿命,更大地发挥其作用.     

同构及异构认知无线网络中多信道MAC协议探讨

认知无线网络是一个能检测当前网络条件,并据此进行规划、调整并采取适当行动的网络。文章重点分析了同构认知无线网络环境下的载波侦听多址接入(Carrier Sense Multiple Access,CSMA)方案,并在此基础上,提出了异构认知无线网络环境下的p-选择型CSMA方案。     

基于信道状态感知的多信道认知多址接入协议

摘 要：针对多信道认知无线网络中预约信道与多个数据传输信道的状态不一致会降低认知多址协议性能的问题,提出了基于数据信道状态感知的多信道认知多址协议——CAM-MAC协议。该协议在预约信道上优化握手机制来减少平均成功预约时长;而在Nakagami衰落数传信道上采用跨层方法设计了基于瞬时SNR的自适应传输机制来提高数据传输速率。通过上述机制,CAM-MAC协议可以有效提升系统性能。分析与仿真均表明：该协议在饱和吞吐量上有较大提升,在特定场景下可提高约50%。     

异构无线网络中基于马尔可夫决策过程的区分业务接纳控制的研究

对异构无线网络中区分业务类型的接纳控制机制进行研究.分析了语音和数据2种典型业务在CDMA蜂窝网络和WLAN中的容量区域.基于马尔可夫决策过程理论,提出异构无线网络中区分业务类型的接纳控制理论模型,规定了不同类型业务的接纳控制行为并推导了系统状态转移概率.而且,进一步从用户角度对不同类型业务QoS要求和网络状态之间关系进行分析,提出一种基于模糊逻辑的接纳效用评估机制,在保证各类业务接入和切换成功率的基础上,推导出接纳效用最大的最优接纳控制策略.仿真表明,基于模糊逻辑的接纳效用评估能够有效反映网络状态动态变化对接纳控制的影响,最优接纳控制策略在平均接纳效用方面明显优于不考虑业务区分和用户移动性2种接纳控制机制,并且能严格保证各类业务的接入和切换成功率.     

面向实时业务的认知无线网络 MAC 层频谱接入方案

摘 要：为满足认知无线网络中宽带业务实时传输的需求,提出低延迟的MAC层频谱接入方案,包括频谱感知调度与信道接入竞争两部分。在频谱感知阶段,认知用户选取最佳可用信道数实现感知与传输的延迟最小化;在信道接入竞争阶段,协议考虑频谱资源动态变化的特点,通过设计数据帧格式以及邻居节点协同侦听机制,减小信道冲突与“聋终端”的影响。理论与实验结果表明,与传统的认知无线网络MAC层协议相比,提出的接入方案数据传输延迟更短,同时在授权信道空闲率较大时吞吐量性能略优。     

基于业务认知的多用户带宽分配方法

无线局域网的MAC协议难以兼顾多用户差别的业务需求和网络吞吐量的有效性。建立具有超帧结构的带宽分配模型和具有惩罚函数的优化目标,计算满足单用户QoS需求的最小带宽,进而提出基于业务认知的多用户带宽分配算法(TCBAA)。该算法优先满足用户QoS要求,其次最大化系统的吞吐量。理论和仿真实验显示:相比于固定分配机制和最大吞吐量分配机制,TCBAA能够在有限带宽下满足更多用户的QoS需求。     

多跳无线网络MAC协议的研究进展

该文简要介绍了多跳无线网络的结构及其MAC协议的分类,简述了近几年来国内外对多跳无线网络MAC协议研究的几个新进展。这些协议均有各自的特点,适用于不同种类的无线网络。最后展望了多跳无线网络MAC协议的发展前景。     

协同认知无线网络中自适应中继节点选择算法

最优停止规则算法的优点是避免主用户考察所有次用户,使主用户能在较短观测时间内挑选出满足通信服务质量的中继节点。但存在些许不足之处,如仅考虑了单次协同通信情况,没有充分利用历史中继节点选择信息。为了克服上述缺点,需要优化该算法的性能,通过引入反馈机制,提出了自适应中继节点选择算法,在每次中继节点选择结束后更新信息库中次用户中继概率,主用户从中继概率高的次用户开始观测。研究结果表明:自适应中继节点选择算法的效率要比最优停止规则算法高;该算法可进一步减少观测次数,降低系统的传输时延和观测能耗,提高主用户的平均吞吐率。     

认知无线网络中一种新的频谱共享方法

频谱共享是认知无线网络关键技术之一。为消除认知无线网络中频率选择性信道下授权主用户与认知用户间的相互干扰,本文提出了一种新的频谱共享方法。该方法充分利用了无线通信系统中由信道的频率选择性衰落导致的不同用户信道的不相关性,通过求解矩阵方程获得预处理矩阵的通解,并在主用户和认知用户发射端分别进行预处理。从而实现认知系统中主用户与认知用户之间的相互零干扰,并使每个用户都可有效地传输数据。理论推导及系统仿真均表明,新方法可以有效地消除授权主用户与认知用户之间的双向干扰,实现不同用户平等地共享无线频谱资源。新方法可以提高频谱的利用率,一定程度上缓解无线频谱资源在当前及未来无线通信领域日益紧缺的矛盾。而且新方法也同样适用于不同认知用户之间共享频谱。      

An efficient and adaptive channel handover procedure for cognitive radio networks

In designing cognitive radio systems, one of the most critical issues is handling the channel handover process (CHP). The CHP consists of spectrum sensing, spectrum decision, negotiation on the common control channel, and adjustment of frequency and modulation settings, and such, it can be a time‐consuming process. Consequently, initiating the CHP after each detected user activity (UA) can decrease the aggregate spectrum utilization. To alleviate this problem, we introduce a novel handover strategy to find the optimal trade‐off between the durations of the CHP and UAs. With the use this model, secondary users (SUs) track only local information on their current data channel to make the decision to initiate the CHP or to wait for the termination of the ongoing UA. The system adapts to the dynamic conditions of the data channels and reduces the frequency of handovers to increase throughput and decrease access delay. We give analytical utilization bounds for SUs and also compare the performance of our model to those of other channel handover strategies by using extensive simulations. Our results for channels with heterogeneous loads and dynamic environments show that this model can clearly decrease the frequency of handover and consequently increase the aggregate SU utilization. Copyright © 2013 John Wiley & Sons, Ltd.     

ATMAC: adaptive token‐based medium access control protocol for cognitive radio wireless mesh network

In next generation wireless communication, cognitive radio technology facilitates to utilize underutilized licensed frequency bands that help to enhance the spectrum utilization. Cognitive radio wireless mesh network (CRWMN) is a promising and reliable technology to experience high throughput with low cost. Existing IEEE 802.11 based medium access control (MAC) protocols offer high data rates with decreasing efficiency at the MAC layer. Hence, most of the researchers applied aggregation mechanisms to provide the solution to bandwidth craving applications. In CRWMN, MAC design is significant because stability, efficient resource utilization, and scalability are predominating problems; however, the specified MAC issues are not yet resolved. The proposed MAC is novel, which aims to ensure reliability and scalability for CRWMN. The common control channel is used to exchange handshaking frames between the transmitter and receiver. It helps us to schedule the data transmission as well as reserve the channel in a discrete time interval. It introduces a token‐based channel accessing mechanism with resource‐aware channel assignment, which resolves the problems of efficiency and stability. The proposed MAC simulated using the network simulator (ns‐2), and the simulation results demonstrate that the proposed protocol improved the performance compared with the existing protocols.     

An auction‐based MAC protocol for cognitive radio networks

Cognitive radio and dynamic spectrum sharing systems use innovative spectrum management techniques that allow different systems to share the same frequency band to utilize the radio spectrum in an efficient way. In this paper, we propose a novel cognitive media access control protocol for cognitive radio networks under the property‐rights model, in which secondary users are divided into several nonoverlapping groups, and each group uses the proposed auction algorithm to bid for required channels from the auctioneer appointed by primary users. Simulations indicate that our proposed media access control protocol can effectively utilize spectrum resources, achieve high system efficiency, and guarantee the fairness of channel allocation among groups. Copyright © 2011 John Wiley & Sons, Ltd.     

Cluster‐based adaptive multispectrum sensing and access in cognitive radio networks

Spectrum sensing and access have been widely investigated in cognitive radio network for the secondary users to efficiently utilize and share the spectrum licensed by the primary user. We propose a cluster‐based adaptive multispectrum sensing and access strategy, in which the secondary users seeking to access the channel can select a set of channels to sense and access with adaptive sensing time. Specifically, the spectrum sensing and access problem is formulated into an optimization problem, which maximizes the utility of the secondary users and ensures sufficient protection of the primary users and the transmitting secondary users from unacceptable interference. Moreover, we explicitly calculate the expected number of channels that are detected to be idle, or being occupied by the primary users, or being occupied by the transmitting secondary users. Spectrum sharing with the primary and transmitting secondary users is accomplished by adapting the transmission power to keep the interference to an acceptable level. Simulation results demonstrate the effectiveness of our proposed sensing and access strategy as well as its advantage over conventional sensing and access methods in terms of improving the achieved throughput and keeping the sensing overhead low. Copyright © 2012 John Wiley & Sons, Ltd.     

DCR‐MAC: distributed cognitive radio MAC protocol for wireless ad hoc networks

The MAC protocol for a cognitive radio network should allow access to unused spectrum holes without (or with minimal) interference to incumbent system devices. To achieve this main goal, in this paper a distributed cognitive radio MAC (DCR‐MAC) protocol is proposed for wireless ad hoc networks that provides for the detection and protection of incumbent systems around the communication pair. DCR‐MAC operates over a separate common control channel and multiple data channels; hence, it is able to deal with dynamics of resource availability effectively in cognitive networks. A new type of hidden node problem is introduced that focuses on possible signal collisions between incumbent devices and cognitive radio ad hoc devices. To this end, a simple and efficient sensing information exchange mechanism between neighbor nodes with little overhead is proposed. In DCR‐MAC, each ad hoc node maintains a channel status table with explicit and implicit channel sensing methods. Before a data transmission, to select an optimal data channel, a reactive neighbor information exchange is carried out. Simulation results show that the proposed distributed cognitive radio MAC protocol can greatly reduce interference to the neighbor incumbent devices. A higher number of neighbor nodes leads to better protection of incumbent devices. Copyright © 2008 John Wiley & Sons, Ltd.     

基于最优停止的认知无线网络下行频谱接入算法

为有效平衡认知无线网络中次用户系统中接入信道的感知时间和信道总的吞吐量之间的矛盾,提出了一种只对部分信道进行感知的频谱接入策略,联合总的感知信道数和各条信道的感知时间进行优化,并通过最优停止算法求解,在最大化节省感知时间的同时,取得较大的平均吞吐量。与HC-MAC(Hardware Constrained- Media Access Control)算法的仿真分析对比表明,该算法在相同给定条件下感知时间更短,吞吐量更大,具有明显的优势。     

Cross‐layer perspective for channel assignment in cognitive radio networks: A survey

With the advent of various emerging wireless products, the usage of limited spectrum has grown exponentially in the recent years. In the next few years, that mobile data traffic globally is expected to grow up to 50 EB/month, which is nearly a five times increase over year 2018. Therefore, it will become extremely difficult to satisfy the ever increasing demand through the current fixed spectrum assignment policy in which spectrum band is exclusively used for the particular applications, and it has also led to underutilization of a significant portion of the spectrum (like TV bands). Cognitive radio networks has emerged as a possible solution for the problem which makes dynamic spectrum access possible for unlicensed user when licensed user is not active. Among various operations of cognitive radio, channel assignment to the unlicensed user is very important. Further, wireless regional area network is one of the most important application of cognitive radio, which provides wireless broadband to the rural area using vacant TV channels. This paper discusses channel assignment techniques considering various functionalities for cognitive radio networks in respect of wireless regional area network in the existing literature. Initially, a comprehensive introduction to both cognitive radio networks and wireless regional area networks is provided, and in the end, the paper summarizes the various issues and research challenges in the channel assignment for wireless regional area networks.     

Securing cognitive radio networks

Cognitive radio is a promising technology aiming to improve the utilization of the radio electromagnetic spectrum. A cognitive radio device uses general purpose computer processors that run radio applications software to perform signal processing. The use of this software enables the device to sense and understand its environment and actively change its mode of operation based on its observations. Unfortunately, this solution entails new security challenges. Our objective in this paper is to analyze the security issues of the main recent developments and architectures of cognitive radio networks. We present vulnerabilities inherent to those systems, identify novel types of abuse, classify attacks, and analyze their impact on the operation of cognitive radio‐based systems. Moreover, we discuss and propose security solutions to mitigate such threats. Copyright © 2010 John Wiley & Sons, Ltd.     

Scheduling and routing methods for cognitive radio sensor networks in regular topology

Wireless sensor network of regular topology is efficient in area covering and targets locating. However, communications with fixed channels lead to low spectrum efficiency and high probability of conflicts. This paper proposes economical timeslots‐and‐channels allocation methods for scheduling links in square, triangle, and hexagon lattice topologies. Based on these scheduling methods in square lattice, the authors explore routing methods for load balance and delay minimization, respectively, and compare their effects on transmission delay and energy consumption. The OMNet++‐based simulation for square lattice verified the effectiveness of scheduling methods for improving network throughput and made performance comparison among different scheduling methods. It also proved that delay minimization‐oriented routing helps to reduce the energy consumption for node standing by and load balance‐oriented routing helps to reduce the energy consumption for packets transmission. However, there is trade‐off between the reductions of the two types of energy consumptions. The authors further propose the idea of hybrid routing with the two aforementioned routing methods for reducing overall energy consumption and explore the challenges and countermeasures for hybrid routing optimization. Copyright © 2014 John Wiley & Sons, Ltd.