The random access procedure is a bottleneck to the development of wireless networks supporting the use cases of massive machine-type communication and ultra reliable and low-latency communication. Such networks are densely and massively popupated and must meet stringent latency and reliability requirements. Due to these characteristics, grant-free random access is envisioned to alleviate the control overhead generated by the classical random access procedure. However, active user detection and channel estimation algorithms are required. Existing algorithms assume that the activity of each device is homogeneous and independent, which is not the case in many applications (e.g., due to sensors observing a common phenomenon). In order to address this problem, we introduce a new flexible model taking into account a group-heterogeneous activity, using the framework of copula theory. It is then leveraged by a hybrid generalized approximate message passing algorithm to solve the active user detection and channel estimation problem. Our numerical results show that the user detection and channel estimation are both improved with this new algorithm w.r.t. state-of-the-art Bayesian algorithms, with gains up to 10 times fewer detection errors and 10 dB less channel estimation error.

Industrial IoT (IIoT) is one of the major verticals targeted by the next generations of wireless networks. In order to provide industrial plants with features relying on wireless communications, the grant-free RA (GFRA) protocol appears to be a promising means for supporting massive ultra-reliable connectivity; at the same time, it is a critical bottleneck that requires an access point (AP) to be able to jointly perform active user detection and channel estimation (AUDaCE) to fulfill its main mission of allowing industrial wireless devices to access the core network. This mission is even harder when the GFRA requests are correlated because of event-driven activity triggers. This paper proposes a new tractable gaussian correlated activity (GCA) model for this scenario. The corresponding AUDaCE problem is then studied in the Bayesian compressed sensing (BCS) framework. An hybrid instance of the generalized AMP (GAMP) algorithm is derived and its capability to perform AUDaCE is numerically assessed by extensive Monte-Carlo simulations. The numerical results show gains of 2.5dB in channel estimation gain for twice less detection errors w.r.t. state-of-the-art algorithms.

In grant-free random access, a key question is how devices should utilize resources without coordination. One standard solution to this problem are strategies where devices randomly select time-slots based on an optimized stochastic allocation rule. However, the optimization of this allocation rule requires accurate knowledge of which devices have been active in previous frames. As user identification algorithms are subject to errors, the expected throughput of the optimized allocation can be highly suboptimal. In this paper, we propose algorithms for optimization of device time-slot allocations that mitigate the impact of user identification errors. We show that when the activity distribution with and without errors is known, then our algorithm converges with probability one to a stationary point. When the activity distributions are not available, we introduce new theoretically-motivated heuristics which significantly improve the expected throughput over existing algorithms and approach the performance when errors are not present.

Despite the huge number of contributions dealing with the evaluation of cellular networks performance, tackling with more and more complex systems including multi-tier networks or MIMO systems, the fundamental limits in terms of capacity in an information theory sense is not known for these networks. Stochastic geometry helped doing a step forward, relying on Palm theory and providing coverage statistic at the network scale. However, this statistic is not sufficient to establish a fundamental limit, namely to characterise a Shannon capacity region of the network. In this paper, we propose a new approach exploiting the cell capacity of the Spatial Continuum Broadcast Channel (SCBC) recently introduced for an isolated cell. The network capacity is linked to the cells' geometry statistics in a Voronoi tessellation. The fundamental limit is characterised by the minimal average cell power required in a network modelled as a Point Process (PP) to achieve a desired rate distribution. A direct relation is established between this minimum average power and the partial area statistics of the cells geometry, which constitute a sufficient statistic. Our approach is validated through Monte-Carlo simulations.