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]

In wireless networks, the link connectivity may be intermittent due to shadowing, burstiness of data arrival, or uncoordinated resource allocation. In this paper, we model the intermittence of links as Bernoulli distributed random channel states, termed intermittence channel states, and study the impact of the corresponding channel state information at the transmitter (CSIT) in a two-user Gaussian broadcast channel (BC). Moreover, due to the heterogeneous timeliness of intermittence channel states, the CSIT considered in this paper is hybrid. More specifically, the CSIT of each link can be perfectly (causally or non-causally) available, delayed, or not available. When the links are connected, we adopt a general setting that the received signal-to-noise ratios can be different. Our contribution is the characterization of the capacity regions of intermittent Gaussian BC to within bounded gaps for all combinations of hybrid CSIT, except for scenario DN (delayed CSIT of receiver 1, no CSIT of receiver 2). For scenario DN, we propose an opportunistic physical layer network coding scheme that achieves a strictly larger degree-of-freedom (DoF) region than the no-CSIT DoF region. As a corollary, single-user CSIT is able to increase the sum DoF for intermittent Gaussian BC (also the capacity region for the erasure BC, as a by-product). This result is in sharp contrast to the recent negative result by Davoodi and Jafar, where it is shown that for fast-fading multiple-input single-output BC with continuous channel states, single-user CSIT does not help at all in terms of sum DoF. [ABSTRACT FROM AUTHOR]

The explosive growth of Internet-of-Things (IoT) applications such as smart cities and Industry 4.0 have led to drastic increase in demand for wireless bandwidth, hence motivating the rapid development of new techniques for enhancing spectrum utilization needed by new generation wireless communication technologies. Among others, dynamic spectrum access (DSA) is one of the most widely accepted approaches. In this paper, as an enhancement of existing works, we take into consideration of inter-node collaborations in a dynamic spectrum environment. Typically, in such distributed circumstances, intelligent dynamic spectrum access almost invariably relies on self-learning to achieve dynamic spectrum access improvement. Whereas, this paper proposes a DSA scheme based on deep reinforcement learning to enhance spectrum and access efficiency. Unlike traditional Q-learning-based DSA, we introduce the following to enhance the spectrum efficiency in dynamic IoT spectrum environments. First, deep double Q-learning is adopted to perform local self-spectrum-learning for IoT terminals in order to achieve better dynamic access accuracy. Second, to accelerate learning convergence, federated learning (FL) in edge nodes is used to improve the self-learning. Third, multiple secondary users, who do not interfere with each other and have similar operation condition, are clustered for federated learning to enhance the efficiency of deep reinforcement learning. Comparing with the traditional distributed DSA with deep learning, the proposed scheme has faster access convergence speed due to the characteristic of global optimization for federated learning. Based on this, a framework of federated deep reinforcement learning (FDRL) for DSA is proposed. Furthermore, this scheme preserves privacy of IoT users in that FDRL only requires model parameters to be uploaded to edge servers. Simulations are performed to show the effectiveness of theproposed FDRL-based DSA framework. [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]

Fixed Satellite Services (FSS) used to be alone at the C-Band spectrum in most countries. Since the deployment of 5G in many countries (i.e., 3.3–3.6 GHz), FSS is not the exclusive system in the C-Band anymore. In order to minimize the detrimental interference for the FSS to allowable levels, regional exclusion zones of maximum radiated power in 5G base stations (BS) are proposed and evaluated. In this paper, a measurement campaign has been carried out, and an analysis of the interference has been studied. A filtering model, namely Filter to Remove Broadband Interference 5G (FIREBRING), is proposed and analyzed concerning the carrier-to-noise ratio (C/N). Moreover, this paper focuses on the evaluation of the 5G interference into the FSS. The proposed solution deployed an Low-Noise Block (LNB) with a band frequency of 3.7 to 4.2 GHz to test the satellite down-conversion signal at the receiver. The paper offered a complete analysis of the 5G signal, taking into account the implications of out-of-band emissions, potentially LNB saturation into FSS receiver, and the repercussions of the deployment of the 5G BS active antenna systems. With the LNB and down-converter in place, it can be found that the signal interference between 1.450 GHz and 1.550 GHz, is nearly 18 dB. [ABSTRACT FROM AUTHOR]

The reconfigurable intelligent surface (RIS), which consists of many low-cost reflecting elements, can enhance the reception of the desired signal and suppress the interference. Considering the above advantages, this paper investigates the RIS-assisted wireless communication in the presence of an interferer, where a receiver receives the desired signal and interference from a transmitter and an interferer, respectively, and the RIS is deployed to assist this system. First, an interference-limited channel capacity maximization problem is formulated, and a numerical algorithm based on the fraction programming and optimality conditions is proposed to obtain the optimal solution. Then, this paper shows the upper boundary of the maximal capacity with interference and discusses what kind of channel conditions can achieve the upper boundary and the corresponding optimal phase shifts. Next, this paper analyzes the asymptotic behaviors of the maximal capacity in the scenarios that some or all of the number of reflecting elements, antennas at the transmitter, and interferer go to infinity. Finally, this paper generalizes the above results to the multiple interferers scenario. [ABSTRACT FROM AUTHOR]

