Search

This paper considers the downlink of a cognitive radio (CR) network formed by multiple primary and secondary transmitters, where each multiantenna transmitter serves a preknown set of single-antenna users. This paper assumes that the secondary and primary transmitters can simultaneously transmit their data over the same frequency bands to achieve high system spectrum efficiency. This paper considers the downlink balancing problem of maximizing the minimum signal-to-interference-plus-noise ratio (SINR) of the secondary transmitters subject to both the total power constraint of the secondary transmitters and the maximum interference constraint at each primary user due to secondary transmissions. This paper proposes solving the problem using the alternating direction method of multipliers, which leads to a distributed implementation through limited information exchange across the coupled secondary transmitters. This paper additionally proposes a solution that guarantees feasibility at each iteration. Simulation results demonstrate that the proposed solution converges to the centralized solution in a reasonable number of iterations. [ABSTRACT FROM AUTHOR]

In concurrent spectrum sharing scenarios between radars and wireless communication systems, one strict approach to protect the radar from undesired interference is locating the base stations outside a guard (or exclusion) zone of the radar. As a result, users inside that zone experience bad communication coverage. This paper uses Reconfigurable Intelligent Surfaces (RISs) to improve the base station coverage of users in the radar exclusion zone. The paper shows, through analysis and simulation, that joint optimization of base station and RIS locations improves the probability of coverage in the exclusion zone over the shared spectrum without disturbing the radar operation. [ABSTRACT FROM AUTHOR]

This paper considers the $\mathscr{L}_{2}$ string stability analysis and controller synthesis for vehicle platooning under jamming attacks and interferences from other communication channels. Jamming attacks and interferences for vehicle platooning systems are modeled as periodic denial of service attacks. Further, the vehicle platooning with denial of service attacks is modeled as a distributed switching system where an average dwell time approach is adopted for the stability analysis. Under the distributed switching system framework, this paper presents a co-design paradigm for the vehicle platooning. The distributed event-triggered method (ETM) and controllers are presented to guarantee $\mathscr{L}_{2}$ string stability, which can ensure that the output cannot be amplified along the vehicle platooning. Sufficient conditions for $\mathscr{L}_{2}$ string stability are then provided to guide the co-design of the ETM and controllers, which can be efficiently obtained by solving LMIs. Simulation results are presented to demonstrate the efficacy of the proposed co-design approach in addressing the denial of service attacks for vehicle platooning systems. [ABSTRACT FROM AUTHOR]

This paper considers the problem of user association to small-cell base stations (SBSs) in a heterogeneous and small-cell network (HetSNet). Two optimization problems are investigated, namely, maximizing the set of associated users to the SBSs (the unweighted problem) and maximizing the set of weighted associated users to the SBSs (the weighted problem), under signal-to-interference-plus-noise ratio constraints. Both problems are formulated as linear integer programs. The weighted problem is known to be NP-hard, and in this paper, the unweighted problem is proved to be NP-hard as well. Therefore, this paper develops two heuristic polynomial-time algorithms to solve both problems. The computational complexity of the proposed algorithms is evaluated and is shown to be far more efficient than the complexity of the optimal brute-force (BF) algorithm. Moreover, this paper benchmarks the performance of the proposed algorithms against the BF algorithm, the branch-and-bound CPLEX-based algorithm, and state-of-the-art algorithms, through numerical simulations. The results demonstrate the close-to-optimal performance of the proposed algorithms. They also show that the weighted problem can be solved to provide solutions that are fair between users or to balance the load among SBSs. [ABSTRACT FROM PUBLISHER]

Carrier sense multiple access with collision notification (CSMA/CN) is a typical representation of physical-layer (PHY)/medium access control (MAC) co-designs, where the MAC control frames are implemented or detected using PHY techniques. With CSMA/CN, the sender detects an unsuccessful transmission, with the aid of a collision notification (CN) from the receiver. In this paper, we first theoretically study the crucial impact of the CN attributes (namely, the detection threshold and the length) on system throughput in a wireless local area network (WLAN). We identify that the false-alarm probability of CN (more generally, the control frames in PHY/MAC co-designs) is a dominating metric that influences system performance. This paper will help developers select optimal CN attributes to balance various factors influencing CN detection performance. Extensive simulation results verify that our performance model is very accurate. [ABSTRACT FROM PUBLISHER]

With low-cost energy consumption, the reconfigurable intelligent surface (RIS) technique is a potential solution to the real-time data processing for intelligent transportation systems (ITSs). In this paper, an intelligent transmissive surface is introduced into the vehicular communications, enabling vehicle-to-infrastructure (V2I) signals to penetrate the intelligent RIS to access the base station (BS) on the opposite side of the vehicle. Considering that the vehicle-to-vehicle (V2V) communication reuses the spectrum spanned for V2I link, we investigate the ergodic capacity optimization problem for the vehicle performing V2I communications with the assistance of RIS, while meeting the low-latency and high-reliability requirements of the V2V link. The RIS transmission coefficients and power allocation of vehicles are jointly optimized, for the management of the desired and undesired vehicular communication links. Moreover, the expression of optimal phase shifts is derived in a closed-form, which reveals that the performance gain brought by RIS is proportional to the number of intelligent elements, while inversely proportional to the distance from vehicle-to-BS, in a quadratic form. Moreover, in the case of discrete phase shifts, an intelligent algorithm is proposed for the beamforming design at RIS. Afterwards, with the objective to maximize the ergodic capacity of the V2I link, the optimal power allocation is also proposed. Simulation results confirm the accuracy of the proposed resource allocation strategy, and that the system performance in terms of the ergodic V2I capacity can be significantly improved by the RIS. [ABSTRACT FROM AUTHOR]

