Publications

This paper investigates the performance of dualhop multiple antenna amplify-and-forward relaying system of transmit beamforming (TB) and maximum ratio combining considering feedback delay and co-channel interference (CCI) at the relay node. Source-relay and relay-destination channels experience Rayleigh and Rician fading respectively. TB vector is calculated using outdated channel state information due to the feedback delay from relay-to-source, and the relay node experience CCI due to frequency reuse in the cellular network. We derive new closed form expressions for the exact cumulative distribution function of the end-to-end signal-to-interference-plus-noise ratio to statistically characterized the system. We also derive closed form expression for the outage probability, bit error rate and ergodic capacity. The system performance is investigated using the derived performance metrics to analyze the effect of Rician fading, CCI, feedback delay and number of antennas.

Ultra-reliable and low-latency communications (URLLC) play a vital role in factory automation. To share the situational awareness data collected from the infrastructure as raw or processed data, the system should guarantee the URLLC capability since this is a safety-critical application. In this work, the resource allocation problem for an infrastructure-based communication architecture (Elevated LiDAR system/ELiD) has been considered which can support the autonomous driving in a factory floor. The decoder error probability and the number of channel uses parameterize the reliability and the latency in the considered optimization problems. A maximum decoder error probability minimization problem and a total energy minimization problem have been considered in this work to analytically evaluate the performance of the ELiD system under different vehicle densities.

Recent advances on wireless energy transfer (WET) make it a promising solution for powering future Internet of Things (IoT) devices enabled by the upcoming sixth generation (6G) era. The main architectures, challenges and techniques for efficient and scalable wireless powering are overviewed in this paper. Candidates enablers such as energy beamforming (EB), distributed antenna systems (DAS), advances on devices' hardware and programmable medium, new spectrum opportunities, resource scheduling and distributed ledger technology are outlined. Special emphasis is placed on discussing the suitability of channel state information (CSI)-limited/free strategies when powering simultaneously a massive number of devices. The benefits from combining DAS and EB, and from using average CSI whenever available, are numerically illustrated. The pros and cons of the state-of-the-art CSI-free WET techniques in ultra-low power setups are thoroughly revised, and some possible future enhancements are outlined. Finally, key research directions towards realizing WET-enabled massive IoT networks in the 6G era are identified and discussed in detail.

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 URLLC the performance of short message communications highly depends on the training sequence length due to the stringent latency and reliability requirements. In this paper, we study the performance of cooperative and non-cooperative transmissions under imperfect channel estimation and Rayleigh fading for URLLC. We assume a peak power constraint on pilot symbols in addition to the average power constraint which is used for comparison purposes. We obtain the optimal training length as a function of blocklength and power constraint factor to meet the URLLC requirements. Moreover, the simulation results show the impact of pilot overhead on reliability, latency, and goodput of cooperative communications compared to point-to-point transmission.

The rapidly increasing demand in indoor small cell networks has given rise to the concept of local 5G operator (OP) for local service delivery. In this regard, we develop a novel game-theoretic framework with geometric programming to model and analyze cache-enabled small cell base stations (SBSs) with infrastructure sharing for local 5G OP networks. In such a network, the local 5G OP provides wireless network in indoor area and rent out the infrastructure which are RAN and cache storage to multiple mobile network operators (MNOs) while guarantee the quality-of-experience (QoE) at the users (UEs) of MNOs. We formulate a Stackelberg game model where the local 5G OP is the leader and the MNOs are the followers. The local 5G OP aims to maximize its profit by optimizing its infrastructure rental fee, and the MNOs aim to minimize their renting cost of infrastructure by minimizing the cache intensity subject to latency constraint at each UE. Here, the cache intensity is defined as the product of the number of SBSs per unit area and the number of popular files stored in each SBS. The optimization problems of the local 5G OP and the MNOs are transformed into geometric programming. Accordingly, the subgame perfect equilibrium of Stackelberg game is obtained through the succesive geometric programming (SGP) method. Since the MNOs share their rented infrastructure, for cost sharing, we apply the concept of Shapley value to divide the cost among the MNOs. We show that the cost sharing problem can be mapped into a simplified “airport runway cost sharing problem”, in which the Shapley value can be computed efficiently. Finally, we present an extensive performance evaluation that reveals interesting insights into designing resource sharing with edge caching in local 5G OP networks.

