Search

This paper studies the secure transmission in a multiuser broadcast channel where only the statistical channel state information of the eavesdropper is available. We propose to apply secret dirty-paper coding (S-DPC) in this scenario to support the secure transmission of one user and the normal (unclassified) transmission of the other users. By adopting the S-DPC and encoding the secret message in the first place, all the information-bearing signals of the normal transmission are treated as noise by potential eavesdroppers and thus provide secrecy for the secure transmission. In this way, the proposed approach exploits the intrinsic secrecy of multiuser broadcasting and can serve as an energy-efficient alternative to the traditional artificial noise (AN) scheme. To evaluate the secrecy performance of this approach and compare it with the AN scheme, we propose two S-DPC-based secure transmission schemes for maximizing the secrecy rate under constraints on the secrecy outage probability (SOP) and the normal transmission rates. The first scheme directly optimizes the covariance matrices of the transmit signals, and a novel approximation of the intractable SOP constraint is derived to facilitate the optimization. The second scheme combines zero-forcing dirty-paper coding and AN, and the optimization involves only power allocation. We establish efficient numerical algorithms to solve the optimization problems for both schemes. Theoretical and simulation results confirm that, in addition to supporting the normal transmission, the achievable secrecy rates of the proposed schemes can be close to that of the traditional AN scheme, which supports only the secure transmission of one user. [ABSTRACT FROM PUBLISHER]

The critical nature of vehicular communications requires their extensive testing and evaluation. Analytical models can represent an attractive and cost-effective approach for such evaluation if they can adequately model all underlying effects that impact the performance of vehicular communications. Several analytical models have been proposed to date to model vehicular communications based on the IEEE 802.11p (or DSRC) standard. However, existing models normally model in detail the MAC (Medium Access Control), and generally simplify the propagation and interference effects. This reduces their value as an alternative to evaluate the performance of vehicular communications. This paper addresses this gap, and presents new analytical models that accurately model the performance of vehicle-to-vehicle communications based on the IEEE 802.11p standard. The models jointly account for a detailed modeling of the propagation and interference effects, as well as the impact of the hidden terminal problem. The model quantifies the PDR (Packet Delivery Ratio) as a function of the distance between transmitter and receiver. The paper also presents new analytical models to quantify the probability of the four different types of packet errors in IEEE 802.11p. In addition, the paper presents the first analytical model capable to accurately estimate the Channel Busy Ratio (CBR) metric even under high channel load levels. All the analytical models are validated by means of simulation for a wide range of parameters, including traffic densities, packet transmission frequencies, transmission power levels, data rates and packet sizes. An implementation of the models is provided openly to facilitate their use by the community. [ABSTRACT FROM AUTHOR]

This paper presents a multiple-input–multiple-output (MIMO) precoder with a compensated QR decomposition (CQRD) combination for coordinated multipoint (CoMP) downlink transmission. Unlike conventional QR decomposition (QRD) combination, CQRD combination adopts compensated channel matrix orderings. This paper first proposes CQRD combination for CoMP scenarios. The statistics for combined spatial subchannel gains with a CQRD combination of two coordinated base stations (BSs) are derived, and these statistics show that more balanced subchannel gains are generated with a CQRD combination than with a QRD combination. Furthermore, this paper proposes a generalized CQRD combination scheme with a joint sorting strategy that can be applied to scenarios with more than two coordinated BSs. Unlike the unsorted strategy, the joint sorting strategy determines an enhanced compensated combination to further increase spatial subchannel gains; therefore, the performance can be upgraded. Because conventional Tomlinson–Harashima precoding (THP) cannot be used in the CQRD combination, interference presubtraction and vector precoding (VP) is adopted. Theoretical analysis and simulation results are both provided to demonstrate the advantages of balanced spatial subchannel gains and enhanced bit-error-rate (BER) performance in the proposed CQRD-based schemes. Compared with existing QRD-based MIMO precoders in CoMP scenarios, the proposed CQRD-based schemes have substantial signal-to-noise ratio (SNR) improvements of 2–5 dB. [ABSTRACT FROM PUBLISHER]

Two-path relay networks can be deployed to achieve full-rate transmissions. In this paper, we introduce stable throughput analysis into decode-and-forward (DF) two-path relay networks. We establish the queueing model and take outage probabilities into consideration to characterize the packet-level cooperation and derive the closed-form stable throughput region. Based on the stable throughput region, we also propose a power-allocation scheme between the source node and relays to maximize the achievable packet rate. The maximal achievable packet rate determines the admission control of certain cooperation (i.e., when to cooperate) under a specific interrelay interference (IRI) cancellation technique. The power allocation is utilized to illustrate how to cooperate between the source node and relays. Three IRI responses are considered, and the system behaviors under various circumstances are presented through simulations. [ABSTRACT FROM AUTHOR]

Within the scenario of the proliferation of smart vehicles, a novel tendency is to exploit the cooperation between vehicles to create vehicular ad hoc networks (VANETs) using the IEEE 802.11p standard. IEEE 802.11p includes dedicated short-range communications (DSRC) between high-speed vehicles and between the vehicles and the roadside infrastructure in the licensed intelligent transportation system (ITS) band at 5.9 GHz. At such frequencies, fading problems caused by the Doppler effect and/or multipath adversely affect propagation, particularly in dense urban environments. To reduce such propagation impairments, the use of lower frequencies has been proposed in literature, namely the TV white spaces (TVWS) in the ultrahigh-frequency (UHF) band. TVWS is the part of the spectrum licensed to broadcasters that is not occupied at a given time in a given geographical area on a noninterfering/nonprotected basis with regard to primary services. This paper analyses coexistence issues between digital video broadcasting—terrestrial (DVB-T)2 and IEEE 802.11p transmission in the TVWS. The aim of this paper is twofold: to evaluate the protection of DVB-T2 broadcasting services interfered by IEEE 802.11p communications and the impact of adjacent DVB-T2 services on IEEE 802.11p communications in the TVWS. The main outcomes of this paper are the maximum transmission power level and bandwidth configuration of an 802.11p signal in the adjacent channel (i.e., TVWS) of an active DVB-T2 system while protecting the broadcast service, as well as the error rate curves for each allowed mode of IEEE 802.11p in the TVWS to evaluate the performance of VANETs communications coexisting with DVB-T2 regular services in the licensed TV band. [ABSTRACT FROM AUTHOR]