This correspondence paper studies the impact of nonidentically distributed channel estimation error on performance of a scheduled space-time block coding with mean-value power allocation in cognitive-radio multiple-input multiple-output system. Using the derived probability density function, the exact closed-form expressions of the proposed system for outage probability, ergodic capacity, and symbol-error rate (SER) with both $\rm M$ -ary quadrature amplitude modulation and phase shift keying modulation are derived. Using asymptotic analysis, this paper quantifies the diversity order for both outage probability and SER in the presence of nonidentically distributed error. From the analysis results, this paper shows that the diversity order is enhanced by the multiuser diversity as the number of user terminals increases regardless of outage probability and SER, while the spatial diversity is eliminated. [ABSTRACT FROM AUTHOR]

The technical challenges, e.g. the mobility management and the offloading process, hinder the conventional cellular systems to meet the huge data traffic requirements of the next generation mobile communications. The traditional system (e.g dual-connectivity (DC)) has been proposed to improve the mobility management, however, it will inherit the big trade-off in the offloading process between the energy consumption for the small cell (SC) discovery (SCD) process and the efficiency of utilizing the system resources (e.g. frequency and signaling). In this paper, we present a framework to model the potential offloading opportunities as well as the offloading loss when a typical user equipment (UE) performs the inter-frequency (IRF) scan periodically. The proposed framework also studies the impact of the SCD on the energy efficiency. To improve the system performance and reduce the power consumption at the UEs, a new scheme, trio-connectivity (TC), is proposed in this paper to tackle the aforementioned challenges. The TC includes three planes: control-plane (C-plane), user-plane (U-plane) and indication-plane (I-plane). The I-plane works as an indicator to help the UE to identify and discover the SCs in the system prior to offloading. The role of the I-plane is to keep the SCD on one frequency channel regardless of the number of frequency channels in the system. In the proposed offloading mechanism, some of the energy consumption is transferred from the UE to the network. By using the proposed framework, UE energy efficiency and system energy efficiency as well as the total energy consumption are derived as performance metrics to compare between the TC and the DC. The results show that the TC can outperform the DC in dense cellular systems. [ABSTRACT FROM AUTHOR]

As the number of antennas increases, the massive multiple-input multiple-output (MIMO) system can precisely point to user equipments (UEs) with narrow beams. Accurate and timely channel state information (CSI) feedback is crucial to keep UEs in service. Mobile UEs, however, may suffer from the narrow beam nature of the massive MIMO system since UEs can move out of the beam coverage. When intelligent reflecting surface (IRS) is applied to the massive MIMO system, the adjustment of the IRS cannot be frequent as the IRS is controlled remotely by the base station (BS). Limiting the number of CSI feedback and the number of both BS and IRS adjustments significantly reduces the overhead of transmission and computation to the system. In this paper, we consider the UEs’ mobility adaptation problem in an IRS assisted multiuser massive MIMO downlink system with infrequent CSI feedback. We propose a beam control method that adapts to UEs’ mobility. The problem is constructed as a sum rate problem where both the BS and IRS are taken into account to jointly optimize the beamforming matrices. Simulation results show that our proposed algorithm can converge quickly and provide satisfactory performance for mobile UEs. At the same time, our proposed algorithm reduces the frequency of updating the beamforming matrices effectively both at the BS and at the IRS. [ABSTRACT FROM AUTHOR]

In this study, we investigate the operation of a user-number threshold-based base station (BS) on/off control, in which the BS turns off when the number of users is less than a specific threshold value. This paper presents a space-based analysis of the BS on/off control system to which a stochastic geometric approach is applied. In particular, we derive the approximated closed-form expression of the coverage probability of a homogeneous network (HomNet) with the user-number threshold-based BS on/off control. Moreover, the optimal user-number threshold for maximizing coverage probability is analytically derived. In addition to HomNet, we also derive the approximated closed-form expression of the coverage probability and the optimal user-number thresholds for a heterogeneous network (HetNet). The results show that HetNet, the analysis of which seems intractable, can be analyzed in the form of a linear combination of HomNets with weighted densities. In addition, the optimal user-number threshold of each tier is obtained independently from other tiers. The modeling and analysis presented in this paper are not only limited to the case of user-number threshold-based on/off control, but also applicable to other novel on/off controls with minor modifications. Finally, by comparing the analytical results with the simulated results, the theoretical contributions of this study are validated. [ABSTRACT FROM AUTHOR]

This paper studies the performance of two traditional schedulers, namely, proportional fair (PF) and round robin (RR), in the context of relay-enhanced Long-Term Evolution Advanced (LTE-A) networks. These two schedulers are natural candidates for implementation in relay nodes (RNs), and following the results obtained in single-hop networks, mobile operators could be tempted to adopt PF because of the good tradeoff it offers between cell capacity and fairness. Based on a statistical throughput evaluation model, we show that this is not necessarily the right option. The number of RNs, their locations in the cell, and backhaul link quality have a decisive influence on scheduler choice. In some scenarios, it is even not desirable to deploy relays as they degrade the network performance compared with the no-relay case. For the purpose of performance evaluation, we develop a realistic and computationally tractable statistical network model that takes into account fast fading, multiple interferers, cell range expansion bias, backhaul link quality, and traffic load. We also propose optimization of the radio frame structure and a suboptimal RN placement scheme to fairly compare RR and PF. [ABSTRACT FROM AUTHOR]