Indoor optical wireless communication (IOWC) is a key technology complementing radio communication in 6G. Typically, the downlink of IOWC is implemented using visible light and uplink is implemented using infrared. Though the downlink of IOWC has been studied well, the uplink of multiple-access IOWC requires further research. In this paper, power allocation strategies in the uplink of IOWC with multiple non-cooperative users is studied. Optimizing power allocation in IOWC that maximize sum-rate with power constraints becomes a non-convex problem. First, this paper proposes an alternating maximization algorithm to compute near optimal power allocation policies for small number of users. Next, a phenomenon of invariance is observed when the number of users in the system is large. Under invariance, the optimal power allocation policy of a user becomes independent of other users, thereby facilitating fast and decentralized computation of power allocation strategies. From simulations, it was observed that the invariance can occur even with five to ten users. For the first time, a rigorous analysis of the invariance phenomenon is provided. An algorithm to compute the optimal power allocation at invariance is proposed; this algorithm is proven to achieve the global maxima in sum-rate without the channel knowledge of other users. [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]

This paper presents a part of our ground-breaking work on evaluation of buildings in terms of wireless friendliness at the building-design stage. The main goal is to devise building design practices that provide for a good performance of wireless networks deployed in buildings. In this paper, the interference gain (IG) and power gain (PG) are defined as two figures of merit (FoM) of the wireless performance of buildings. The FoMs bridge the gap between building design and wireless communications industries. An approach to derive exact closed-form equations for these FoMs is proposed for the first time. The derived analytic expressions facilitate straightforward and more computationally efficient numerical evaluation of the proposed FoMs as compared to Monte Carlo simulations for well-known indoor propagation models. It is shown that the derived closed-form expression can be readily employed to evaluate the impact of building properties, such as the sizes and the aspect ratios (ARs) of rooms, on the wireless performance. The proposed approach sheds light to architects on evaluation and design of wireless-friendly building layouts. [ABSTRACT FROM AUTHOR]

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]

Unmanned aerial vehicles (UAVs) are widely deployed to enhance the wireless network capacity and to provide communication services to mobile users beyond the infrastructure coverage. Recently, with the help of a promising technology called network virtualization, multiple service providers (SPs) can share the infrastructures and wireless resources owned by the mobile network operators (MNOs). Then, they provide specific services to their mobile users using the resources obtained from MNOs. However, wireless resource sharing among SPs is challenging as each SP wants to maximize their utility/profit selfishly while satisfying the QoS requirement of their mobile users. Therefore, in this paper, we propose joint users association and wireless resource sharing problem in the cell-free UAVs-assisted wireless networks with the objective of maximizing the total network utility of the SPs while ensuring QoS constraints of their mobile users and the resource constraints of the UAVs deployed by MNOs. To solve the proposed mixed-integer non-convex problem, we decompose the proposed problem into two subproblems: users association, and resource sharing problems. Then, a two-sided matching algorithm is deployed in order to solve users association problem. We further deploy the whale optimization and Lagrangian relaxation algorithms to solve the resource sharing problem. Finally, extensive numerical results are provided in order to show the effectiveness of our proposed algorithm. [ABSTRACT FROM AUTHOR]

Computation over multiple access channels (CoMAC) has been proposed to solve the problem of spectrum scarcity in wireless networks, which combines communication and computation efficiently using the superposition property of wireless channels. In this paper, we consider a multi-cluster CoMAC network, whose performance is affected by the inter-cluster interference and the non-uniform fading. To minimize the sum mean squared error of signals aggregated at different fusion centers (FCs), we propose a transceiver design for multi-cluster CoMAC. Specifically, we adopt a uniform-forcing transmitter design to formulate the receiver design as a quadratic sum-of-ratios problem with nonconvex quadratic constraints. Then, we propose a branch-and-bound algorithm to find its optimal solution with a given error tolerance. To solve the problem in a decentralized way, we develop a distributed algorithm based on the primal decomposition theory. Each subproblem is solved by using the successive convex approximation method. Further combining Lagrange duality, we derive the optimal solution structure of each subproblem, based on which we can find the solution with lower complexity. Simulation results demonstrate the effectiveness of the proposed distributed transceiver design. [ABSTRACT FROM AUTHOR]

Caching at the wireless edge nodes is a promising way to boost the spatial and spectral efficiency, for the sake of alleviating networks from content-related traffic. Coded caching originally introduced by Maddah-Ali and Niesen significantly speeds up communication efficiency by transmitting multicast messages simultaneously useful to multiple users. Most prior works on coded caching are based on the assumption that each user may request all content in the library. However, in many applications the users are interested only in a limited set of content that depends on their location. For example, assisted self-driving vehicles may access super High-Definition maps of the area through which they are travelling. Motivated by these considerations, this paper formulates the coded caching problem for location-based content with edge cache nodes. The considered problem includes a content server with access to ${\mathsf N}$ location-based files (e.g., High-Definition maps), ${\mathsf K}$ edge cache nodes located at different regions, and ${\mathsf K}$ users (i.e., vehicles) each of which is in the serving region of one cache node and can retrieve the cached content of this cache node with negligible cost. Depending on the location, each user only requests a file from a location-dependent subset of the library. The objective is to minimize the worst-case load (i.e., the worst-case number of broadcasted bits from the content server among all possible demands). For this novel coded caching problem, we propose a highly non-trivial converse bound under uncoded cache placement (i.e., each cache node directly copies some library bits in its cache), which shows that a simple achievable scheme is optimal under uncoded cache placement. In addition, this achievable scheme is also proved to be generally order optimal within a factor of 3. Finally, we extend the coded caching problem for location-based content to the multiaccess coded caching topology originally proposed by Hachem et al., where each user is connected to ${\mathsf L}$ nearest cache nodes. When ${\mathsf L}\geq 2$ , we characterize the exact optimality on the worst-case load. [ABSTRACT FROM AUTHOR]