This paper explores the feasibility and scope of co-channel coexistence between a low data rate Orthogonal Frequency Division Multiplexing (OFDM) secondary network and a digital television (DTV) broadcast network operating in the same area. Since DTV receivers do not transmit, neither the presence nor the impact of interference from the secondary network on these DTV receivers can be known. Consequently, conventional spectrum sensing techniques cannot be employed effectively. This paper proposes to compensate the lack of feedback by combining the available information about population distribution in the region - ranging from coarse population density estimates to accurate geospatial maps - with better estimation of interference using a data-driven technique called Ordinary Kriging. Radio Environment Maps constructed using the Kriging method from field-reported observations from the secondary nodes are used to obtain better accuracy than the conventional statistical models. The estimates are then used to compute communication parameters for each secondary link in terms of power, number of active subcarriers, and active time slots, while keeping the average interference in the DTV network within threshold bounds. Thus, the viability of such co-channel license-exempt operation of secondary networks in the DTV black and grey spaces for low data rate applications in densely populated urban areas and higher data rate capabilities for sparsely populated rural areas is established. [ABSTRACT FROM AUTHOR]

In this paper, the scaling law of the network throughput of a special type of heterogeneous networks is studied, where a secondary network composed of cognitive users shares the same resources opportunistically with a primary network of licensed users. Some pioneering works in this area showed that this type of heterogeneous networks performs as well as two stand-alone networks under the dense network model. A key assumption behind this conclusion is that the density of the secondary network is higher than that of the primary network in the order sense, which essentially decouples the two overlaid networks as the secondary network dominates asymptotically. In this paper, we endeavor to investigate this problem with a weaker condition that the dimensions of the two overlaid networks are on the same order, under the extended network model. Our analysis shows that, with the ratio of the two network sizes larger than a threshold, this weaker (and arguably more practical) condition does not degrade either network throughput scaling. Our result further reveals the potential of cognitive radio (CR) technology in real applications. [ABSTRACT FROM PUBLISHER]

This paper investigates collaborative spectrum sharing (CSS) for which a cognitive secondary transmitter acts as a decode-and-forward (DF) relay for two primary users (PUs) occupying an interfering multiple-access channel. PUs are assumed to send their signals simultaneously; hence, interference between the primary signals exists due to the multiple-access nature. The secondary user (SU) selects and forwards one of the PU's signals to a desired destination, and at the same time, the SU also transmits its own signal only if it is not harmful to PUs. The selection of a primary signal to relay is investigated, depending on SU's knowledge of two primary source–destination channels, for which closed-form outage probabilities for PUs and SU are provided accordingly. With the help of the closed-form PU's outage probability, an optimal selection strategy between the primary signals and an optimal power allocation between the primary and secondary signals are also obtained in closed form, which minimizes SU's outage probability while keeping the PU's outage performance at an SU-free level. Numerical investigation is used to verify and illustrate the analysis given in this paper. Numerical results also show that the SU's performance can vary significantly according to the amount of channel knowledge that the SU can have. [ABSTRACT FROM PUBLISHER]

In this paper, we propose an ergodic interference alignment (IA) method for interference elimination in spectrum sharing multiple-input multiple-output (MIMO) radar and multi-user MIMO communication systems. In existing ergodic IA methods, the channel state information (CSI) is generally assumed to be constant, but time-varying channels should be considered in practice. Differently, our proposed ergodic IA allows to time-varying and/or frequency selective channels for spectrum sharing radar-communication systems. The essence is equivalent to design a simple transmit beamforming, which helps to find a pair of desired complementary channels easily without long-time system delay, therefore, the interferences can be effectively cancelled. The proposed method is evaluated by generalized likelihood ratio test (GLRT) and signal to interference plus noise ratio (SINR) for the radar functionality, while the communication functionality is examined by bit error rate (BER) performance. Both theoretical analysis and simulation results validate that the effectiveness of the ergodic IA method for spectrum sharing radar-communication systems. [ABSTRACT FROM AUTHOR]

In this paper, the throughput maximization of millimeter-wave (mm-Wave) ultradense networks (UDN) using dynamic spectrum sharing (DSS) is considered. Most of the existing works only allow temporal-domain access and admit at most one user at each time slot, resulting in significant underutilization of spectrum resource, which will be less attractive to mm-wave UDN applications. A generalized temporal-spatial sharing scheme is proposed in this paper for UDN by exploiting the location information of incumbent devices, where multiple users are allowed to access each channel simultaneously via spatial separations. For distributed applications, the global information exchange among secondary users (SU) tends to be impractical, given the unaffordable signaling overhead and latency. Thus, a noncooperative game with fine-grained two-dimensional reuse is formulated, which leads to a more efficient access strategy. It is then proved to be an ordinary potential game (OPG), which guarantees the existence of the strategy Nash equilibrium (NE). Finally, an improved decentralized reinforcement learning algorithm is designed, with which SUs can learn from wireless environments and adapt toward an NE point, relying on the individual observation and the historical action reward (rather than the global information exchanging). The convergence efficiency of the new scheme is also rigorously proved. Numerical simulations are provided to validate the performances of the proposed schemes. [ABSTRACT FROM AUTHOR]

In this paper, we design receivers for filter bank multicarrier-based (FBMC-based) massive MIMO considering practical aspects such as channel estimation and equalization. In particular, we propose a spectrally efficient pilot structure and a channel estimation technique in the uplink to jointly estimate all the users’ channel impulse responses. We mathematically analyze our proposed channel estimator and find the statistics of the channel estimation errors. These statistics are incorporated into our proposed equalizers to deal with the imperfect channel state information (CSI) effect. We revisit the channel equalization problem for FBMC-based massive MIMO, address the shortcomings of the existing equalizers in the literature, and make them more applicable to practical scenarios. The proposed receiver in this paper consists of two stages. In the first stage, a linear combining of the received signals at the base station (BS) antennas provides a coarse channel equalization and removes any multiuser interference. In the second stage, a per subcarrier fractionally spaced equalizer (FSE) takes care of any residual distortion of the channel for the user of interest. We propose an FSE design based on the equivalent channel at the linear combiner output. This enables the applicability of our proposed technique to small and/or distributed antenna setups such as cell-free massive MIMO. Finally, the efficacy of the proposed techniques is corroborated through numerical analysis. [ABSTRACT FROM AUTHOR]