This paper studies a cognitive radio network (CRN), in which a multiple-input single-output (MISO) secondary transmitter (SU-Tx) aims to send confidential messages to its receiver (SU-Rx) in the presence of unknown eavesdroppers, while having to control its generated interference to the primary users (PUs) under a given threshold. Because the eavesdroppers are unknown, this paper considers the artificial noise (AN) approach or masked beamforming to provide the information secrecy. The objective of this paper is to maximize the power of AN in order to degrade the eavesdroppers, subject to the signal-to-interference-plus-noise ratio (SINR) constraint at the SU-Rx, as well as the interference temperature limits (ITLs) for the PUs. In the case of perfect channel state information (CSI), we reveal that the optimal strategy for the information-bearing signal is beamforming. Imperfect CSI cases of bounded and stochastic uncertainties are investigated. In the case of ellipsoid-bounded errors, we derive the equivalent forms for the SINR and ITL constraints and then transform the optimization problem into a form of semidefinite programming (SDP). For the case of probabilistic CSI uncertainties, we propose an outage-constrained robust formulation where the CSI errors are Gaussian distributed. With the aid of two kinds of Bernstein-type inequalities, we reexpress the probabilistic constraints into deterministic forms, which results in a safe approximate solution. [ABSTRACT FROM PUBLISHER]

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]

The next generation of mobile communication has progressed toward the deployment of small cells to meet the growing demands of increased capacity and QoS as compared to the conventional method, where all the computations were performed by the base station (BS)'s only. To reduce burden at the BS side, small cells deployment has been stressed upon, thus resulting in the formation of ultradense networks (UDN) having high concentration of small cells (e.g., picocell, femtocell, hotspots) and as a counter effect of which distance between two small cells is reduced to a greater extent. With such a close association of cells in UDN, the probability of frequent handovers also increases abruptly. As a result, the chances for attacker to spoof the bandwidth also increases many folds. In this paper, we have analyzed SNR, signal-to-interference-plus-noise ratio, and channel quality information channel parameters, such that the position of moving users at which handover is initiated in picocell deployment of UDN can be traced out successfully or region where the probability of attackers presence is high. Through this paper, we have tried to introduce the attacking scenario for the high mobility conditions in UDN. [ABSTRACT FROM AUTHOR]

Complex building structures constrain indoor wireless communications. The significant dependence between the indoor wireless network performance and the building structures can be considered as an intrinsic property of a building, which means that the building has to be designed to achieve desirable indoor wireless network performance. The power gain (PG) and the interference gain (IG) have been defined as the figures of merit (FoMs) to evaluate the wireless performance of a building. Employing open space as the benchmark, the PG and the IG respectively quantify the effective change of the intended signal power and the undesired power, i.e., the interference and thermal noise power, received in a targeted user equipment (UE) location due to the presence of the building. In this paper, a tractable approach is proposed to obtain the PG and the IG with a partition-based path gain model. It enables the PG and the IG to capture the impact of both building materials and the building layout on indoor wireless network performance. Numerical results show that the analytical models in closed-form expressions facilitate the wireless performance assessment to a given building computational-efficiently. This work is a critical complement to the initial framework of the building wireless performance (BWP) evaluation. The proposed method can be employed in future wireless-friendly building design. [ABSTRACT FROM AUTHOR]

Cache-enabled small base stations (SBS) are capable of relieving the heavy burden of the backhaul link and reducing the transmission latency. The hit probability depends on the coverage probability and caching placement probabilities. However, the interference in the small-cell networks may significantly degrade the coverage probability. In this paper, for MIMO small-cell networks consisting of SBS and users, where both of them are equipped with multiple antennas, a joint interference alignment (IA) and probabilistic caching (JIA-ProbC) scheme is proposed. Using tools from stochastic geometry, the $K$ -th order Voronoi cells are constructed to form clusters, where $K$ SBSs cooperatively serve users within each of the $K$ -th order Voronoi cells. Then, the IA scheme for MIMO interference channel (IC) is employed to cancel the intra-cluster interference within each $K$ -th order Voronoi cell. By exploiting the advantage of multiples antennas at users, the IA scheme can simultaneously support more users interference-free than both the zero forcing (ZF) based interference cancellation scheme for MISO systems and SISO systems without interference management, as more interference can be canceled. Furthermore, the coverage probability is analytically approximated by the a closed-form expression. Moreover, the optimal caching placement probability is analytically derived. Numerical Simulation results show that the proposed JIA-ProbC can significantly outperform the existing joint ZF and probabilistic caching (JZF-ProbC) scheme for MISO systems and SISO probabilistic caching (SISO-ProbC) scheme as well as the joint IA and most popular caching (JIA-MPC) caching scheme. [ABSTRACT FROM AUTHOR]

Power control is becoming increasingly essential for the fifth-generation (5G) and beyond systems. An example use-case, among others, is the unmanned-aerial-vehicle (UAV) communications where the nearly line-of-sight (LoS) radio channels may result in very low signal-to-interference-plus-noise ratios (SINRs). The authors in (Chiang et al., 2007) proposed to efficiently and reliably solve this kind of non-convex problem via a series of geometrical programmings (GPs) using condensation approximation. However, it is only applicable for a small-scale network with several communication pairs and practically infeasible with more (e.g., tens of) nodes to be jointly optimized. We therefore in this paper aim to provide new insights into this problem. By properly introducing auxiliary variables, the problem is transformed to an equivalent form which is simpler and more intuitive for condensation. A novel condensation method with linear complexity is also proposed based on the form. The enhancements make the GP-based power control feasible for both small- and especially large-scale networks that are common in 5G and beyond. The algorithm is verified via simulations. A preliminary case study of uplink UAV communications also shows the potential of the algorithm. [ABSTRACT FROM AUTHOR]