In this paper, we propose a cost-efficient beamforming optimization algorithm for multi-user wireless communication systems associated with the intelligent reflecting surface (IRS). From the baseline successive refinement algorithm, which gives a sub-optimal solution for the power minimization problem under the signal-to-interference-plus-noise-ratio (SINR) constraint at each user, several optimization techniques are proposed to reduce the computation complexity while maintaining the algorithm-level performance. To reduce the number of required multiply-accumulate (MAC) operations, we first simplify the complicated matrix inversion by utilizing the channel hardening effect. We also present the two-phase refinement process for the group-level optimization of phase-shift elements, further relaxing the computation complexity as well as the processing latency. Applying the proposed optimization techniques, as a result, numerical results show that the fully-optimized algorithm can reduce the computational costs by up to 89.4% while showing less than 1 dB power loss, leading to the practical solution for the next-generation IRS-aided communication. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) and coordinated multi-point (CoMP) are two fundamental techniques considered for the fifth generation (5 G) of wireless communications. In this paper, a hybrid satellite-unmanned aerial vehicle (UAV) relay network (HSURN) is proposed where the UAV relays (URs) employ CoMP transmission to serve the terrestrial users (UEs). Furthermore, all UEs associated with the CoMP-URs form a single NOMA cluster. For this model, an optimization problem is formulated subject to the minimum quality of services (QoSs) requirements of the UEs, transmission power budgets and, successive interference cancellation (SIC), to select URs and allocate their transmission powers for the energy efficiency (EE) maximization. With this insight, first, a computationally efficient sub-optimal UR selection scheme is proposed. Then, the powers are allocated to the selected URs via the Lagrange multipliers optimization (LMO) method. Due to the non-convex nature of the considered problem, it is relatively difficult to be solved. Hence, a metaheuristic teaching-learning-based optimization (TLBO) algorithm is employed to achieve an efficient solution. Simulation results are provided to verify the effectiveness of the proposed sub-optimal relay selection scheme and the TLBO-based power allocation method compared to the LMO conventional method. Besides, the obtained results also reveal that the CoMP-NOMA transmission in the proposed scenario significantly improves the spectral efficiency (SE) and outage probability (OP) of the system compared to non-comp NOMA transmission case. [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]

The heterogeneous fog radio access networks (Fog-RAN), the integration of fog computing, and traditional heterogeneous radio access networks can be implemented through the next-generation wireless communication networks. However, most of the solutions are limited to the spectrum efficiency optimization, and cross-tier interference existing in the fog access points (F-APs) could affect the network performance seriously. In this paper, the user association, resource allocation (including bandwidth and power), and caching deployment are investigated in the heterogeneous Fog-RAN to consider energy efficiency and cross-tier interference mitigation. Specifically, the user association, resource allocation, and caching strategy are formulated as a non-convex optimization problem and then transformed into a convex problem, which can be solved by a proposed algorithm based on the concept of the alternating direction method of multipliers (ADMM). Then an ADMM-based algorithm is proposed to enhance the energy efficiency of the Fog-RAN. Compared with the current solutions, simulation results illustrate the proposed algorithm’s convergence and effectiveness. [ABSTRACT FROM AUTHOR]

The future connectivity landscape, and notably, the 5G wireless systems will feature Ultra-Reliable Low Latency Communication (URLLC). The coupling of high reliability and low latency requirements in URLLC use cases makes the wireless access design very challenging, in terms of both the protocol design and of the associated transmission techniques. This paper aims to provide a broad perspective on the fundamental tradeoffs in URLLC, as well as the principles used in building access protocols. Two specific technologies are considered in the context of URLLC: massive MIMO and multi-connectivity, also termed interface diversity. This paper also touches on the importance of the proper statistical methodology for designing and assessing extremely high-reliability levels. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a secure mobile edge computing (MEC) network in the presence of multiple eavesdroppers, where multiple users can offload parts of their tasks to the computational access point (CAP). The multiple eavesdroppers may overhear the confidential task offloading, which leads to information leakage. In order to address this issue, we present the minimization problem of the secrecy outage probability (SOP), by jointly taking into account the constraints from the latency and energy consumption. With the aim to improve the system secrecy performance, we then introduce three user selection criteria to choose the best user among multiple ones. Specifically, criterion I maximizes the locally computational capacity, while criterion II and III maximize the secrecy capacity and data rate of main links, respectively. For these criteria, we further analyze the system secrecy performance by deriving analytical and asymptotic expressions for the SOP, from which we can conclude important insights for the system design. Finally, simulation and analytical results are provided to verify the proposed analysis. The results show that the three criteria can efficiently safeguard the MEC networks, compared to the traditional local computing and fully offloading, especially with a large value of user number. [ABSTRACT FROM AUTHOR]

This paper studies the integration of the newly-emerged intelligent reflecting surface (IRS) technology into non-orthogonal multiple access (NOMA)-based wireless powered communication networks (WPCNs). We consider two WPCNs which communicate with a common hybrid access point (HAP), where there exists two types of devices in each WPCN, namely information receiving device (IRD) and harvest-then-transmit device (HTTD). Downlink communication from the HAP to IRDs, downlink energy transfer (ET) from the HAP to HTTDs, and uplink information transmission (IT) from the HTTDs to the HAP are assisted by two IRSs, one in each WPCN. Under this setup, we propose efficient algorithms to optimize reflection coefficients, beamforming vectors, and resource allocation for the sake of uplink sum-rate maximization, taking into account the minimum rate requirement at the IRDs. Numerical results show the considerable performance gain of the proposed NOMA-based scheme as compared to the conventional orthogonal multiple access (OMA)-based counterpart. [ABSTRACT FROM AUTHOR]