Interference alignment (IA) is a precoding technique that aligns interfering signals at receivers. It is known that IA achieves the maximum degrees of freedom over an interference channel under ideal assumptions. The real-world performance of IA depends on a range of practical issues, such as imperfect synchronization, channel estimation, and feedback. Practical issues have been studied in simulations and prototypes, but fully distributed operation of IA network nodes has not been considered. In this paper, we present the first investigation of real-time IA performance on a fully distributed 2 $\times$ 2 multiple-input–multiple-output (MIMO) prototype system with three physically independent user pairs. Over-the-air algorithms for time and frequency synchronization, as well as analog feedback, are studied and implemented. Sum rates are illustrated as a function of complexity and accuracy of different alignment, synchronization, and feedback algorithms. Corresponding tradeoffs are evaluated using an iterative IA method, the injection of residual frequency offset into synchronization, and analog versus quantization-based limited feedback approaches. We demonstrate that, while considering all possible error sources in estimation, synchronization, and feedback, the theoretical multiplexing gain of IA can be reached in practical systems with a constant sum rate loss that remains within 5 bits/Hz/s compared with an ideal simulation. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a channel transformation technique for joint decoding of desired and interfering signals in an interference alignment scenario consisting of $K$ users with multiple antennas. Our technique, i.e., pseudo-lattice treatment, is based on the compute-and-forward framework. Our technique can be implemented to provide decoding gains with low complexity for subspace aligned interference signals. We evaluate the performance of the system through simulations that show the performance gain attained by using our pseudo-lattice method over subspace decoding techniques for interference alignment in low- and medium-SNR conditions. [ABSTRACT FROM AUTHOR]

This paper studies the interference graph construction for device-to-device (D2D) communications in cellular networks and proposes an interference graph construction protocol. The proposed interference graph construction protocol consists of two stages, i.e., announcement and collision resolution, which are performed in an iterative manner. The announcement announces the existence of each D2D link to its neighbor area by broadcasting announce messages. The collision-resolution stage resolves the collisions that could occur during the announce stage by broadcasting response messages. The theoretical analysis of the proposed construction protocol is presented, and the convergence of the protocol to an actual interference graph is studied. The theoretical analysis is validated by simulation results, and the performance of the proposed protocol is analyzed. It is shown that, for a number of D2D links up to as large as 1000 links, only two to seven iterations are needed to complete the interference graph construction procedure. [ABSTRACT FROM AUTHOR]

The use of cyclic prefix (CP) allows all existing orthogonal frequency-division multiplexing or multiple access (OFDM/OFDMA) systems to realize high-data-rate transmission in frequency-selective fading channels at the expense of losses in spectrum efficiency, energy efficiency, and transmission rate (SET). This paper proposes a CP-free OFDM/OFDMA design. Unlike traditional OFDM/OFDMA systems, the proposed CP-free OFDM/OFDMA does not insert CPs between symbols at the transmitter side. The neighboring symbols in frequency-selective fading channels will be overlapped at a receiver, and decision feedback equalization (DFE) is performed before FFT operation for intersymbol interference (ISI) removal. After DFE, each symbol consists of multipath returns with different linear shifts (LSs), which may result in intercarrier interference (ICI). Therefore, the output symbols from the DFE will be sent to a CP restoration unit for LS-to-cyclic-shift (CS) conversion. We call this a CP-free OFDM/OFDMA system symbol CS equalizing OFDM/OFDMA (SCSE-OFDM/OFDMA), whose system design is introduced in detail in this paper. We will show that SCSE-OFDM/OFDMA offers a much higher SET than traditional OFDM/OFDMA systems in frequency-selective fading channels. [ABSTRACT FROM PUBLISHER]

This paper investigates a channel-coded multiuser system operated with orthogonal frequency-division multiplexing (OFDM) and interleaved-division multiple access (IDMA). In general, there are many variations to multiuser systems. Our choice of the combination of OFDM and IDMA is motivated by its ability to achieve multiuser diversity gain in frequency-selective multiple-access channels. To realize OFDM-IDMA, however, two challenges must be addressed. The first challenge is the estimation of multiple channel parameters, particularly how to contain the estimation errors of the channel parameters of the multiple users, considering that the overall estimation errors may increase with the number of users because the estimations of their channel parameters are intertwined with each other. The second challenge is that the transmitters of the multiple users may be driven by different radio-frequency oscillators. The associated frequency asynchrony may cause multiple carrier frequency offsets (CFOs) at the receiver. Compared with a single-user receiver where the single CFO can be compensated away at the receiver prior to channel decoding, a particular difficulty for a multiuser receiver is that it is not possible to compensate away all the multiple CFOs simultaneously. To tackle the two challenges, we put forth an integrated framework to solve the problems of multiuser channel-parameter estimation, CFO compensation, and channel decoding jointly and iteratively. The framework employs the space-alternating generalized expectation-maximization (SAGE) algorithm to decompose the multiuser problem into multiple single-user problems and the expectation-conditional maximization (ECM) algorithm to tackle each of the single-user subproblems. Iterative executions of SAGE and ECM in the framework allow the two aforementioned challenges to be tackled in an optimal manner. Simulation results indicate that, compared with other approaches, our approach can achieve significant bit-error-rate (BER) and mean-square-error (MSE) improvements. [ABSTRACT FROM PUBLISHER]

Device-to-device (D2D) communication permits direct communication between devices, thereby it provides performance gain for traditional cellular networks. In this paper, we investigate how to improve the performance of D2D communication while satisfying the delay constraint for practical applications. Closed-form expressions are derived for trade-offs among system performance, such as successful transmission probability, transmission capacity, delay constraint, and energy consumption. In addition, two schemes are proposed to improve the performance for D2D communication under a given delay constraint. First, an optimal transmission scheme is proposed in which the transmission of user equipment (UE) can be scheduled adaptively to have the best successful transmission probability, whereas the D2D link satisfies the delay constraint. Second, a delay assignment scheme is proposed in which delay is adaptively assigned for each hop to achieve the maximum capacity when the network employs multihop D2D communication. Simulation results show that the adaptive transmission scheme improves the successful transmission probability (e.g., increased by 13 times when the source density is \text10^-4) compared with the fixed-probability transmission scheme, although it can satisfy the delay constraints for different applications. Furthermore, compared with the fixed delay assignment scheme, the network capacity can be improved up to 50% by the proposed scheme with proper delay assignment for each hop. [ABSTRACT FROM AUTHOR]

