Publications

No abstract is provided for this article.

Radiated testing of massive multiple-input-multiple-output devices in fading radio-channel conditions is expected to be essential in the development of the fifth-generation (5G) base stations and user equipment (TIE) operating at or close to the millimeter-wave (mm-wave) frequencies. In this paper, we present a setup upgrading the multiprobe anechoic chamber-based system designed originally for 4G TIE. We describe methods for mapping radio-channel models onto the probe configuration and discuss the differences to the former 4G case. We also propose metrics to assess the accuracy of the test setup and find key design parameters by simulations. The results with the utilized channel models indicate that at 28 GHz, up to 16 × 16 planar arrays can be tested with a range length of 1 m and with at minimum eight active dual polarized probes.

The most important third generation (3G) cellular communications standard is based on wideband CDMA (WCDMA). Receivers based on TDMA style channel equalization at the chip level have been proposed for a WCDMA downlink employing long spreading sequences to ensure adequate performance even with a high number of active users. These receivers equalize the channel prior to despreading, thus restoring the orthogonality of users and resulting in multiple-access interference (MAI) suppression. In this paper, an overview of chip-level channel equalizers is delivered with special attention to adaptation methods suitable for the WCDMA downlink. Numerical examples on the equalizers′ performance are given in Rayleigh fading frequency-selective channels.

We model the problem of infrastructure sharing among mobile network operators (MNOs) as a multiple-seller single-buyer market where the MNOs are able to share their own base stations (BSs) with each other. First, we use techniques from stochastic geometry to find the coverage probability of the infrastructure sharing system and analyze the trade-off between increasing the transmit power of a BS and the BS intensity of a buyer MNO required to achieve a given quality-of-service (QoS) in terms of the coverage probability. We also analyze the power consumption of the network per unit area (i.e., areal power consumption) and show that it is a piecewise continuous function composed of a linear and a convex functions. We show that when the transmit power of the BSs and/or the BS intensity of a network increases, the system becomes interference limited and the coverage probability tends to saturate at a certain value. As such, when the required QoS is set above this bound, an MNO can improve its coverage by buying infrastructure from other MNOs. Subsequently, we analyze the strategy of a buyer MNO on choosing how many MNOs and which MNOs to buy the infrastructure from. The optimal strategy of the buyer is given by greedy fractional knapsack algorithm. On the sellers' side, the pricing and the fraction of infrastructure to be sold are formulated using a Cournot oligopoly game.

This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node and then sent to the control unit. The sensor measurements, their communication with the aggregetor and the information processing are all assumed perfect. To reach the control unit, the message may travel through relay nodes, forming a multi-hop, wireless link. At every hop, eavesdropper nodes attempt to acquire the messages transmitted through the legitimate link. The communication design problem posed here is how to maximize the multi-hop throughput from the aggregator to the control unit by finding the best combination of relay positions (i.e. hop length: short or long) and coding rates (i.e. high or low spectral efficiency) so that the secrecy constraint is satisfied. Using a stochastic-geometry approach, we show that the optimal choice of coding rate depends only on the path- loss exponent and is normally high while greater number of shorter hops are preferable to smaller number of longer hops. For the scenarios of interest, we prove that the optimal throughput subject to the secrecy constraint achieves the unconstrained optimal performance if a feasible solution exists.

In this paper, assuming an interference-limited eavesdropper scenario, the secrecy outage performance ofmultiple-input multiple-output wiretap channels with transmit antenna selection is investigated. Considering that the transmitter (Tx) and the receiver (Rx) are equipped with NA and NB antennas, respectively, while the passive eavesdropper is set with NE antennas, closed-form expressions for the secrecy outage probability and non-zerosecrecy rate are derived. In our analysis, both maximal-ratio combining (MRC) and selection combining (SC) are employed at the Rx, while the eavesdropper uses a MRC scheme. The derived outage expressions hold for arbitrary power distributed jamming signals and some of their special cases (i.e., distinct power distributed and equal power distributed jamming signals) are presented. An asymptotic analysis is carried out to show the impact of the number of jamming signals and number of antennas on the secrecy outage performance. Interestingly, our results show thatthe diversity order equals to min(M,NANB), with M denoting the number of jamming signals. This allows us to conclude that the number of jamming signals at the eavesdropper limits the secrecy performance via diversity such that a high number of antennas does not imply necessarily in a performance improvement, unless for a large number of jamming signals.

No abstract is provided for this article.

In this paper, we consider the problem of admission control in 5G networks where enhanced mobile broadband (eMBB) users and ultra-reliable low-latency communication (URLLC) users are coexisting. URLLC users require low latency and high reliability while eMBB users require high data rates. Thus, it is essential to control the admission of eMBB users while giving priority to all URLLC users in a network where both types of users are coexisting. Our aim is to maximize the number of admitted eMBB users to the system with a guaranteed data rate while allocating resources to all URLLC users. We formulated this as an l_0 minimization problem. Since it is an NP-hard problem we have used approximation methods and sequential convex programming to obtain a suboptimal solution. Numerically we have shown that the proposed algorithm achieves near-optimal performance. Our algorithm is able to maximize the number of admitted eMBB users with an optimal allocation of resources while giving priority to all URLLC users.

In this paper, we consider the problem of admission control in 5G networks where enhanced mobile broadband (eMBB) users and ultra-reliable low-latency communication (URLLC) users are coexisting. URLLC users require low latency and high reliability while eMBB users require high data rates. Thus, it is essential to control the admission of eMBB users while giving priority to all URLLC users in a network where both types of users are coexisting. Our aim is to maximize the number of admitted eMBB users to the system with a guaranteed data rate while allocating resources to all URLLC users. We formulated this as an l_0 minimization problem. Since it is an NP-hard problem we have used approximation methods and sequential convex programming to obtain a suboptimal solution. Numerically we have shown that the proposed algorithm achieves near-optimal performance. Our algorithm is able to maximize the number of admitted eMBB users with an optimal allocation of resources while giving priority to all URLLC users.

This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node and then sent to the control unit. The sensor measurements, their communication with the aggregetor and the information processing are all assumed perfect. To reach the control unit, the message may travel through relay nodes, forming a multi-hop, wireless link. At every hop, eavesdropper nodes attempt to acquire the messages transmitted through the legitimate link. The communication design problem posed here is how to maximize the multi-hop throughput from the aggregator to the control unit by finding the best combination of relay positions (i.e. hop length: short or long) and coding rates (i.e. high or low spectral efficiency) so that the secrecy constraint is satisfied. Using a stochastic-geometry approach, we show that the optimal choice of coding rate depends only on the path- loss exponent and is normally high while greater number of shorter hops are preferable to smaller number of longer hops. For the scenarios of interest, we prove that the optimal throughput subject to the secrecy constraint achieves the unconstrained optimal performance if a feasible solution exists.