Search

This paper proposes a novel bit loading algorithm to multicarrier non-orthogonal multiple access (NOMA) systems to maximize the system total throughput while satisfying the users’ individual quality of service (QoS) constraints. Although bit loading is generally a non-deterministic polynomial-time (NP)-hard problem, even for orthogonal multiple access (OMA), the mutual interference between the users, and the dependence of power coefficients and modulation orders are additional challenges that add substantial complexity to the optimization problem. Therefore, in this paper, we propose an efficient bit loading algorithm for multicarrier NOMA systems and compare the complexity and throughput with a corresponding OMA system. The obtained results show that for the case of NOMA, bit loading provides an additional degree of freedom that allows non-uniform spectrum sharing among the users. In particular scenarios, the system may experience hybrid modes of operation, where the system switches between NOMA and OMA. The obtained numerical results show that NOMA can outperform OMA by 100% in terms of spectral efficiency, for a two-user scenario. The complexity of the loading process for NOMA is noticeably higher than OMA, which is due to the high complexity associated with the bit error rate (BER) computation in the case of NOMA. [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, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications. The proposed CRA scheme is scalable. As a result, if the number of devices increases, more RBs can be added to support them. Thanks to multiple RBs, we can employ fast retrial between RBs for re-transmissions of collided packets, which can result in short access delay. For stable CRA with fast retrial, we derive conditions (with a rate control scheme), and analyze the steady-state performance to find the throughput and delay. Through analysis and simulation results, we can see that the proposed scheme can perform better than conventional multichannel ALOHA and enjoy a tradeoff between the performance and complexity in terms of the number of RBs. [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]

Channel gain based path selection has been recently proposed to simplify the network design of a cluster-based cross-layer multihop vehicular communications. In vehicular network systems, end-to-end packet delay increases with the growing number of vehicles associated in that path. In delay-sensitive application, the information exchange must be successfully carried out very quickly to ensure the quality of infotainment services. In the case of excessive packet delay, some important information either are needed to be enqueued before reaching the destination or are lost. The packet loss makes it impractical to deploy the network in practice. In this paper, a new delay-sensitive buffer-aided relay selection is proposed using the channel-based greedy scheduling algorithm (CGSA) to overcome the limitations imposed by processing delay. The proposed scheme significantly minimizes average delay by selecting a set of alternative paths based on individual node buffer status. This scheme has less packet delay than existing Max-link scheme with very close system performances, making it an ideal candidate for delay-sensitive applications. Finally, both analytical and simulation results are provided to demonstrate the performance improvement of the proposed algorithm compared with the existing relaying schemes. [ABSTRACT FROM AUTHOR]

Terahertz (THz) band communication is envisioned as a key technology to satisfy the increasing demand for ultrabroadband wireless systems, thanks to its ultrabroad bandwidth. Tailored for the unique properties of pulse-based communications in the THz band, two timing acquisition algorithms are proposed and analyzed thoroughly in this paper. First, a low-sampling-rate (LSR) synchronization algorithm is proposed, by extending the theory of sampling signals with finite rate of innovation in the communication context and exploiting the properties of the annihilating filter. The simulation results show that the timing accuracy at an order of ten picoseconds is achievable. In particular, the LSR algorithm has high performance with uniform sampling at $1/20$ of the Nyquist rate when the signal-to-noise ratio (SNR) is high (i.e., greater than 18 dB). Complementary to this, a maximum likelihood (ML) approach for timing acquisition is developed, which searches for the timing offsets by adopting a two-step acquisition procedure based on the ML criterion. The simulation results show that the ML-based algorithm is well suitable in the low SNR case with a half-reduced search space. For further evaluation, the error performance and the resulting bit-error-rate sensitivity to the timing errors in the LSR and the ML algorithms are both analytically and numerically studied. This paper provides very different and promising angles to efficiently and reliably solve the timing acquisition problem for pulse-based THz band wireless systems. [ABSTRACT FROM PUBLISHER]

Due to signal fading and user mobility in wireless networks, quality-of-service provisioning for wireless services has become more challenging. As a promising technique, cooperative communications make use of the broadcasting nature of the wireless medium to facilitate data transmission and, thereby, reduce energy consumption. However, in many studies on wireless cooperative diversity, it is often assumed that the number of relays or the relay distribution intensity is known a priori. In this paper, we relax this assumption and propose an algorithm to estimate the relay intensity for a backoff-based cooperative scheme, where the relays are distributed as a homogeneous Poisson point process. It is proved that the algorithm can converge to an optimal solution with the minimum estimation error. Based on the estimated relay intensity, we further investigate a distributed energy saving strategy, which selectively turns off some relays to reduce energy consumption while maintaining the required transmission success probability. The performance of the proposed cooperative scheme is analytically evaluated with respect to the collision probability. The numerical and simulation results demonstrate the high accuracy and efficiency of the intensity estimation algorithm and validate the theoretical analysis. Moreover, the proposed cooperative scheme exhibits significant energy savings and satisfactory transmission performance, which offers a good match to accommodate green communications in wireless networks. [ABSTRACT FROM PUBLISHER]

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

In the heterogeneous networks (HetNets), the downlink-uplink decoupled (DUDE) user association is a very promising technology that can employ different association strategies for uplink and downlink. The DUDE mode has great potential for improving system capacity and frequency efficiency. However, interference between the DUDE user equipment (DUDE UE), macro user equipment (MUE) and small user equipment (SUE) still needs to be considered and properly tackled. Therefore, this paper presents an optimization scheme of frequency allocation and power control to improve the communication quality of users. Firstly, the multiple region frequency allocation (MRFA) scheme is proposed for non-uniform user distribution to alleviate interference among users and allocate spectrum resources equally to dense users. This scheme is modelled as a sub-region partition problem with maximum sum rate, which can disperse densely distributed users to different sub-bands for transmission. Secondly, the convergent power control (CPC) algorithm is considered to improve the transmission performance of each user. It can converge the transmit power to the optimal transmit power for reducing interference among co-channel users when there is no disturbance in the network. The CPC algorithm can also make the signal-to-interference-plus-noise-ratio (SINR) of each active user always greater than the target threshold until the end of communication by dynamically adjusting the transmit power of users. Simulation results show that the joint scheme of MRFA and CPC achieves a higher system throughput and better user performance than existing frequency allocation schemes or power control schemes. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new beam allocation strategy aiming to maximize the average successful tracking probability (ASTP) of a single user time-varying millimeter-wave MIMO system. In contrast to most existing works that employ one transmitting-receiving (Tx-Rx) beam pair once only, we investigate a more general framework, where the Tx-Rx beam pairs are allowed to be used repeatedly in each beam training period to improve the received signal powers in specific directions. In the case of orthogonal Tx-Rx beam pairs, a power-based estimator is employed to track the time-varying AoA and AoD of the channel, and the resulting training beam pair sequence design problem is formulated as an integer nonlinear programming (I-NLP) problem. By dividing the feasible region into a set of subregions, the formulated I-NLP is decomposed into a series of concave sub I-NLPs, which can be solved by recursively invoking a nonlinear branch-and-bound algorithm. To reduce the computational cost, we relax the integer constraints of each sub I-NLP and obtain a low-complexity solution via solving the Karush-Kuhn-Tucker conditions of their relaxed problems. For the case when the Tx-Rx beam pairs are overlapped in the angular space, we estimate the updated AoA and AoD via an orthogonal matching pursuit (OMP) algorithm. Moreover, since no explicit expression for the ASTP exists for the OMP-based estimator, we derive a closed-form lower bound of the ASTP, based on which a favorable beam pair allocation strategy can be obtained. Numerical results demonstrate the superiority of the proposed beam allocation strategy over existing benchmarks. [ABSTRACT FROM AUTHOR]

In this paper, we consider a downlink multiuser multiple-input–multiple-output (MU-MIMO) system with multiple antennas at the transmitter and multiple antennas at each user, where the transmitter can send one or more data streams to each user. We propose a non-iterative method by combining Tomlinson–Harashima precoding (THP) with pre- and post-processing and selecting processing vectors based on the maximization of instantaneous signal-to-noise ratio (SNR) of the data stream at the input of the detector of each user. The postprocessing vectors for all users are found to be eigenvectors corresponding to the maximum eigenvalue of a certain matrix involving the channel matrix of the user. The transmitter computes the vectors of the linear processing matrix through an orthonormalization procedure in a single step. The feedback matrix at the transmitter is then obtained from the effective channel matrix and the linear processing matrix. We express the instantaneous SNR of all data streams in terms of eigenvalues of a Wishart matrix, obtained from the channel matrix of the user, and find the diversity order for each data stream. Considering multiple scenarios, we find the outage probability of the instantaneous SNR for all data streams and the cumulative distribution function (cdf) of the sum-rate capacity for all users using the proposed method and compare the results with those of recently proposed methods that provide a closed-form solution and with that of block diagonalization, channel inversion, and THP in scenarios where they are applicable. [ABSTRACT FROM PUBLISHER]

Small cells are introduced to cellular systems to enhance coverage and improve capacity. Densely deploying small cells can not only offload the traffic of macrocells but also provide an energy- and cost-efficient way to meet the sharp increase in traffic demands in mobile networks. However, such a cell deployment paradigm also leads to heterogeneous network (HetNet) infrastructure and raises new challenges for cell planning. In this paper, we study the cell planning issue in the HetNet. Our optimization task is to select a subset of candidate sites to deploy macro or small cells to minimize the total cost of ownership (TCO) or the energy consumption of the cellular system while satisfying practical constraints. We introduce approximation algorithms to cope with two different cell-planning cases, which are both NP-hard. First, we discuss the macrocell-only case. Our proposed algorithm achieves an approximation ratio of O(\log R) in this scenario, where R is the maximum achievable capacity of macrocells. Then, we introduce an O(\log \widetildeR)-approximation algorithm to the small-cell scenario, where \widetildeR is the maximum achievable capacity of a macrocell with small cells overlaid on it. Numerical results indicate that the HetNet can significantly reduce the TCO and the energy consumption of the cellular system. [ABSTRACT FROM PUBLISHER]

In this paper, we consider the coordinated multipoint (CoMP) transmission design for the downlink cloud radio access network (Cloud-RAN). Our design aims to optimize the set of remote radio heads (RRHs) serving each user and the precoding and transmission power to minimize the total transmission power while maintaining the fronthaul capacity and users' quality-of-service (QoS) constraints. The fronthaul capacity constraint involves a nonconvex and discontinuous function that renders the optimal exhaustive search method unaffordable for large networks. To address this challenge, we propose two low-complexity algorithms. The first pricing-based algorithm solves the underlying problem through iteratively tackling a related pricing problem while appropriately updating the pricing parameter. In the second iterative linear-relaxed algorithm, we directly address the fronthaul constraint function by iteratively approximating it with a suitable linear form using a conjugate function and solving the corresponding convex problem. For performance evaluation, we also compare our proposed algorithms with two existing algorithms in the literature. Finally, extensive numerical results are presented, which illustrate the convergence of our proposed algorithms and confirm that our algorithms significantly outperform the state-of-the-art existing algorithms. [ABSTRACT FROM PUBLISHER]

In this paper, an adaptive nonlinear differential limiter (ANDL) is proposed to efficiently alleviate the impact of impulsive noise (IN) in a communication system. Unlike existing nonlinear methods, the ANDL is implemented in the analog domain where the broader acquisition bandwidth makes outliers more detectable and consequently it is easier to remove them. While the proposed ANDL behaves like a linear filter when there is no outlier, it exhibits intermittent nonlinearity in response to IN. Therefore, the structure of the matched filter in the receiver is modified to compensate the filtering effect of the ANDL in the linear regime. In this paper, we quantify the performance of the ANDL by deriving a closed-form analytical bound for the average signal-to-noise ratio at the output of the filter. The calculation is based on the idea that the ANDL can be perceived as a time-variant linear filter whose bandwidth is modified based on the intensity of the IN. In addition, by linearizing the filter time parameter variations, we treat the ANDL as a set of linear filters where the exact operating filter at a given time depends upon the magnitude of the outliers. The theoretical average bit error rate is validated through simulations and the performance gains relative to classical methods such as blanking and clipping are quantified. [ABSTRACT FROM AUTHOR]

In this paper, we propose a generalized channel decoding scheme for nonbinary physical-layer network coding (CD-NC) in two-way relay channels (TWRCs), where two source nodes A and B exchange their nonbinary symbols via a relay. The two sources use the same nonbinary low-density parity-check (LDPC) channel code over the integer ring $\mathbb {Z}_M$ and $M$ -pulse-amplitude modulation, respectively. The existing channel decoding schemes for nonbinary network coding suffer severe rate loss compared with the cut-set bound of TWRC, especially in the low-to-medium signal-to-noise ratio regime. The proposed CD-NC can decrease the rate loss. Our contributions are as follows: 1) We develop a generalized nonbinary sum product algorithm (G-SPA) for CD-NC according to the principle of virtual encoding of the superimposed symbols. Simulation results show that our CD-NC can achieve significant performance gains over the conventional nonbinary network coding for both additive white Gaussian noise and fading channels; and 2) We exploit two-dimensional fast-Fourier-transform-based belief propagation (2-D-FFT-BP) and extended min-sum (EMS) decoding algorithms to reduce the decoding complexity of G-SPA. Simulation results show that the 2-D-FFT-BP has the same performance as G-SPA, while EMS can greatly reduce the decoding complexity of G-SPA at the cost of slight performance degradation. [ABSTRACT FROM AUTHOR]

