Adaptive load control for IoT based on satellite communications

The Internet Of Things (IoT) market is growing more and more every year. Today, the number of IoT devices is estimated around 8 billion but forecasts announce 20 billion devices for 2020. Terrestrial or satellite communications systems are already deployed to answer the connectivity need. These systems rely on a Random Access CHannel (RACH) used either to send resource allocation requests or directly the useful message. Because of the number of IoT devices, the overload on the RACH is an emerging issue since it may cause a service outage. This is especially the case for IoT satellite systems because of the wide area covered by a single satellite. The Access Class Barring (ACB) is the load control mechanism used within the Narrow Band IoT. Unfortunately, no method was specified to compute the load control parameters. In this paper, in the context of a satellite IoT system, we propose a method to compute dynamically ACB based load control parameters. Thanks to our method, the load control mechanism reach excellent results regarding transmission reliability and energy consumption for various traffic scenarios

Massive Grant-Free Access with Massive MIMO and Spatially Coupled Replicas

Massive multiple access schemes, capable of serving a large number of uncoordinated devices while fulfilling reliability and latency constraints, are proposed. The schemes belong to the class of grant-free coded random access protocols and are tailored to massive multiple input multiple output (MIMO) base station processing. High reliability is obtained owing to an intra-frame spatial coupling effect, triggered by a simple device access protocol combined with acknowledgements (ACKs) from the base station. To provide system design guidelines, analytical bounds on error floor and latency are also derived. The proposed schemes are particularly interesting to address the challenges of massive machine-type communications in the framework of next generation massive multiple access systems

High Performance Signal Processing-Based Collision Resolution for Random Access Schemes