Covert wireless communications aim to hide the existence of transmission behavior from watchful adversaries to enhance security. In this paper, we propose a spectrum mask based covert communication strategy in Internet of Things (IoT) networks, where the overt channels are leveraged to enhance the covertness. Specifically, the legitimate IoT transmitter superimposes its own message on the overt channel to avoid being detected by the warden. We assume that proper Gaussian signaling (PGS) is adopted at the overt channel, and improper Gaussian signaling (IGS) is adopted at the legitimate transmitter to improve the covert transmission performance. To maximize the covert rate of the legitimate IoT system, a joint transmit power and IGS factor optimization problem is formulated under the constraints of covertness requirement. The metric of minimum error detection probability, that represents the worst-case for the legitimate transmitter, is utilized to measure the covertness. By exploiting the piece-wise monotonic properties of the objective function and the constraints, we derive the optimal transmit power and IGS factor pairs in both the IGS and PGS schemes. Finally, extensive numerical results are presented to demonstrate that the IGS scheme can improve the covert rate compared to the PGS scheme under a given covertness constraint. [ABSTRACT FROM AUTHOR]

Due to transmission of train control and dispatch commands, the ultra high reliability is required for railway wireless communication systems (RWCS). However, the quality of service (QoS) of RWCS is affected by external interference and jamming seriously in railway transportation. The external interference and jamming generated from intentional and/or unintentional sources can disturb the transmission of RWCS and be extremely dangerous for the trains’ safety. In this paper, a reconfigurable intelligent surface (RIS) approach is proposed to suppress the interference and jamming in RWCS. By taking the signal-to-interference-plus-noise (SINR) as the QoS metrics, the interference suppression problem with RIS is transformed into a maximizing receiving SINR problem. Two optimum solutions, which one is based on Charnes-Cooper transformation and the other is based on single linear programming, are provided. In order to deploy the RIS in RWCS practically, two low-complexity sub-optimum solutions, which one is to bypass the channel estimation for interference links and the other is to maximize the receiving desired power, are also discussed. The simulations results show that the RIS can be employed in RWCS with considerable anti-interference gain. [ABSTRACT FROM AUTHOR]

In order to satisfy the requirement of extremely high data rate in traffic hotspot regions, millimeter wave (mmWave) has attracted significant attention in wireless communication networks. While the coverage performance of mmWave networks based on the distribution of signal-to-interference-plus-noise ratio (SINR) has been widely studied, it provides only very limited information on the link reliability. In this paper, we provide a fine-grained performance analysis of the mmWave networks with hotspots. Specifically, we first establish a general and tractable framework to investigate the performance of mmWave networks using the Poisson cluster process integrated with several features of the mmWave band. Both open and closed association strategies are considered. To show what fraction of users in the networks achieves target reliability when the SINR is given, we derive the tier association probability and the moments of the conditional SINR distribution, based on which the exact meta distributions of SINR are given. Interestingly, in clustered mmWave networks, the widely used standard and generalized beta approximations do not work well when the blockage effect is severe. To resolve this issue, we provide a modified approximation by scaling the standard beta distribution, which is shown to be closer to the exact results. We conduct extensive simulations to study the impact of mmWave and deployment features on the performance of clustered mmWave networks. Numerical results reveal that the optimal scattering variance of mmWave base stations scales with the cluster size to maximize the number of concurrent reliable links, and increasing the antenna directivity results in more reliable communications than elevating the transmit power of mmWave base stations. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) is deemed as a promising solution to improve the spectral and energy efficiency of wireless communications cost-effectively. In this paper, we consider a wireless network where multiple base stations (BSs) serve their respective users with the aid of distributed IRSs in the downlink communication. Specifically, each IRS assists in the transmission from its associated BS to user via passive beamforming, while in the meantime, it also randomly scatters the signals from other co-channel BSs, thus resulting in additional signal as well as interference paths in the network. As such, a new IRS-user/BS association problem arises pertaining to optimally balance the passive beamforming gains from all IRSs among different BS-user communication links. To address this new problem, we first derive a tractable lower bound of the average signal-to-interference-plus-noise ratio (SINR) at the receiver of each user, termed average-signal-to-average-interference-plus-noise ratio (ASAINR), based on which two ASAINR balancing problems are formulated to maximize the minimum ASAINR among all users by optimizing the IRS-user associations without and with BS transmit power control, respectively. We also characterize the scaling behavior of user ASAINRs with the increasing number of IRS reflecting elements to investigate the different effects of IRS-reflected signal versus interference power. Moreover, to solve the two ASAINR balancing problems that are both non-convex optimization problems, we propose an optimal solution to the problem without BS power control and low-complexity suboptimal solutions to both problems by applying the branch-and-bound method and exploiting new properties of the IRS-user associations, respectively. Numerical results verify our performance analysis and also demonstrate significant performance gains of the proposed solutions over benchmark schemes. [ABSTRACT FROM AUTHOR]