This paper presents a novel autocorrelation-based algorithm that uses statistical knowledge to detect orthogonal frequency division multiplexing signals in channels where frequency offset is present. The algorithm may be viewed as a significant improvement over other types of autocorrelation algorithms that appear in literature that lead to false alarm due to the hardware impairment of frequency offset. The algorithm works by making an unbiased estimate of the square of an autocorrelation coefficient and from that deduces an appropriate probability density function for the phase angle of the complex test statistic and thereby palliating the effect of phase distortion introduced by the frequency offset. It is shown that the algorithm presented in this paper can be implemented on a testbed, as well as overcome simulations that have been specifically designed to have worst case frequency offset phase distortion conditions. [ABSTRACT FROM AUTHOR]

To ensure link reliability and signal receiving quality, robust adaptive beamforming (RAB) is vital important in mobile communications. In this paper, we propose a new RAB algorithm based on interference-plus-noise covariance (INC) matrix reconstruction and steering vector (SV) estimation. In this method, the INC matrix is reconstructed by estimating all interferences SVs and powers, as well as the noise power. The interference SVs are estimated by using the Capon spatial spectrum together with robust Capon beamforming principle, subsequently the interference powers are estimated based on the orthogonality between different signal SVs. On the other hand, the desired signal SV is estimated via maximizing the beamformer output power by solving a quadratic convex optimization problem. The proposed algorithm only needs to know in advance the array geometry and angular sector, in which the desired signal lies. Simulation results indicate that the proposed algorithm outperforms the existing RAB techniques in terms of the overall performance in cases of various mismatches. [ABSTRACT FROM AUTHOR]