In this paper, an antenna synthesis process is investigated for Intelligent Transportation System (ITS) application. The wireless communication between Road Side Units (RSUs) and On Board Units (OBUs) located in the vehicles enables smart mobility. However, to support high speed vehicles and high data rates, a wider coverage area by the RSU antennas projected on the highway is required. This is defined by the radiation patterns of the RSU antennas. On a multi-lane highway, interference from the adjacent lanes is a critical issue which determines the communication reliability in terms of Single-to-Interference plus Noise Ratio (SINR). Hence, in this paper, an interference-aware antenna synthesis process is proposed and a planar array is optimized based on the objective function of obtaining a wide coverage area in terms of SINR distribution for a given modulation scheme. The proposed antenna array enhances the reliable communication area and provides improved SINR distribution across the lane for misaligned vehicles from the center of the lane. The results indicate that the proposed antenna array performs better than the existing designs in terms of communication reliability. [ABSTRACT FROM AUTHOR]

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 presents an optimization approach for a system consisting of multiple bidirectional links over a two-way amplify-and-forward relay. Improvement to the fairness of the system is desired. All user pairs exchange information over one relay station (RS) with multiple antennas. Due to the joint transmission to all users, the users are subject to mutual interference. A mitigation of the interference can be achieved by max–min fair precoding optimization where the relay is subject to a sum power constraint. The resulting optimization problem is nonconvex. This paper proposes a novel iterative low-complexity approach based on a modified Levenberg–Marquardt (LM) method to find near optimal solutions. The presented method finds solutions close to the standard convex-solver-based relaxation approach. [ABSTRACT FROM PUBLISHER]

$N$-continuous orthogonal frequency-division multiplexing (NC-OFDM) is a promising technique to achieve significant sidelobe suppression for baseband OFDM signals. However, NC-OFDM usually has high implementation complexity that limits its practical applications. Based on conventional NC-OFDM, this paper proposes a new technique, termed time-domain $N$-continuous OFDM (TD-NC-OFDM), which shifts the processing burden from the frequency domain to the time domain. This is achieved by adding a smooth signal, which is linearly combined by rectangularly pulsed OFDM basis signals consisting of a novel basis set. We prove that TD-NC-OFDM with the basis set is essentially equivalent to conventional NC-OFDM. Furthermore, using the time-domain structure, an asymptotic spectrum analysis of $N$-continuous OFDM signals is obtained by developing a closed-form expression related to sidelobe decaying. This paper also examines the impact of TD-NC-OFDM on the received signal-to-interference-plus-noise ratio (SINR) and derives closed-form expressions. [ABSTRACT FROM PUBLISHER]

Joint transmission (JT)-based Coordinated Multipoint (CoMP) systems achieve high performance gains by allowing full coordination among multiple cells, transforming unwanted intercell interference into useful signal power. In this paper, we present an analytical model to perform adaptive modulation for a typical JT CoMP system, consisting of three transmission points, under a target bit error rate (BER) constraint. Probability density functions of the signal-to-interference-plus-noise ratio (SINR) are derived for different JT CoMP schemes, and based on them, closed-form expressions for the average spectral efficiency (ASE) are obtained when adopting continuous-rate adaptive modulation. The study of ASE is also extended for the case of discrete-rate modulations, where the performance comparison of different practical quantized modulation schemes is carried out. [ABSTRACT FROM PUBLISHER]