Multi-user shared access (MUSA) is introduced as advanced code domain non-orthogonal complex spreading sequences to support a massive number of machine-type communications (MTC) devices. In this paper, we propose a novel deep neural network (DNN)-based multiple user detection (MUD) for grant-free MUSA systems. The DNN-based MUD model determines the structure of the sensing matrix, randomly distributed noise, and inter-device interference during the training phase of the model by several hidden nodes, neuron activation units, and a fit loss function. The thoroughly learned DNN model is capable of distinguishing the active devices of the received signal without any a priori knowledge of the device sparsity level and the channel state information. Our numerical evaluation shows that with a higher percentage of active devices, the DNN-MUD achieves a significantly increased probability of detection compared to the conventional approaches.

We analyze the performance of the type-I automatic repeat request (ARQ) protocol with ultra-reliability constraints. First, we show that achieving a very low packet outage probability by using an open loop setup is a difficult task. Thus, we introduce the ARQ protocol as a solution for achieving the required low outage probabilities for ultra reliable communication. For this protocol, we present an optimal power allocation scheme that would allow us to reach any outage probability target in the finite block-length regime. We formulate the power allocation problem as minimization of the average transmitted power under a given outage probability and maximum transmit power constraint. By utilizing the Karush-Kuhn-Tucker (KKT) conditions, we solve the optimal power allocation problem and provide a closed form solution. Next, we analyze the effect of implementing the ARQ protocol on the throughput. We show that by using the proposed power allocation scheme we can minimize the loss of throughput that is caused from the retransmissions. Furthermore, we analyze the effect of the feedback delay length in our scheme.

No abstract is provided for this article.

This work proposes an analytical framework to study how relay selection strategies perform in half- and full-duplex deployments by combining renewal theory and stochastic geometry. Specifically, we assume that the network nodes -- operating in either half- or full-duplex mode -- are scattered according to a two-dimensional homogeneous Poisson point process to compute the relay selection cost by using a semi-Markov process. Our results show: ($i$) fixed relay outperforms the reactive option in either cases, ($ii$) the performance of both reactive and fixed relay strategies depends on the self-interference attenuation in full-duplex scenarios, evincing when they outperform the half-duplex option, and ($iii$) the reactive relay selection suffers from selecting relays at hop basis, while the fixed relay selection benefits most from the full-duplex communication.

Caching of popular contents at cellular base stations, i.e., edge caching, in order to eliminate duplicate transmission through the backhaul can reduce the latency of data delivery in $5$G networks. However, since caching can only reduce the backhaul delay, techniques such as base station densification will also need to be used to reduce the fronthaul delay. In this paper, using results from stochastic geometry, we first model the effects of base station densification and cache size on the latency of the system. We then derive a tight approximation for the cache hit probability. To optimize the network cost due to the deployment of base station (BS) and cache storage, a minimization problem for the product of the BS intensity and cache size is formulated under probabilistic delay constraint, which is converted into a geometric program and solved analytically. The results are then used to analyze the economics of a cache-enabled virtualized cellular network where the network infrastructure, i.e., BSs and cache storage, owned by an infrastructure provider (InP) is shared among multiple mobile network operators (MNOs). For the pricing between the InP and the MNOs, we formulate a Stackelberg game with the InP as the leader and multiple MNOs as the followers. In this virtualized scenario, the common cost of renting the infrastructure is shared in a fair manner among the MNOs by using the Shapely value. An efficient algorithm is provided to divide the rent among MNOs.

We introduce a full duplex multiuser multiple-input multiple-output (FD MU-MIMO) system, and consider the total throughput maximization problem under a sum power constraint in the downlink (DL) channel and per-user power constraints in the uplink (UL) channel. Due to the nature of asymmetric DL/UL capacity, a trivial method to this problem is to optimize the DL and UL channels sequentially. However, when the self-interference (SI) is large, the sum rate of the UL channel in this sequential design is dramatically degraded. Herein, a joint design is proposed, in which the DL and UL channels are optimized simultaneously. Since the objective function of the throughput maximization problem is non-convex, it is difficult to find the optimal solution. Thus, we propose a joint iterative algorithm to find a suboptimal design, using a local optimization strategy. Simulation results demonstrate that the iterative joint design outperforms the sequential design, and the FD MU-MIMO system is superior to the conventional half duplex (HD) system in terms of the total system throughput when the SI is sufficiently small. This makes the FD MU-MIMO techniques promising for small cell deployments where the transmit power is relatively small.