Abstract:Reconfigurable intelligent surfaces (RISs) have become a promising candidate for the development of future mobile systems. In the context of massive machine-type communications (mMTC), a RIS can be used to support the transmission from a group of sensors to a collector node. Due to the short data packets, we focus on the design of the RIS for maximizing the weighted sum and minimum rates in the finite blocklength regime. Under the assumption of non-orthogonal multiple access, successive interference cancelation is considered as a decoding scheme to mitigate interference. Accordingly, we formulate the optimizations as non-convex problems and propose two sub-optimal solutions based on gradient ascent (GA) and sequential optimization (SO) with semi-definite relaxation (SDR). In the GA, we distinguish between Euclidean and Riemannian gradients. For the SO, we derive a concave lower bound for the throughput and maximize it sequentially applying SDR. Numerical results show that the SO can outperform the GA and that strategies relying on the optimization of the classical Shannon capacity might be inadequate for mMTC networks.
Abstract:Machine-type communications (MTC) are crucial in the evolution of mobile communication systems. Within this context, we distinguish the so-called massive MTC (mMTC), where a large number of devices coexist in the same geographical area. In the case of sensors, a high correlation in the collected information is expected. In this letter, we evaluate the impact of correlation on the entropy of a set of quantized Gaussian sources. This model allows us to express the sensed data with the data correlation matrix. Given the nature of mMTC, these matrices may be well approximated as rank deficient. Accordingly, we exploit this singularity to design a technique for switching off several sensors that maximizes the entropy under power-related constraints. The discrete optimization problem is transformed into a convex formulation that can be solved numerically.
Abstract:This paper presents several analytic closed-form approximations of the aggregated interference statistics within the framework of uplink massive machine-type communications (mMTC), taking into account the random activity of the sensors. Given its discrete nature and the large number of devices involved, a continuous approximation based on the Gram--Charlier series expansion of a truncated Gaussian kernel is proposed. We use this approximation to derive an analytic closed-form expression for the outage probability, corresponding to the event of the signal-to-interference-and-noise ratio being below a detection threshold. This metric is useful since it can be used for evaluating the performance of mMTC systems. We analyze, as an illustrative application of the previous approximation, a scenario with several multi-antenna collector nodes, each equipped with a set of predefined spatial beams. We consider two setups, namely single- and multiple-resource, in reference to the number of resources that are allocated to each beam. A graph-based approach that minimizes the average outage probability, and that is based on the statistics approximation, is used as allocation strategy. Finally, we describe an access protocol where the resource identifiers are broadcast (distributed) through the beams. Numerical simulations prove the accuracy of the approximations and the benefits of the allocation strategy.
Abstract:This paper presents an estimation approach within the framework of uplink massive machine-type communications (mMTC) that considers the energy limitations of the devices. We focus on a scenario where a group of sensors observe a set of parameters and send the measured information to a collector node (CN). The CN is responsible for estimating the original observations, which are spatially correlated and corrupted by measurement and quantization noise. Given the use of Gaussian sources, the minimum mean squared error (MSE) estimation is employed and, when considering temporal evolution, the use of Kalman filters is studied. Based on that, we propose a device selection strategy to reduce the number of active sensors and a quantization scheme with adjustable number of bits to minimize the overall payload. The set of selected sensors and quantization levels are, thus, designed to minimize the MSE. For a more realistic analysis, communication errors are also included by averaging the MSE over the error decoding probabilities. We evaluate the performance of our strategy in a practical mMTC system with synthetic and real databases. Simulation results show that the optimization of the payload and the set of active devices can reduce the power consumption without compromising the estimation accuracy.
Abstract:In this paper, we address the design of multi-user multiple-input single-output (MU-MISO) precoders for indoor visible light communication (VLC) systems. The goal is to minimize the transmitted optical power per light emitting diode (LED) under imperfect channel state information (CSI) at the transmitter side. Robust precoders for imperfect CSI available in the literature include noisy and outdated channel estimation cases. However, to the best of our knowledge, no work has considered adding robustness against channel quantization. In this paper, we fill this gap by addressing the case of imperfect CSI due to the quantization of VLC channels. We model the quantization errors in the CSI through polyhedric uncertainty regions. For polyhedric uncertainty regions and positive real channels, as is the case of VLC channels, we show that the robust precoder against channel quantization errors that minimizes the transmitted optical power while guaranteeing a target signal to noise plus interference ratio (SNIR) per user is the solution of a second order cone programming (SOCP) problem. Finally, we evaluate its performance under different quantization levels through numerical simulations.
Abstract:The employment of stochastic geometry for the analysis and design of ultra dense networks (UDNs) has provided significant insights into network densification. In addition to the characterization of the network performance and behavior, these tools can also be exploited toward solving complex optimization problems that could maximize the capacity benefits arising in UDNs. However, this is preconditioned on the existence of tractable closed form expressions for the considered figures of merit. In this course, the present paper introduces an accurate approximation for the moment generating function (MGF) of the aggregate other-cell interference created by base stations whose positions follow a Poisson point process of given spatial density. Given the pivotal role of the MGF of the aggregate interference in stochastic geometry and the tractability of the derived MGF, the latter can be employed to substantially simplify ensuing stochastic geometry analyses. Subsequently, the present paper employs the introduced MGF to provide closed form expressions for the downlink ergodic capacity for the interference limited case, and validates the accuracy of these expressions by the use of extensive Monte Carlo simulations. The derived expressions depend on the density of users and base stations, setting out a densification road map for network operators and designers of significant value.
Abstract:The mmWave bands, considered to support the forthcoming generation of mobile communications technologies, have a well-known vulnerability to blockages. Recent works in the literature analyze the blockage probability considering independence or correlation among the blocking elements of the different links. In this letter, we characterize the effect of blockages and their correlation on the ergodic capacity. We carry out the analysis for urban scenarios, where the considered blocking elements are buildings that are primarily parallel to the streets. We also present numerical simulations based on actual building features of the city of Chicago to validate the obtained expressions.
Abstract:Designers of millimeter wave (mmWave) cellular systems need to evaluate line-of-sight (LOS) maps to provide good service to users in urban scenarios. In this letter, we derive estimators to obtain LOS maps in scenarios with potential blocking elements. Applying previous stochastic geometry results, we formulate the optimal Bayesian estimator of the LOS map using a limited number of actual measurements at different locations. The computational cost of the optimal estimator is derived and is proven to be exponential in the number of available data points. An approximation is discussed, which brings the computational complexity from exponential to quasi-linear and allows the implementation of a practical estimator. Finally, we compare numerically the optimal estimator and the approximation with other estimators from the literature and also with an original heuristic estimator with good performance and low computational cost. For the comparison, both synthetic layouts and a real layout of Chicago have been used.