Els darrers anys han experimentat un augment de la demanda de serveis interactius per satèl·lit per al gran consum, cobrint serveis fixes i mòbils, tal i com accés de banda ampla, comunicacions màquina-màquina (M2M), supervisió, control i adquisició de dades (SCADA), transaccions i aplicacions de seguretat crítiques. Aquestes xarxes de comunicacions es caracteritzen per tenir una gran població d’usuaris compartint l’amplada de banda amb unes condicions de tràfic molt dinàmiques. Concretament, en el canal de retorn (de l’usuari a la xarxa) de xarxes d’accés de banda ampla, els usuaris residencials generen grans ràfegues de tràfic amb períodes d’inactivitat freqüents. Una situació similar succeeix en xarxes de comunicacions mòbils per satèl·lit, on una gran població de terminals generen transmissions infreqüents de senyalització, serveis basats en la localització or altres aplicacions de missatgeria. Aquests serveis requereixen el desenvolupament de protocols d’accés múltiple eficients que puguin operar en les condicions descrites anteriorment. Els protocols d´accés aleatori són bons candidats per servir tràfic poc predictiu, amb transmissions infreqüents així com sensibles amb el retard. A més, els protocols d´accés aleatori suporten un gran nombre de terminals compartint el canal de comunicacions i requereixen poca complexitat en el terminals. El protocols d´accés aleatori han estat àmpliament estudiats i desplegats en xarxes terrestres, però les seves prestacions són pobres en el entorn satèl·lital, que està caracteritzat per retards de propagació molt grans. Avui en dia, el seu ús en les xarxes de comunicacions per satèl·lit està principalment limitat a la senyalització d’inici de sessió, transmissió de paquets de control i en alguns casos a la transmissió de petits volums de dades amb unes eficiència d’utilització del canal molt baixa. Aquesta tesi proposa tres noves tècniques d’accés aleatori, bens adaptades per proveir els serveis esmentats anteriorment en un entorn satèl·lital, amb altes prestacions i una complexitat en el terminal d’usuari reduïda. Les noves tècniques d’accés aleatori són Contention Resolution Diversity Slotted Aloha (CRDSA), Asynchronous Contention Resolution Diversity Aloha (ACRDA) i Enhanced Spread Spectrum Aloha (E-SSA), adaptades per un tipus d’accés ranurat, asíncron i d’espectre eixamplat respectivament. Les tres tècniques utilitzen una codificació de canal (FEC) robusta, capaç d’operar en front de interferències elevades, que són típiques en l’accés aleatori, i d’un mecanisme de cancel·lació successiva d’interferència que s’implementa en el receptor sobre els paquets descodificats satisfactòriament. Els nous protocols obtenen un throughput normalitzat superior a 1 bit/s/Hz amb una tassa de pèrdua de paquets inferior a 10-3, el qual representa un factor de millora de 1000 respecte a protocols d’accés aleatori tradicionals com l’ALOHA ranurat. Les prestacions de les noves tècniques d’accés aleatori has estat analitzades per mitjà de simulacions, així com amb nou models analítics desenvolupats en aquesta tesi capaços de caracteritzar el tràfic, la distribució estadística de la potència dels paquets, les prestacions de la codificació de canal (FEC) i el procés de cancel·lació d’interferència successiva.Los últimos años han experimentado un crecimiento de la demanda de servicios interactivos por satélite para el gran consumo, cubriendo servicios fijos i móviles, como el acceso de banda ancha, comunicaciones máquina a máquina (M2M), supervisión, control y adquisición de datos (SCADA), transacciones i aplicaciones criticas de seguridad. Estas redes de comunicaciones se caracterizan por tener una gran población de usuarios compartiendo el ancho de banda en unas condiciones de tráfico muy dinámicas. Concretamente, en el canal de retorno (del usuario a la red) de redes de acceso de banda ancha, los usuarios residenciales generan grandes ráfagas de tráfico con periodos frecuentes de inactividad. Una situación similar ocurre en las redes de comunicaciones móviles por satélite, donde una gran población de terminales generan transmisiones infrecuentes de señalización, servicios basados en la localización u otras aplicaciones me mensajería. Estos servicios requieren el desarrollo de protocolos de acceso múltiple eficientes capaces de operar en las condiciones descritas anteriormente. Los protocolos de acceso aleatorio son buenos candidatos para servir el tráfico poco predictivo, con transmisiones infrecuentes así como sensibles al retardo. Además, los protocolos de acceso soportan un gran número de terminales compartiendo el canal de comunicaciones y requieren poca complejidad en los terminales. Los protocolos de acceso aleatorio han estado ampliamente estudiados i desplegados en las redes terrestres, pero sus prestaciones son pobres en el entorno satelital, que se caracteriza por retardos de comunicaciones muy elevados. Hoy en día, su uso en la redes de comunicaciones por satélite está principalmente limitado a la señalización de inicio de sesión, transmisión de pequeños volumenes de datos con eficiencia de utilización del canal muy baja. Esta tesis propone tres nuevas técnicas de acceso aleatorio bien adaptadas para proveer los servicios mencionados anteriormente en un entorno de comunicaciones por satélite, con altas prestaciones y una complejidad en el terminal de usuario reducida. Las nuevas técnicas de acceso aleatorio son Contention Resolution Diversity Slotted Aloha (CRDSA), Asynchronous Contention Resolution Diversity Aloha (ACRDA) y Enhanced Spread Spectrum Aloha (E-SSA), adaptadas para un tipo de acceso ranurado, asíncrono y de espectro ensanchado respectivamente. Las tres técnicas utilizan una codificación de canal (FEC) robusta, capaz de operar en condiciones de interferencia elevadas, que son típicas en el acceso aleatorio, y de un mecanismo de cancelación sucesiva de interferencias que se implementa en el receptor sobre los paquetes que han sido decodificados satisfactoriamente. Los nuevos protocolos obtienen un throughput normalizado superior a 1 bit/s/Hz con una tasa de pérdida de paquetes inferior a 10-3, lo cual representa un factor de mejora de 1000 respecto a los protocolos de acceso aleatorio tradicionales como el ALOHA ranurado. Las prestaciones de las nuevas técnicas de acceso aleatorio han sido analizadas con simulaciones así como con nuevos modelos analíticos desarrollados en esta tesis, capaces de caracterizar el tráfico, la distribución estadística de la potencia de los paquetes, las prestaciones de la codificación de canal (FEC) y el proceso de cancelación sucesiva de interferencias.Over the past years there has been a fast growing demand for low-cost interactive satellite terminals supporting both fixed and mobile services, such as consumer broadband access, machine-to-machine communications (M2M), supervisory control and data acquisition (SCADA), transaction and safety of life applications. These networks, are generally characterized by a large population of terminals sharing the available resources under very dynamic traffic conditions. In particular, in the return link (user to network) of commercial satellite broadband access networks, residential users are likely to generate a large amount of low duty cycle bursty traffic with extended inactivity periods. A similar situation occurs in satellite mobile networks whereby a large number of terminals typically generate infrequent packets for signaling transmission as well for position reporting or other messaging applications. These services call for the development of efficient multiple access protocols able to cope with the above operating conditions. Random Access (RA) techniques are by nature, good candidates for the less predictive, low duty cycle as well as time sensitive return link traffic. Besides, RA techniques are capable of supporting large population of terminals sharing the same capacity and require low terminal complexity. RA schemes have been widely studied and deployed in terrestrial networks, but do not perform well in the satellite environment, which is characterized by very long propagation delays. Today, their use in satellite networks is mainly limited to initial network login, the transmission of control packets, and in some cases, for the transmission of very small volumes of data with very low channel utilization. This thesis proposes three novel RA schemes well suited for the provision of the above-mentioned services over a satellite environment with high performance and low terminal complexity. The new RA schemes are Contention Resolution Diversity Slotted Aloha (CRDSA), Asynchronous Contention Resolution Diversity Aloha (ACRDA) and Enhanced Spread Spectrum Aloha (E-SSA), suited for slotted, unslotted and spread spectrum-based systems respectively. They all use strong Forward Error Correction (FEC) codes, able to cope with heavy co-channel interference typically present in RA, and successive interference cancellation implemented over the successfully decoded packets. The new schemes achieve a normalized throughput above 1 bit/s/Hz for a packet loss ratio below 10-3, which represents a 1000-fold increase compared to Slotted ALOHA. The performance of the proposed RA schemes has been analyzed by means of detailed simulations as well as novel analytical frameworks that characterize traffic and packets power statistical distributions, the performance of the FEC coding as well as the iterative interference cancellation processing at the receiver