In this paper, secure communication aided by a multiantenna cooperative jammer is investigated. Under very practical but adverse assumptions, i.e., no instantaneous jammer–eavesdropper channel state information (CSI) and imperfect instantaneous jammer–receiver CSI, the residual interference from the jammer to the legitimate receiver appears, even with spatial beamforming. Then, this paper analyzes the impact of imperfect CSI on the function of cooperative jamming and derives closed-form expressions of multiple secrecy performance metrics, including ergodic secrecy rate, secrecy outage capacity, and interception probability. Interestingly, it is found that two antennas at the jammer is always optimal. Furthermore, some insights are obtained through asymptotic analysis, e.g., the secrecy performance is saturated as the source transmit power increases, the ergodic secrecy rate is a linear function of CSI feedback bits in the region of high transmit power at the source/jammer, and interception probability is independent of transmit power at the source and is a decreasing function of transmit power at the jammer. Finally, theoretical claims are validated by simulation results. [ABSTRACT FROM PUBLISHER]

In this paper, we consider a general centralized feedback model for interference alignment (IA) algorithms of which precoders and decoders are designed with quantized channel state information (CSI) at a central unit and then fed back to corresponding transmitters and receivers via finite-rate links. The significant difference of this model from existing models is that all the realizations of channels, precoders, and decoders are fed back by finite rates. The signal-to-interference-plus-noise ratio (SINR) characteristic of this model is analyzed, which helps derive an upper bound of average throughput loss relative to perfect IA. The upper bound is shown to be tight by simulation, particularly in the high-feedback regime. Based on this result, the scaling laws of feedback bits for channels, precoding, and decoding vectors to obtain full degree of freedom are derived, which are backward compatible to the existing results for quantized CSI only or quantized precoder only. Simulation results show that the system is interference limited at a high signal-to-noise ratio (SNR) if the three scaling laws are not simultaneously satisfied, and the throughput performance is dominantly limited by the worst feedback links among the channels, precoders, and decoders. [ABSTRACT FROM PUBLISHER]

This paper investigates distributed beamforming networks composed of multiple groups of transmitters where each group consists of two transmitters. The goal is to jointly optimize the phase components at the transmitters and the orientation angles of the groups that maximize the radiated energy over an angular sector containing an adversary while placing a null towards the client in order not to obfuscate the client. Since the optimization problem is non-convex, it is intractable to obtain the optimal solution in closed-form. To this end, we propose a non-iterative closed-form solution by adopting a group-wise nullforming approach where each group independently creates a null to the client. The effectiveness of the proposed scheme is validated through numerical simulations. [ABSTRACT FROM AUTHOR]

In multi-user multiple-input–multiple-output (MU-MIMO) systems that employ pilot-symbol aided channel estimation, the pilot-to-data power ratio (PDPR) has a large impact on the system performance. In this paper, we consider the problem of setting the PDPR in multi-cell MU-MIMO systems in the presence of channel estimation errors, intercell interference and pilot contamination. To analyze and address this problem, we first develop a model of the multi-cell MU-MIMO system and derive a closed-form expression for the mean squared error of the uplink received data symbols. Building on this result, we then propose two decentralized PDPR-setting algorithms based on game theoretic approaches that are applicable in multi-cell systems. We find that both algorithms converge to a Nash equilibrium and provide performance improvements over systems that do not properly set the PDPR, while they maintain different levels of fairness. [ABSTRACT FROM AUTHOR]

In this paper, we propose regularized block diagonalization (RBD) precoding using artificial noise (AN) for physical layer security in downlink multi-user MIMO wireless networks. We derive secrecy sum rate and asymptotic secrecy sum rate for the proposed scheme. The optimum power allocation for legitimate users and the AN signal are derived in closed form for optimal asymptotic secrecy sum rate. Our analysis shows that to achieve best performance, it is more efficient to degrade the performance of the eavesdropper than improving legitimate users’ rates. We also study the impact of error in channel estimation on the system and derive closed-form SINR and secrecy sum-rate expressions for this case. Simulations show that the secrecy sum rate of RBD precoding outperforms the secrecy sum rate of regularized channel inversion by 0.5 bits/s/Hz. We also show that in the presence of channel estimation error, our approximate closed forms for secrecy sum rate are very closed to the actual secrecy sum rate over a wide range of SNR and channel estimation error values. [ABSTRACT FROM AUTHOR]

In this paper, a new transmission scheme, signal space cognitive cooperation, is introduced by applying the idea of signal space diversity in an underlay spectrum sharing decode-and-forward multirelay cooperative network. In the proposed structure, the secondary source signal is rotated by a certain angle and then the source and the secondary best relay transmit the in-phase and the quadrature components of the rotated signal. As a consequence, two source signals, rather than one, are transmitted in two-time slots which improves data rates considerably, compared to the conventional cognitive cooperative schemes. In this paper, proactive relaying mode is used in which the best relay is selected based on the max–min selection criterion before executing the transmission. Considering both statistical and the instantaneous channel state information of the feedback channel between the primary receiver and the secondary network, two power allocation methods are adopted at the source. For both methods, closed-form expressions of error probability are derived. Moreover, asymptotic analysis is performed and diversity gain is obtained to provide further insights about the system performance. Finally, analytical expressions are verified by Monte Carlo simulations. [ABSTRACT FROM AUTHOR]

In the presence of perfect channel state information (CSI), the achievable degrees of freedom (DoF) in wireless interference networks can be linearly scaled up with the number of users. Achievability is based on the idea of interference alignment (IA). However, in the presence of imperfect CSI, the sum rate becomes degraded, and full DoF may no longer be achievable. In this paper, we propose novel least squares (LS)- and minimum mean square error (MMSE)-based IA schemes that adaptively design beamformers by relying on the availability of imperfect CSI and knowledge of the channel estimation error variance in advance. Interestingly and unlike the other robust algorithms, the proposed adaptive schemes do not impose extra computational complexity compared to their nonadaptive counterparts. It is shown that the LS-based IA is able to outperform interference leakage minimization algorithms under both perfect and imperfect CSI. Furthermore, we compare the performance of the proposed MMSE-based IA with maximum signal-to-interference-plus-noise ratio (Max-SINR) algorithm. We show that while under perfect CSI, the MMSE-based IA achieves the same performance as that of Max-SINR, the former outperforms the latter under CSI mismatch. Meanwhile, it is shown that the proposed MMSE-based IA needs less CSI to be available and has less computational complexity compared to Max-SINR. [ABSTRACT FROM PUBLISHER]

Recently, multiple concurrent transmission techniques have been proposed for smartly exploiting interference to improve network throughput. This paper considers zero-forcing (ZF) precoding that allows two interfering links to concurrently transmit under certain situations. This paper focuses on identifying appropriate schedule schemes that efficiently utilize the ZF precoding opportunities to improve network throughput. With this motivation, we define novel link models to formulate our concerned problem. We also develop a distributed scheduling algorithm by using belief propagation. Finally, we conduct extensive simulation experiments to evaluate the efficiency of ZF in improving network throughput in multihop wireless networks. Our simulations confirm that intelligently utilizing ZF in multihop networks is very effective in improving throughput. [ABSTRACT FROM PUBLISHER]