In two-tier femtocell networks, adjusting the transmission power values of femtocell base stations (BSs) such that indoor users receive high signal quality while limiting leakage to outdoor users is an important problem. This paper proposes a novel distributed and self-optimized power adjustment algorithm for two-tier femtocell networks, in which a BS adjusts the transmission power based on the signal quality of neighboring BSs. Achieving fairness among users with minimal information exchange is desired. There are no predefined target parameters used to adjust transmission power, contrary to existing approaches in the literature. The convergence properties of the algorithm under fixed and time-varying communication infrastructures are investigated. The performance is further verified by simulations and comparisons with other algorithms for the coverage problem. [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 studies the cooperative device-to-device (D2D) transmissions in cellular networks, where two D2D users communicate bidirectionally with each other and simultaneously serve as relays to assist the two-way transmissions between two cellular users. For this scenario, both cellular and D2D links share the same spectrum, thus creating mutual interference. In addition to that, a security problem also exists since the cellular users want to keep their messages secret from the D2D users and vice versa. To address these two issues, a security-embedded interference avoidance scheme is proposed in this paper. By exploiting the constellation rotation technique, the proposed scheme can create interference-free links for both D2D and cellular communications, thereby significantly improving the system error performance. Moreover, our scheme also provides an inherent secrecy protection at the physical layer, which makes the information exchange between cellular users and that between D2D users confidential from each other. [ABSTRACT FROM PUBLISHER]

Current and future mobile network access technologies increasingly rely on multiantenna transmission techniques and on cell miniaturization to achieve orders-of-magnitude gains in capacity. In this paper, we propose and evaluate the idea of multiuser multiple-input–multiple-input-based (MU-MIMO) cell reassignments. Dense small-cell deployments make it possible to pair user equipment units (UEs), which were originally assigned to different cells, enabling multiuser MIMO (MU-MIMO) and resulting in performance improvements to both UEs. We discuss how such pairings can be accomplished, and we assess the potential gains in the resulting spectral efficiency and MU-MIMO usage. These are assessed through both discussion of performance bounds and detailed system-level simulation in a realistic outdoor small-cell scenario. [ABSTRACT FROM PUBLISHER]

We study multiuser detection for uplink transmissions using only analog beamformers in a millimeter-wave (mm-wave) communication system under a limited scattering environment in this paper. In particular, the successive interference cancelation (SIC)-based detection at a base station (BS) that is equipped with an antenna array is considered with the outputs of analog beamformers. We employ beam selection from a codebook of analog beams for low-complexity analog beamforming in the SIC-based detection and compressive sensing (CS)-based channel estimation that is suitable for the BS that only has analog beamformers. Through simulation results, we can see that the performance of the joint analog beam selection and SIC-based detection is comparable with the performance of the SIC-based detection (with ideal digital beamforming) at the cost of more antenna elements with lower complexity. [ABSTRACT FROM AUTHOR]

This paper considers the bit loading problem for communication systems that utilize orthogonal frequency division multiplexing (OFDM) in conjunction with precoding (POFDM) or time-domain interleaving (IOFDM). In particular, we propose a new bit loading algorithm for P/I-OFDM that has substantially higher effective throughput and less computational complexity, when compared to bit loading in conventional OFDM systems. The obtained results show that the effective throughput of P/I-OFDM can be more than fourfold the conventional OFDM while the complexity is less than $1.5\%$. Moreover, the results show that the peak-to-average power ratio (PAPR) properties of the considered systems are preserved under the adaptation process. [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 general two-way relay (TWR) transmission method is proposed under per-antenna power constraints by combining space-time line codes (STLCs) with transmit power allocation for two source nodes. We introduce a general STLC-based encoding scheme for a decode-and-forward TWR and derive the detection signal-to-interference-plus-noise ratio (SINR) values at two source nodes. An optimal encoder structure with power allocation is proposed in terms of maximizing the minimum SINRs, and it is verified that the optimal encoder is identical to the superposition of two conventional STLCs. An iterative method is proposed to find the optimal power allocation for detection at two source nodes. Moreover, a low-complexity suboptimal encoder is proposed for practical implementation. Numerical simulations present that the proposed STLC-based transmission method outperforms a conventional eigen-beamforming scheme with nulling and an STLC-based scheme with equal power allocation, in terms of the average bit error rate of source nodes, regardless of the distribution of source nodes, the number of TWR antennas, and the transmit power. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the performance of single-stream and multistream spatial multiplexing (SM) systems employing opportunistic scheduling in the presence of interference. In the proposed downlink framework, every active user reports the postprocessing signal-to-interference-plus-noise power ratio (post-SINR) or the receiver-specific mutual information (MI) to its own transmitter using a feedback channel. The combination of scheduling and multiantenna receiver processing leads to substantial interference suppression gain. Specifically, we show that opportunistic scheduling exploits the spatial interference alignment (SIA) property inherent to a multiuser system for effective interference mitigation. We obtain bounds for the outage probability and the sum outage capacity for single-stream and multistream SM employing real or complex encoding for a symmetric interference channel (SIC) model. The techniques considered in this paper are optimal in different operating regimes. We show that the sum outage capacity can be maximized by reducing the SM rate to a value less than the maximum allowed value. The optimal SM rate depends on the number of interferers and the number of available active users. In particular, we show that the generalized multiuser SM (MU SM) method employing real-valued encoding provides a performance that is either comparable or significantly higher than that of MU SM employing complex encoding. A combination of analysis and simulation is used to describe the tradeoff between the multiplexing rate and the sum outage capacity for different antenna configurations. [ABSTRACT FROM PUBLISHER]

In this paper, we evaluate the outage performance of a decode-and-forward (DF) relay system with two low-complexity relay selection schemes and interference at the relays and the destination. The schemes are mainly based on the switch-and-examine diversity combining (SEC) and SEC postexamine selection (SECps) techniques in which a relay out of multiple relays is selected to forward the source message to the destination. The selection process is performed such that the signal-to-noise ratio (SNR) of the second hop of the selected relay satisfies a predetermined switching threshold. In this paper, we first derive the probability density function (pdf) of the SNR of the relay selection scheme and the conditional cumulative distribution function (cdf) of the end-to-end (e2e) signal-to-interference-plus-noise ratio (SINR), assuming Rayleigh fading channels. The derived statistics, along with the statistics of first-hop channels of the relays and the direct link, are then used to derive a closed-form expression of the e2e outage probability. Maximal-ratio combining (MRC) is used at the destination to combine the signals from the relay and the direct link. Furthermore, the outage performance is studied at the high-SNR regime where approximate expressions for the outage probability, diversity order, and coding gain are derived and analyzed. Monte Carlo simulations and some numerical examples are provided to illustrate the validity of the derived results and to show the effect of interference and other parameters on the system performance. Main results illustrate that when the interference power is fixed, the system can still achieve some performance gain when more relays are added, particularly at SNR values that are comparable with the switching threshold. Asymptotic results show that at a high SNR, the system with the SEC and SECps relaying schemes achieves a diversity order of 2 and approximately the same coding gain. Finally, findings illustrate that the interference at the destination is more severe on the system performance compared with that at the relays. [ABSTRACT FROM PUBLISHER]

The ultra dense deployment of small cells is considered a key technology to achieve the requested capacity in future cellular networks. However, the interference pattern becomes more unpredictable and challenging in these networks. Therefore, a suitable trade-off between spectrum spatial reuse and interference level has to be pursued to achieve good performance in terms of provided throughput. This paper proposes a new method to maximize the achievable throughput of an UDN with a suitable level of spatial spectrum reuse. In particular, the focus is on the small cells tier where the available spectrum is divided into sub-bands and each cell can use some of these to communicate with its associated users. The goal is to find the sub-bands allocation among cells that maximizes the system throughput. However, to limit complexity and signaling overhead that could result unaffordable in an UDN, a new metric to approximate the cell throughput to be optimized is defined. Moreover, the newly defined problem is solved using the Gibbs Sampling approach. The method effectiveness is proven by comparing the achieved results with those of the maximization of the effective system throughput and the optimal solution. [ABSTRACT FROM AUTHOR]

This paper investigates the capacity gain of full duplex (FD) self-backhauling over the half duplex (HD) counterpart in downlink cellular systems, and then proposes an opportunistic FD scheme. The first step is to derive the capacity gain of FD self-backhauling over the HD counterpart as a function of the system parameters in a computationally tractable form. Unlike previous studies on the capacity of FD self-backhauling, a practical constraint is imposed so that the end-to-end link achieves a target signal-to-interference-plus-noise ratio (SINR) for a successful link connection. Also, a condition under which FD is more beneficial than HD is derived. Specifically, the minimum allowable self interference cancellation factor and the maximum allowable cell radius for the benefit of FD are derived as an explicit function of system parameters. Their dependencies on the system parameters are investigated and compared with counterparts derived for single-hop point-to-point links. Lastly, to overcome the weak points of FD and HD, this paper proposes a user-wise opportunistic FD (OFD) self-backhauled scheme. To this end, an instantaneous channel gain-based FD/HD switching rule is derived from a condition under which FD cannot instantaneously satisfy the target SINR. We confirm the substantial capacity gain of the proposed user-wise instantaneous OFD over a cell-wise static duplex switching scheme, as well as the fixed duplex (HD or FD) schemes. When compared to the static duplex switching scheme, the proposed OFD is most beneficial at the boundary of HD-preferred and FD-preferred regions. Based on this, a system-level guideline is proposed for selecting the most practical scheme among OFD, FD, and HD by trading off capacity gain and switching overhead. Extensive simulation results are provided to confirm the correctness of the derivations and the related investigations. [ABSTRACT FROM AUTHOR]

Code division multiplexing (CDM)-based random access, wherein a set of sequences is reserved for random access and a remote station transmits a random access packet using a sequence randomly selected from this set, is employed in numerous practical wireless systems. If multiple remote stations simultaneously transmit random access packets using the same sequence, the performance degrades owing to sequence collision. In addition, the performance is degraded because of interference if multiple remote stations simultaneously transmit random access packets using different sequences. Therefore, the performance of CDM-based random access is dependent on both sequence collision and interference. There have been no previous studies on analyzing the performance of CDM-based random access considering both sequence collision and interference. In this paper, the throughput of CDM-based random access is investigated considering both sequence collision and interference based on a signal-to-interference-plus-noise ratio (SINR) capture model. Analyses and numerical simulations are performed to compare the throughputs of several random access schemes, including conventional and channel-adaptive random access. The results show that channel-adaptive random access can achieve significantly higher throughput than that achieved by conventional random access. Moreover, the results demonstrate that it is possible to analyze the trade-off between the throughput and implementation complexity with the increased the number of sequences. [ABSTRACT FROM AUTHOR]

Multi-numerology transmission is a promising multiple access scheme for flexible communication systems, which can simultaneously support users with different service requirements. To this end, both inter- and intra-numerology interference (inter-NI and intra-NI) should be suppressed, which is not straightforward. This paper proposes a novel zero-forcing (ZF) precoding design, which perfectly eliminates all the interference, for massive multiple-input multiple-output (MIMO) systems with multi-numerology. First of all, we express the signal-to-interference-plus-noise ratio (SINR) of the multi-numerology system with spectrum sharing. From the SINR representation, we identify the channels that precoders must nullify to suppress inter-NI. After that, we propose a ZF precoder suppressing both inter-NI and intra-NI perfectly. The lower bound of ergodic achievable rate with perfect channel state information at the transmitter (CSIT) is analyzed. Based on the lower bound of ergodic achievable rate, we present the feasible rate region. Also, we propose two power allocation schemes: user fairness and the ergodic sum rate maximization. The simulation results demonstrate the advantage of the proposed precoding design and verify our analysis results. [ABSTRACT FROM AUTHOR]

This article studies the transmit beamforming security in the dual-functional radar-communication (DFRC) system, where the radar beam also serves as the artificial jamming to suppress potential eavesdropper channels. Unlike previous researches, which assumed that the lone target might be a potential eavesdropper on the adversary side, this paper analyses a more generic scenario in which the eavesdroppers’ channel state information (CSI) is unknown. The eavesdropping rate should be limited to guarantee transmission confidentiality, which is intractable owing to the unknown CSI. To address this issue, we present the long-term eavesdropping signal-to-interference-plus-noise ratio (SINR) as a more tractable security metric. Based on the long-term eavesdropping SINR, the sum rate maximization (SRM) and jamming power maximization (JPM) transmission scheme are investigated. For the SRM scheme, we propose a zero-forcing (ZF) suboptimal algorithm to solve the non-convex fractional programming (FP) problem, and for the JPM scheme, the resultant problem is solved via the semidefinite relaxation (SDR) technique. Finally, numerical results validate the effectiveness of the proposed beamforming approaches. [ABSTRACT FROM AUTHOR]

Despite increasing interest in distributed antenna systems (DASs), how to guarantee resource-based fairness in multiuser DASs remains largely unexplored. In this paper, we propose a novel cumulative distribution function (CDF)-based scheduling (CS) with flexible beam transmissions (CSFB) to guarantee resource-based fairness in DASs. With CSFB, to increase the probability that each remote antenna unit (RAU) can contribute to the throughput of users located near it, the probabilities of each user being selected for different RAUs and the number of beams for transmission are jointly adapted to the geographical distribution of RAUs. Thus, CSFB can efficiently exploit multiuser diversity realized by independent fading channels, as well as spatial multiplexing by effectively utilizing the distributed RAUs. To realize CSFB in practice, a one-bit-feedback scheme, i.e., CSFB-OB, is further proposed to reduce feedback overhead for user selection. We prove that both CSFB and CSFB-OB can satisfy resource-based fairness and derive the upper bound for the feedback overhead with CSFB-OB. Simulation results show that CSFB and CSFB-OB with a suitable feedback threshold achieve a better throughput performance than CS with all-beam and single-beam transmissions and the existing fair scheduling schemes. [ABSTRACT FROM AUTHOR]

With the unprecedented new capabilities introduced by modern broadband wireless networks, public safety (PS) agencies are increasingly depending on such networks for their mission-critical communications. One of the key enablers for this adoption is the device-to-device (D2D) communications, where mobile devices can connect directly between each other, without the need for a base station (BS) nor a switching core to handle and route the traffic. This feature is a vital communication backup in case of a network infrastructure failure or a natural disaster. In this paper, we analytically quantify the cellular network performance during massive infrastructure failure, where some terminals can play the role of low-power relay nodes forming multihop communication links to assist farther terminals outside the reach of the healthy network coverage. Namely, we analytically determine the D2D effect in alleviating the damage caused by the disaster. This paper is based on stochastic geometry analysis and presents a novel analytical methodology that is applicable to wide scenarios of network conditions and parameters. This methodology is verified through Monte Carlo simulations for practical network parameters based on the latest Third-Generation Partnership Project (3GPP) recommendations. [ABSTRACT FROM AUTHOR]

Multicell coordinated beamforming (CB) can mitigate intercell interference (ICI). However, existing work on CB focuses on systems that maximize overall throughput. This paper considers CB for systems with multiple receive antennas and further extends the CB to multiuser and multistream transmission. We consider fairness and pay close attention to cell-edge users. CB that maximizes the harmonic sum of signal-to-interference-plus-noise ratio (SINR) can be derived into a low-complexity algorithm that favors cell-edge users. Two iterative algorithms are developed. From the simulation results, the proposed algorithms can provide a better fifth-percentile user throughput compared with the CB algorithms minimizing mean square error, maximizing uplink SINR, and maximizing weighted sum rate. Furthermore, the computational complexity of the proposed algorithms is significantly lower than that maximizing the minimum SINR of users. [ABSTRACT FROM AUTHOR]

This paper studies user-specific clustering for a downlink cloud radio access network (C-RAN), where a central unit (CU), connected to all base stations (BSs) via limited-capacity backhaul links, coordinates the BSs to form cooperative clusters for every user. By taking into account the training overhead for channel estimation in C-RAN, we design the clustering scheme aimed at maximizing the average net throughput of the network subject to the constraint on backhaul capacity, where a hybrid coordinated multipoint (CoMP) transmission mode is considered. The proposed clustering scheme can be operated in a semi-dynamic manner merely based on large-scale channel information, has low computational complexity, and performs close to the optimal scheme found by exhaustive searching. Under two special cases where the backhaul capacity is very stringent and unlimited, the proposed scheme is then tailored for pure coordinated beamforming (CB) mode and pure joint transmission (JT) mode to further reduce the clustering complexity. Simulation results show that the proposed semi-dynamic clustering schemes are superior to the dynamic clustering scheme due to the reduction of required training overhead. [ABSTRACT FROM AUTHOR]

Densely deployed cellular wireless networks, which employ small cell technology, are being widely implemented. Mitigating the impact of inter- and intracell signal interferences induced by the operations of these networks is a challenging yet essential task. In this paper, we consider adaptive rate scheduling for a transmitting node, regardless of whether it is a base station (BS) or a mobile user. We aim to maximize the system's throughput through the employment of fractional frequency reuse (FFR) schemes. Each BS employs either an omnidirectional or a directional antenna system. We derive the optimal configuration of the FFR scheme and evaluate the ensuing system's performance behavior under absolute and proportional fairness requirements. To maximize the attained throughput by mobiles, we determine the best method to use to classify cell users into interior and edge mobiles. The bandwidth levels allocated for serving interior and edge mobiles are optimized. We derive approximate closed-form mathematical expressions for calculating the probability distributions of the interference signal levels measured at the destined receivers. We account for the impact of the classification process on intercell interference power levels. Under an absolute fairness requirement, we show that optimally configured FFR schemes lead to much enhanced performance. We show that the optimally configured directional-FFR schemes increase the throughput capacity by a factor of about 60% relative to that obtained by using optimal omnidirectional-FFR schemes. The analyses and simulation results presented in this paper serve to characterize the performance behavior attainable by using such small cell deployed cellular wireless network systems when employing the underlying configurations. [ABSTRACT FROM AUTHOR]

The large spectral bandwidth at millimeter-wave (mmWave) frequencies provides a mean to achieve very high data rates in wireless communication systems. A unique characteristic of mmWave is that mmWave links are very sensitive to blockage and have large propagation path loss, which exhibits low line-of-sight (LoS) probability, unstable connectivity and unreliable communication. This paper studies the influence of the blockage in pedestrian scenario, explains in detail how blockage affects the mmWave propagation characteristics. In particular, we study the behavior of the blockage due to human mobility and how it affects the timescale for outage due to blockage using knife-edge diffraction model (KED). One of the existing solutions to overcome the influence of blockage, is to associate the user equipment (UE) with other available base stations (BSs) by handover (HO) if the serving BS is blocked. In this paper, for a pedestrian scenario, we propose two reinforcement learning (RL) based user association algorithms, which accounts for the past experience of the blockage on the position of the UE. One focuses on the reward to increase the sum LoS probability and is named as blockage-aware user association (BAUA). The other focuses on the reward to balance the trade-off between the throughput and the LoS probability and is named as modified BAUA. We compare the proposed algorithm with the conventional user algorithms such as the maximum throughput based algorithm and the maximum SINR based algorithm. Simulation results show that to increase the sum LoS probability BAUA would be suitable, and to increase the average throughput maximum throughput based method would be suitable. [ABSTRACT FROM AUTHOR]

Vector perturbation (VP) is a nonlinear precoding technique that achieves near-capacity performance in multiuser multiple-input multiple-output systems at the expense of large complexity due to the search for the optimum perturbation vector. In this paper, we present the hybrid Tomlinson–Harashima VP (TH-VP) algorithm, a novel zero-forcing precoding scheme, which combines TH precoding to remove interuser interference, and VP precoding to equalize each user's multiple spatial streams. We show that the two nonlinear techniques can be integrated in a single optimization and that the proposed algorithm has lower computational requirements than any other. The performance of TH-VP is analyzed and simulation results show that TH-VP outperforms conventional zero-forcing VP and approaches the performance of dirty paper coding. [ABSTRACT FROM AUTHOR]

Very recent studies showed that in a fully loaded dense small cell network (SCN), the coverage probability performance will continuously decrease with the network densification. Such new results were captured in IEEE ComSoc Technology News with an alarming title of “Will Densification Be the Death of 5G?” In this paper, we revisit this issue from more practical views of realistic network deployment, such as a finite number of active base stations (BSs) and user equipments (UEs), a decreasing BS transmission power with the network densification, etc. Particularly, in dense SCNs, due to an oversupply of BSs with respect to UEs, a large number of BSs can be put into idle modes without signal transmission, if there is no active UE within their coverage areas. Setting those BSs into idle modes mitigates unnecessary intercell interference and reduces energy consumption. In this paper, we investigate the performance impact of such BS idle mode capability (IMC) on dense SCNs. Different from existing work, we consider a realistic path loss model incorporating both line-of-sight (LoS) and non-LoS transmissions. Moreover, we obtain analytical results for the coverage probability, the area spectral efficiency and the energy efficiency (EE) performance for SCNs with the BS IMC and show that the performance impact of the IMC on dense SCNs is significant. As the BS density surpasses the UE density in dense SCNs, the coverage probability will continuously increase toward one, addressing previous concerns on “the death of 5G”. Finally, the performance improvement in terms of the EE performance is also investigated for dense SCNs using practical energy models developed in the Green-Touch project. [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]

Convergence and density evolution of a low-complexity iterative multiple-input multiple-output detection based on belief propagation over a ring-type pairwise graph are presented for binary data. The detection algorithm to be considered is effectively a forward–backward recursion and was originally proposed by Yoon and Chae in a work published in 2014, in which link-level performance, computational complexity, and convergence for Gaussian input were analyzed in detail. This paper presents the convergence proof and the density evolution framework for binary input to give an asymptotic performance in terms of average signal-to-interference-plus-noise ratio and bit error rate (BER) without channel coding. The BER curve obtained via density evolution shows a good match with the simulation results for uncoded BER in the paper by Yoon and Chae verifying the effectiveness of the analysis provided and the performance of the detection algorithm. [ABSTRACT FROM AUTHOR]

The terahertz (THz) waves with enormous bandwidth can be used along with the existing sub-6GHz and millimeter wave (mmWave) bands to achieve the ever evolving ecosystem of applications that need to be supported by the modern wireless networks. This paper investigates a user-centric dynamic base station (BS) clustering design for a hybrid network where THz, mmWave, and sub-6GHz BSs coexist. Invoking the proposed clustering model, the BS cooperation within each band is made possible by considering long term channel variations and all the surrounding BSs within a cluster with tunable size. A typical user is associated with the best BS cluster, from either a sub-6GHz, mmWave or THz tier based on the maximum signal-to-interference-plus-noise-ratio (SINR) criterion or the maximum rate criterion. Using tools from stochastic geometry, we assess the performance of the proposed user-centric hybrid system in terms of SINR and rate coverage performances, while accounting for: band specific propagation models, directional beamfroming, and BSs random locations. The accuracy of the analytical results is validated with Monte-Carlo simulations. The obtained results recognize a clear coverage/rate trade-off where a high fraction of THz BSs improves the rate significantly but may degrade the coverage performance. Thus, with carefully planned networks, enabling user-centric BS cooperation for hybrid wireless systems can achieve ultra-high rates while maintaining sufficient coverage in sixth-generation (6G) networks. [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]

Recently, model-free power control approaches have been developed to achieve the near-optimal performance of cell-free (CF) massive multiple-input multiple-output (MIMO) with affordable computational complexity. In particular, deep reinforcement learning (DRL) is one of such promising techniques for realizing effective power control. In this paper, we propose a model-free method adopting the deep deterministic policy gradient algorithm (DDPG) with feedforward neural networks (NNs) to solve the downlink max-min power control problem in CF massive MIMO systems. Our result shows that compared with the conventional convex optimization algorithm, the proposed DDPG method can effectively strike a performance-complexity trade-off obtaining 1,000 times faster implementation speed and approximately the same achievable user rate as the optimal solution produced by conventional numerical convex optimization solvers, thereby offering effective power control implementations for large-scale systems. Finally, we extend the DDPG algorithm to both the max-sum and the max-product power control problems, while achieving better performance than that achieved by the conventional deep learning algorithm. [ABSTRACT FROM AUTHOR]