Spectrum sensing in next-generation wireless radio networks is considered a key technology to overcome the problem of spectrum scarcity. Unfortunately, many approaches to spectrum sensing do not work well in low signal-to-noise ratio (SNR) environments. This paper proposes and analyzes a new algorithm named kernelized generalized likelihood ratio test (KGLRT) for spectrum sensing in cognitive radio systems to overcome this problem. Effectively, KGLRT uses a nonlinear kernel to map input data onto a high-dimensional feature space; then, the widely accepted (linear) generalized likelihood ratio test is used for hypothesis testing. This new algorithm gives a gain of 4 dB in SNR over its linear counterpart. A theoretical analysis for this algorithm is given for the first time and is shown analogous to algorithms used in image signal processing. The detection metrics are found to be concentrated random variables; furthermore, the probability distributions of the detection metrics are proved to follow the F -distributions, which agree with the results obtained using the concentration inequality. The analytical thresholds are derived for target false-alarm probabilities. The thresholds are independent of noise power; thus, the proposed algorithm can overcome noise uncertainty issues at very low SNR levels. Simulations validate the theoretical results. [ABSTRACT FROM AUTHOR]

This paper proposes a flexible pilot assignment method to jointly optimize the uplink and downlink data transmission in multi-cell Massive multiple input multiple output (MIMO) systems with correlated Rayleigh fading channels. By utilizing a closed-form expression of the ergodic spectral efficiency (SE) achieved with maximum ratio processing, we formulate an optimization problem for maximizing the minimum weighted sum of the uplink and downlink SEs subject to the transmit powers and pilot assignment sets. This combinatiorial optimization problem is solved by two sequential algorithms: a heuristic pilot assignment is first proposed to obtain a good pilot reuse set and the data power control is then implemented. Numerical results manifest that the proposed algorithm converges fast to a better minimum sum SE per user than the algorithms in previous works. [ABSTRACT FROM AUTHOR]

In this paper, we study the power allocation problem in a multiuser cooperative network, where users help each other's transmissions to an access point. We use iterative double auction (IDA) game to model the interaction among the users and the access point. In each iteration of this game, the users first submit bids for buying other users' power and asks for selling its own power, and then, the access point determines the power allocation based on users' bids and asks. We propose a distributed algorithm for the implementation of the IDA-based power allocation. We also show that the proposed algorithm achieves a weighted sum signal-to-noise ratio (sum-SNR)-optimal solution. Simulation results are conducted to verify the performance of the proposed algorithm. [ABSTRACT FROM PUBLISHER]