The millimeter wave (mmWave) communication has drawn intensive attention with abundant band resources. In this paper, we consider the popular content distribution (PCD) problem in the mmWave vehicular network. In order to offload the communication burden of base stations (BSs), vehicle-to-vehicle (V2V) communication is introduced into the PCD problem to transmit contents between on-board units (OBUs), and improve the transmission efficiency. We propose a full-duplex (FD) cooperative scheme based on coalition formation game, and the utility function is provided based on the maximization of the number of received contents. The contribution of each member in the coalition can be transferable to its individual profit. While maximizing the number of received contents in the fixed time, the cooperative scheme also ensures the individual profit of each OBU in the coalition. We evaluate the proposed scheme by extensive simulations in mmWave vehicular networks. Compared with other existing schemes, the proposed scheme has superior performances on the number of possessed contents, and system fairness. Besides, the low complexity of the proposed algorithm is demonstrated by the switch operation number, and CPU time. [ABSTRACT FROM AUTHOR]

Ambient backscatter communication (AmBC) over orthogonal-frequency-division-multiplexing (OFDM) signals has recently been proposed as an appealing technique for low power Internet-of-Things (IoT) applications. The special spectrum structure of OFDM signals provides a range of flexibility in terms of bit-error-rate (BER) performance, data rate, and power consumption. In this paper, we study subcarrier-wise backscatter communication over ambient OFDM signals. This new AmBC is to exploit the special spectrum structure of OFDM to transmit data over its squeezed orthogonal subcarriers. We propose a basis transmission scheme, and its two modifications to support a higher data rate with superior BER performance compared to existing methods. The basis scheme can transmit one bit per subcarrier using on-off keying (OOK) modulation in the frequency domain. In the first modification, interleaved subcarrier block transmission model is employed to improve the BER performance of the system in frequency-selective channels. It results in a trade-off between the size of the blocks, and data rate. Thus, in the second modification, interleaved index modulation (IM) is employed to mitigate the data rate decrementation of the former modification. It also stabilizes, and controls the power of the signal to result in interference reduction for a legacy receiver. Analytical, and numerical evaluations provide a proof to see the performance of the proposed method in terms of BER, data rate, and interference. [ABSTRACT FROM AUTHOR]

The main focus of this paper is on multistream multiantenna (multiple-input multiple-output) communications in large-scale heterogeneous random networks. Previous work in this area mainly studies the outage probability from the perspective of a given stream, which is inaccurate as it generally overlooks possible interference-driven cross stream signal-to-interference correlation in each communication link. To tackle this issue, in this paper, we focus on a link-level performance evaluation by characterizing the complementary cumulative distribution function (CCDF) of random mutual information (RMI) under heterogeneous interference. We focus on the scenarios that no coordination among transmitters is persuaded, and the receivers do not attempt to cancel out part of interuser interference. Assume that channel state information is known at both the transmitter and receiver of each communication pair, Rayleigh fading, that the singular value decomposition (SVD) is applied to construct pre-coding/post-coding filters for single-user detection, and that transmitted signals of antennas are i.i.d. Gaussian. We first provide accurate expression for the achievable data rate (ADR) of each link, and show that, regardless of the interference power, when transceivers are equipped with equal number of antennas it grows sublinearly with the number of antennas. We then approximate RMI via Gaussian distribution that its mean is the ADR and its variance is derived based on network's parameters. It is seen that the Gaussian approximation is credible even when two streams of data are transmitted. This paper provides various insights regarding the impact of system parameters, including density of transmitters, path-loss exponent, and the number of antennas, on the ADR and CCDF of RMI. We finally spot tremendous benefits of the SVD scheme over other prominent multiplexing systems, including maximum ratio combining, zero-forcing, and diagonal BLAST superstructure with minimum mean square error receivers. [ABSTRACT FROM PUBLISHER]

Both caching and interference alignment (IA) are promising techniques for next-generation wireless networks. Nevertheless, most of the existing works on cache-enabled IA wireless networks assume that the channel is invariant, which is unrealistic considering the time-varying nature of practical wireless environments. In this paper, we consider realistic time-varying channels. Specifically, the channel is formulated as a finite-state Markov channel (FSMC). The complexity of the system is very high when we consider realistic FSMC models. Therefore, in this paper, we propose a novel deep reinforcement learning approach, which is an advanced reinforcement learning algorithm that uses a deep $Q$ network to approximate the $Q$ value-action function. We use Google TensorFlow to implement deep reinforcement learning in this paper to obtain the optimal IA user selection policy in cache-enabled opportunistic IA wireless networks. Simulation results are presented to show that the performance of cache-enabled opportunistic IA networks in terms of the network's sum rate and energy efficiency can be significantly improved by using the proposed approach. [ABSTRACT FROM PUBLISHER]

The level crossing rate (LCR) is an important second-order statistical quantity that characterizes the rate of occurrence of fading time intervals. In this paper, we investigate the LCR of multiantenna flat-fading channels in the presence of additive white Gaussian noise and cochannel interferers with unequal received powers and Doppler shifts. We first present a unified approach to derive the exact LCR of the signal-to-interference-noise ratio at a receiver, where maximum ratio combining is deployed over spatially correlated or uncorrelated systems. Through the exact LCR derivation, we identify an accurate approach to obtain a simplified approximate LCR expression in the spatially uncorrelated system case. Benefits of the LCR expressions derived in the paper are demonstrated in two important applications: 1) the packet error rate is evaluated through the finite-state Markov channel model; and 2) the optimum packet length to maximize the throughput of the system with the stop-and-wait automatic repeat request protocol is derived. The analytical results are validated by simulations. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a reference-modulated permutation index differential chaos shift keying (RM-PI-DCSK) over multipath fading channels. Due to quasi-orthogonal property between different permutated chaotic signals, the proposed scheme can remarkably suppress the inter-sequence interference to recover the desired information. Moreover, the proposed RM-PI-DCSK has one more modulation bit in the reference segment than the conventional permutation index differential chaos shift keying (PI-DCSK). Both the reference signal in the first time-slot and a permuted replica of the reference in the second time-slot are modulated for efficient transmission. The theoretical bit-error-rate (BER) performance and the highly consistent simulation results demonstrate that the proposed RM-PI-DCSK can achieve a performance gain 3 dB over the conventional PI-DCSK at a BER of $10^{-4}$ , and this gain becomes larger in a high-delay-spread channel. In particular, the performance superiority of the RM-PI-DCSK is further demonstrated in a typical ultra-wideband (UWB) channel with narrow-band interference. Therefore, this proposed scheme can be deemed as an efficient transmission alternative for chaotic-based wireless communications, such as in wireless local area network (WLAN) applications and indoor applications of the transmitted-reference UWB. [ABSTRACT FROM AUTHOR]