Modern Random Access for Satellite Communications

The present PhD dissertation focuses on modern random access (RA) techniques. In the first part an slot- and frame-asynchronous RA scheme adopting replicas, successive interference cancellation and combining techniques is presented and its performance analysed. The comparison of both slot-synchronous and asynchronous RA at higher layer, follows. Next, the optimization procedure, for slot-synchronous RA with irregular repetitions, is extended to the Rayleigh block fading channel. Finally, random access with multiple receivers is considered.Comment: PhD Thesis, 196 page

Analysis and Design of Communication Policies for Energy-Constrained Machine-Type Devices

This thesis focuses on the modelling, analysis and design of novel communication strategies for wireless machine-type communication (MTC) systems to realize the notion of Internet of things (IoT). We consider sensor based MTC devices which acquire physical information from the environment and transmit it to a base station (BS) while satisfying application specific quality-of-service (QoS) requirements. Due to the wireless and unattended operation, these MTC devices are mostly battery-operated and are severely energy-constrained. In addition, MTC systems require low-latency, perpetual operation, massive-access, etc. Motivated by these critical requirements, this thesis proposes optimal data communication policies for four different network scenarios. In the first two scenarios, each MTC device transmits data on a dedicated orthogonal channel and either (i) possess an initially fully charged battery of finite capacity, or (ii) possess the ability to harvest energy and store it in a battery of finite capacity. In the other two scenarios, all MTC devices share a single channel and are either (iii) allocated individual non-overlapping transmission times, or (iv) randomly transmit data on predefined time slots. The proposed novel techniques and insights gained from this thesis aim to better utilize the limited energy resources of machine-type devices in order to effectively serve the future wireless networks. Firstly, we consider a sensor based MTC device communicates with a BS, and devise optimal data compression and transmission policies with an objective to prolong the device-lifetime. We formulate joint optimization problems aiming to maximize the device-lifetime whilst satisfying the delay and bit-error-rate constraints. Our results show significant improvement in device-lifetime. Importantly, the gain is most profound in the low latency regime. Secondly, we consider a sensor based MTC device that is served by a hybrid BS which wirelessly transfers power to the device and receives data transmission from the device. The MTC device employs data compression in order to reduce the energy cost of data transmission. Thus, we propose to jointly optimize the harvesting-time, compression and transmission design, to minimize the energy cost of the system under given delay constraint. The proposed scheme reduces energy consumption up to 19% when data compression is employed. Thirdly, we consider multiple MTC devices transmit data to a BS following the time division multiple access (TDMA). Conventionally, the energy-efficiency performance in TDMA is optimized through multi-user scheduling, i.e., changing the transmission time allocated to different devices. In such a system, the sequence of devices for transmission, i.e., who transmits first and who transmits second, etc., does not have any impact on the energy-efficiency. We consider that data compression is performed before transmission. We jointly optimize both multi-user sequencing and scheduling along with the compression and transmission rate. Our results show that multi-user sequence optimization achieves up to 45% improvement in the energy-efficiency at MTC devices. Lastly, we consider contention resolution diversity slotted ALOHA (CRDSA) with transmit power diversity where each packet copy from a device is transmitted at a randomly selected power level. It results in inter-slot received power diversity, which is exploited by employing a signal-to-interference-plus-noise ratio based successive interference cancellation (SIC) receiver. We propose a message passing algorithm to model the SIC decoding and formulate an optimization problem to determine the optimal transmit power distribution subject to energy constraints. We show that the proposed strategy provides up to 88% system load performance improvement for massive-MTC systems