The energy detection technology is recommended in the licensed assisted access (LAA) scheme by 3GPP because of its simplicity and low cost. However, due to its inherent limitation, there may exist imperfect channel detection, which can lead to the decrease of the channel utilization efficiency and the deterioration of fairness. The imperfect detection can generally be represented by the detection probability and false alarm probability, which depend on detection time, signal to noise ration (SNR), sampling rate and energy threshold. However, among the parameters, only the energy threshold can be dominated by LAA small base stations (SBSs) in the LAA scheme. Therefore, the energy threshold should be dynamically adjusted in the changeable channel environment such that the detection accuracy can improved as high as possible. Consider the fact that the optimization theory cannot be used to optimize the energy threshold since the expressions of performance indexes about the energy threshold are extremely complex, a Q-learning based energy threshold optimization algorithm (QLET) is thus proposed in the paper, where LAA SBSs act as the agent, the energy threshold is defined as the agent action, the different combinations of fairness and throughput are defined as the agent states, and the fairness and the reward function are also redefined. In order to ensure the smooth implementation of the proposed QLET algorithm, the information exchange mechanism, where the sending-confirmation mechanism and 1- persistent CSMA are used, is also proposed. Based on the proposed QL framework, the agent can learn the optimal energy threshold by repeatedly interacting with the environment, which enables the coexistence system to obtain the best coexistence performance. A large number of simulation results show that the proposed QLET is superior to the traditional fixed energy threshold scheme (FET) in terms of the fairness, WiFi collision probability and transmission delay, and that QLET is almost the same as FET in term of throughput. [ABSTRACT FROM AUTHOR]

We consider the uplink transmission in multiuser wireless systems with multiple single-antenna transmitting users and a multiantenna receiver. We address two problems in this paper. The first problem is user admission, i.e., given a large number of users, how to admit the maximum number of users that can simultaneously satisfy quality of service (QoS) and power constraints. The second problem is how to distribute the data among the users when they are allowed to share data before transmission. The aim is to minimize the total data exchange cost. Such a problem is called user clustering. We formulate those problems into sparsity-maximization problems, which are NP-hard. Inspired by compressive sensing techniques, we propose a common framework to tackle those problems by first applying the \ell1 -norm relaxation and then solving them with convex optimization methods. Simulations show that the proposed algorithms achieve excellent performance. For user admission, the numbers of admitted users by the proposed algorithms are close to the optimum numbers of admitted users obtained by exhaustive search (ES) . For user clustering, the total data exchange cost is reduced by more than 10% after only a few iterations. When the QoS requirement is low, the user data exchange can be avoided using the proposed method, which achieves the optimum result obtained by ES. [ABSTRACT FROM PUBLISHER]

This paper deals with joint source and relay beamforming (BF) design for an amplify-and-forward (AF) multiantenna multirelay network. Considering that the channel state information (CSI) from relays to a destination is imperfect, we aim to maximize the worst-case received signal-to-noise ratio (SNR). The associated optimization problem is then solved in two steps. In the first step, by fixing the source BF vector, a semi-closed-form solution of the relay BF matrices is obtained, up to a power-allocation factor. In the second step, the global optimal source BF vector is obtained based on the polyblock outer approximation (PA) algorithm. We also propose two low-complexity methods for obtaining the source BF vector, which differ in their complexity and performances. The optimal joint source and relay BF solution obtained by the proposed algorithms serves as the benchmark for evaluating the existing schemes and the proposed low-complexity methods. Simulation results show that the proposed robust design can significantly reduce the sensitivity of the channel uncertainty to the system performance. [ABSTRACT FROM AUTHOR]

How to associate a femto user (FU) to an appropriate femto base station (FBS) to avoid interference and maximize the achievable data rate (ADR) of FUs has attracted a lot of attention in femtocell networks. The evidence provided in this paper proves it to be an NP-complete problem. To maximize the ADR of the FUs, the methods for assigning FUs to neighboring FBSs are examined to determine the required transmit power level (TPL) adjustments for the FBSs to mitigate the downlink (DL) interference among the FBSs and the macro base station (MBS). Traditionally, the linear programming (LP) approach is adopted to obtain the optimal solution for this problem. However, the LP approach requires substantially more time to obtain the solution. To lessen this drawback, we propose an easy but smarter scheme, i.e., the smart FBS selection algorithm (SFSA), to distribute FUs to the noninterfered FBSs and to obtain the maximal ADR for each FU. If the SFSA fails to solve this problem, a DL power-control algorithm (DPCA) is employed to find a solution that causes the least amount of interference. The simulation results show that the SFSA and DPCA require only a minor amount of computation time to obtain a feasible solution. The results show that the maximal data rates of the FUs obtained using the SFSA and DPCA are comparable to that of the LP approach. [ABSTRACT FROM PUBLISHER]

Given the optimal transmit beamforming vector, the user who has the worst signal-to-noise ratio (SNR) is referred to as a bottleneck user for a single-group multicasting system with multiple antennas at the transmit side. In this paper, we present some interesting insights into the bottleneck users, such as the maximum number as well as the optimal beamformer when the transmitter has an arbitrary number of antenna elements. The $\max$– $\min$ fair SNR problem is employed and the closed-form solutions are proposed from the weighted sum-SNR maximization perspective for different numbers of possible bottleneck users. A new heuristic beamforming algorithm based on the bottleneck users is also presented to improve the system performance in terms of the achievable rate for physical-layer multicasting. [ABSTRACT FROM PUBLISHER]

One of the key challenges in wireless networking is allocating the available radio resources to maximize key service delivery parameters such as the aggregate throughput and the multimedia quality of experience (QoE). We propose a novel and effective scheduling policy that allocates resource blocks, such that interference power is shifted toward capacity-saturated users, while improving the throughput of unsaturated users. The highlight of this paper is that the proposed scheme can dramatically improve the performance of cells that have a high discrepancy in its signal-to-noise ratio (SNR) distribution, which is typical in urban areas. The results show that a free-lunch (FL) solution is possible, whereby for negligible performance degradation in the saturated users, a large improvement in the nonsaturated users can be obtained. However, on average, the number of FL user pairings is low. By relaxing the degradation constraints, the non-FL (NFL) solution can yield a greater multiuser throughput gain. Motivated by a surge in mobile multimedia traffic, we further demonstrate that the proposed scheduling may have a profound impact on both energy efficiency and QoE of multimedia service delivery. [ABSTRACT FROM PUBLISHER]