It has been a challenging task to derive the complementary cumulative distribution function (CCDF) of aggregate interference as closed-form in Poisson point process (PPP). In this paper, we consider wireless communication networks where transmitters are all distributed according to homogeneous PPP and study the CCDF of the interference. Mainly, we derive generalized bounds on the CCDF of aggregate interference from whole homogeneous PPP based on discretization of interference, which considerably enhance tightness compared to the previous bounds. These bounds can be used to the analysis requiring the distribution for aggregate interference, such as deployment and activation of BSs, massive MIMO, and millimeter wave communication networks. As examples of utilizing the derived bounds, we derive tractable coverage probabilities of uplink non-orthogonal multiple access (NOMA) users and downlink users in cellular networks under line-of-sight(LoS)/non-line-of-signt (NLOS) channels, respectively. In NOMA, we derive the closed-form bounds on coverage probability when successive interference cancellation is adopted for NOMA signal demodulation. Using the proposed bounds, we also obtain the bounds on coverage probability of a cellular system with LoS/NLOS channels. The tightness of bounds in this work is shown via numerical comparison. Moreover, we mathematically prove the convergence of bounds to exact CCDF. [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]

Consider a (multiple-access) wireless communication system where users are connected to a unique base station over a shared-spectrum radio links. Each user has a fixed number k of bits to send to the base station, and his signal gets attenuated by a random channel gain (quasi-static fading). In this paper we consider the many-user asymptotics of Chen-Chen-Guo’2017, where the number of users grows linearly with the blocklength. Differently, though, we adopt a per-user probability of error (PUPE) criterion (as opposed to classical joint-error probability criterion). Under PUPE the finite energy-per-bit communication is possible, and we are able to derive bounds on the tradeoff between energy and spectral efficiencies. We reconfirm the curious behaviour (previously observed for non-fading MAC) of the possibility of almost perfect multi-user interference (MUI) cancellation for user densities below a critical threshold. Further, we demonstrate the suboptimality of standard solutions such as orthogonalization (i.e. TDMA/FDMA) and treating interference as noise (i.e. pseudo-random CDMA without multi-user detection). Notably, the problem treated here can be seen as a variant of support recovery in compressed sensing for the unusual definition of sparsity with one non-zero entry per each contiguous section of 2k coordinates. This identifies our problem with that of the sparse regression codes (SPARCs) and hence our results can be equivalently understood in the context of SPARCs with sections of length 2100. Finally, we discuss the relation of the almost perfect MUI cancellation property and the replica-method predictions. [ABSTRACT FROM AUTHOR]

In recent years, wireless communication has experienced a massive shift from a single service (i.e., voice) to an interconnected web of networks. Although many techniques have been developed improving the offered services to mobile users, still the demand for high-quality services cannot be reached. Therefore, this paper proposes a joint non-orthogonal multiple access (NOMA)-enabled optimization framework for small-cell network (SCNet) by utilizing the concepts of multi-objective problem. In particular, the transmit power of base station (BS) in each small-cell simultaneously optimizes to maximize the sum-capacity and total energy efficiency (EE) of SCNet. The multi-objective optimization problem is formulated as non-convex subject to several practical constraints, i.e., individual quality of service requirement, maximum power budget of small-cell BS, and efficient decoding of superimposed signal using successive interference cancellation. Based on the nature of the problem, the optimal solutions are provided using sequential quadratic programming, and Karush-Kuhn-Tucker approaches. The obtained results show significant performance gains over conventional orthogonal multiple access technique in terms of sum-capacity and total EE. [ABSTRACT FROM AUTHOR]

Deep neural networks (DNNs) have been widely applied for classification tasks in wireless communications such as link scheduling, user association and base station (BS) muting. When training a DNN using datasets with highly-skewed class distribution where most data belong to a few majority classes, learning performance for minority classes will degrade since the imbalanced data forces the training process to be biased towards the majority classes. In many wireless problems, multiple decisions for classification are made jointly, say deciding which BSs in a network should be muted to avoid interference. In this paper, we employ DNN to learn an optimal predictive interference coordination policy, and strive to avoid biased learning in such a multi-label multi-class classification problem. The major contribution is proposing a training method to encourage fairness among classes by minimizing the maximal cost of decisions among classes, which is converted into a problem to optimize the weighting factors on the training cost of each class. We provide a gradient descent algorithm to optimize the weighting factors and the model parameters of the DNN by alternative updates. Simulation results show that the training method can improve the learning performance for the minority class and can achieve higher network utility than existing training methods. [ABSTRACT FROM AUTHOR]

Doppler effect is a fundamental phenomenon that appears in wave propagation, where a moving observer experiences dilation or contraction of the wavelength of a wave. It also appears in radio frequency (RF) wireless communication when there exists a relative movement between the transmitter and the receiver, and is widely considered as a major impairment for reliable wireless communication. The current paper proposes Doppler assisted wireless communication (DAWC) that exploits Doppler effect and uses kinetic energy for co-channel interference (CCI) mitigation. The proposed system also exploits the propagation environment and the network topology and consists of an access point (AP) with a rotating drum antenna. The rotating drum receive antenna is designed in such a way that it shifts the interfering signals away from the desired signal band. This paper includes a detailed system model, and the results show that under favorable fading conditions, CCI can be significantly reduced. Therefore, it is anticipated that more sophisticated wireless systems and networks can be designed by extending the basic ideas proposed herein. [ABSTRACT FROM AUTHOR]