In a vehicular ad hoc network (VANET) based on IEEE 802.11p, the performance of the communication link is heavily influenced by interference. To quantify the impact of interference, analytical models usually explicitly or implicitly assumed the interference range beyond which interference is ignored. We find that the potential maximum interference range should be related to the minimum interference power that the device can perceive. However, most previous works on VANET performance modeling simply assumed a fixed interference range. The most recently proposed effective interference range dependent on the signal-to-interference-and-noise ratio (SINR) threshold may appear to exceed the potential maximum interference range, resulting in an overestimation of the impact of interference. This paper proposes the SINR related Effective Distance Constrained by the Maximum interference range-based (SED-CM) model for IEEE 802.11p VANET performance evaluation on the Highway. First, we give the potential maximum interference range setting by studying the empirical distribution of interference distance corresponding to the minimum interference power in NS2 simulation. The performance metrics are then derived. The proposed SED-CM model is further extended to the intersection scenario. We conducted extensive NS2 simulations to evaluate the proposed model and compare it with three typical models. Results show that the SED-CM model presents the best evaluation ability. Moreover, we experimentally analyzed the effect of vehicle speed on the performance of VANET by mapping the vehicle speed to the vehicle density. Results show that a faster beacon rate is required to meet the reliability requirement of safety applications with the increase in vehicle speed. [ABSTRACT FROM AUTHOR]

In the common model for spectrum sharing, cognitive users can access the spectrum as long as the target performance in the legitimate primary system is not violated. In this paper, we consider a downlink primary multiple-input single-output (MISO) system, which operates under a controlled interference from the downlink MISO cognitive radio, which is also called a secondary system. We derive exact expressions for outage probability of the primary user under Rayleigh fading, when the primary system is exposed to interference from a secondary base station (BS). We treat three different operating modes for the primary BS, namely, space–time coding, antenna selection, and beamforming, each of them with different channel information requirements. We first consider the case in which the primary BS uses a fixed rate, and we analyze the outage probability. In a high-signal-to-noise-ratio (SNR) scenario, we derive closed-form asymptotic formulas for the outage probability. Furthermore, the optimum transmit power in the secondary system is investigated for maximizing the ergodic capacity when there is an outage constraint at the primary system, and simple solutions are proposed. We then consider the case with rate adaptation at the primary BS and introduce a suitable rate margin and a consistent requirement for primary throughput, for which we determine the outage probability. To be able to accommodate the secondary network, a rate margin is assumed at the primary link. We calculate the exact outage probabilities and average throughput of the adaptive-rate transmit-beamforming primary system, as well as the adaptive-rate transmit antenna-selection primary system. The analytical results are confirmed by simulations, in which we analyze the impact of different parameters, such as the number of antennas and the amount of the interference on the system performance. [ABSTRACT FROM PUBLISHER]

In multimode transceivers, the transmitter for one communication standard may induce strong interference in the receiver for another standard, often exceeding the desired signal by many tens of decibels. To linearly suppress this interference, the receiver requires a very large linear dynamic range, resulting in excessive power consumption. In a recent paper, a nonlinear block, which requires an adaptation signal proportional to the envelope of the received interference, has been used to strongly suppress the interference. In that work, the required adaptation signal for the nonlinear block has been determined analytically. In this paper, we quantify the required accuracy for the adaptation signal to properly suppress the interference while keeping the degradation to the receiver symbol error rate (SER) negligible. To provide the required accuracy, we propose a closed-loop method that calculates the adaptation signal based on a model, which describes the received interference in terms of the locally available baseband interference. We propose a method to adapt this model during the operation of the transceiver such that the power of the residual interference at the output of the nonlinear block is minimized. Our analysis shows that the proposed method can strongly suppress the interference while a SER close to that of an exactly linear receiver is achieved. Simulation results for a practical scenario validate this analysis. [ABSTRACT FROM PUBLISHER]

With interference alignment (IA), the achievable degrees of freedom (DoFs) in wireless networks can be linearly scaled up with the number of users. However, to attain the full DoF, the availability of perfect network channel state information (CSI) is mandatory, which is not pragmatic in general. In this paper, we quantify the performance of IA under CSI mismatch where the variance of the CSI measurement error depends on the signal-to-noise ratio (SNR). We show that when this error variance is proportional to the inverse of the SNR, the full DoF is achievable, and an upper bound on asymptotic mean loss in sum rate compared with the perfect CSI case is derived. We also derive a bound on the achievable DoF when the CSI error variance is proportional to the inverse of the SNR to a power of a constant. Furthermore, we investigate the effect of CSI mismatch on the performance of the maximum signal-to-interference-plus-noise ratio (Max-SINR) algorithm. We show that with perfect CSI, the Max-SINR algorithm outperforms interference leakage minimization algorithms, but with the presence of imperfect CSI, its comparative improvement becomes negligible. We then propose an adaptive Max-SINR algorithm that can notably improve the performance of the original Max-SINR algorithm under CSI mismatch. [ABSTRACT FROM AUTHOR]

Direct-conversion transceivers are in demand due to low implementation cost of analog front ends. However, these transmitters or receivers introduce imperfections such as in-phase and quadrature-phase (I/Q) imbalances. In this paper, we first investigate the effect of I/Q imbalance on the performance of primary system and show that these impairments can severely degrade the performance of cognitive radio system that are based on orthogonal frequency-division multiplexing (OFDM) multiple-access scheme. Next, we design a new four-level hypothesis blind detector for spectrum sensing in such cognitive radio system and show that the proposed detector is less vulnerable to I/Q imbalance than conventional two-level detectors. [ABSTRACT FROM PUBLISHER]

In multiple-input–multiple-ouput (MIMO) interference channels (IFCs), interference alignment (IA) with zero-forcing (ZF) linear detection can be used to achieve the maximum degrees of freedom (DoFs). However, ZF linear detection usually degrades the performance due to the noise enhancement in practical systems. In this paper, we propose lattice reduction (LR)-aided successive interference cancelation (SIC) in conjunction with IA over lattice for three-user (and extendable to $K$-user) MIMO IFCs in which the interfering signals aligned over the lattices are detected and canceled rather than nulled out. To complete the proposed LR-aided SIC method, the detection ordering and the precoding matrix that minimize the mean square error are also determined. [ABSTRACT FROM PUBLISHER]