In multi-user downlink small cell networks, cooperative resource allocation (RA) within a small cell cluster is a key technique to enhance network capacity. However, capacity-maximizing RA in frequency-selective fading channels requires global channel state information (CSI) of users within a small cell cluster, which makes it infeasible in practical networks with limited direct link capacity. To circumvent this global CSI assumption, most of the existing studies on RA have been based on several CSI assumptions such as local CSI and local CSI at the transmitters (CSIT). Nevertheless, cost functions with local CSI or local CSIT in the literature rely on heuristic formulations, because the sum-rate cannot be computed if without global CSI. In this paper, we propose a deep reinforcement learning-based RA algorithm to maximize the sum-rate for any given limited information on instantaneous CSI or sum-rate at the previous period. The proposed scheme is not restricted to certain CSI assumptions, but attempts to find the best RA for any given information such as quantized local CSI and quantized local CSIT; thus, it is applicable to any given direct link capacity. The proposed algorithm is self-adaptive in time-varying channels, since it is not divided into training and test phases. We modify the target neural network (TNN) scheme to enhance the sum-rate and the convergence speed. Numerical simulations confirm that: i) the proposed algorithm outperforms the conventional algorithms even under the same CSI assumption such as local CSI and local CSIT; ii) a flexible trade-off between the amount of CSI and the sum-rate is realizable in practical systems. [ABSTRACT FROM AUTHOR]

The direct position determination (DPD) algorithms have been shown to outperform conventional two-step methods in localization accuracy under poor observation conditions (e.g., low signal-to-noise ratios or short signal observation durations). In this paper, we consider the distributed DPD of a static source in large-scale sensor networks. Different from the centralized DPD (CDPD) algorithms where all the raw signal samples are transmitted globally to a fusion center to solve for the source position, in our method the signal samples are only exchanged locally between neighboring sensors, and the source position is estimated using the proposed DPD algorithm distributively. The problem-specific cost function, which is different from the cost function of CDPD, is first derived. To obtain the cost function at each sensor, we propose to transmit the low-dimensional sufficient statistics across the sensor networks instead of the original high-dimensional raw signal samples, and to reconstruct the cost function via simple interpolations. Simplification of cost function evaluation is also developed to further reduce complexity. Finally, source position is estimated at each sensor efficiently via the importance sampling algorithm. Simulation results demonstrate the superior performance of the proposed method over existing adaptive distributed DPD as well as the two-step algorithms under poor observation conditions, and its computational efficiency is significantly improved compared with the CDPD. [ABSTRACT FROM AUTHOR]

Combining intelligent reflecting surface (IRS) and non-orthogonal multiple access (NOMA) is an effective solution to enhance communication coverage and energy efficiency. In this paper, we focus on an IRS-assisted NOMA network and propose an energy-efficient algorithm to yield a good tradeoff between the sum-rate maximization and total power consumption minimization. We aim to maximize the system energy efficiency by jointly optimizing the transmit beamforming at the BS and the reflecting beamforming at the IRS. Specifically, the transmit beamforming and the phases of the low-cost passive elements on the IRS are alternatively optimized until the convergence. Simulation results demonstrate that the proposed algorithm in IRS-NOMA can yield superior performance compared with the conventional OMA-IRS and NOMA with a random phase IRS. [ABSTRACT FROM AUTHOR]

In this paper, we propose an optimal random beamforming technique in mmWave MIMO-NOMA transmission systems. In our model, we consider a NOMA system with a user pairing scheme that works based on the distance between the cellular base station (BS) and the active mobile users. The aim of this is to reduce the system overall overhead for massive connectivity and achieve the desired Quality of Service (QoS). We present an optimization problem with the aims to find the optimal random beamforming coefficients by minimizing the outage probability. We analyze the convexity of the outage probability for three user pairing schemes and prove that the proposed optimal random beamforming is convex in high signal-to-noise ratio (SNR). We utilize the gradient-based algorithm namely the gradient descent algorithm to find optimal random beamforming coefficients. Our simulation results demonstrate that the proposed transmission schemes reduce the outage probability and improve network performance compared to previous works. [ABSTRACT FROM AUTHOR]

This paper proposes the integration of non-orthogonal multiple access (NOMA) and broadcasting with buffer-aided (BA) full-duplex (FD) relaying to improve the spectral efficiency of a single-source two-user network. Furthermore, opportunistic relay selection is employed, activating one or two FD relays to support the end-to-end communication. The network performance is improved through buffers, allowing to switch to half-duplex (HD) transmission/reception when FD operation is not feasible. A hybrid BA FD/HD NOMA relay selection algorithm is proposed, herein called $\mathop {\mathrm{BAHyNOMA}}$ , orchestrating the three aforementioned techniques, towards a simple yet efficient and robust relay selection. $\mathop {\mathrm{BAHyNOMA}}$ is evaluated in terms of outage probability, average sum-rate and average delay, and it is observed that the average sum-rate can be doubled, while maintaining low latency. [ABSTRACT FROM AUTHOR]

