3GPP Release-19 is introducing an interesting new feature for narrowband Internet of Things (NB-IoT) and enhanced machine type communications (eMTC). The solution, currently enabled only for IoT over non-terrestrial networks, consists in the use of contention-based early data transmission (CB-EDT) procedures to allow a UE send data over shared uplink resources following a random access approach. In contrast to the existing EDT solution, the new feature does not rely on the exchange of a random access preamble and random access response, but rather foresees the UE directly transmitting its message, thus saving overhead and reducing delay. Moreover, CB-EDT implements diversity slotted ALOHA (DSA), so that a UE transmits multiple replicas of its packet over the available uplink resources, aiming to enhance the probability of having at least one of its messages not colllided. Further improvements are attained by using a multicast acknowledgment (message 4), addressing multiple UEs and saving downlink capacity. This article provides a description of the new feature, starting from its basic working principles and adding up details that cover the current 3GPP implementation status. The potential of the solution is demonstrated and discussed by means of numerical results, also identifying potential developments in future releases.
28 July 2025 in IEEE Transactions on Vehicular Technology
In this work, we provide a simple yet tight analytical approximation of the packet loss rate in the error floor region for a non-orthogonal multiple access (NOMA)-based irregular repetition slotted ALOHA (IRSA) scheme. Considering an Internet of Things (IoT) scenario, users randomly select both the number of replicas based on a designed degree distribution and the transmission power from predetermined levels, while successive interference cancellation (SIC) is performed at the receiver. Our derived packet loss rate expression in the finite length regime is promptly evaluated. Its accuracy is validated through Monte-Carlo simulations, demonstrating a strong match across channel loads, including those beyond the low load regime.
27 March 2023 in IEEE Transactions on Communications
We study the performance of caching schemes based on two different coding techniques. A heterogeneous network is assumed, in which cache-aided relays are connected through a backhaul link to a master node while no connection exits between users and the master node. The first caching scheme considers to fill the cache with encoded content while the second scheme considers to encode the content during the delivery phase. We compare the schemes by characterizing the average transmission load when users ask for downloading content to the network. We provide an approximation of the expression of the average load which allows a fast evaluation of the network behavior for each scheme considered. We further assume a constraint on the capacity of the backhaul link and derive the expression of the outage probability, i.e. the probability that the system is not able to serve the entire set of users demands. Finally, we examine and discuss how the derived analysis of a two relays scenario can be scaled to study the performance of a network with a generic number of relays.
16 October 2018 in IEEE Transactions on Communications
We study the problem of caching optimization in heterogeneous networks with mutual interference and per-file rate constraints from an energy efficiency perspective. A setup is considered in which two cache-enabled transmitter nodes and a coordinator node serve two users. We analyse and compare two approaches: (i) a cooperative approach where each of the transmitters might serve either of the users and (ii) a noncooperative approach in which each transmitter serves only the respective user. We formulate the cache allocation optimization problem so that the overall system power consumption is minimized while the use of the link from the master node to the end users is spared whenever possible. We also propose a lowcomplexity optimization algorithm and show that it outperforms the considered benchmark strategies. Our results indicate that significant gains both in terms of power saving and sparing of master node’s resources can be obtained when full cooperation between the transmitters is in place. Interestingly, we show that in some cases storing the most popular files is not the best solution from a power efficiency perspective.