To meet the exponentially increasing air traffic, L-band (960--1164 MHz) digital aeronautical communication system (LDACS) has been introduced. The LDACS aims to exploit the vacant spectrum between incumbent Distance Measuring Equipment (DME) signals and envisioned to follow an orthogonal frequency division multiplexing (OFDM) approach to support high-speed delay-sensitive multimedia services. This paper deals with the design and implementation of end-to-end LDACS the transceiver on the Zynq System on Chip platform, consisting of FPGA as programmable logic (PL) and ARM as processing system (PS). We consider OFDM based LDACS and improve it further using windowing and/or filtering. We propose a hardware-software co-design approach and analyze various transceiver configurations by dividing it into PL and PS. We demonstrate the flexibility offered by such a co-design approach to choose the configuration as well as word-length for a given area, delay and power constraints. The transceiver is also integrated with the programmable analog front-end to validate its functionality in the presence of various RF impairments and wireless channels and interference specific to the LDACS environment. Via in-depth performance analysis concerning parameters such as out-of-band attenuation, DME interference, bit-error-rate, word-length, and complexity, we demonstrate wide bandwidth filtered OFDM as an attractive solution for the next generation LDACS. [ABSTRACT FROM AUTHOR]

Resource management plays a crucial role in improving sum rate of non-orthogonal multiple access (NOMA) networks. However, the traditional resource management methods have considerable complexity, creating a huge challenge in computational efficiency. To handle this challenge, a resource management method is proposed based on a deep neural network (DNN). The key advantage of the method is that the DNN can perform in almost real-time resource allocation because it requires a very simple operation. In this paper, the resource management problem of the NOMA system adopting imperfect successive interference cancellation (SIC) technology at the receivers is studied, including the power allocation stage and the user scheduling stage. For power allocation stage, the generic fully-connected DNN is trained to approximate the power allocation of interior point method (IPM), which not only greatly improves the computational efficiency but also increases the sum rate of the system. Based on the allocated power, the user scheduling algorithm is performed to further increase the system sum rate. Finally, simulation results verify some performances of the proposed algorithms. [ABSTRACT FROM AUTHOR]

Traditional beamforming (BF) methods can be used to suppress the Gaussian interferers in underwater acoustic communication systems. However, multiple unsteady sub-Gaussian interferers may exist that degrade the performance of BF. In this paper, a new beamformer is proposed for the suppression of multiple unsteady sub-Gaussian interferers (SMUSGI). The proposed BF combines the multiplier and the quasi-Newton methods to obtain the optimal weight vector. Simulation experiments are conducted to validate the performance of the proposed beamformer. In addition, the proposed beamformer is compared with the traditional methods including the MVDR, Subspace, Bartlett, MDDR, LCMD and LCMV beamformers. The obtained results demonstrate that the proposed beamformer can effectively suppress multiple unsteady sub-Gaussian interferers with a higher output signal-to-interference-plus-noise ratio (SINR), and faster convergence compared with the traditional methods. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel joint radio resource allocation and successive interference cancellation (SIC) ordering algorithm for the downlink scenario of a power-domain sparse code multiple access (PSMA) based wireless network. To this end, we formulate a novel joint radio and SIC ordering optimization problem. Our aim is to maximize sum rate over codebook assignment, transmit power, and SIC ordering variables. Since the proposed optimization problem is NP-hard and mathematically intractable, we exploit alternate search method (ASM). Based on this algorithm, the proposed optimization problem is decomposed into three sub-problems, namely, codebook assignment, power allocation, and SIC ordering. To solve the codebook assignment sub-problem, we exploit matching theory and submodularity and compared them from the performance and complexity perspectives. Due to the fact that PD-NOMA-based networks adopt SIC at the receiver side, the proposed SIC ordering algorithm is also studied for this type of networks. Moreover, the proposed algorithms are investigated from the performance, convergence, and computational complexity perspectives. Numerical results show that the proposed SIC ordering method outperforms the conventional one by approximately 48% in the studied NOMA-based networks. [ABSTRACT FROM AUTHOR]

Heterogeneous networks (HetNets) as a combination of macro cells and small cells are used to increase the cellular network's capacity, and present a perfect solution for high-speed communications. Increasing area spectrum efficiency and capacity of HetNets largely depends on the high speed of backhaul links. One effective way that is currently utilized in HetNets is the use of full-duplex (FD) technology that potentially doubles the spectral efficiency without the need for additional spectrum. On the other hand, one of the most critical network design requirements is delay, which is a key representation of the quality of service in modern cellular networks. In this paper, by utilizing tools from the stochastic geometry, we analyze the local delay for downlink channel, which is typically defined as the mean number of required time slots for a successful communication. Given imperfect self-interference cancellation in practical FD communications, we utilize duplex mode (half-duplex (HD) or FD) for each user based on the distance from its serving base station. Further, we aim to investigate the energy efficiency for both duplexing modes, i.e., HD and FD, by considering local delay. We conduct extensive simulations to validate system performance in terms of local delay versus different system key parameters. [ABSTRACT FROM AUTHOR]

The proliferation of IEEE 802.11 or WiFi networks, and the explosive growth in traffic demands call for solutions to maximize the capacity of WiFi networks. Hence, maximizing the spatial reuse of WiFi networks is critical as doing so allows multiple concurrent transmissions. In this respect, a critical network parameter, Clear Channel Assessment (CCA) threshold, plays a vital role as it dictates whether a node is allowed to transmit after sensing the channel. In this paper, we propose to use Deep Q-network (DQN) under two learning patterns to select the CCA threshold of devices. We further consider Transmit Power Control (TPC) in conjunction with CCA threshold selection to improve the capacity of a WiFi network. The simulation results show that our approach is capable of selecting the optimal CCA threshold for each device. As a result, the average throughput is 62.4% higher than that of a legacy Dynamic Sensitivity Control (DSC) algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the problem of spectrum leasing in cognitive radio (CR) networks, while incorporating two advanced physical-layer technologies, i.e., multiple-input multiple-output (MIMO) and distributed interference alignment. We present a cooperative spectrum leasing scheme for primary and secondary users to balance the tension between data transmission and revenue collection/payment. A Stackelberg game is formulated, where the primary user is the leader, and secondary users are followers. With backward induction, we derive the optimal strategies for primary and secondary users that can achieve the unique Stackelberg equilibrium, where no player can gain by a unilaterally changing strategy. We find that spectrum leasing is always beneficial to enhancing the utilities of primary and secondary users. The proposed scheme outperforms a no-spectrum-leasing scheme and a cooperative scheme presented in the literature with considerable gains, which demonstrate the benefits of spectrum leasing and distributed interference alignment and validates the efficacy of the proposed scheme. [ABSTRACT FROM PUBLISHER]