We present in this paper a novel proactive interference avoidance scheme for mobile-to-mobile (M2M) communication as an underlay in Long-Term Evolution (LTE) downlink networks. The proposed scheme introduces an intelligent user-selective resource allocation algorithm that aims to proactively avoid interference between M2M pairs and LTE regular users while achieving a satisfactory link budget for both M2M and LTE regular links. The proposed resource allocation algorithm is based on a novel low-complexity interference estimation approach that requires only channel quality indicator (CQI) information (CSI). Since the CQI reporting mechanism has been already implemented in current LTE systems, the proposed algorithm is indeed practical and standard compatible, compared with the existing works that require perfect knowledge of the channel state information (CSI). In this research, achievable data throughput with LTE-compliant adaptive modulation and coding has been adopted as the optimization measurement, rather than the information-theoretic capacity. Therefore, the performance of the proposed scheme is practically realizable in LTE communication systems. Since the performance of the proposed scheme highly relies on the accuracy of CQI feedback, we also carry out performance analysis to evaluate the impact of CQI estimation error and delay. The simulation results show that the total achievable data throughput for LTE networks is dramatically enhanced by M2M communication with this proposed interference avoidance resource allocation scheme. [ABSTRACT FROM PUBLISHER]

Estimation of signal-to-noise ratio (SNR) plays an important role in many fields of communications. This paper addresses the SNR estimation of multiple phase-shift keying (MPSK) signals in Nakagami- $m$ fading channels. A family of SNR estimators with closed-form expressions is developed based on the relationship among different orders of moments. Compared with the existing algorithms, the estimator, which exploits the minimum order of moments, exhibits the best performance in general. We also propose a joint estimation algorithm for SNR and the fading factor when it is unknown. Simulation results verify the feasibility and superiority of the proposed algorithms. [ABSTRACT FROM PUBLISHER]

In heterogeneous networks (HetNets), the load between macrocell base stations (MBSs) and small-cell base stations (SBSs) is imbalanced due to their different transmission powers and locations. This load imbalance significantly impacts system performance and affects the experience of mobile users (MUs) with different priorities. In this paper, we aim to distributively optimize the user association in HetNets with various user priorities to solve the load balancing problem. Since the user association is a binary matching problem, which is NP-hard, we propose a distributed belief propagation (BP) algorithm to approach the optimal solution. We first develop a factor graph model, using the network topology, to represent this user association problem. With this factor graph, we propose a novel distributed BP algorithm by adopting the proportional fairness as the objective. Next, we theoretically prove the existence of the fixed point in our BP algorithm. To be more practical, we develop an approximation method to significantly reduce the computational and communication complexity of the BP algorithm. Furthermore, we analyze some properties of the factor graph relevant to the performance of the BP algorithm using the stochastic geometry. Simulation results show that 1) the proposed BP algorithm well approaches the optimal system performance and achieves a much better performance compared with other association schemes and that 2) the analytical results on the average degree distribution and sparsity of the factor graph match with those obtained from the Monte Carlo simulations. [ABSTRACT FROM PUBLISHER]

Direct device-to-device (D2D) links are proposed as a possible enabler for vehicle-to-vehicle (V2V) communications, where the incurred intracell interference and the stringent latency and reliability requirements are challenging issues. In this paper, we investigate the radio resource management problem for D2D-based V2V communication. First, we analyze and transform the latency and reliability requirements of V2V communication into optimization constraints that are computable using only the slowly varying channel information. This transformation opens up the possibility of extending certain existing D2D techniques to cater to V2V communication. Second, we propose a problem formulation that fulfills the different requirements of V2V communication and traditional cellular communication. Moreover, a Separate resOurce bLock and powEr allocatioN (SOLEN) algorithm is proposed to solve this problem. Finally, simulations are presented to evaluate different schemes, which illustrate the necessity of careful design when extending D2D methods to V2V communication, as well as show promising performance of the proposed SOLEN algorithm. [ABSTRACT FROM AUTHOR]

This paper investigates an adaptive scheduling algorithm for multiuser environments with statistically independent but nonidentically distributed (i.n.d.) channel conditions. The algorithm aims to reduce feedback load by sequentially and arbitrarily examining the user channels. It also provides improved performance by realizing postexamining best user selection. The first part of the paper presents new formulations for the statistics of the signal-to-noise ratio (SNR) of the scheduled user under i.n.d. channel conditions. The second part capitalizes on the findings in the first part and presents various performance and processing complexity measures for adaptive discrete-time transmission. The results are then extended to investigate the effect of outdated channel estimates on the statistics of the scheduled user SNR, as well as some performance measures. Numerical results are provided to clarify the usefulness of the scheduling algorithm under perfect or outdated channel estimates. [ABSTRACT FROM PUBLISHER]

In this paper, we analyze the impact of correlated secondary users' local decisions on the performance of cooperative spectrum-sensing schemes when the counting rule is employed at the fusion center. We employ a correlation model that is indexed by a single parameter \rho. We derive the system probabilities of detection and false alarm for the K-out-of-M counting rule when the secondary users' local decisions are correlated under both hypothesis. Our performance evaluations are based on two performance criteria, which are the Neyman–Pearson (NP) criterion and the minimization of the sensing errors. Our results show that, for each value of the correlation index, there exists an optimal value of K that satisfies each criterion. We use genetic algorithm to find the optimal setting that minimizes the total probability of sensing error since the optimization problem under the correlation model used in our analysis is a mixed integer nonlinear problem with nonlinear constraint. [ABSTRACT FROM PUBLISHER]

Based on the analysis of the feature of cognitive radio (CR) networks, we build a relevant interference model. Cognitive users should particularly consider the problem of interference with licensed users and satisfy the signal-to-interferenceplus-noise ratio (SINR) requirement at the same time. We propose a new iterative algorithm using the game theory in this paper. We consider not only the SINR requirement as other game algorithms but also the influence of power threshold. The variable power limit is the characteristic of CR. We prove the convergence of the algorithm and the existence of Nash equilibrium. According to different power thresholds, we give an approach for solving the problem of coexistence between licensed user and cognitive user in a cognitive system. The algorithm has the advantage that it can be distributively implemented, and the method converges relatively fast. Numerical results are presented to show that the proposed approach has better antinoise effect and capacity. [ABSTRACT FROM PUBLISHER]

