Power Allocation Based on Data Classification in Wireless Sensor Networks.

Full-duplex amplify-and-forward relay system with direct link: Performance analysis and optimization

Reconfigurable Intelligent Surface (RIS) is an emerging technology that can improve the spectrum and energy efficiency of next-generation wireless networks. However, attaining accurate channel state information (CSI) for the cascaded RIS channel is particularly challenging. Imperfect CSI is a major bottleneck to achieving the spectral efficiency benefit of RIS-assisted networks. Rate splitting (RS), a promising multiple access technology, has been shown to be able to achieve an improved spectrum efficiency and be robust to channel uncertainties. This paper investigates the interplay between RIS and RS by considering a RIS-assisted RS beamforming problem. Active beamforming at the base station (BS) and passive beamforming at the RIS are jointly considered to maximize the minimum user rate under both the perfect CSI case and the imperfect CSI case. A block coordinate descent (BCD) algorithm is developed to solve this non-convex problem. Compared with the conventional semi-definite relaxation (SDR) approach, the proposed method does not require that the covariance matrix of the common beamforming vector be rank-one. Moreover, we present theoretical results to help reveal the impact of the system parameters and explain the performance gain resulting from the integration of RIS and RS. Extensive simulation results are also provided to show that RIS-assisted RS can improve the max-min rate performance significantly compared with conventional multiple access technologies, such as non-orthogonal multiple access (NOMA) and space division multiple access (SDMA) with/without RIS, especially in overloaded systems. With the proposed method, RS shows great potential in combating realistic CSI errors in RIS-assisted networks.

In this paper, a comprehensive comparison analysis in terms of outage probability and average symbol error ratio (SER) is presented for cooperative cognitive multiple-input and multiple-output (CC-MIMO) multiuser systems with amplify-and-forward (AF) protocol. Specially, we consider two scenarios where the CC-MIMO multiuser systems have the perfect and imperfect channel state information (CSI). The CC-MIMO multiuser systems consist of one multi-antenna source, one single-antenna relay, and multiple multi-antenna destinations. At the secondary source and destinations, the maximal ratio transmission (MRT) and maximal ratio combining (MRC) are employed, respectively. For such CC-MIMO multiuser systems, we first obtain the exact closed-form expressions of outage probability under the two cases where the CC-MIMO multiuser systems have the perfect and imperfect CSI. Then, to reduce the implementation complexity, the tight lower bounds of outage probability and average SER are derived. Finally, to obtain insight, by using the high signal-to-noise ratio (SNR) approximation, the asymptotic estimations of outage probability are achieved. The numerical results show that the derivations are agreed with the simulations, which validate our derivations. At the same time, the results show that, for the systems without perfect CSI, the achievable diversity order reduces to one, regardless of the number of antennas at the cognitive source and destinations as well as the number of the cognitive destinations. Nevertheless, these key parameters affect the coding gain of the CC-MIMO multiuser systems. When the systems have the perfect CSI (or without feedback delay), the achievable diversity gain is determined by the minimum between the number of source’s antennas and the product of the number of destinations and the number of destination’s antennas. For the effect of PU’s parameters, our results indicate that primary systems only affect the coding gain but not the diversity gain.

As a building block toward a simple and scalable solution for massive random access, we introduce collision-resolution algorithms using successive interference cancellation (SIC) based on the received signals, with no need for any coordination or codebook differentiation. We first consider two-user multiple access with the ZigZag algorithm. We prove that the original ZigZag and a modified version of it, called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">double-zipper ZigZag</i> , attain the same performance as the optimal coordinated time-sharing in the high signal to noise ratio (SNR) regime, even in the presence of channel state information (CSI) errors. We then extend the results to the case of arbitrary number of users employing delay-domain processing. Specifically, we introduce delay-domain zero forcing and its regularized version, which are able to cancel and suppress the interference among users, respectively. By obtaining a post-processing system model and characterizing the accumulated noise during the decoupling process, we also derive bounds on the achievable sum-rates of the proposed algorithm for both cases of perfect and imperfect CSI. Simulation results show that the newly proposed approach have comparable performance with coordinated time-sharing at high SNRs.