Next-generation heterogeneous cellular network (HCN) expects more and more deployment of the base stations and spectrum to achieve data rate in gigabits per second with seamless connectivity. Recently, small cell deployment has proven its effectiveness for increasing the coverage and area spectral efficiency (ASE) of the cellular network. Although, dense small cell deployment also increases the deployment cost and cross-tier interference of the network. This paper suggests switching-based mixed millimeter wave (mmW)/ultra high frequency (UHF) cellular network as a possible solution to overcome these challenges. In mixed mmW/UHF cellular network (named as MMUCN), mmW is used as the main transmission link, and UHF band is utilized as a backup link. In this paper, a theoretical framework is developed using tools from the stochastic geometry to analyze the outage performance, ASE, and deployment cost efficiency (DCE) of the MMUCN, which comprises existing macro base stations and mmW base stations. Optimal mmW base station densities constraints by the outage are calculated, which maximizes the ASE and DCE. Furthermore, a multiobjective optimization problem is formulated to maximize ASE and DCE simultaneously. Numerical results show that MMUCN outperforms UHF-based two-tier cellular network and efficiently mitigates the cross-tier interference of the system. [ABSTRACT FROM AUTHOR]

The universal filtered multicarrier (UFMC) modulation is among the most considered solutions for the realization of beyond orthogonal frequency division multiplexing (OFDM) air interfaces for future wireless networks. This paper focuses on the design and analysis of a UFMC transceiver equipped with multiple antennas and operating at millimeter-wave carrier frequencies. This paper provides the full mathematical model of an MIMO-UFMC transceiver, taking into account the presence of hybrid analog/digital beamformers at both ends of the communication links. Then, several detection structures are proposed, both for the case of single-packet isolated transmission and for the case of multiple-packet continuous transmission. In the latter situation, this paper also considers the case in which no guard time among adjacent packets is inserted, trading off an increased level of interference with higher values of spectral efficiency. At the analysis stage, several considered detection structures and transmission schemes are compared in terms of bit-error rate, root-mean-square error, and system throughput. The numerical results show that the proposed transceiver algorithms are effective and that the linear minimum mean-square error (MMSE) data detector is capable of well managing the increased interference brought by the removal of guard times among consecutive packets, thus yielding throughput gains of about 10%–13%. The effect of phase noise at the receiver is also numerically assessed, and it is shown that the recursive implementation of the linear MMSE exhibits some degree of robustness against this disturbance. [ABSTRACT FROM AUTHOR]

This paper provides an analytical performance characterization of both the uplink (UL) and downlink (DL) user-centric network multiple-input multiple-output (MIMO) systems, where a cooperating base station (BS) cluster is formed for each user individually and the clusters for different users may overlap. In this model, cooperating BSs (each equipped with multiple antennas) jointly perform zero-forcing beamforming to the set of single-antenna users associated with them. As compared with a baseline network MIMO system with disjoint BS clusters, the effect of user-centric clustering is that it improves signal strength in both the UL and DL, while reducing cluster-edge interference in the DL. This paper quantifies these effects by assuming that BSs and users form Poisson point processes and by further approximating both the signal and interference powers using Gamma distributions of appropriate parameters. We show that BS cooperation provides significant gain as compared to single-cell processing for both the UL and DL, but the advantage of user-centric clustering over the baseline disjoint clustering system is significant for the DL cluster-edge users only. Although the analytic results are derived with the assumption of perfect channel state information and infinite backhaul between the cooperating BSs, they nevertheless provide architectural insight into the design of the future cooperative cellular networks. [ABSTRACT FROM AUTHOR]

In this paper, a comprehensive design and analysis of multiple-input multiple-output (MIMO) full-duplex (FD) relaying systems in a multi-cell environment is investigated, where a multi-antenna amplify-and-forward FD relay station serves multiple half-duplex (HD) multi-antenna users. The pivotal obstacles of loopback self-interference (LI) and multiple co-channel interferers (CCI) at the relay and destination when employing FD relaying in cellular networks are addressed. In contrast to the HD relaying mode, the CCI in the FD relaying mode is predicted to double since the uplink and downlink communications are simultaneously scheduled via the same channel. In this paper, the optimal layout of transmit (receive) precoding (decoding) weight vectors which maximizes the overall signal-to-interference-plus-noise ratio is constructed by a suitable optimization problem, and then a closed-form sub-optimal formula based on null space projection is presented. The proposed hop-by-hop rank-1 zero-forcing (ZF) beamforming vectors are based on added ZF constraints used to suppress the LI and CCI channels at the relay and destination, i.e., the source and relay perform transmit ZF beamforming, while the relay and destination employ receive ZF combining. To this end, unified accurate expressions for the outage probability and ergodic capacity are derived in closed form. In addition, simpler tight lower bound formulas for the outage probability and ergodic capacity are presented. Moreover, the asymptotic approximations for outage probability are considered to gain insights into system behavior in terms of the diversity order and array gain. Numerical and simulation results show the accuracy of the presented exact analytical expressions and the tightness of the lower bound expressions. The case of hop-by-hop maximum-ratio transmission/maximal-ratio combining beamforming is included for comparison purposes. Furthermore, our results show that while multi-antenna terminals improve the system performance, the detrimental effect of CCI on FD relaying is clearly seen. Therefore, our findings unveil that MIMO FD relaying could significantly improve the system performance compared to its conventional MIMO HD relaying counterpart. [ABSTRACT FROM AUTHOR]