Multi-Power Irregular Repetition Slotted ALOHA in Heterogeneous IoT networks

International audienceIrregular Repetition Slotted Aloha (IRSA) is one candidate member of a family of random access protocols to provide solutions for massive parallel connections in the Internet of Things (IoT) networks. The key features of this protocol are repeating the transmitted packets several times and using Successive Interference Cancellation (SIC) at the decoder to resolve the collisions, which dramatically increases the performance of Slotted ALOHA. Motivated by multiple previous studies of IRSA performance in different settings, we focus on the scenario of an IoT network where the packets of different nodes are received with different powers at the base station, either per design due to different transmission power, or induced by the fact that the nodes are at different distances from the base station. In such a scenario, the capture effect emerges at the receiver, which in turn enhances the protocol performance. We analyze the protocol behavior using a new density evolution which is based on dividing nodes into classes with different powers. By computing the probability to decode a packet in the presence of the interference, we explore the achievable throughput and its associated gain and show the excellent performance of Multi-Power IRSA

Application of network coding in satellite broadcast and multiple access channels

Satellite broadcasting and relaying capabilities enable mobile broadcast systems over wide geographical areas, which opens large market possibilities for handheld, vehicular and fixed user terminals. The geostationary (GEO) satellite orbit is highly suited for such applications, as it spares the need for satellite terminals to track the movement of the spacecraft, with important savings in terms of complexity and cost. The large radius of the GEO orbit (more than 40000 km) has two main drawbacks. One is the large free space loss experienced by a signal traveling to or from the satellite, which limits the signal-to-noise ratio (SNR) margins in the link budget with respect to terrestrial systems. The second drawback of the GEO orbit is the large propagation delay (about 250 msec) that limits the use of feedback in both the forward (satellite to satellite terminal) and the reverse (satellite terminal to satellite) link. The limited margin protection causes loss of service availability in environments where there is no direct line of sight to the satellite, such as urban areas. The large propagation delay on its turn, together with the large terminal population size usually served by a GEO satellite, limit the use of feedback, which is at the basis of error-control. In the reverse link, especially in the case of fixed terminals, packet losses are mainly due to collisions, that severely limit the access to satellite services in case a random access scheme is adopted. The need for improvements and further understanding of these setups lead to the development of our work. In this dissertation we study the application of network coding to counteract the above mentioned channel impairments in satellite systems. The idea of using network coding stems from the fact that it allows to efficiently exploit the diversity, either temporal or spatial, present in the system. In the following we outline the original contributions included in each of the chapters of the dissertation. Chapter 3. This chapter deals with channel impairments in the forward link, and specifically with the problem of missing coverage in Urban environments for land mobile satellite (LMS) networks. By applying the Max-flow Min-cut theorem we derive a lower bound on the maximum coverage that can be achieved through cooperation. Inspired by this result, we propose a practical scheme, keeping in mind the compatibility with the DVB-SH standard. We developed a simulator in Matlab/C++ based on the physical layer abstraction and used it to test the performance gain of our scheme with a benchmark relaying scheme that does allow coding at packet level. Chapter 4. The second chapter of contributions is devoted to the information theoretical study of real-time streaming transmissions over fading channels with channel state information at the transmitter only. We introduce this new channel model and propose several transmission schemes, one of which is proved to be asymptotically optimal in terms of throughput. We also provide an upper bound on the achievable throughput for the proposed channel model and compare it numerically with the proposed schemes over a Rayleigh fading channel. Chapter 5. Chapter 5 is devoted to the study of throughput and delay in non-real-time streaming transmission over block fading channels. We derive bounds on the throughput and the delay for this channel and propose different coding techniques based on time-sharing. For each of them we carry out an analytical study of the performance. Finally, we compare numerically the performance of the proposed schemes over a Rayleigh fading channel. Chapter 6. In the last technical chapter we propose a collision resolution method for the return link based on physical layer network coding over extended Galois field (EGF). The proposed scheme extracts information from the colliding signals and achieves important gains with respect to Slotted ALOHA systems as well as with respect to other collision resolution schemes.Una de les característiques mes importants de les plataformes de comunicacions per satèl.lit és la seva capacitat de retransmetre senyals rebuts a un gran número de terminals. Això es fonamental en contextes com la difusió a terminals mòbils o la comunicació entre màquines. Al mateix temps, la disponibilitat d’un canal de retorn permet la creació de sistemes de comunicacions per satèl.lit interactius que, en principi, poden arribar a qualsevol punt del planeta. Els satèl.lits Geoestacionaris son particularment adequats per a complir amb aquesta tasca. Aquest tipus de satèl.lits manté una posició fixa respecte a la Terra, estalviant als terminals terrestres la necessitat de seguir el seu moviment en el cel. Per altra banda, la gran distància que separa la Terra dels satèl.lits Geoestacionaris introdueix grans retrassos en les comunicacions que, afegit al gran número de terminals en servei, limita l’ús de tècniques de retransmissió basades en acknowledgments en cas de pèrdua de paquets. Per tal de sol.lucionar el problema de la pèrdua de paquets, les tècniques més utilitzades son el desplegament de repetidors terrestres, anomenats gap fillers, l’ús de codis de protecció a nivell de paquet i mecanismes proactius de resolució de col.lisions en el canal de retorn. En aquesta tesi s’analitzen i s’estudien sol.lucions a problemes en la comunicació per satèl.lit tant en el canal de baixada com el de pujada. En concret, es consideren tres escenaris diferents. El primer escenari es la transmissió a grans poblacions de terminals mòbils en enorns urbans, que es veuen particularment afectats per la pèrdua de paquets degut a l’obstrucció, per part dels edificis, de la línia de visió amb el satèl.lit. La sol.lució que considerem consisteix en la utilització de la cooperació entre terminals. Una vegada obtinguda una mesura del guany que es pot assolir mitjançant cooperació en un model bàsic de xarxa, a través del teorema Max-flow Min-cut, proposem un esquema de cooperació compatible amb estàndards de comunicació existents. El segon escenari que considerem es la transmissió de vídeo, un tipus de tràfic particularment sensible a la pèrdua de paquets i retards endògens als sistemes de comunicació per satèl.lit. Considerem els casos de transmissió en temps real i en diferit, des de la perspectiva de teoria de la informació, i estudiem diferents tècniques de codificació analítica i numèrica. Un dels resultats principals obtinguts es l’extensió del límit assolible de la capacitat ergòdica del canal en cas que el transmissor rebi les dades de manera gradual, enlloc de rebre-les totes a l’inici de la transmissió. El tercer escenari que considerem es l’accés aleatori al satèl.lit. Desenvolupem un esquema de recuperació dels paquets perduts basat en la codificació de xarxa a nivell físic i en extensions a camps de Galois, amb resultats molt prometedors en termes de rendiment. També estudiem aspectes relacionats amb la implementació pràctica d’aquest esquema

