Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access

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 without feedback. Moreover, a capacity bound is developed and component code distributions tightly approaching the bound are derived.Comment: The final version to appear in IEEE Trans. Inf. Theory. 18 pages, 10 figure

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

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

[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

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

Energy-efficient diversity combining for different access schemes in a multi-path dispersive channel

Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e ComputadoresThe forthcoming generation of mobile communications, 5G, will settle a new standard for a larger bandwidth and better Quality of Service (QoS). With the exploding growth rate of user generated data, wireless standards must cope with this growth and at the same time be energy efficient to avoid depleting the batteries of wireless devices. Besides these issues, in a broadband wireless setting QoS can be severely affected from a multipath dispersive channel and therefore be energy demanding. Cross-layered architectures are a good choice to enhance the overall performance of a wireless system. Examples of cross-layered Physical (PHY) - Medium Access Control (MAC) architectures are type-II Diversity Combining (DC) Hybrid-ARQ (H-ARQ) and Multi-user Detection (MUD) schemes. Cross-layered type-II DC H-ARQ schemes reuse failed packet transmissions to enhance data reception on posterior retransmissions; MUD schemes reuse data information from previously collided packets on posterior retransmissions to enhance data reception. For a multipath dispersive channel, a PHY layer analytical model is proposed for Single-Carrier with Frequency Domain Equalization (SC-FDE) that supports DC H-ARQ and MUD. Based on this analytical model, three PHY-MAC protocols are proposed. A crosslayered Time Division Multiple Access (TDMA) scheme that uses DC H-ARQ is modeled and its performance is studied in this document; the performance analysis shows that the scheme performs better with DC and achieves a better energy efficiency at the cost of a higher delay. A novel cross-layered prefix-assisted Direct-Sequence Code Division Multiple Access (DS-CDMA) scheme is proposed and modeled in this document, it uses principles of DC and MUD. This protocol performs better by means of additional retransmissions, achieving better energy efficiency, at the cost of higher redundancy from a code spreading gain. Finally, a novel cross-layered protocol H-ARQ Network Division Multiple Access (H-NDMA) is proposed and modeled, where the combination of DC H-ARQ and MUD is used with the intent of maximizing the system capacity with a lower delay; system results show that the proposed scheme achieves better energy efficiency and a better performance at the cost of a higher number of retransmissions. A comparison of the three cross-layered protocols is made, using the PHY analytical model, under normalized conditions using the same amount of maximum redundancy. Results show that the H-NDMA protocol, in general, obtains the best results, achieving a good performance and a good energy efficiency for a high channel load and low Signal-to-Noise Ratio (SNR). TDMA with DC H-ARQ achieves the best energy efficiency, although presenting the worst delay. Prefix-assisted DS-CDMA in the other hand shows good delay results but presents the worst throughput and energy efficiency

Enhanced Collision Resolution for the IEEE 802.11 Distributed Coordination Function

The IEEE 802.11 standard relies on the Distributed Coordination Function (DCF) as the fundamental medium access control method. DCF uses the Binary Exponential Backoff (BEB) algorithm to regulate channel access. The backoff period determined by BEB depends on a contention window (CW) whose size is doubled if a station suffers a collision and reset to its minimum value after a successful transmission. BEB doubles the CW size upon collision to reduce the collision probability in retransmission. However, this CW increase reduces channel access time because stations will spend more time sensing the channel rather than accessing it. Although resetting the CW to its minimum value increases channel access, it negatively affects fairness because it favours successfully transmitting stations over stations suffering from collisions. Moreover, resetting CW leads to increasing the collision probability and therefore increases the number of collisions. % Quality control editor: Please ensure that the intended meaning has been maintained in the edits of the previous sentence. Since increasing channel access time and reducing the probability of collisions are important factors to improve the DCF performance, and they conflict with each other, improving one will have an adverse effect on the other and consequently will harm the DCF performance. We propose an algorithm, \gls{ECRA}, that solves collisions once they occur without instantly increasing the CW size. Our algorithm reduces the collision probability without affecting channel access time. We also propose an accurate analytical model that allows comparing the theoretical saturation and maximum throughputs of our algorithm with those of benchmark algorithms. Our model uses a collision probability that is dependent on the station transmission history and thus provides a precise estimation of the probability that a station transmits in a random timeslot, which results in a more accurate throughput analysis. We present extensive simulations for fixed and mobile scenarios. The results show that on average, our algorithm outperformed BEB in terms of throughput and fairness. Compared to other benchmark algorithms, our algorithm improved, on average, throughput and delay performance

大規模多元接続ネットワークのためのグラフ構造に基づくランダムアクセス方式

電気通信大学201

Wi-Fi QoS improvements for industrial automation

Digitalization caused a considerable increase in the use of industrial automation applications. Industrial automation applications use real-time traffic with strict requirements of connection of tens of devices, high-reliability, determinism, low-latency, and synchronization. The current solutions meeting these requirements are wired technologies. However, there is a need for wireless technologies for mobility,less complexity, and quick deployment. There are many studies on cellular technologies for industrial automation scenarios with strict reliability and latency requirements, but not many developments for wireless communications over unlicensed bands. Wireless Fidelity (Wi-Fi) is a commonly used and preferred technology in factory automation since it is supported by many applications and operates on a license free-band. However, there is still room for improving Wi-Fi systems performance for low-latency and high-reliable communication requirements in industrial automation use cases. There are various limitations in the current Wi-Fi system restraining the deployment for time-critical operations. For meeting the strict timing requirements of low delay and jitter in industrial automation applications, Quality of Service (QoS)in Wi-Fi needs to be improved. In this thesis, a new access category in Medium Access Control (MAC) layer for industrial automation applications is proposed.The performance improvement is analyzed with simulations, and a jitter definition for a Wi-Fi system is studied. Then, a fixed Modulation and Coding (MCS) link adaptation method and bounded delay is implemented for time-critical traffic in the simulation cases to observe performance changes. Finally, it is shown that the new access category with no backoff time can decrease the delay and jitter of time-critical applications. The improvements in Wi-Fi QoS are shown in comparison with the current standard, and additional enhancements about using a fixed modulation and coding scheme and implementation of a bounded delay are also analyzed in this thesi

PERFORMANCE STUDY FOR CAPILLARY MACHINE-TO-MACHINE NETWORKS

Communication technologies witness a wide and rapid pervasiveness of wireless machine-to-machine (M2M) communications. It is emerging to apply for data transfer among devices without human intervention. Capillary M2M networks represent a candidate for providing reliable M2M connectivity. In this thesis, we propose a wireless network architecture that aims at supporting a wide range of M2M applications (either real-time or non-real-time) with an acceptable QoS level. The architecture uses capillary gateways to reduce the number of devices communicating directly with a cellular network such as LTE. Moreover, the proposed architecture reduces the traffic load on the cellular network by providing capillary gateways with dual wireless interfaces. One interface is connected to the cellular network, whereas the other is proposed to communicate to the intended destination via a WiFi-based mesh backbone for cost-effectiveness. We study the performance of our proposed architecture with the aid of the ns-2 simulator. An M2M capillary network is simulated in different scenarios by varying multiple factors that affect the system performance. The simulation results measure average packet delay and packet loss to evaluate the quality-of-service (QoS) of the proposed architecture. Our results reveal that the proposed architecture can satisfy the required level of QoS with low traffic load on the cellular network. It also outperforms a cellular-based capillary M2M network and WiFi-based capillary M2M network. This implies a low cost of operation for the service provider while meeting a high-bandwidth service level agreement. In addition, we investigate how the proposed architecture behaves with different factors like the number of capillary gateways, different application traffic rates, the number of backbone routers with different routing protocols, the number of destination servers, and the data rates provided by the LTE and Wi-Fi technologies. Furthermore, the simulation results show that the proposed architecture continues to be reliable in terms of packet delay and packet loss even under a large number of nodes and high application traffic rates

Hybrid Network for Business and Information Systems

Local Area Networks provide a way of linking together computers for the purpose of sharing resources such as information, communication, high-speed printing facilities, etc., within a small area or over a complete site. Computer networks for Information Systems are available in a number of different topologies utilizing different technologies. The main criterion for network use is that the networks are inexpensive to implement. The networks available range from dedicated networks with the main type of workstation designed for a single off ice environment (but also providing interface for the more popular personal computers), to third party networks designed to connect different networks over a large area. The purpose of this thesis is both to design and to simulate a medium accessing technique for a local network. The thesis highlights some of the other medium accessing techniques available, the topologies used in these techniques, and their advantages and disadvantages. The first chapter defines the problem and briefly proposes a solution to the problem. The second chapter puts the computer network into perspective by looking at different networks. The third and fourth chapters cover the design of the Network Architecture and the Network Manager respectively. Chapter five briefly describes the Data Architecture which was implemented at Business and Economics Research, Oklahoma State University. Results of the simulation conducted are discussed in chapter six of this thesis. Appendix-A provides the figures required in understanding the thesis. Figure (3), and Figures (4, 5 & 10) are referenced from [1] and [5] respectively. Appendix-B is a glossary of all important terms used in writing this thesis.Computing and Information Science