This paper considers the transmission of scheduling information in orthogonal frequency-division multiple-access (OFDMA)-based cellular communication systems such as the Third-Generation Partnership Project (3GPP) long-term evolution (LTE). These systems provide efficient usage of radio resources by allowing users to be dynamically scheduled in both frequency and time. This requires considerable amounts of scheduling information to be sent to the users. This paper compares two basic transmission strategies: transmitting a separate scheduling message to each user versus broadcasting a joint scheduling message to all users. Different scheduling granularities are considered, as are different scheduling algorithms. The schemes are evaluated in the context of the LTE downlink using multiuser system simulations, assuming a full-buffer situation. The results show that separate transmission of the scheduling information requires a slightly lower overhead than joint broadcasting when proportional fair scheduling is employed and the users are spread out over the cell area. The results also indicate that the scheduling granularity standardized for LTE provides a good tradeoff between scheduling granularity and overhead. [ABSTRACT FROM PUBLISHER]

In this paper, a power allocation space-time coding scheme based on the self-coding property of residual loop interference (RLI) for two-way full-duplex (FD) amplify-and-forward (AF) relaying networks is proposed. The relay and direct link cooperate to forward the received signals to destination node, forming the self-coded distributed space-time code, in which the relay performs self-coding using the RLI after implementing some self-interference cancellation techniques. Then, an iterative power allocation algorithm is presented. With the proposed power allocation algorithm, both amplifying factor and transmit powers of terminal nodes are jointly optimized to maximize the smaller signal-to-interference-plus-noise ratio (SINR) of terminal nodes under a total power constraint when estimated instantaneous channel state information is available. We theoretically demonstrate the benefits of the proposed power allocation algorithm compared to equal power allocation. Simulation results show that the proposed scheme achieves significant improvement in performance compared with existing schemes for FD relaying systems and half-duplex relaying systems. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the joint signal to interference plus noise ratio (SINR) thresholds optimization and resource allocation to maximize the sum-rate of Device-to-Device (D2D) communications while still retaining the rate requirements for active cellular users (CUs), when the inactive CUs are used as opportunistic relays under three operational modes: without using network-coding (NNC), using traditional high-layer network-coding (HNC), and using physical-layer network-coding (PNC). Under Rayleigh fading, we show that, given the selections of relays, this sum-rate maximization in no-relay scheme, NNC, HNC, and PNC opportunistic relay schemes can be formulated as a mixed integer non-linear programming (MINLP), which is NP-hard in general. To find the solution to the MINLP, we propose a two-step approach to solve the problem: 1) for each possible pairing of a D2D pair and a CU, we derive the optimal SINR thresholds to obtain the maximum transmission rate of the D2D pair while satisfying the rate requirement of the CU; 2) based on the maximum transmission rates of D2D pairs for each possible pairing in the first step, we develop a bipartite-matching method to find the optimal pairing CUs for D2D pairs. Finally, according to the solution to the MINLP, we propose an iterative relay selection algorithm to find out the relays that can further improve the sum-rate of D2D communications. Extensive simulation results demonstrate that, compared with the scenario without relaying, the NNC, HNC, and PNC opportunistic relay schemes achieve a maximum performance enhancement of 106%, 138%, and 168%, respectively. [ABSTRACT FROM AUTHOR]

Interference alignment (IA) is a promising technique for interference management and can be applied to spectrum sharing in cognitive radio (CR) networks. However, the sum rate may fall short of the theoretical maximum, particularly at low signal-to-noise ratio (SNR), and the quality of service (QoS) of the primary user (PU) may not be guaranteed. In addition, power allocation (PA) in IA-based CR networks is largely ignored, which can further improve its performance. Thus, in this paper, PA in IA-based CR networks is studied. To guarantee the QoS requirement of the PU, its minimal transmitted power is derived. Then, we propose three PA algorithms to maximize the throughput of secondary users (SUs), the energy efficiency (EE) of the network, and the requirements of SUs, respectively, while guaranteeing the QoS of the PU. To reduce the complexity, the closed-form solutions of these algorithms are further studied in detail. The outage probability of the PU according to its rate threshold is also derived to analyze the performance of these algorithms. Moreover, we propose a transmission-mode adaptation scheme to further improve the PU's performance when its QoS requirement cannot be guaranteed at low SNR, and it can be easily combined with the proposed PA algorithms. Simulation results are presented to show the effectiveness of the proposed adaptive PA algorithms for IA-based CR networks. [ABSTRACT FROM AUTHOR]

For space communication circumstances, long-distance transmission significantly deteriorates the received signal-to-noise ratio (SNR) at the receiver. Moreover, the high-speed relative movement between the transmitter and the receiver causes a very large Doppler shift, thus imposing a new challenge for the acquisition. To address the Doppler shift acquisition problem under not only the very low SNR but under the very high relative movement scenarios as well, in this paper, we develop one search range correction (SRC)-based acquisition scheme, which includes three algorithms called single SRC, overlapping SRC, and iterative SRC, respectively, to significantly increase the acquisition probability for space communications. First, the single SRC algorithm, which has a simple closed-form expression for the net increment of acquisition probability, uses multiple combination periods to correct the search range for the succeeding period. Moreover, the special case using two combination periods for the single SRC algorithm is already verified to increase the acquisition probability. Second, the overlapping SRC algorithm, which is based on the period overlapping of the single SRC algorithm, enjoys much implementation feasibility and saves many received signals. Third, the iterative SRC algorithm, which builds on the iteration of the overlapping SRC algorithm, can further increase the acquisition probability as compared with that of the overlapping SRC algorithm. Simulations results show that our proposed scheme can obtain much higher acquisition probability of Doppler shift, compared with existing acquisition schemes, including the fast Fourier transform (FFT), time–frequency, and single SRC using two combination periods. [ABSTRACT FROM AUTHOR]

