arXiv subjects

George C. Alexandropoulos

Publications and source records attributed to George C. Alexandropoulos.

284 records · Page 16Linked to original sources

arXiv2016

Simultaneous Spectrum Sensing and Data Reception for Cognitive Spatial Multiplexing Distributed Systems

A multi-user cognitive (secondary) radio system is considered, where the spatial multiplexing mode of operation is implemented amongst the nodes, under the presence of multiple primary transmissions. The secondary receiver carries out minimum mean-squared error (MMSE) detection to effectively decode the secondary data streams, while it performs spectrum sensing at the remaining signal to capture the presence of primary activity or not. New analytical closed-form expressions regarding some important system measures are obtained, namely, the outage and detection probabilities; the transmission power of the secondary nodes; the probability of unexpected interference at the primary nodes; {\color{blue}and the detection efficiency with the aid of the area under the receive operating characteristics curve}. The realistic scenarios of channel fading time variation and channel estimation errors are encountered for the derived results. Finally, the enclosed numerical results verify the accuracy of the proposed framework, while some useful engineering insights are also revealed, such as the key role of the detection accuracy to the overall performance and the impact of transmission power from the secondary nodes to the primary system.

cs.IT↗

arXiv2016

Optimizing Access Mechanisms for QoS Provisioning in Hardware Constrained Dynamic Spectrum Access

One of the major challenges in Dynamic Spectrum Access (DSA) systems is to guarantee a required level of Quality of Service (QoS) to secondary users of the spectrum. In this paper, we propose efficient algorithms for deriving optimal policies for the sensing / transmitting trade-off in hardware-constrained DSA systems. Unlike previous approaches which seek to maximize mean data rate for the secondary users, the proposed algorithms derive policies which minimize the probability of excessive queuing delays. Large Deviations (LD) asymptotics are used to approximate the probability of interest and policies maximizing the associated LD exponent are proposed. Although dynamic programming is not able to identify the optimal policy in this case, much more efficient algorithms than exhaustive search are proposed. These algorithms are based on specific properties of the optimal policy which are described and proven in this paper.

cs.IT↗

arXiv2016

Green Cognitive Relaying: Opportunistically Switching Between Data Transmission and Energy Harvesting

Energy efficiency has become an encouragement, and more than this, a requisite for the design of next-generation wireless communications standards. In current work, a dual-hop cognitive (secondary) relaying system is considered, incorporating multiple amplify-and-forward relays, a rather cost-effective solution. First, the secondary relays sense the wireless channel, scanning for a primary network activity, and then convey their reports to a secondary base station (SBS). Afterwards, the SBS, based on these reports and its own estimation, decides cooperatively the presence of primary transmission or not. In the former scenario, all the secondary nodes start to harvest energy from the transmission of primary node(s). In the latter scenario, the system initiates secondary communication via a best relay selection policy. Performance evaluation of this system is thoroughly investigated, by assuming realistic channel conditions, i.e., non-identical link-distances, Rayleigh fading, and outdated channel estimation. The detection and outage probabilities as well as the average harvested energy are derived as new closed-form expressions. In addition, an energy efficiency optimization problem is analytically formulated and solved, while a necessary condition in terms of power consumption minimization for each secondary node is presented. From a green communications standpoint, it turns out that energy harvesting greatly enhances the resources of secondary nodes, especially when primary activity is densely present.

cs.IT↗

arXiv2016

Performance Analysis of $L$-Branch Scan-and-Wait Combining (SWC) over Arbitrarily Correlated Nakagami-$m$ Fading Channels

The performance of $L$-branch scan-and-wait combining (SWC) reception systems over arbitrarily correlated and not necessarily identically distributed Nakagami-$m$ fading channels is analyzed and evaluated. Firstly, a fast convergent infinite series representation for the SWC output signal-noise ratio (SNR) is presented. This expression is used to obtain analytical expressions in the form of infinite series for the average error probability performance of various modulation schemes for integer values of $m$ as well as the average number of paths estimation and average waiting time (AWT) of $L$-branch SWC receivers for arbitrary values of $m$. The numerically obtained results have shown that the performance expressions converge very fast to their exact analytical values. It was found that the convergence speed depends on the correlation and operating SNR values as well as the Nakagami $m$-parameter. In addition to the analytical results, complementary computer simulated performance evaluation results have been obtained by means of Monte Carlo error counting techniques. The match between these two sets of results has verified the accuracy of the proposed mathematical analysis. Furthermore, it is revealed that, at the expense of a negligible AWT, the average error probability performance of SWC receivers is always superior to that of switched-and-examine combining receivers and in certain cases to that of maximal-ratio combining receivers.

cs.IT↗

arXiv2016

User Scheduling and Optimal Power Allocation for Full-Duplex Cellular Networks