The advantages envisioned from using large antenna arrays have made massive multiple- input multiple-output systems (also known as massive MIMO) a promising technology for future wireless standards. Despite the advantages that massive MIMO systems provide, increasing the number of antennas introduces new technical challenges that need to be resolved. In particular, symbol detection is one of the key challenges in massive MIMO. Obtaining accurate channel state information (CSI) for the extremely large number of chan- nels involved is a difficult task and consumes significant resources. Therefore for Massive MIMO systems coherent detectors must be able to cope with highly imperfect CSI. More importantly, non-coherent schemes which do not rely on CSI for symbol detection become very attractive. Expectation propagation (EP) has been recently proposed as a low complexity algo- rithm for symbol detection in massive MIMO systems , where its performance is evaluated on the premise that perfect channel state information (CSI) is available at the receiver. However, in practical systems, exact CSI is not available due to a variety of reasons in- cluding channel estimation errors, quantization errors and aging. In this work we study the performance of EP in the presence of imperfect CSI due to channel estimation er- rors and show that in this case the EP detector experiences significant performance loss. Moreover, the EP detector shows a higher sensitivity to channel estimation errors in the high signal-to-noise ratio (SNR) regions where the rate of its performance improvement decreases. We investigate this behavior of the EP detector and propose a Modified EP detector for colored noise which utilizes the correlation matrix of the channel estimation error. Simulation results verify that the modified algorithm is robust against imperfect CSI and its performance is significantly improved over the EP algorithm, particularly in the higher SNR regions, and that for the modified detector, the slope of the symbol error rate (SER) vs. SNR plots are similar to the case of perfect CSI. Next, an algorithm based on expectation propagation is proposed for noncoherent symbol detection in large-scale SIMO systems. It is verified through simulation that in terms of SER, the proposed detector outperforms the pilotbased coherent MMSE detector for blocks as small as two symbols. This makes the proposed detector suitable for fast fading channels with very short coherence times. In addition, the SER performance of this detec- tor converges to that of the optimum ML receiver when the size

In this letter, secure beamforming designs are investigated in a multiple-input multiple-output secrecy channels with simultaneous wireless information and power transfer. In order to achieve fairness among different multiple energy harvesting receivers, the minimum harvested energy is maximized under the secrecy rate requirements. In particular, in order to reduce the computational complexity of the semidefinite programming problem, a successive convex approximation (SCA) iterative algorithm is proposed in the perfect channel state information (CSI) case to obtain a near-optimal rank-one solution. Moreover, the original problem is extended to the imperfect CSI case by incorporating a norm-bounded error model, where an SCA-based iterative algorithm is also proposed. Simulation results reveal that the SCA-based iterative algorithm achieves the same performance as the semidefinite relaxation method with reduced complexity.

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

We address the issue of maximizing the number of connected devices in a Narrowband Internet-of-Things (NB-IoT) network using nonorthogonal multiple access (NOMA) in the downlink. We first propose an optimal joint subcarrier and power allocation strategy assuming perfect channel state information (CSI) called stratified device allocation (SDA), which maximizes the connectivity under data rate, power, and bandwidth constraints. Then, we generalize the connectivity maximization problem to the case of partial CSI, where only the distance-dependent path-loss component of the channel gain is available at the base station (BS). We introduce a novel framework called the stochastic connectivity optimization (SCO) framework. In this framework, we propose a heuristic improvement to SDA, namely, SDA with excess power (SDA-EP) algorithm for operation under partial CSI. Furthermore, we derive a concave approximation (SCO-CA) algorithm of near-optimal performance to SCO given the same amount of CSI. Through computer simulations, we show that SDA-EP and SCO-CA outperform conventional NOMA and OMA schemes in the presence of partial CSI over a wide range of service scenarios.

Multiple input multiple output (MIMO) processing techniques are of interest for the next generation wireless communication systems due to their potential ability to dramatically improve the system capacity. There have been existed several multi-user MIMO (MU-MIMO) transmit schemes such as zero-forcing dirty paper coding (ZF-DPC), and zero-forcing beamforming (ZFBF). In this paper, we analysis and compare the dynamic transmission schemes based on TDMA and SDMA under perfect and imperfect channel state information (CSI). The system throughput (sum data rate), the optimal user number that can be supported are evaluated under perfect CSI by computer simulations. The effect of imperfect CSI on the throughput of TDMA and SDMA is also investigated. The results show that under perfect channel state information at both transmitter and receiver, the SDMA schemes can achieve a larger throughput than the TDMA scheme because SDMA can fully explore the multiuser diversity by transmitting to the optimal set of users. In contrast, the results show that the system performance of SDMA scheme is sensitive to the channel error.

In this paper, with the aid of new analytical method, we present a new closed-form expression for the ergodic capacity of full-duplex relaying (FDR) systems, with multiple antenna amplify-and-forward (AF) cooperative networks and imperfect channel state information (CSI). At the relay, the loopback self-interfernce (LI) is mitigated by using receive zero-forcing (ZF) precoding scheme, then steering the signal to the destination by using the maximum-ratio transmission (MRT) technique. To facilitate comparison, a closed-form expression for the ergodic capacity of half-duplex relaying (HDR) systems with multiple antenna AF cooperative networks is also addressed, when maximum-ratio combining (MRC)/MRT precoding schemes are performed at the relay input/output, respectively. Therefore, since perfect CSI is not available in practice, this paper investigates the impact of channel estimation errors on the performance of receive ZF/MRT and MRC/MRT schemes. These expressions are exact in the case of perfect CSI and form a very tight indistinguishable lower-bound in the case of imperfect CSI. Numerical results sustained by Monte-Carlo simulations show the exactness of the proposed analytical expressions in perfect CSI and the tightness of the lower-bounds in imperfect CSI. In addition, it is seen here that the FDR AF cooperative systems outperforms the HDR AF cooperative systems in terms of capacity. Furthermore, in contrast to perfect CSI, in the presence of imperfect CSI, an ergodic capacity ceiling is seen as SNR increases. Besides, it is seen that the ergodic capacity degradation due to imperfect CSI is higher in the FDR case because of the extra LI estimation errors.