In this paper, observing the information asymmetry phenomenon among multiple secondary users (SUs) spectrum sharing, we analyze the hierarchical decision-making and the strategic interaction of information-poor and information-rich SUs. A Stackelberg capacity-maximization game is formulated with leaders and followers, and closed-form solutions are mathematically derived for the optimal Stackelberg equilibrium solution. Moreover, the existence and uniqueness of equilibrium solutions are investigated via the quasi-variational inequality method. Finally, the distributed algorithm with partial asymmetric information awareness is designed to reach the solution. Numerical results demonstrate that the proposed algorithm achieves improved individual and system performance with mild condition on the ratio of information-poor leaders and information-rich followers. [ABSTRACT FROM PUBLISHER]

In this paper, we propose two groups of recursive codes, namely the Hadamard recursive carrier interferometry (HRCI) codes and diagonal recursive carrier interferometry (DRCI) codes, to simultaneously reduce the peak-to-average power ratio (PAPR) and suppress the phase noises and residual carrier frequency offset (RCFO) for high-speed orthogonal frequency division multiplexing (OFDM) systems. We exploit the recursion property of the Hadamard and diagonal matrices to constitute the proposed HRCI code and DRCI code using the carrier interferometry (CI) code, and present the system model in details to spread OFDM symbols in the frequency domain. Then, we prove that both HRCI and DRCI generation matrices keep their invertibility during the recursions. As a direct result of the new code design, the phase intervals are enlarged and the signals are shifted in the time domain, thus both the PAPR and the phase noises are reduced, and the RCFO can be mitigated. Moreover, the enlarged phase intervals enable the transceiver blocks including the channel estimator, which estimate the phase noise based on the received signals, to improve the performance. Furthermore, we present the expressions for the HRCI and DRCI embedded transmitted and received signals, and derive the analytical signal-to-interference-plus-noise ratio (SINR) expressions for bit error rate (BER) performance analysis. Then, we analyze the effects of presented codes on the phase differences and provide the computational complexity analysis. Numerical simulations verify the effectiveness of our theoretical analysis of SINR. Additionally, under different parameter settings, which consider the working conditions of practical systems, we demonstrate that the presented robust HRCI and DRCI coded OFDM systems can suppress the PAPR satisfactorily and better BER performances can be achieved by the recursive CI-aided spread OFDM systems with phase noise rejection and RCFO compensation when compared with counterpart systems. [ABSTRACT FROM AUTHOR]

Ultradense heterogeneous networks (HetNets) are emerging as an inevitable approach to tackle the capacity crunch in cellular networks. However, imbalanced load among small and macrocells and poor resource utilization as a consequence in HetNets remains a long-standing problem. This paper addresses this problem by presenting a solution for maximization of coverage and capacity while minimizing load imbalance among macro and small cells. Most recent studies on the topic focus on either optimization of coverage, capacity or load, or a combination of two of these three intertwined objectives. We formulate the optimization problem as a function of two hard parameters namely antenna tilt and transmit power, and a soft parameter, cell individual offset, that affect the coverage, capacity, and load directly. The resulting solution is a combination of the otherwise conflicting coverage and capacity optimization (CCO) and load balancing (LB) self-organizing network (SON) functions. In the presented joint CCO-LB solution, a conflict free operation of CCO and LB is ensured by designing a novel load aware user association methodology and resolving the effects of shadowing on coverage probability using stochastic approximation. The problem is proven to be nonconvex and is solved using genetic algorithm, sequential quadratic programming, and pattern search algorithms. The proposed CCO-LB solution is compared against two recently proposed CCO and CCO-LB solutions in the literature. Results show that the proposed solution can yield significant gain in terms of throughput, spectral efficiency, and load distribution. [ABSTRACT FROM AUTHOR]

In this paper, we study a transmit beamforming technique for multiple-input–multiple-output (MIMO) downlink multicast systems. Assuming that channel state information (CSI) is available at a transmitter, we try to maximize the lowest transmit data rate among users for a given transmit power level. Since finding the optimal beamforming vector requires prohibitively high computational complexity, we propose a reduced complexity scheme by applying greedy vector search and a simple power-allocation (PA) algorithm. Simulation results show that the proposed scheme outperforms the conventional semidefinite relaxation (SDR) technique and provides a performance quite close to the optimal performance with much reduced complexity. [ABSTRACT FROM PUBLISHER]

This paper is concerned with the problem of relay assignment in cooperative wireless networks having multiple sources, multiple relays, and a single destination. With the objective of maximizing the minimum capacity among all sources in the network, a mixed-integer linear programming (MILP) problem is formulated, which can be solved by standard branch-and-bound algorithms. To reduce computational complexity, a greedy solution in the form of a lexicographic bottleneck assignment algorithm is proposed. Simulation results obtained for the IEEE 802.16j uplink scenarios show that the greedy algorithm performs very close to the optimal solution but at a much lower computational cost. The proposed greedy solution can also be tailored to provide further improvements on other network performance criteria. [ABSTRACT FROM PUBLISHER]

In this paper, an order recursive method is proposed to solve the joint estimation of channel impulse response (CIR) and carrier frequency offset (CFO) for orthogonal frequency-division multiplexing (OFDM) transmission. As long as one can obtain the solution for Qth-order Taylor expansion, the solution for (Q + 1)th order can also be obtained via a simple recursive relation. The proposed recursive algorithm actually provides a method to handle any Qth-order Taylor expansion, instead of just the second order adopted in the technical literature. Significant improvement can be observed by adopting higher order approximation. Analytical mean-square-error (MSE) performance results are given, demonstrating the efficiency of the proposed algorithm. [ABSTRACT FROM PUBLISHER]

In this paper, the average rate maximization problem given transmission power constraints in a decode-and-forward (DF) relay network over slow fading channels is studied. For the problem, either a long- or short-term power constraint is imposed on the source and relays. In each combination of the power constraints at the source and relays, the original optimization problem is decomposed into subproblems, each corresponding to a specific channel gain realization. For each subproblem, a fast algorithm with closed-form solutions is provided. The case with additional peak power spectrum density constraints is also investigated. Numerical results are presented to demonstrate the effectiveness of the algorithms. [ABSTRACT FROM PUBLISHER]