Study of coded ALOHA with multi-user detection under heavy-tailed and correlated arrivals

In this paper, we study via simulation the performance of irregular repetition slotted ALOHA under multi-packet detection and different patterns of the load process. On the one hand, we model the arrival process with a version of the M/G/∞ process able to exhibit a correlation structure decaying slowly in time. Given the independence among frames in frame-synchronous coded-slotted ALOHA (CSA), this variation should only take effect on frame-asynchronous CSA. On the other hand, we vary the marginal distribution of the arrival process using discrete versions of the Lognormal and Pareto distributions, with the objective of investigating the influence of the right tail. In this case, both techniques should be affected by the change, albeit to a different degree. Our results confirm these hypotheses and show that these factors must be taken into account when designing and analyzing these systems. In frameless operations, both the shape of the packet arrivals tail distribution and the existence of short-range and long-range correlations strongly impact the packet loss ratio and the average delay. Nevertheless, these effects emerge only weakly in the case of frame-aligned operations, because this enforces the system to introduce a delay in the newly arrived packets (until the beginning of the next frame), and implies that the backlog of accumulated packets is the key quantity for calculating the performance.Ministerio de Ciencia e Innovación | Ref. PID2020-113240RB-I00Ministerio de Ciencia e Innovación | Ref. PID2020-113795RB-C3

Nanosatellite-5G Integration in the Millimeter Wave Domain: A Full Top-Down Approach

This paper presents a novel network architecture for an integrated nanosatellite (nSAT)-5G system operating in the millimeter-wave (mmWave) domain. The architecture is realized adopting a delay/disruption tolerant networking (DTN) approach allowing end users to adopt standard devices. A buffer aware contact graph routing algorithm is designed to account for the buffer occupancy of the nSATs and for the connection planning derived from their visibility periods. At the terrestrial uplink, a coded random access is employed to realize a high-capacity interface for the typically irregular traffic of 5G users, while, at the space uplink, the DTN architecture is combined with the contention resolution diversity slotted Aloha protocol to match the recent update of the DVB-RCS2 standard. To achieve a reliable testing of the introduced functionalities, an accurate analysis of the statistic of the signal to interference-plus-noise ratio and of the capture probability at each mmWave link is developed by including interference, shadowing, fading, and noise. The application of the designed architecture to data transfer services in conjunction with possible delay reduction strategies, and an extension to inter-satellite communication, are finally presented by estimating the resulting loss/delay performance through a discrete-time discrete-event platform based on the integration of Matlab with Network Simulator 3