In traditional orthogonal frequency division multiplexing (OFDM) systems, a cyclic prefix (CP) must be used in every block for intersymbol interference (ISI) suppression in time-dispersive channels at a price of severely impaired spectrum efficiency. To deal with this issue, the symbol cyclic shift equalization (SCSE) algorithm was proposed to implement a CP-free OFDM system. In this paper, we aim to further reduce the computational complexity of the SCSE algorithm. In particular, a pulse amplitude modulation (PAM) is used at a transmitter to construct conjugate symmetric OFDM blocks, while only partial samples in an OFDM block are involved in the SCSE algorithm at the receiver side, leading to a significantly reduced implementation complexity if compared to an SCSE quadratic-amplitude modulation(QAM)/phase-shift keying (PSK)-OFDM system, where all samples in an OFDM block must be involved in the detection process. The performance of the proposed SCSE PAM-OFDM scheme is analyzed and compared to traditional OFDM systems. The results obtained from this paper verify the effectiveness of the proposed scheme. [ABSTRACT FROM PUBLISHER]

This paper investigates the impact of primary transmissions on the performance of a dual-hop bidirectional cognitive radio system. The secondary users (SUs) communicate with each other in an underlay mode with the assistance of amplify-and-forward (AF) relays in the presence of primary users (PUs). Depending on whether there exists interference at the secondary transceivers, originating from the primary transmissions, or there is a possibility of employing the best relay selection technique at the secondary side, two operating cases are considered for the secondary network (SN). For both cases, tight lower bounds on the outage probability (OP) and the average symbol error probability (SEP) are derived in closed form. Moreover, a novel and general closed-form expression for the bit error rate (BER) of $M$-ary square quadrature amplitude modulation (QAM) for both single- and multiple-relay systems, under additive white Gaussian noise (AWGN) when Gray coded bit mapping is employed, is presented. In addition, we provide an upper bound and closed-form approximate expression for the ergodic capacity (EC). Numerical results provide important insights into the impact of system parameters on performance; for instance, it is demonstrated that, in both cases, under consideration of power constraints on the secondary nodes as dictated by the underlay mode of operation, the SN always achieves the full diversity order similar to the noncognitive counterpart. [ABSTRACT FROM PUBLISHER]

To address the asynchronous interference issue in a generalized scenario with multiple primary and multiple secondary receivers, in this paper, we propose an innovative cooperative beamforming technique. The cooperative beamforming design is formulated as an optimization problem that maximizes the weighted sum transmission rate of secondary destinations while maintaining the asynchronous interference at the primary receivers below their target thresholds. In particular, we obtain the optimum beamforming directions and allocate power values among such beamforming directions. In light of the intractability of the power allocation problem, an approximation is used to convert the nonconvex and nonlinear optimization problem into a convex and linear one. Due to the multiple interference constraints corresponding to multiple primary receivers, the power allocation scheme is still complex. Therefore, we also propose a low-complexity power allocation algorithm. The proposed beamforming technique is extended for the case when cooperating CR nodes (CCRNs) have statistical channel knowledge of the primary receivers by developing an upper bound on the probability of introducing asynchronous interference at a given primary receiver beyond a given threshold value. We also propose two CCRN selection strategies for cooperative beamforming. [ABSTRACT FROM PUBLISHER]

Interference alignment (IA) is a promising technique for interference management in wireless networks. On the other hand, jamming is a potential threat to wireless communications, which can degrade the performance of IA-based networks severely. Although some excellent work has been done on IA and antijamming, these two important aspects have traditionally been addressed separately in most previous work. In this paper, we study the antijamming issues and propose two antijamming schemes for IA-based networks. In the first scheme, the jamming signal and interferences are aligned into the same subspace at each receiver, and thus, can be perfectly eliminated together. When the requirement of perfect alignment can be relaxed, the second scheme is proposed to further improve the antijamming performance by maximizing the received signal-to-interference-plus-noise ratio (SINR). We derive the proper and feasibility conditions of the proposed two schemes. Simulation results are presented to show the effectiveness of the proposed schemes in mitigating jamming signals in IA-based wireless networks. [ABSTRACT FROM PUBLISHER]

In this paper, we introduce advancements of the conventional blanking nonlinearity (BN) for orthogonal frequency-division multiplexing (OFDM)-based systems, which is referred to in the following as advanced BN. Blanking is a common measure for mitigating impulsive interference that often occurs in wireless communication systems. Although the BN removes impulsive interference reliably, it possesses various drawbacks for OFDM-based systems. In particular, the choice of the blanking threshold (BT), to decide whether a received sample is blanked, is a critical issue. We present an algorithm for determining the optimal BT to maximize the signal-to-noise-and-interference ratio (SINR) after blanking. Another drawback is that the entire received signal is discarded during a blanking interval, despite the fact that only a fraction of the spectrum of the OFDM signal might be affected by interference. We show how blanking can be limited to subcarriers that are actually affected by interference. Further, we show how these measures can be combined and how a priori information obtained in an iterative loop can be incorporated into the proposed scheme. Simulation results incorporating realistic channel and interference models demonstrate the effectiveness of the proposed scheme. [ABSTRACT FROM PUBLISHER]

In this paper, we present a precise comprehensive analysis of the aggregate interference $I$ generated from an underlay network of cognitive radio (CR) nodes employing several transmit power control and receiver association schemes. Importantly, we consider spatial randomness by modeling CR transmitter nodes and receiver nodes as two independent Poisson point processes (PPPs). For the cognitive nodes, we investigate receiver association based on the distance or the instantaneous received power and power control based on the maximum possible transmitter–receiver distance, fixed or location-dependent cutoff power levels, feedback from the primary system, or the maximum number of available receivers. For each of these schemes, the exact moment generating function (mgf) and mean of aggregate $I$ power are derived for links with Rayleigh fading and exponential path loss. The resulting primary outage and the probability of secondary transmitter cutoff are also derived. Numerical results show that the secondary power thresholds and node densities significantly affect the aggregate $I$, the primary receiver (PR) outage, and the secondary transmitter cutoff arising from the different schemes. [ABSTRACT FROM PUBLISHER]