We present a stochastic geometry-based model to investigate alternative medium access choices for LoRaWAN---a widely adopted low-power wide-area networking (LPWAN) technology for the Internet-of-things (IoT). LoRaWAN adoption is driven by its simplified network architecture, air interface, and medium access. The physical layer, known as LoRa, provides quasi-orthogonal virtual channels through spreading factors (SFs) and time-power capture gains. However, the adopted pure ALOHA access mechanism suffers, in terms of scalability, under the same-channel same-SF transmissions from a large number of devices. In this paper, our objective is to explore access mechanisms beyond-ALOHA for LoRaWAN. Using recent results on time- and power-capture effects of LoRa, we develop a unified model for the comparative study of other choices, i.e., slotted ALOHA and carrier-sense multiple access (CSMA). The model includes the necessary design parameters of these access mechanisms, such as guard time and synchronization accuracy for slotted ALOHA, carrier sensing threshold for CSMA. It also accounts for the spatial interaction of devices in annular-shaped regions, characteristic of LoRa, for CSMA. The performance derived from the model in terms of coverage probability, channel throughput, and energy efficiency are validated using Monte-Carlo simulations. Our analysis shows that slotted ALOHA indeed has higher reliability than pure ALOHA but at the cost of lower energy efficiency for low device densities. Whereas, CSMA outperforms slotted ALOHA at smaller SFs in terms of reliability and energy efficiency, with its performance degrading to pure ALOHA at higher SFs.
The analogies between successive interference cancellation (SIC) in slotted ALOHA framework and iterative belief-propagation erasure-decoding, established recently, enabled the application of the erasure-coding theory and tools to design random access schemes. This approach leads to throughput substantially higher than the one offered by the traditional slotted ALOHA. In the simplest setting, SIC progresses when a successful decoding occurs for a single user transmission. In this paper we consider a more general setting of a channel with capture and explore how such physical model affects the …
Although the idea of using wireless links for covering large areas is not new, the advent of LPWANs has recently started changing the game. Simple, robust, narrowband modulation schemes permit the implementation of low-cost radio devices offering high receiver sensitivity, thus improving the overall link budget. The several technologies belonging to the LPWAN family, including the well-known LoRaWAN solution, provide a cost-effective answer to many Internet-of-things (IoT) applications, requiring wireless communication capable of supporting large networks of many devices (e.g., smart metering)…
Various applications of wireless Machine-to-Machine (M2M) communications have rekindled the research interest in random access protocols, suitable to support a large number of connected devices. Slotted ALOHA and its derivatives represent a simple solution for distributed random access in wireless networks. Recently, a framed version of slotted ALOHA gained renewed interest due to the incorporation of successive interference cancellation (SIC) in the scheme, which resulted in substantially higher throughputs. Based on similar principles and inspired by the rateless coding paradigm, a frameless…
In nonorthogonal multiple access (NOMA), the power difference of multiple signals is exploited for multiple access and successive interference cancellation (SIC) is employed at a receiver to mitigate co-channel interference. Thus, NOMA is usually employed for coordinated transmissions and mostly applied to downlink transmissions where a base station (BS) per- forms coordination for downlink transmissions with full channel state information (CSI). In this paper, however, we show that NOMA can also be employed for non-coordinated transmissions such as random access for uplink transmissions. We a…
The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by utilizing theory and tools of erasure-correcting codes. In this paper we present a generalization of the and-or tree evaluation, adapted for the asymptotic analysis of the slotted ALOHA-based random-access protocols, for the case when the contending users experience different channel conditions, resulting in packet loss probability that varies across users.…
In this paper, a random access scheme is introduced which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation of the SIC process, resembling iterative decoding of generalized low-density parity-check codes over the erasure channel, is exploited to optimize the selection probabilities of the component erasure correcting codes via density evolution analysis. The capacity (in packets per slot) of the scheme is then analyzed in the context of the collision channel with…
We consider a relay-aided Slotted ALOHA solution for uplink random access for an Optical Wireless Communications (OWC)-based Internet of Things (IoT). The first phase of uplink, the one between IoT devices and the relays, is realized using indoor OWC, while the second phase, between the relays and a base station, represents the long-range RF transmission based on low-power wide area network such as LoRaWAN and occurs outdoors. The throughput performance dependence on the OWC and RF channel conditions is observed. The behavior of the performance gain due to adding relays is highlighted and inve…
Machine-type communication services in mobile cel- lular systems are currently evolving with an aim to efficiently address a massive-scale user access to the system. One of the key problems in this respect is to efficiently identify active users in order to allocate them resources for the subsequent transmissions. In this paper, we examine two recently suggested approaches for user activity detection: compressed-sensing (CS) and coded slotted ALOHA (CSA), and provide their comparison in terms of performance vs resource utilization. Our preliminary results show that CS-based approach is able to…
We propose a novel distributed random access scheme for wireless networks based on slotted ALOHA, motivated by the analogies between successive interference cancellation and iterative belief-propagation decoding on erasure channels. The proposed scheme assumes that each user independently accesses the wireless link in each slot with a predefined probability, resulting in a distribution of user transmissions over slots. The operation bears analogy with rateless codes, both in terms of probability distributions as well as to the fact that the ALOHA frame becomes fluid and adapted to the current …
Modern random access protocols are emerging as an efficient yet simple solution for arising internet of things (IoT) applications in upcoming beyond-5G systems. In this context, both terrestrial and non-terrestrial scenarios can benefit from the presence of multiple low-complexity receivers that act as relays, collecting packets from users and forwarding them towards a central unit. To gain insights on the potential of these setups, we investigate a two-tier slotted ALOHA (SA) multiple-relay system under an erasure channel model. We derive exact end-to-end throughput expressions for an arbitra…
Access reservation based on slotted ALOHA is commonly used in wireless cellular access. In this paper we investigate its enhancement based on the use of physical-layer network coding and signature coding, whose main feature is enabling simultaneous resolution of up to K users contending for access, where K >= 1. We optimise the slot access probability such that the expected throughput is maximised. In particular, the slot access probability is chosen in line with an estimate of the number of users in the system that is obtained relying on the pseudo-Bayesian approach by Rivest, which we genera…
The sum rate performance of random-access networks crucially depends on the access protocol and receiver structure. Despite extensive studies, how to characterize the maximum sum rate of the simplest version of random access, Aloha, remains an open question. In this paper, a comprehensive study of the sum rate performance of slotted Aloha networks is presented. By extending the unified analytical framework proposed in [20], [21] from the classical collision model to the capture model, the network steady-state point in saturated conditions is derived as a function of the signal-to-interference-…
Multiple connected devices sharing common wireless resources might create interference if they access the channel simultaneously. Medium access control (MAC) protocols gener- ally regulate the access of the devices to the shared channel to limit signal interference. In particular, irregular repetition slotted ALOHA (IRSA) techniques can achieve high-throughput performance when interference cancellation methods are adopted to recover from collisions. In this work, we study the finite length performance for IRSA schemes by building on the analogy between successive interference cancellation and …
The random access scheme is a fundamental scenario in which users transmit through a shared channel and cannot coordinate each other. In recent years, successive interference cancellation (SIC) was introduced into the random access scheme. It is possible to decode transmitted packets using collided packets by the SIC. The coded slotted ALOHA (CSA) is a random access scheme using the SIC. The CSA encodes each packet using a local code prior to transmission. It is known that the CSA achieves excellent throughput. On the other hand, it is reported that in the coding theory time shift improves the…
In this paper, we study wireless powered communication networks that employ the slotted ALOHA protocol, which is the preferred protocol for simple and uncoordinated networks. In the energy harvesting (EH) phase, the base station broadcasts radio frequency energy to the EH users (EHUs). The EHUs harvest the broadcasted energy and use it to transmit information back to the base station by contending for access to the uplink channel in the random access (RA) phase. In order to ensure fairness among the users, we propose a proportionally fair resource allocation scheme that exploits the RA nature …
Non-orthogonal multiple access (NOMA) can improve the spectral efficiency by exploiting the power domain and successive interference cancellation (SIC), and it can be applied to various transmission schemes including random access that plays a crucial role in the Internet of Things (IoT) to support connectivity for a number of devices with sparse activity. In this paper, we formulate a game when NOMA is applied to ALOHA to decide the transmission probability. We consider a payoff function based on an energy-efficiency metric and drive the mixed strategy Nash equilibrium (NE).
In this paper, coded slotted ALOHA (CSA) is introduced as a powerful random access scheme to the MAC frame. In CSA, the burst a generic user wishes to transmit in the MAC frame is first split into segments, and these segments are then encoded through a local a packet-oriented code prior to transmission. On the receiver side, iterative interference cancellation combined with decoding of the local code is performed to recover from collisions. The new scheme generalizes the previously proposed irregular repetition slotted ALOHA (IRSA) technique, based on a simple repetition of the users' bursts. …
Recently, random access protocols have acquired a new wave of interest, not only from the satellite communication community, but also from researchers active in fields like Internet of Things and machine-to-machine. Asynchronous (slot- and frame-wise) ALOHA-like random access protocols, are very attractive for such applications, enabling low complexity transmitters and avoiding time synchronization requirements. Evolutions of ALOHA employ time diversity through proactive replication of packets, but the time diversity is not fully exploited at the receiver. Combining techniques, as selection co…
With the rapid expansion of the Internet of Things, the efficient sharing of the wireless medium by a large amount of simple transmitters is becoming essential. Scheduling-based solutions are inefficient for this setting, where small data units are broadcast sporadically by terminals that most of the time are idle. Modern random access has embraced the challenge and provides suitable slot-synchronous and asynchronous multiple access solutions based on replicating the packets and exploiting successive interference cancellation (SIC) at the receiver. In this work, we focus on asynchronous modern…
One of the main problems in WIMAX is to share the medium by multiple users who compete for access. Various random access mechanisms, such as ALOHA and its corresponding variations have been widely studied as efficient methods to coordinate the medium access among competing users. In this paper the slotted ALOHA protocol is implemented as a two-state system. Using Markov Models, we evaluate the channel utilization and we analyze the throughput under different fairness conditions. The cooperative team problem is considered.
Slotted ALOHA (SA) algorithms with Successive Interference Cancellation (SIC) decoding have received significant attention lately due to their ability to dramatically increase the throughput of traditional SA. Motivated by increased density of cellular radio access networks due to the introduction of small cells, and dramatic increase of user density in Machine-to-Machine (M2M) communications, SA algorithms with SIC operating cooperatively in multi base station (BS) scenario are recently considered. In this paper, we generalize our previous work on Slotted ALOHA with multiple-BS (SA-MBS) by co…
Motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, and cyber-physical systems, supporting delay-constrained traffic becomes critical for such systems. In delay-constrained traffic, each packet has a hard deadline; when it is not delivered before its deadline is up, it becomes useless and will be removed from the system. In this work, we focus on designing random access schemes for delay-constrained wireless communications. We first investigate three ALOHA-based schemes and prove that the system timely throughput of all three schemes …
Herein, we consider the problem of cooperative multi-access in the presence of overlapped coverage areas. Assuming a frameless ALOHA transmission scheme, we derive exact analytical throughput expressions for throughput in the aforementioned scenarios as a function of the frame length of the system and for arbitrary average numbers of users transmitting in each slot (target degree). After obtaining these original expressions, we then formulate a utility function whose maximization (obtained, e.g., through genetic algorithms) yields unequal and optimum target degrees to be employed by users in e…
There is a paucity of random access protocols designed for alleviating collisions in visible light communication (VLC) systems, where carrier sensing is hard to be achieved due to the directionality of light. To resolve the problem of collisions, we adopt the successive interference cancellation (SIC) algorithm to enable the coordinator to simultaneously communicate with multiple devices, which is referred to as the multi-packet reception (MPR) capability. However, the MPR capability could be fully utilized only when random access algorithms are properly designed. Considering the characteristi…
One of the novelties brought by 5G is that wireless system design has increasingly turned its focus on guaranteeing reliability and latency. This shifts the design objective of random access protocols from throughput optimization towards constraints based on reliability and latency. For this purpose, we use frameless ALOHA, which relies on successive interference cancellation (SIC), and derive its exact finite-length analysis of the statistics of the unresolved users (reliability) as a function of the contention period length (latency). The presented analysis can be used to derive the reliabil…
Supporting massive device transmission is challenging in Machine-to-Machine (M2M) communications. Particularly, in event-driven M2M communications, a large number of devices activate within a short period of time, which in turn causes high radio congestions and severe access delay. To address this issue, we propose a Fast Adaptive S-ALOHA (FASA) scheme for random access control of M2M communication systems with bursty traffic. Instead of the observation in a single slot, the statistics of consecutive idle and collision slots are used in FASA to accelerate the tracking process of network status…
In this paper, we consider the delay-sensitive power and transmission threshold control design in S-ALOHA network with FSMC fading channels. The random access system consists of an access point with K competing users, each has access to the local channel state information (CSI) and queue state information (QSI) as well as the common feedback (ACK/NAK/Collision) from the access point. We seek to derive the delay-optimal control policy (composed of threshold and power control). The optimization problem belongs to the memoryless policy K-agent infinite horizon decentralized Markov decision proces…
In this paper a Time Division Multiple Access (TDMA) based Random Access (RA) channel with Successive Interference Cancellation (SIC) is considered for a finite user population and reliable retransmission mechanism on the basis of Contention Resolution Diversity Slotted ALOHA (CRDSA). A general mathematical model based on Markov Chains is derived which makes it possible to predict the stability regions of SIC-RA channels, the expected delays in equilibrium and the selection of parameters for a stable channel configuration. Furthermore the model enables the estimation of the average time before…
Random Access (RA) Medium Access (MAC) protocols are simple and effective when the nature of the traffic is unpredictable and random. In the following paper, a novel RA protocol called Enhanced Contention Resolution ALOHA (ECRA) is presented. This evolution, based on the previous Contention Resolution ALOHA (CRA) protocol, exploits the nature of the interference in unslotted Aloha-like channels for trying to resolve most of the partial collision that can occur there. In the paper, the idea behind ECRA is presented together with numerical simulations and a mathematical analysis of its performan…
Machine-to-Machine (M2M) communication is now playing a market-changing role in a wide range of business world. However, in event-driven M2M communications, a large number of devices activate within a short period of time, which in turn causes high radio congestions and severe access delay. To address this issue, we propose a Fast Adaptive S-ALOHA (FASA) scheme for M2M communication systems with bursty traffic. The statistics of consecutive idle and collision slots, rather than the observation in a single slot, are used in FASA to accelerate the tracking process of network status. Furthermore,…
In this paper, we focus on the throughput of random access with power-domain non-orthogonal multiple access (NOMA) and derive bounds on the throughput. In particular, we demonstrate that the expression for the throughput derived in [1] is an upper-bound and derive a new lower-bound as a closed-form expression. This expression allows to find the traffic intensity that maximizes the lower-bound, which is shown to be the square root of the number of power levels in NOMA. Furthermore, with this expression, for a large number of power levels, we obtain the asymptotic maximum throughput that is incr…
Machine-type communication (MTC) has been extensively studied to provide connectivity for devices and sensors in the Internet-of-Thing (IoT). Thanks to the sparse activity, random access, e.g., ALOHA, is employed for MTC to lower signaling overhead. In this paper, we propose to adopt exploration for multichannel ALOHA by transmitting preambles before transmitting data packets in MTC, and show that the maximum throughput can be improved by a factor of 2 - exp(-1) = 1.632, In the proposed approach, a base station (BS) needs to send the feedback information to active users to inform the numbers o…
We propose an uncoordinated all-to-all broadcast protocol for periodic messages in vehicular networks based on coded slotted ALOHA (CSA). Unlike classical CSA, each user acts as both transmitter and receiver in a half-duplex mode. As in CSA, each user transmits its packet several times. The half-duplex mode gives rise to an interesting design trade-off: the more the user repeats its packet, the higher the probability that this packet is decoded by other users, but the lower the probability for this user to decode packets from others. We compare the proposed protocol with carrier sense multiple…
In this paper, we study federated learning in a cellular system with a base station (BS) and a large number of users with local data sets. We show that multichannel random access can provide a better performance than sequential polling when some users are unable to compute local updates (due to other tasks) or in dormant state. In addition, for better aggregation in federated learning, the access probabilities of users can be optimized for given local updates. To this end, we formulate an optimization problem and show that a distributed approach can be used within federated learning to adaptiv…
An information-theoretic approach to irregular repetition slotted ALOHA (IRSA) is proposed. In contrast with previous works, in which IRSA analysis is conducted only based on quantities that are typical of collision models such as the traffic, the new approach also captures more fundamental quantities. Specifically, a suitable codebook construction for the adder channel model is adopted to establish a link with successive interference cancellation over the multi-packet reception channel. This perspective allows proving achievability and converse results for the average sum rate of IRSA multipl…
Recently, contention resolution diversity slotted ALOHA (CRDSA) has been introduced as a simple but effective improvement to slotted ALOHA. It relies on MAC burst repetitions and on interference cancellation to increase the normalized throughput of a classic slotted ALOHA access scheme. CRDSA allows achieving a larger throughput than slotted ALOHA, at the price of an increased average transmitted power. A way to trade-off the increment of the average transmitted power and the improvement of the throughput is presented in this paper. Specifically, it is proposed to divide each MAC burst in k su…
Contention Resolution Diversity Slotted ALOHA (CRDSA) and its burst degree optimizations (CRDSA++, IRSA) make use of MAC burst repetitions and Interference Cancellation (IC) making possible to reach throughput values as high as $T \simeq 0.8$ in practical implementations, whereas for the traditional slotted ALOHA $T \simeq 0.37$. However, these new techniques introduce a frame-based access to the channel that limits the performance in terms of throughput and packet delivery delay. In this paper, a new technique named Sliding Window CRDSA (SW-CRDSA) and its counterpart for irregular repetitions…
Random Access MAC protocols are simple and effective when the nature of the traffic is unpredictable and sporadic. In the following paper, investigations on the new Enhanced Contention Resolution ALOHA (ECRA) are presented, where some new aspects of the protocol are investigated. Mathematical derivation and numerical evaluation of the symbol interference probability after SIC are here provided. Results of the optimum header positioning which is found to be in the beginning and in the end of the packets, are exploited for the evaluation of ECRA throughput and Packet Error Rate (PER) under imper…
Associated with multi-packet reception at the access point, irregular repetition slotted ALOHA (IRSA) holds a great potential in improving the access capacity of massive machine type communication systems. Considering the time-frequency resource efficiency, K = 2 (multi-packet reception capability) may be the most suitable scheme for scenarios that allow smaller resource efficiency in exchange for greater throughput. In this paper, we analytically derive an optimal transmission probability distribution for IRSA with K = 2, which achieves a significant higher load threshold than the existing be…
We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted ALOHA (IRSA) scheme is investigated and achievability bounds are derived. The main difference of this scheme in comparison to IRSA is as follows: any collisions of order up to T can be resolved with some probability of error introduced by noise. In order to optimize the parameters of the scheme we combine the density evolution method (DE) proposed by G. Liva and a finite length random coding bound for the Gaussian MAC…
Slotted Aloha-based Random Access (RA) techniques have recently regained attention in light of the use of Interference Cancellation (IC) as a mean to exploit diversity created through the transmission of multiple burst copies per packet content (CRDSA). Subsequently, the same concept has been extended to pure ALOHA-based techniques in order to boost the performance also in case of asynchronous RA schemes. In this paper, throughput as well as packet delay and related stability for asynchronous ALOHA techniques under geometrically distributed retransmissions are analyzed both in case of finite a…
We provide a characterization of the peak age of information (AoI) achievable in a random-access system operating according to the frameless ALOHA protocol. Differently from previous studies, our analysis accounts for the fact that the number of terminals contending the channel may vary over time, as a function of the duration of the previous contention period. The exact characterization of the AoI provided in this paper, which is based on a Markovian analysis, reveals the impact of some key protocol parameters such as the maximum length of the contention period, on the average peak AoI. Speci…
In this paper, the problem of using uncoordinated multiple access (UMA) to serve a massive amount of heterogeneous users is investigated. Leveraging the heterogeneity, we propose a novel UMA protocol, called iterative collision resolution for slotted ALOHA (IRSA) with non-orthogonal multiple access (NOMA), to improve the conventional IRSA. In addition to the inter-slot successive interference cancellation (SIC) technique used in existing IRSA-based schemes, the proposed protocol further employs the intra-slot SIC technique that enables collision resolution for certain configurations of collide…
Various random access mechanisms, such as Aloha protocol and its corresponding variants have been widely studied as efficient methods to coordinate the medium access among competing users. But when two or more wireless users transmit packets at the same time over the same channel a collisions occur. When this happens, the received packets are discarded and retransmissions are required, which is a waste of power and bandwidth. In such a situation one of the most important objectives is to find techniques to improve these protocols to reduce the number of collisions or to avoid them. Several stu…
Applications like environmental sensing, and health and activity sensing, are supported by networks of devices (nodes) that send periodic packet transmissions over the wireless channel to a sink node. We look at simple abstractions that capture the following commonalities of such networks (a) the nodes send periodically sensed information that is temporal and must be delivered in a timely manner, (b) they share a multiple access channel and (c) channels between the nodes and the sink are unreliable (packets may be received in error) and differ in quality. We consider scheduled access and slott…
This letter analyzes a class of information freshness metrics for large IoT systems in which terminals employ slotted ALOHA to access a common channel. Considering a Gilbert- Elliot channel model, information freshness is evaluated through a penalty function that follows a power law of the time elapsed since the last received update, in contrast with the linear growth of age of information. By means of a signal flow graph analysis of Markov processes, we provide exact closed form expressions for the average penalty and for the peak penalty violation probability.
In this paper, we review the key figures of merit to assess the performance of advanced random access (RA) schemes exploiting physical layer coding, repetitions and collision resolution techniques. We then investigate RA modeling aspects and their impact on the figures of merit for the exemplary advanced RA schemes: Contention Resolution Diversity Slotted ALOHA (CRDSA), Irregular Repetition Slotted ALOHA (IRSA), Coded Slotted ALOHA (CSA) and Enhanced Spread-Spectrum ALOHA (E-SSA). We show that typical simplifications of the reception model when used to optimize RA schemes lead to inaccurate fi…
The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered as waste. However, if the common receiver (e.g., base station) is capable to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access,…
We propose an uncoordinated medium access control (MAC) protocol, called all-to-all broadcast coded slotted ALOHA (B-CSA) for reliable all-to-all broadcast with strict latency constraints. In B-CSA, each user acts as both transmitter and receiver in a half-duplex mode. The half-duplex mode gives rise to a double unequal error protection (DUEP) phenomenon: the more a user repeats its packet, the higher the probability that this packet is decoded by other users, but the lower the probability for this user to decode packets from others. We analyze the performance of B-CSA over the packet erasure …
In this paper, we design a novel high-throughput random access scheme for an indoor optical wireless communication (OWC) massive Internet of Things (IoT) scenario. Due to the large density of both IoT devices and OWC access points (APs), we base the proposed scheme on multi-receiver coded slotted ALOHA. In this scenario, collisions at APs are resolved by a centralized interference cancellation decoder that may exploit both spatial and temporal diversity. By applying adaptive control of each OWC AP field of view (FOV), the proposed system is able to dynamically adapt to different IoT device act…
We consider a massive Internet of Things (IoT) scenario where indoor IoT devices access the network via optical wireless communication (OWC) IoT systems that relay data via a backhaul radio frequency (RF) low-power wide-area network (LP WAN). We propose a novel two-tier multi-rate Slotted ALOHA (SA) system model to design and analyse such hybrid OWC/RF networks. For a particular hybrid OWC/RF setup, we present an in-depth numerical investigation that provides insights into the proposed two-tier multi-rate hybrid OWC/RF SA system design.
ALOHA-type protocols became a popular solution for distributed and uncoordinated multiple random access in wireless networks. However, such distributed operation of the Medium Access Control (MAC) layer leads to sub-optimal utilization of the shared channel. One of the reasons is the occurrence of collisions when more than one packet is transmitted at the same time. These packets cannot be decoded and retransmissions are necessary. However, it has been recently shown that it is possible to apply signal processing techniques with these collided packets so that useful information can be decoded.…
