In this letter, we propose a dissimilarity metric (DM) to measure the deviation of a cognitive radio from the network in terms of local sensing reports. Utilizing the probability mass function of the DM, we present a dissimilarity-based attacker detection algorithm to distinguish Byzantine attackers from honest users. The proposed algorithm is able to identify the attackers without a priori information of the attacking styles and is robust against both independent and dependent attacks.

This letter investigates the problem of distributed channel selection in cognitive radio ad hoc networks (CRAHNs) with heterogeneous spectrum opportunities. Firstly, we formulate this problem as a local congestion game, which is proved to be an exact potential game. Then, we propose a spatial best response dynamic (SBRD) to rapidly achieve Nash equilibrium via local information exchange. Moreover, the potential function of the game reflects the network collision level and can be used to achieve higher throughput.

With no need for Road Side Unit (RSU), multi-hop Vehicular Ad Hoc NETworks (VANETs) have drawn more and more attention recently. Considering the safety of vehicles, a Media Access Control (MAC) protocol for reliable transmission is critical for multi-hop VANETs. Most current works need RSU to handle the collisions brought by hidden-terminal problem and the mobility of vehicles. In this paper, we proposed RV-MAC, which is a reliable MAC protocol for multi-hop VANETs based on Time Division Multiple Access (TDMA). First, to address the hidden-terminal under the networks with multi-hop topology, we design a region marking scheme to divide vehicles into different regions. Then a collisions avoidance scheme is proposed to handle the collisions owing to channel competition and the mobility of vehicles. Simulation results show that compared with other protocol, RV-MAC can decrease contention collisions by 30% and encounter collisions by 50% respectively. As a result, RV-MAC achieves higher throughput and lower network delay.

In a periodic spectrum sensing framework where each frame consists of a sensing block and a data transmitting block, increasing sensing duration decreases the probabilities of both missed opportunity and interference with primary users, but increasing sensing duration also decreases the energy efficiency and the transmitting efficiency of the cognitive network. Therefore, the sensing duration to use is a trade-off between sensing performance and system efficiencies. The relationships between sensing duration and state transition probability are analyzed firstly, when the licensed channel stays in the idle and busy states respectively. Then a state transition probability based sensing duration optimization algorithm is proposed, which can dynamically optimize the sensing duration of each frame in the current idle/busy state by predicting each frame's state transition probability at the beginning of the current state. Analysis and simulation results reveal that the time-varying optimal sensing duration increases as the state transition probability increases and compared to the existing method, the proposed algorithm can use as little sensing duration in each frame as possible to satisfy the sensing performance constraints so as to maximize the energy and transmitting efficiencies of the cognitive networks.

We investigate the problem of joint frequency and power allocation in wireless mesh networks, using a self-pricing game based solution. In traditional pricing game models, the price factor is determined from the global information of the network, which causes heavy communication overhead. To overcome this problem, we propose a self-pricing game model, in which the price factor is determined by the distributed access points processing their individual information; moreover, it is implemented in an autonomous and distributed fashion. The existence and the efficiency of Nash equilibrium (NE) of the proposed game are studied. It is shown that the proposed game based solution achieves near cooperative network throughput while it reduces the communication overhead significantly. Also, a forcing convergence algorithm is proposed to counter the vibration of channel selection. Simulation results verify the effectiveness and robustness of the proposed scheme.

This letter proposes a novel connected dominanting set based decentralized cooperative spectrum sensing algorithm for cognitive radio networks. It is analytically shown that the proposed algorithm distributively converges to the average consensus as that of traditional distributed consensus algorithm, while reducing both the convergence time and message complexity significantly.

As a key technology for 5G and beyond, Multi-User Multi-Input Multi-Output (MU-MIMO) can achieve Gbps downlink rate by allowing concurrent transmission from one Access Point (AP) to multiple users. However, the huge overhead of full CSI feedback may overwhelm the gain yielded by beamforming. Although there have been many works on compress CSI to reduce the feedback overhead, the performance of beamforming may decrease because the accuracy of channel state degrades. To address the tradeoff between feedback overhead and accuracy, we present a two-stage Multipath Profile based Feedback protocol (MPF). In the first stage, compared with CSI feedback, the channel state is represented by multipath profile which has a smaller size but is accurate enough for user selection. Meanwhile, we propose an implicit polling scheme to decrease the feedback further. In the second stage, only the selected users send their CSI information to the AP to guarantee the low overhead and accuracy of steering matrix calculation. We implement and evaluate MPF with USRP N210. Experiments show that MPF can outperform alternative schemes in a variety of radio environments.

In this letter, we focus on the spectrum sharing cognitive radio system, wherein a single-input multi-output cognitive fading channel is considered. Subject to the joint average interference constraint and peak interference constraint at the primary receiver, the outage capacity of the cognitive channel involving joint beamforming and power control is analyzed. We derive the optimal beamforming and power control strategy and deduce the closed-form expression for the outage capacity under Rayleigh fading model, the functional regions of two kinds of interference constraints are discussed as well. Furthermore, considering zero-outage transmission, we investigate the delay-limited capacity and introduce a new concept called the zero-outage average interference wall. Extensive simulations corroborate our theoretical results.