A multihop regenerative relay system is considered. We explore adaptive power allocation (PA) under a total power constraint to minimize the system error probability when the perfect channel state information (CSI) is known at the transmitters. We propose adaptive PA schemes with limited feedback when the transmitters have no perfect knowledge of CSI. Simulation results demonstrate the good performance of the proposed PA scheme with perfect CSI. When no perfect CSI is available at the transmitters, the proposed PA schemes with a small number of feedback bits are able to achieve very close performance to the adaptive PA with perfect CSI.

In this work, we consider the downlink of a single-cell multi-user MIMO system in which the base station (BS) makes use of N antennas to communicate with K single-antenna user equipments (UEs). The UEs move around in the cell according to a random walk mobility model. We aim at determining the energy consumption distribution when different linear precoding techniques are used at the BS to guarantee target rates within a finite time interval T. The analysis is conducted in the asymptotic regime where N and K grow large with fixed ratio under the assumption of perfect channel state information (CSI). Both recent and standard results from large system analysis are used to provide concise formulae for the asymptotic transmit powers and beamforming vectors for all considered schemes. These results are eventually used to provide a deterministic approximation of the energy consumption and to study its fluctuations around this value in the form of a central limit theorem. Closed-form expressions for the asymptotic means and variances are given. Numerical results are used to validate the accuracy of the theoretical analysis and to make comparisons. We show how the results can be used to approximate the probability that a battery-powered BS runs out of energy and also to design the cell radius for minimizing the energy consumption per unit area. The imperfect CSI case is also briefly considered.

The increasing traffic demand in both ground and satellite communication systems will lead to increasing spectrum demand. Spectrum sharing would become a challenging issue in future between terrestrial and satellite systems with frequency reusing, which would lead to co-channel interference. In this case, it is of great importance to allocate the system resources reasonably to optimize the system performance. Upon this, we propose two resource allocation schemes for two multiple access integrated system. First, we investigate the problem of interference controlling and power allocation in a terrestrial-satellite spectrum sharing network. In order to protect the terrestrial users, interference temperature limit is introduced for the satellite to control the interference caused to BS users. Then, under this constraint, we maximize the total capacity of the satellite system and obtain the optimal power allocation scheme. Second, we propose the concept of the Cloud Based Integrated Terrestrial-Satellite Network (CTSN), where both base stations of the cellular networks and the satellite are connected to a cloud central unit and the signal processing procedures are executed centrally at the cloud. By utilizing the channel state information (CSI), the interference from the mixed signal can be mitigated. When it comes to the case of imperfect CSI, we propose a resource allocation scheme in respect to subchannel and power to maximize the total capacity of the terrestrial system.

A wireless sensor network monitoring a target signal source by distributed sensors is considered and the effects of imperfect channel state information at the sensor node receivers are studied. The sensor nodes are assumed to have independent observations of the target signal which are sent to a common fusion center through reliable links. If the channel gains between the target and the sensors (channel state information) are known exactly, the estimation problem reduces to least-squares estimation. If the channel gains are only known in distribution and by pilot-assisted training (imperfect channel state information), least-squares estimation is inefficient. This work investigates the properties of the optimum estimator with imperfect channel state information and assesses its performance versus suboptimum least-squares estimation and perfect channel state information (genie-aided) estimation.

Nowadays, the majority of new GNSS applications targets dynamic users in urban environments; therefore the decoder input in GNSS receivers needs to be adapted to the urban propagation channel to avoid mismatched decoding when using soft input channel decoding. The aim of this paper consists thus in showing that the GNSS signals demodulation performance is significantly improved integrating an advanced soft detection function as decoder input in urban areas. This advanced detection function takes into account some a priori information on the available Channel State Information (CSI). If no CSI is available, one has to blindly adapt the detection function in order to operate close to the perfect CSI case. This will lead to avoid mismatched decoding due to, for example, the consideration by default of the Additive White Gaussian Noise (AWGN) channel for the derivation of soft inputs to be fed to soft input decoders. As a consequence the decoding performance will be improved in urban areas. The expressions of the soft decoder input function adapted for an urban environment is highly dependent on the available CSI at the receiver end. Based on different model of urban propagation channels, several CSI contexts will be considered namely perfect CSI, partial statistical CSI and no CSI. Simulation results will be given related to the GPS L1C demodulation performance with these different advanced detection function expressions in an urban environment. The results presented in this paper are valid for any kind of soft input decoders, such as Viterbi decoding for trellis based codes, the MAP/BCJR decoding for turbo-codes and the Belief Propagation decoding for LDPC codes.