126 research outputs found

    Goodbye, ALOHA!

    Get PDF
    ©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft

    Towards zero-power wireless machine-to-machine networks

    Get PDF
    This thesis aims at contributing to overcome two of the main challenges for the deployment of M2M networks in data collection scenarios for the Internet of Things: the management of massive numbers of end-devices that attempt to get access to the channel; and the need to extend the network lifetime. In order to solve these challenges, two complementary strategies are considered. Firstly, the thesis focuses on the design, analysis and performance evaluation of MAC protocols that can handle abrupt transitions in the traffic load and minimize the energy consumption devoted to communications. And secondly, the use of energy harvesting (EH) is considered in order to provide the network with unlimited lifetime. To this end, the second part of the thesis focuses on the design and analysis of EH-aware MAC protocols. While the Frame Slotted-ALOHA (FSA) protocol has been traditionally adopted in star topology networks for data collection, results show that FSA-based protocols lack of scalability and present synchronization problems as the network density increases. Indeed, the frame length of FSA must be adjusted to the number of contenders, which may be complex to attain in dense networks with large and dynamic number of end-devices. In order to overcome these issues, a tree splitting-based random access protocol, referred to as Low Power Contention Tree-based Access (LP-CTA), is proposed in the first part of this thesis. In LP-CTA, the frame length can be very short and fixed, which facilitates synchronization and provides better network scalability than FSA. While LP-CTA uses data slots for contention, it is possible to use short access requests in minislots, where collisions are resolved using tree splitting, and avoid the contention in data. Since these minislots can be much shorter than the duration of a data packet, the performance can be improved. The Low Power Distributed Queuing (LP-DQ) protocol proposed in this thesis is based on this idea. LP-DQ combines tree splitting with the logic of two distributed queues that manage the contention resolution and the collision-free data transmission. Results show that LP-DQ outperforms LP-CTA and FSA in terms of delay and energy efficiency, and it relaxes the need to know the size of the network and adapts smoothly to any change in the number of end-devices. The approach of LP-DQ is convenient when the messages transmitted by each end-device fit in one single slot, however, if the end-devices generate long messages that have to be fragmented, it is better to add a reservation mechanism in order to boost the performance. In this sense, the LPR-DQ protocol is proposed as an extension of LP-DQ where the concept of reservation is integrated to allow the end-devices reserve as many collision-free slots as needed. The second part of the thesis is devoted to the integration of the MAC layer with the use of energy harvesting. The variability and fluctuations of the harvested energy is considered for the design of EH-aware MAC protocols and three performance metrics are proposed: the probability of delivery, the data delivery ratio and the time efficiency. Previous works on data collection networks with EH focus on DFSA. In this thesis, the EH-CTA protocol is proposed as an adaptation of LP-CTA that takes the energy harvesting process into account. Results show that EH-CTA outperforms DFSA if the energy threshold for an end-device to become active is properly configured. In addition, while DFSA needs to adapt the frame length dynamically, EH-CTA uses a fixed frame length, thus facilitating scalability and synchronization. Finally, the EH-RDFSA and EH-DQ protocols are proposed for scenarios where data must be fragmented. EH-RDFSA is a combination of RFSA and DFSA, and EH-DQ is an extension of LPR-DQ.Esta tesis contribuye a resolver dos de los retos para el despliegue de redes M2M en escenarios de recolección de datos para el Internet de las Cosas: la gestión del acceso al canal de un número masivo de dispositivos; y la necesidad de extender la vida de la red. Para resolverlos se consideran dos estrategias complementarias. En primer lugar, se centra en el diseño, el análisis y la evaluación de protocolos MAC que pueden manejar transiciones abruptas de tráfico y reducen el consumo de energía. Y en segundo lugar, se considera el uso de mecanismos de captura de energía (Energy Harvesters, EH) para ofrecer un tiempo de vida ilimitado de la red. Con este fin, la segunda parte de la tesis se centra en el diseño y el análisis de protocolos MAC de tipo "EH-aware". Mientras que Frame Slotted-ALOHA (FSA) ha sido tradicionalmente adoptado en aplicaciones de recolección de datos, los resultados muestran que FSA presenta problemas de escalabilidad y sincronización cuando aumenta la densidad de la red. De hecho, la longitud de trama de FSA se debe ajustar según sea el número de dispositivos, lo cual puede ser difícil de estimar en redes con un número elevado y dinámico de dispositivos. Para superar estos problemas, en esta tesis se propone un protocolo de acceso aleatorio basado en "tree-splitting" denominado Low Power Contention Tree-based Access (LP-CTA). En LP-CTA, la longitud de trama puede ser corta y constante, lo cual facilita la sincronización y proporciona mejor escalabilidad. Mientras que LP-CTA utiliza paquetes de datos para la contienda, es posible utilizar solicitudes de acceso en mini-slots, donde las colisiones se resuelven utilizando "tree-splitting", y evitar la contención en los datos. Dado que estos mini-slots pueden ser mucho más cortos que la duración de un slot de datos, el rendimiento de LP-CTA puede ser mejorado. El protocolo Low Power Distributed Queuing (LP-DQ) propuesto en esta tesis se basa en esta idea. LP-DQ combina "tree-splitting" con la lógica de dos colas distribuidas que gestionan la resolución de la contienda en la solicitud de acceso y la transmisión de datos libre de colisiones. Los resultados demuestran que LP-DQ mejora LP-CTA y FSA en términos de retardo y eficiencia energética, LP-DQ no requiere conocer el tamaño de la red y se adapta sin problemas a cualquier cambio en el número de dispositivos. LP-DQ es conveniente cuando los mensajes transmitidos por cada dispositivo caben en un único slot de datos, sin embargo, si los dispositivos generan mensajes largos que requieren fragmentación, es mejor añadir un mecanismo de reserva para aumentar el rendimiento. En este sentido, el protocolo LPR-DQ se propone como una extensión de LP-DQ que incluye un mecanismo de reserva para permitir que cada dispositivo reserve el número de slots de datos según sea el número de fragmentos por mensaje. La segunda parte de la tesis está dedicada a la integración de la capa MAC con el uso de "Energy Harvesters". La variabilidad y las fluctuaciones de la energía capturada se consideran para el diseño de protocolos MAC de tipo "EH-aware" y se proponen tres métricas de rendimiento: la probabilidad de entrega, el "Data Delivery Ratio" y la eficiencia temporal. Los trabajos previos en redes de recolección de datos con EH se centran principalmente en DFSA. En esta tesis, el protocolo EH-CTA se propone como una adaptación de LP-CTA que tiene en cuenta el proceso de captura de energía. Los resultados muestran que EH-CTA supera DFSA si el umbral de energía para que un dispositivo se active está configurado correctamente. Además, mientras que en DFSA se necesita adaptar la longitud de trama de forma dinámica, EH-CTA utiliza una longitud de trama fija, facilitando así la escalabilidad y la sincronización. Por último, se proponen los protocolos EH-RDFSA y EH-DQ para escenarios en los que los datos deben ser fragmentados. EH-RDFSA es una combinación de RFSA y DFSA, y EH-DQ es una extensión de LPR-DQ.Aquesta tesi contribueix a resoldre dos dels reptes per al desplegament de xarxes M2M en escenaris de recol·lecció de dades per a l'Internet de les Coses: la gestió de l'accés al canal d'un nombre massiu de dispositius; i la necessitat d'extendre la vida de la xarxa. Per resoldre'ls es consideren dues estratègies complementàries. En primer lloc, es centra en el disseny, l'anàlisi i l'avaluació de protocols MAC que poden manegar transicions abruptes de trànsit i redueixen el consum d'energia. I en segon lloc, es considera l'ús de mecanismes de captura d'energia (Energy Harvesters, EH) per a oferir un temps de vida il·limitat de la xarxa. Amb aquesta finalitat, la segona part de la tesi es centra en el disseny i l'anàlisi de protocols MAC de tipus "EH-aware".Mentre que Frame Slotted-ALOHA (FSA) ha estat tradicionalment adoptat en aplicacions de recol·lecció de dades, els resultats mostren que FSA presenta problemes d'escalabilitat i sincronització quan augmenta la densitat de la xarxa. De fet, la longitud de trama de FSA s'ha d'ajustar segons sigui el nombre de dispositius, la qual cosa pot ser difícil d'estimar en xarxes amb un nombre elevat i dinàmic de dispositius. Per superar aquests problemes, en aquesta tesi es proposa un protocol d'accés aleatori basat en "tree-splitting" denominat Low Power Contention Tree-based Access (LP-CTA). En LP-CTA, la longitud de trama pot ser curta i constant, la qual cosa facilita la sincronització i proporciona millor escalabilitat.Mentre que LP-CTA utilitza paquets de dades per a la contenció, és possible utilitzar sol·licituds d'accés a mini-slots, on les col·lisions es resolen utilitzant "tree-splitting", i evitar la contenció a les dades. Atès que aquests mini-slots poden ser molt més curts que la durada d'un slot de dades, el rendiment de LP-CTA pot ser millorat. El protocol Low Power Distributed Queuing (LP-DQ) proposat en aquesta tesi es basa en aquesta idea. LP-DQ combina "tree-splitting" amb la lògica de dues cues distribuïdes que gestionen la resolució de la contenció en la sol·licitud d'accés i la transmissió de dades lliure de col·lisions. Els resultats demostren que LP-DQ millora LP-CTA i FSA en termes de retard i eficiència energètica, LP-DQ no requereix conèixer la mida de la xarxa i s'adapta sense problemes a qualsevol canvi en el nombre de dispositius.LP-DQ és convenient quan els missatges transmesos per cada dispositiu caben en un únic slot de dades, però, si els dispositius generen missatges llargs que requereixen fragmentació, és millor afegir un mecanisme de reserva per augmentar el rendiment. En aquest sentit, el protocol LPR-DQ es proposa com una extensió de LP-DQ que inclou un mecanisme de reserva per a permetre que cada dispositiu reservi el nombre de slots de dades segons sigui el nombre de fragments per missatge.La segona part de la tesi està dedicada a la integració de la capa MAC amb l'ús de "Energy Harvesters". La variabilitat i les fluctuacions de l'energia capturada es consideren per al disseny de protocols MAC de tipus "EH-aware" i es proposen tres mètriques de rendiment: la probabilitat d'entrega, el "Data Delivery Ratio" i l'eficiència temporal.Els treballs previs en xarxes de recol·lecció de dades amb EH se centren principalment en DFSA. En aquesta tesi, el protocol EH-CTA es proposa com una adaptació de LP-CTA que té en compte el procés de captura d'energia. Els resultats mostren que EH-CTA supera DFSA si el llindar d'energia perquè un dispositiu s'activi s'ajusta correctament. A més, mentre que a DFSA es necessita adaptar la longitud de trama de forma dinàmica, EH-CTA utilitza una longitud de trama fixa, facilitant així l'escalabilitat i la sincronització. Finalment, es proposen els protocols EH-RDFSA i EH-DQ per a escenaris en els quals les dades han de ser fragmentades. EH-RDFSA és una combinació de RFSA i DFSA, i EH-DQ és una extensió de LPR-DQ.Postprint (published version

    Contention tree-based access for wireless machine-to-machine networks with energy harvesting

    Get PDF
    ©2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.In this paper, we consider a wireless machine-to-machine network composed of end-devices with energy harvesters that periodically transmit data to a gateway. While energy harvesting allows for perpetual operation, the uncertain amount of harvested energy may not guarantee fully continuous operation due to temporary energy shortages. This fact needs to be addressed at the medium access control layer. We thus investigate the performance of an energy harvesting-aware contention tree-based access (EH-CTA) protocol, which uses a tree-splitting algorithm to resolve collisions and takes energy availability into account. We derive a theoretical model to compute the probability of delivery and the time efficiency. In addition, we conduct a performance comparison of EH-CTA using an EH-aware dynamic frame slotted-ALOHA (EH-DFSA) as a benchmark. We determine the parameters that maximize performance and analyze how it is influenced by the amount of harvested energy and the number of end-devices. Results reveal the superior performance of EH-CTA over EH-DFSA. While EH-DFSA requires an estimate of the number of contending end-devices per frame to adapt the frame length, EH-CTA uses short and fixed frame lengths, which enables scalability and facilitates synchronization as the network density increases.Peer ReviewedPostprint (author's final draft

    LPDQ: a self-scheduled TDMA MAC protocol for one-hop dynamic lowpower wireless networks

    Get PDF
    Current Medium Access Control (MAC) protocols for data collection scenarios with a large number of nodes that generate bursty traffic are based on Low-Power Listening (LPL) for network synchronization and Frame Slotted ALOHA (FSA) as the channel access mechanism. However, FSA has an efficiency bounded to 36.8% due to contention effects, which reduces packet throughput and increases energy consumption. In this paper, we target such scenarios by presenting Low-Power Distributed Queuing (LPDQ), a highly efficient and low-power MAC protocol. LPDQ is able to self-schedule data transmissions, acting as a FSA MAC under light traffic and seamlessly converging to a Time Division Multiple Access (TDMA) MAC under congestion. The paper presents the design principles and the implementation details of LPDQ using low-power commercial radio transceivers. Experiments demonstrate an efficiency close to 99% that is independent of the number of nodes and is fair in terms of resource allocation.Peer ReviewedPostprint (author’s final draft

    Performance evaluation of framed slotted ALOHA with reservation packets and succesive interference cancelation for M2M networks

    Full text link
    [EN] Random access protocols like ALOHA have been considered for machine-to-machine (M2M) communication in future networks for their simplicity of operation. This paper evaluates the performance of a Frame Slotted-ALOHA protocol that uses reservation and data packets (FSA-RDP), in a scenario where a controller collects data packets transmitted by a finite number of M2M devices. In FSA-RDP, frames of variable duration are divided in two parts, the reservation and data subframes. During the reservation subframe, active devices send short reservation packets to the controller. The controller assigns reserved slots in the data subframe to those devices that succeeded with the reservation. At devices, the FIFO service discipline and two queue management schemes, tail drop and push-out, have been considered. When the queue size is of one packet, we develop a discrete-time Markov chain to evaluate the protocol performance, including the cumulative distribution function of the delay of data packets that are successfully transmitted. Analytical results are validated by extensive simulations. The simulation model is also used to evaluate the system performance when larger queues are used. In addition, we study the impact that implementing Successive Interference Cancellation (SIC) at the controller has on the system performance. We also evaluate the performance of implementing SIC at the controller together with Irregular Repetition Slotted ALOHA (IRSA) to send the reservation packets. Numerical results show that the protocol efficiency of FSA-RDP is between one and two orders of magnitude larger than the efficiency of conventional Frame Slotted ALOHA, when a perfect channel is assumed. In more realistic channel environments, the use of SIC brings an important performance boost.This work has been supported by the Ministry of Economy and Competitiveness of Spain through projects TIN2013-47272-C2-1-R and TEC2015-71932-REDT. The authors would like to thank the support received from the Institute ITACA (Instituto Universitario de Tecnologias de la Informacion y Comunicaciones) at the Universitat Politecnica de Valencia, Spain. C. Portillo acknowledges the funding received from the European Union under the program Erasmus Mundus Partnerships, project EuroinkaNet, GRANT AGREEMENT NUMBER -2014 -0870/001/001, and the support received from SEP-SES (DSA/103.5/15/6629).Casares-Giner, V.; Martínez Bauset, J.; Portillo, C. (2019). Performance evaluation of framed slotted ALOHA with reservation packets and succesive interference cancelation for M2M networks. Computer Networks. 155:15-30. https://doi.org/10.1016/j.comnet.2019.02.021S153015

    Modeling and analysis of reservation frame slotted-ALOHA in wireless machine-to-machine area networks for data collection

    Get PDF
    Reservation frame slotted-ALOHA (RFSA) was proposed in the past to manage the access to the wireless channel when devices generate long messages fragmented into small packets. In this paper, we consider an M2M area network composed of end-devices that periodically respond to the requests from a gateway with the transmission of fragmented messages. The idle network is suddenly set into saturation, having all end-devices attempting to get access to the channel simultaneously. This has been referred to as delta traffic. While previous works analyze the throughput of RFSA in steady-state conditions, assuming that traffic is generated following random distributions, the performance of RFSA under delta traffic has never received attention. In this paper, we propose a theoretical model to calculate the average delay and energy consumption required to resolve the contention under delta traffic using RFSA.We have carried out computer-based simulations to validate the accuracy of the theoretical model and to compare the performance for RFSA and FSA. Results show that there is an optimal frame length that minimizes delay and energy consumption and which depends on the number of end-devices. In addition, it is shown that RFSA reduces the energy consumed per end-device by more than 50% with respect to FSA under delta traffic.Peer ReviewedPostprint (published version

    Combining distributed queuing with energy harvesting to enable perpetual distributed data collection applications

    Get PDF
    This is the peer reviewed version of the following article: Vazquez-Gallego F, Tuset-Peiró P, Alonso L, Alonso-Zarate J. Combining distributed queuing with energy harvesting to enable perpetual distributed data collection applications. Trans Emerging Tel Tech. 2017;e3195 , which has been published in final form at https://doi.org/10.1002/ett.3195. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.This paper presents, models, and evaluates energy harvesting–aware distributed queuing (EH-DQ), a novel medium access control protocol that combines distributed queuing with energy harvesting (EH) to address data collection applications in industrial scenarios using long-range and low-power wireless communication technologies. We model the medium access control protocol operation using a Markov chain and evaluate its ability to successfully transmit data without depleting the energy stored at the end devices. In particular, we compare the performance and energy consumption of EH-DQ with that of time-division multiple access (TDMA), which provides an upper limit in data delivery, and EH-aware reservation dynamic frame slotted ALOHA, which is an improved variation of frame slotted ALOHA. To evaluate the performance of these protocols, we use 2 performance metrics: delivery ratio and time efficiency. Delivery ratio measures the ability to successfully transmit data without depleting the energy reserves, whereas time efficiency measures the amount of data that can be transmitted in a certain amount of time. Results show that EH-DQ and TDMA perform close to the optimum in data delivery and outperform EH-aware reservation dynamic frame slotted ALOHA in data delivery and time efficiency. Compared to TDMA, the time efficiency of EH-DQ is insensitive to the amount of harvested energy, making it more suitable for energy-constrained applications. Moreover, compared to TDMA, EH-DQ does not require updated network information to maintain a collision-free schedule, making it suitable for very dynamic networks.Peer ReviewedPostprint (author's final draft

    Contributions to the development of active RFID systems at the 433 MHz band

    Get PDF
    Donat el potencial de la tecnologia RFID activa, aquesta tesi contribueix al seu desenvolupament centrant-se en les capes més baixes de la pila de protocols, és a dir, la capa física i la capa d'enllaç de dades. Aquestes capes determinen l'abast de la comunicació entre l'interrogador i les etiquetes, el nombre d'etiquetes que un interrogador pot llegir per segon i el consum d'energia que utilitzen les etiquetes en el procés, que en són els paràmetres de rendiment clau. A la capa física la tesi avalua els aspectes de propagació de la banda 433 MHz en diferents entorns i els compara amb la banda 2.4 GHz. Els resultats demostren que, per a la mateixa potència de transmissió, els sistemes RFID actius que funcionen a la banda 433 MHz aconsegueixen un millor abast de comunicació gràcies a unes millors característiques de propagació. A la capa d'enllaç de dades la tesi proposa LPDQ (Low-Power Distributed Queuing), un nou protocol d'accés al medi, i el compara amb FSA (Frame Slotted ALOHA). LPDQ combina LPL (Low-Power Listening) per a la sincronització de xarxa i DQ (Distributed Queuing) per a la transmissió de dades. En comparació amb el cas òptim de FSA, LPDQ aconsegueix un rendiment proper al màxim teòric (99.5%) independentment del nombre d'etiquetes i redueix el consum d'energia de les etiquetes en més d'un 10%.Dado el potencial de la tecnología RFID activa, esta tesis contribuye a su desarrollo centrándose en las capas más bajas de la pila de protocolos, es decir, la capa física y la capa de enlace de datos. Estas capas determinan el alcance de la comunicación entre el interrogador y las etiquetas, el número de etiquetas que un interrogador puede leer por segundo y el consumo de energía que utilizan las etiquetas en el proceso, que son los parámetros de rendimiento clave. En la capa física la tesis evalúa los aspectos de propagación de la banda 433 MHz en diferentes entornos y los compara con la banda 2.4 GHz. Los resultados demuestran que, para la misma potencia de transmisión, los sistemas RFID activos que funcionan en la banda 433 MHz consiguen un mejor alcance de comunicación gracias a unas mejores características de propagación. En la capa de enlace de datos la tesis propone LPDQ (Low-Power Distributed Queuing), un nuevo protocolo de acceso al medio, y lo compara con FSA (Frame Slotted ALOHA). LPDQ combina LPL (Low-Power Listening) para la sincronización de red y DQ (Distributed Queuing) para la transmisión de datos. En comparación con el caso óptimo de FSA, LPDQ consigue un rendimiento cercano al máximo teórico (99.5%) independientemente del número de etiquetas y reduce el consumo de energía de las etiquetas en más de un 10%.Given the potential of active RFID technology, this thesis contributes to its development by focusing on the lowest layers of the stack, that is, the physical and data-link layers. These layers determine the tag communication range, packet throughput and energy consumption, which are key performance parameters. At the physical layer, the thesis studies propagation aspects of the 433 MHz band in different environments and compares it to the 2.4 GHz band, which is also used in active RFID systems. The results demonstrate that active RFID systems operating at the 433 MHz band can achieve a better communication range at the same transmit power due to better propagation characteristics. At the data-link layer, the thesis proposes LPDQ (Low-Power Distributed Queuing), a new MAC (media access control) protocol, and compares it to FSA (Frame Slotted ALOHA). LPDQ combines LPL (Low-Power Listening) for network synchronization and DQ (Distributed Queuing) for data transmission. Compared to the optimal FSA case, LPDQ can achieve a performance close to the theoretical maximum (99.5%), regardless of the number of tags, and reduces tag energy consumption by more than 10%

    Delay and energy consumption analysis of frame slotted ALOHA variants for massive data collection in internet-of-things scenarios

    Get PDF
    This paper models and evaluates three FSA-based (Frame Slotted ALOHA) MAC (Medium Access Control) protocols, namely, FSA-ACK (FSA with ACKnowledgements), FSA-FBP (FSA with FeedBack Packets) and DFSA (Dynamic FSA). The protocols are modeled using an AMC (Absorbing Markov Chain), which allows to derive analytic expressions for the average packet delay, as well as the energy consumption of both the network coordinator and the end-devices. The results, based on computer simulations, show that the analytic model is accurate and outline the benefits of DFSA. In terms of delay, DFSA provides a reduction of 17% (FSA-FBP) and 32% (FSA-ACK), whereas in terms of energy consumption DFSA provides savings of 23% (FSA-FBP) and 28% (FSA-ACK) for the coordinator and savings of 50% (FSA-FBP) and 24% (FSA-ACK) for end-devices. Finally, the paper provides insights on how to configure each FSA variant depending on the network parameters, i.e., depending on the number of end-devices, to minimize delay and energy expenditure. This is specially interesting for massive data collection in IoT (Internet-of-Things) scenarios, which typically rely on FSA-based protocols and where the operation has to be optimized to support a large number of devices with stringent energy consumption requirementsPeer ReviewedPostprint (published version

    Multiple Access for Massive Machine Type Communications

    Get PDF
    The internet we have known thus far has been an internet of people, as it has connected people with one another. However, these connections are forecasted to occupy only a minuscule of future communications. The internet of tomorrow is indeed: the internet of things. The Internet of Things (IoT) promises to improve all aspects of life by connecting everything to everything. An enormous amount of effort is being exerted to turn these visions into a reality. Sensors and actuators will communicate and operate in an automated fashion with no or minimal human intervention. In the current literature, these sensors and actuators are referred to as machines, and the communication amongst these machines is referred to as Machine to Machine (M2M) communication or Machine-Type Communication (MTC). As IoT requires a seamless mode of communication that is available anywhere and anytime, wireless communications will be one of the key enabling technologies for IoT. In existing wireless cellular networks, users with data to transmit first need to request channel access. All access requests are processed by a central unit that in return either grants or denies the access request. Once granted access, users' data transmissions are non-overlapping and interference free. However, as the number of IoT devices is forecasted to be in the order of hundreds of millions, if not billions, in the near future, the access channels of existing cellular networks are predicted to suffer from severe congestion and, thus, incur unpredictable latencies in the system. On the other hand, in random access, users with data to transmit will access the channel in an uncoordinated and probabilistic fashion, thus, requiring little or no signalling overhead. However, this reduction in overhead is at the expense of reliability and efficiency due to the interference caused by contending users. In most existing random access schemes, packets are lost when they experience interference from other packets transmitted over the same resources. Moreover, most existing random access schemes are best-effort schemes with almost no Quality of Service (QoS) guarantees. In this thesis, we investigate the performance of different random access schemes in different settings to resolve the problem of the massive access of IoT devices with diverse QoS guarantees. First, we take a step towards re-designing existing random access protocols such that they are more practical and more efficient. For many years, researchers have adopted the collision channel model in random access schemes: a collision is the event of two or more users transmitting over the same time-frequency resources. In the event of a collision, all the involved data is lost, and users need to retransmit their information. However, in practice, data can be recovered even in the presence of interference provided that the power of the signal is sufficiently larger than the power of the noise and the power of the interference. Based on this, we re-define the event of collision as the event of the interference power exceeding a pre-determined threshold. We propose a new analytical framework to compute the probability of packet recovery failure inspired by error control codes on graph. We optimize the random access parameters based on evolution strategies. Our results show a significant improvement in performance in terms of reliability and efficiency. Next, we focus on supporting the heterogeneous IoT applications and accommodating their diverse latency and reliability requirements in a unified access scheme. We propose a multi-stage approach where each group of applications transmits in different stages with different probabilities. We propose a new analytical framework to compute the probability of packet recovery failure for each group in each stage. We also optimize the random access parameters using evolution strategies. Our results show that our proposed scheme can outperform coordinated access schemes of existing cellular networks when the number of users is very large. Finally, we investigate random non-orthogonal multiple access schemes that are known to achieve a higher spectrum efficiency and are known to support higher loads. In our proposed scheme, user detection and channel estimation are carried out via pilot sequences that are transmitted simultaneously with the user's data. Here, a collision event is defined as the event of two or more users selecting the same pilot sequence. All collisions are regarded as interference to the remaining users. We first study the distribution of the interference power and derive its expression. Then, we use this expression to derive simple yet accurate analytical bounds on the throughput and outage probability of the proposed scheme. We consider both joint decoding as well as successive interference cancellation. We show that the proposed scheme is especially useful in the case of short packet transmission
    • …
    corecore