The problem of user scheduling and power allocation in full-duplex (FD) cellular networks is considered, where a FD base station communicates simultaneously with one half-duplex (HD) user on each downlink and uplink channel. First, we propose low complexity user scheduling algorithms aiming at maximizing the sum rate of the considered FD system. Second, we derive the optimal power allocation for the two communication links, which is then exploited to introduce efficient metrics for FD/HD mode switching in the scheduling procedure, in order to further boost the system rate performance. We analyze the average sum rate of the proposed algorithms over Rayleigh fading and provide closed-form expressions. Our representative performance evaluation results for the algorithms with and without optimal power control offer useful insights on the interplay among rate, transmit powers, self-interference (SI) cancellation capability, and available number of users in the system.

cs.IT↗

arXiv2016

Performance Evaluation of User Scheduling for Full-Duplex Small Cells in Ultra-Dense Networks

Full-duplex (FD) communication is an emerging technology that can potentially double the throughput of cellular networks. Preliminary studies in single-cell or small FD network deployments have revealed promising rate gains using self-interference cancellation (SIC) techniques and receive processing. Nevertheless, the system-level performance gains of FD small cells in ultra-dense networks (UDNs) have not been fully investigated yet. In this paper, we evaluate the performance of resource allocation in ultra-dense FD small-cell networks using spatial stochastic models for the network layout and 3GPP channel models. More specifically, we consider various UDN scenarios and assess the performance of different low-complexity user-scheduling schemes and power allocation between uplink and downlink. We also provide useful insights into the effect of the SIC capability on the network throughput.

cs.IT↗

arXiv2016

Advanced Coordinated Beamforming for the Downlink of Future LTE Cellular Networks

Modern cellular networks in traditional frequency bands are notoriously interference-limited especially in urban areas, where base stations are deployed in close proximity to one another. The latest releases of Long Term Evolution (LTE) incorporate features for coordinating downlink transmissions as an efficient means of managing interference. Recent field trial results and theoretical studies of the performance of joint transmission (JT) coordinated multi-point (CoMP) schemes revealed, however, that their gains are not as high as initially expected, despite the large coordination overhead. These schemes are known to be very sensitive to defects in synchronization or information exchange between coordinating bases stations as well as uncoordinated interference. In this article, we review recent advanced coordinated beamforming (CB) schemes as alternatives, requiring less overhead than JT CoMP while achieving good performance in realistic conditions. By stipulating that, in certain LTE scenarios of increasing interest, uncoordinated interference constitutes a major factor in the performance of CoMP techniques at large, we hereby assess the resilience of the state-of-the-art CB to uncoordinated interference. We also describe how these techniques can leverage the latest specifications of current cellular networks, and how they may perform when we consider standardized feedback and coordination. This allows us to identify some key roadblocks and research directions to address as LTE evolves towards the future of mobile communications.

cs.IT↗

arXiv2016

Massive MIMO Relaying with Hybrid Processing

Massive multiple-input multiple-output (MIMO) relaying is a promising technological paradigm which can offer high spectral efficiency and substantially improved coverage. Yet, these configurations face some formidable challenges in terms of digital signal processing (DSP) power consumption and circuitry complexity, since the number of radio frequency (RF) chains may scale with the number of antennas at the relay station. In this paper, we advocate that performing a portion of the power-intensive DSP in the analog domain, using simple phase shifters and with a reduced number of RF paths, can address these challenges. In particular, we consider a multipair amplify-and-forward (AF) relay system with maximum ratio combining/transmission (MRC/MRT) and we determine the asymptotic spectral efficiency for this hybrid analog/digital architecture. After that, we extend our analytical results to account for heavily quantized analog phase shifters and show that the performance loss with 2 quantization bits is only 10%.

cs.IT↗

arXiv2016

Apply Artificial Noise To Secure Fading Relay Networks: A SER-Based Approach

We apply the concept of artificial and controlled interference in a triangular relay network with an untrusted relay aiming at enhancing the wireless communication secrecy between the source and the destination node. In order to shield the square quadrature amplitude modulated (QAM) signals transmitted from the source node to the relay, the destination node designs and transmits artificial noise (AN) symbols to jam the relay reception. The objective of our considered AN design is to degrade the error probability performance at the untrusted relay, for different types of channel state information (CSI) at the destination. By considering perfect knowledge of the instantaneous CSI of the source-to-relay and relay-to-destination links, we first present an analytical expression for the symbol error rate (SER) performance at the relay. Based on the assumption of an average power constraint at the destination node, we then derive the optimal phase and power distribution of the AN that maximizes the SER at the relay. Furthermore, we obtain the optimal AN design for the case where only statistical CSI is available at the destination node. For both cases, our study reveals that the Gaussian distribution is generally not optimal to generate AN symbols. In particular, the conducted numerical results show that the Gaussian distributed AN is far from optimal. The presented AN design takes into account practical parameters for the communication links, such as QAM signaling and maximum likelihood decoding.

cs.IT↗

arXiv2015

Bit Error Rate Analysis of Cooperative Beamforming for Transmitting Individual Data Streams