The integration of local device-to-device (D2D) communications and cellular connections has been intensively studied to satisfy co-existing D2D and cellular communication demand. In future cellular networks, there will be numerous standby users possessing D2D communication capabilities in close proximity to each other. Considering that these standby users do not necessarily request D2D communications all the time, in this paper we propose a hybrid D2D-cellular scheme to make use of these standby users and to improve the rate performance for cellular users. More specifically, through D2D links, a virtual antenna array can be formed by sharing antennas across different terminals to realize the diversity gain of MIMO channels. This paper considers the use of millimeter wave links to enable high data rate D2D communications. We then design an orthogonal D2D multiple access protocol and formulate the optimization problem of joint cellular and D2D resource allocation for downlink transmissions using the proposed scheme. We obtain a closed-form solution for D2D resource allocation, which reveals useful insights for practical system design. Numerical results from extensive system-level simulations demonstrate that the rate performance of cellular users is significantly improved. [ABSTRACT FROM AUTHOR]

Hardware calibration is essential to restore the uplink/downlink channel reciprocity for multi-user massive multiple-input multiple-output (MIMO) systems operating in a time division duplexing mode. Unfortunately, due to the associated overhead, calibration cannot be performed frequently; furthermore, any calibration procedure leaves behind a residual mismatch between the uplink and downlink channels. In this paper, we study the effects of these calibration errors on the achievable rates in the downlink of a multi-cell, multi-user, and distributed massive MIMO system. Specifically, we develop accurate, yet simple, lower-bounds on the per-user achievable rate, assuming either zero-forcing (ZF) or matched filtering (MF) are used. We also introduce a performance loss coefficient as a measure of sensitivity of the performance to the calibration errors. Using this measure, we identify the conditions under which ZF precoding is more sensitive to calibration errors than MF. Finally, we consider the robust weighted sum-rate maximization problem to mitigate the degrading effects of non-ideal calibration. Our numerical experiments show that the rate lower-bounds developed in this paper accurately quantify the impacts of non-ideal calibration on performance. Also, the proposed robust beamforming scheme improves the average sum-rate by up to 42% compared with the other available schemes. [ABSTRACT FROM AUTHOR]

This paper analyzes an emerging architecture of cellular network utilizing both planar base stations uniformly distributed in the Euclidean plane and base stations located on roads. An example of this architecture is that where, in addition to conventional planar cellular base stations and users, vehicles also play the role of both base stations and users. A Poisson line process is used to model the road network and, conditionally on the lines, linear Poisson point processes are used to model the vehicles on the roads. The conventional planar base stations and users are modeled by the independent planar Poisson point processes. We use Palm calculus to investigate the statistical properties of a typical user in such a network. Specifically, this paper discusses two different Palm distributions, with respect to the user point processes depending on its type: planar or vehicular. We derive the distance to the nearest base station, the association of the typical users, and the coverage probability of the typical user. Furthermore, we provide a comprehensive characterization of coverage of all possible cellular transmissions in this setting, namely, vehicle-to-vehicle, vehicle-to-infrastructure, infrastructure-to-vehicle, and infrastructure-to-infrastructure. [ABSTRACT FROM AUTHOR]

Visible light communication (VLC) is an emerging short-range optical wireless communication technology that is driven by the widespread deployment of light-emitting diodes (LEDs). Indoor VLC users may experience noticeable interference when independent transmitters utilizing wide-beam luminaires are closely located. In this paper, a coordinated beamforming (CB) scheme is proposed for downlink interference mitigation among the coexisting VLC attocells utilizing multi-luminaire transmitters. Compared to joint transmission (JT) schemes, wherein the data and channel state information are shared among transmitters of different attocells, the proposed CB scheme places lower requirements on the network in terms of backbone traffic, and is easier to implement in a practical deployment, though at the cost of compromised performance. In this paper, we investigate the downlink transmission of coordinated VLC attocells and focus on its transmitter design. The weighted sum mean square error (WSMSE) is adopted as the performance metric to take into consideration interference, noise, and fairness among users in system optimization. The WSMSE minimization problem is considered with linear beamforming restricted by amplitude constraints. Such constraints arise from the dynamic range limitations in typical LEDs. Moreover, we extend our design method to take into account possible mismatches in channel information available to the transmitters. Numerical examples are provided to illustrate the performance of the proposed CB scheme in typical VLC scenarios. We also quantify the performance gap among several coordination schemes including JT and CB. [ABSTRACT FROM AUTHOR]

In heterogeneous multi-cell networks (HetNets), inter-and intra-cell interference are critical issues impairing the performance. In this paper, the frequency-hopping (FH) technique based on an attractive FH sequence (FHS) set with two-level Hamming correlations is exploited in such networks. Motivating from the idea of no-and low-hit-zone FHS sets, a construction algorithm of the new FHS set is proposed by utilizing the interleaving technique. Then, the performance metric of such FHS set in terms of Hamming correlation properties are derived, which are verified by an example. Compared with classic FHS sets (patterns), the proposed FHS set offers a zero Hamming cross-correlation for intra-cell users, and a low Hamming cross-correlation for inter-cell users (i.e., multi-level quality-of-services). The intra-and inter-interference in multi-cell HetNets can be significantly reduced by the proposed sequence-based FH technique. [ABSTRACT FROM AUTHOR]