Cooperative beamforming (CB) has been proposed as a special case of coordinated multi-point techniques in wireless communications. In wireless sensor networks, CB can enable low power communication by allowing a collection of sensor nodes to transmit data simultaneously to a distant fusion center in one hop. Besides the traditional CB approach where all nodes need to share and transmit the same data, a more recent technique allows each node to transmit its own data while still achieving the benefits of cooperation. However, the intricacies of varying beamforming gains in the direct sequence spread spectrum with binary frequency shift keying multiple access scheme used in this context need to be taken into account when evaluating the performance of this beamforming technique. In this paper, we take the first step towards a more comprehensive understanding of this individual-data CB technique by proposing a best suited decoding scheme and analyzing its bit error rate (BER) performance over an additive white Gaussian noise channel. Through analytical expressions and simulation results BER curves are drawn and the achieved performance improvement offered by the CB gain is quantified.

cs.IT↗

arXiv2015

Maximal Ratio Transmission in Wireless Poisson Networks under Spatially Correlated Fading Channels

The downlink of a wireless network where multi-antenna base stations (BSs) communicate with single-antenna mobile stations (MSs) using maximal ratio transmission (MRT) is considered here. The locations of BSs are modeled by a homogeneous Poisson point process (PPP) and the channel gains between the multiple antennas of each BS and the single antenna of each MS are modeled as spatially arbitrarily correlated Rayleigh random variables. We first present novel closed-form expressions for the distribution of the power of the interference resulting from the coexistence of one intended and one unintended MRT over the considered correlated fading channels. The derived expressions are then used to obtain closed-form expressions for the success probability and area spectral efficiency of the wireless communication network under investigation. Simulation results corroborate the validity of the presented expressions. A key result of this work is that the effect of spatial correlation on the network throughput may be contrasting depending on the density of BSs, the signal-to-interference-plus-noise ratio (SINR) level, and the background noise power.

cs.IT↗

arXiv2014

Precoding for Multiuser MIMO Systems with Single-Fed Parasitic Antenna Arrays

Transmitter (TX) cooperation at various levels has been shown to increase the sum throughput of multiuser multiple-input multiple-output (MIMO) systems. In this paper we consider a K-user MIMO system where TXs have only global channel state knowledge. It has been theoretically shown that interference alignment (IA) achieves the K/2 degrees of freedom of this K-user MIMO interference channel. However, results on IA and all proposed transceiver techniques for this channel up to date, assume conventional antenna arrays at the transceivers with multiple radio-frequency (RF) chains, each connected to a different antenna element. To reduce the consequent hardware burden and power dissipation imposed by such arrays, we propose in this paper the utilization of compact single-RF electronically steerable parasitic (passive) array radiators (ESPARs) at the cooperating TXs. A signal model capable of capturing the characteristics of the considered antenna arrays is first described and then a general precoding design methodology for the tunable parasitic loads at the TXs' ESPARs is introduced. Specific precoding techniques and an indicative ESPAR design are presented for a 3-user 2x2 MIMO system with one ESPAR TX, and the obtained performance evaluation results show that the gains of TX cooperation are still feasible.

cs.IT↗

arXiv2013

A Reconfigurable Distributed Algorithm for K-user MIMO Interference Networks

It is already well-known that interference alignment (IA) achieves the sum capacity of the K-user interference channel at the high interference regime. On the other hand, it is intuitively clear that when the interference levels are very low, a sum-rate scaling of K (as opposed to K/2 for IA) should be accessed at high signal-to-noise ratio values by simple ("myopic") single-link multiple-input multiple-output (MIMO) techniques such as waterfilling. Recent results have indicated that in certain low-to-moderate interference cases, treating interference as noise may in fact be preferable. In this paper, we present a distributed iterative algorithm for K-user MIMO interference networks which attempts to adjust itself to the interference regime at hand, in the above sense, as well as to the channel conditions. The proposed algorithm combines the system-wide mean squared error minimization with the waterfilling solution to adjust to the interference levels and channel conditions and maximize accordingly each user's transmission rate. Sum-rate computer simulations for the proposed algorithm over Ricean fading channels show that, in the interference-limited regime, the proposed algorithm reconfigures itself in order to achieve the IA scaling whereas, in the low-to-moderate interference regime, it leads itself towards interference-myopic MIMO transmissions.

cs.IT↗

arXiv2011

A Comparative Study of Relaying Schemes with Decode-and-Forward over Nakagami-m Fading Channels

Utilizing relaying techniques to improve performance of wireless systems is a promising avenue. However, it is crucial to understand what type of relaying schemes should be used for achieving different performance objectives under realistic fading conditions. In this paper, we present a general framework for modelling and evaluating the performance of relaying schemes based on the decode-and-forward (DF) protocol over independent and not necessarily identically distributed (INID) Nakagami-m fading channels. In particular, we present closed-form expressions for the statistics of the instantaneous output signal-to-noise ratio of four significant relaying schemes with DF; two based on repetitive transmission and the other two based on relay selection (RS). These expressions are then used to obtain closed-form expressions for the outage probability and the average symbol error probability for several modulations of all considered relaying schemes over INID Nakagami-m fading. Importantly, it is shown that when the channel state information for RS is perfect, RS-based transmission schemes always outperform repetitive ones. Furthermore, when the direct link between the source and the destination nodes is sufficiently strong, relaying may not result in any gains and in this case it should be switched-off.

cs.IT↗