Cognitive radio (CR) is an effective solution to improve the spectral efficiency (SE) of wireless communications by allowing the secondary users (SUs) to share spectrum with primary users (PUs). Meanwhile, intelligent reflecting surface (IRS), also known as reconfigurable intelligent surface (RIS), has been recently proposed as a promising approach to enhance energy efficiency (EE) of wireless communication systems through intelligently reconfiguring the channel environment. To improve both SE and EE, in this paper, we introduce multiple IRSs to a downlink multiple-input single-output (MISO) CR system, in which a single SU coexists with a primary network with multiple PU receivers (PU-RXs). Our design objective is to maximize the achievable rate of SU subject to a total transmit power constraint on the SU transmitter (SU-TX) and interference temperature constraints on the PU-RXs, by jointly optimizing the beamforming at SU-TX and the reflecting coefficients at each IRS. Both perfect and imperfect channel state information (CSI) cases are considered in the optimization. Numerical results demonstrate that IRS can significantly improve the achievable rate of SU under both perfect and imperfect CSI cases. [ABSTRACT FROM AUTHOR]

This paper presents a computationally efficient technique for decomposing non-orthogonally superposed $k$ geometric sequences. The method, which is named as geometric sequence decomposition with $k$ -simplexes transform (GSD-ST), is based on the concept of transforming an observed sequence to multiple $k$ -simplexes in a virtual $k$ -dimensional space and correlating the volumes of the transformed simplexes. Hence, GSD-ST turns the problem of decomposing $k$ geometric sequences into one of solving a $k$ -th order polynomial equation. Our technique has significance for wireless communications because sampled points of a radio wave comprise a geometric sequence. This implies that GSD-ST is capable of demodulating randomly combined radio waves, thereby eliminating the effect of interference. To exemplify the potential of GSD-ST, we propose a new radio access scheme, namely non-orthogonal interference-free radio access (No-INFRA). Herein, GSD-ST enables the collision-free reception of uncoordinated access requests. Numerical results show that No-INFRA effectively resolves the colliding access requests when the interference is dominant. [ABSTRACT FROM AUTHOR]

Vehicle-to-vehicle (V2V) underlay cellular communication plays an important role in the fifth-generation (5G) and beyond communications and its security issues attract a lot of attention. Physical layer security, which explores channel characteristics to protect wireless communications, is very attractive due to its low latency. This paper focuses on secrecy capacity maximization in V2V underlay cellular communications, where the secrecy capacity of vehicular user equipments (VUEs) is optimized first, followed by sum proportional fairness function optimization for both VUEs and cellular user equipments (CUEs). The optimization problems can be solved in two sub-problems, e.g., power and subcarrier allocation problems. The power allocation can be done with the first strategy using a one-dimensional searching algorithm, whereas a genetic algorithm (GA) is used to solve the second optimization problem. In addition, as VUEs share uplink resources with CUEs, the co-channel interference exists and the subcarrier allocation sub-problem is a 3D search problem, which is solved by a two-step iterative Hungarian algorithm (IHA). Finally, simulations are performed to validate the performance of the proposed schemes. [ABSTRACT FROM AUTHOR]

This paper studies multi-agent deep reinforcement learning (MADRL) based resource allocation methods for multi-cell wireless powered communication networks (WPCNs) where multiple hybrid access points (H-APs) wirelessly charge energy-limited users to collect data from them. We design a distributed reinforcement learning strategy where H-APs individually determine time and power allocation variables. Unlike traditional centralized optimization algorithms which require global information collected at a central unit, the proposed MADRL technique models an H-AP as an agent producing its action based only on its own locally observable states. Numerical results verify that the proposed approach can achieve comparable performance of the centralized algorithms. [ABSTRACT FROM AUTHOR]

This paper investigates the performance of a non-orthogonal multiple access (NOMA) network with simultaneous wireless information, and power transfer (SWIPT) based battery-assisted energy harvesting (EH) full-duplex relay (FDR). In each signalling interval, the base-station communicates directly to a near user (NU), and through an EH FDR to a far user (FU). Considering the power-splitting (PS) protocol with a non-linear EH model, we derive closed-form expressions for the NU, and FU outage probabilities. We also demonstrate how the battery energy, and PS parameter can be chosen to maximize the FU throughput while ensuring a desired NU throughput when there is imperfect interference cancellation at the NU. Computer simulation results validate the accuracy of the derived expressions, and demonstrate that augmenting the harvested energy with a small quantum of the relay's battery energy can considerably improve the FU performance. [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]

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]

This paper characterizes the performance in terms of queueing stability of a network composed of multiple MIMO transmitter-receiver pairs taking into account the dynamic traffic pattern and the probing/feedback cost. We adopt a centralized scheduling scheme that selects a number of active pairs in each time-slot. We consider that the transmitters apply interference alignment (IA) technique if two or more pairs are active, whereas in the special case where one pair is active point-to-point MIMO singular value decomposition (SVD) is used. We consider a time-division duplex (TDD) system where transmitters acquire their channel state information (CSI) by decoding the pilot sequences sent by the receivers. Since global CSI knowledge is required for IA, the transmitters have also to exchange their estimated CSIs over a backhaul of limited capacity (i.e. imperfect case). Under this setting, we characterize in this paper the stability region of the system under both the imperfect and perfect (i.e. unlimited backhaul) cases, then we examine the gap between these two resulting regions. Further, under each case we provide a centralized probing policy that achieves the max stability region. These stability regions and scheduling policies are given for the symmetric system, where all the path loss coefficients are equal to each other, as well as for the general system. For the symmetric system, we provide the conditions under which IA yields a queueing stability gain compared to SVD. Under the general system, the adopted scheduling policy is of a high computational complexity for moderate numbers of pairs, consequently we propose an approximate policy that has a reduced complexity but that achieves only a fraction of the system stability region. A characterization of this fraction is provided. [ABSTRACT FROM PUBLISHER]

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]