39 research outputs found

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

    Full text link
    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

    Prioritized Random MAC Optimization via Graph-based Analysis

    Get PDF
    Motivated by the analogy between successive interference cancellation and iterative belief-propagation on erasure channels, irregular repetition slotted ALOHA (IRSA) strategies have received a lot of attention in the design of medium access control protocols. The IRSA schemes have been mostly analyzed for theoretical scenarios for homogenous sources, where they are shown to substantially improve the system performance compared to classical slotted ALOHA protocols. In this work, we consider generic systems where sources in different importance classes compete for a common channel. We propose a new prioritized IRSA algorithm and derive the probability to correctly resolve collisions for data from each source class. We then make use of our theoretical analysis to formulate a new optimization problem for selecting the transmission strategies of heterogenous sources. We optimize both the replication probability per class and the source rate per class, in such a way that the overall system utility is maximized. We then propose a heuristic-based algorithm for the selection of the transmission strategy, which is built on intrinsic characteristics of the iterative decoding methods adopted for recovering from collisions. Experimental results validate the accuracy of the theoretical study and show the gain of well-chosen prioritized transmission strategies for transmission of data from heterogenous classes over shared wireless channels

    Modern Random Access for Satellite Communications

    Full text link
    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

    On the Stability of Contention Resolution Diversity Slotted ALOHA

    Get PDF
    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 reaching instability. The presented model is verified against simulations and numerical results are provided for comparison of the stability of CRDSA versus the stability of traditional Slotted ALOHA (SA). The presented results show that CRDSA has not only a high gain over SA in terms of throughput but also in its stability.Comment: 10 pages, 12 figures This paper is submitted to the IEEE Transactions on Communications for possible publication. The IEEE copyright notice applie

    Network coding-aided MAC protocols for cooperative wireless networks

    Get PDF
    The introduction of third generation (3G) technologies has caused a vast proliferation of wireless devices and networks, generating an increasing demand for high level Quality of Service (QoS). The wide spread of mobile applications has further reinforced the user need for communication, motivating at the same time the concepts of user cooperation and data dissemination. However, this trend towards continuous exchange of information and ubiquitous connectivity is inherently restricted by the energy-greedy functionalities of high-end devices. These limitations, along with the pressure exerted on the Information and Communications Technology (ICT) industry towards energy awareness, have induced the design of novel energy efficient schemes and algorithms. In this context, the Medium Access Control (MAC) layer plays a key role, since it is mainly responsible for the channel access regulation, the transmission scheduling and the resource allocation, thus constituting an appropriate point to effectively address energy efficiency issues that arise due to the users overcrowding. This dissertation provides a contribution to the design, analysis and evaluation of novel MAC protocols for cooperative wireless networks. In our attempt to design energy efficient MAC schemes, we were extensively assisted by the introduction of new techniques, such as Network Coding (NC), that intrinsically bring considerable gains in system performance. The main thesis contributions are divided into two parts. The first part presents NCCARQ, a novel NC-aided Cooperative Automatic Repeat reQuest (ARQ) MAC protocol for wireless networks. NCCARQ introduces a new access paradigm for cooperative ARQ schemes, exploiting NC benefits in bidirectional communication among wireless users. The NCCARQ performance in terms of QoS and energy efficiency is assessed by means of analytical probabilistic models and extensive computer-based simulations, revealing the significant gains we can achieve compared to standardized MAC solutions. In addition, the impact of realistic wireless channel conditions on the MAC protocol operation further motivated us to study the NCCARQ performance in wireless links affected by correlated shadowing, showing that the channel correlation may adversely affect the distributed cooperation benefits. The second part of the thesis is dedicated to the investigation of MAC issues in wireless data dissemination scenarios. In particular, the existence of multiple source nodes in such scenarios generates conflicting situations, considering the selfish behavior of the wireless devices that want to maximize their battery lifetime. Bearing in mind the energy efficiency importance, we propose game theoretic medium access strategies, applying energy-based utility functions which inherently imply energy awareness. In addition, Random Linear NC (RLNC) techniques are adopted to eliminate the need of exchanging excessive control packets, while Analog NC (ANC) is employed to efface the impact of collisions throughout the communication. During the elaboration of this thesis, two general key conclusions have been extracted. First, there is a fundamental requirement for implementation of new MAC protocols in order to effectively deal with state-of-the-art techniques (e.g., NC), recently introduced to enhance both the performance and the energy efficiency of the network. Second, we highlight the importance of designing novel energy efficient MAC protocols, taking into account that traditional approaches - designed mainly to assist the collision avoidance in wireless networks - tend to be obsolete.La presente tesis doctoral contribuye al diseño, análisis y evaluación de nuevos protocolos MAC cooperativos para redes inalámbricas. La introducción de nuevas técnicas, tales como la codificación de red (NC), que intrínsecamente llevan un considerable aumento en el rendimiento del sistema, nos ayudó ampliamente durante el diseño de protocolos MAC energéticamente eficientes. Las principales contribuciones de esta tesis se dividen en dos partes. La primera parte presenta el NCCARQ, un protocolo cooperativo de retransmisión automática (ARQ), asistido por NC para redes inalámbricas. La segunda parte de la tesis se centra en el diseño de protocolos de capa MAC en escenarios inalámbricos de difusión de datos. Teniendo en cuenta la importancia de la eficiencia energética, se proponen técnicas de acceso al medio basadas en teoría de juegos dónde las funciones objetivo están motivadas por el consumo energético. Las soluciones propuestas son evaluadas por medio de modelos analíticos y simulaciones por ordenador

    Medium Access Control and Network Coding for Wireless Information Flows

    Get PDF
    This dissertation addresses the intertwined problems of medium access control (MAC) and network coding in ad hoc wireless networks. The emerging wireless network applications introduce new challenges that go beyond the classical understanding of wireline networks based on layered architecture and cooperation. Wireless networks involve strong interactions between MAC and network layers that need to be jointly specified in a cross-layer design framework with cooperative and non-cooperative users. For multi-hop wireless networks, we first rediscover the value of scheduled access at MAC layer through a detailed foray into the questions of throughput and energy consumption. We propose a distributed time-division mechanism to activate dynamic transmitter-receiver assignments and eliminate interference at non-intended receivers for throughput and energy-efficient resource allocation based on stable operation with arbitrary single-receiver MAC protocols. In addition to full cooperation, we consider competitive operation of selfish users with individual performance objectives of throughput, energy and delay. We follow a game-theoretic approach to evaluate the non-cooperative equilibrium strategies at MAC layer and discuss the coupling with physical layer through power and rate control. As a cross-layer extension to multi-hop operation, we analyze the non-cooperative operation of joint MAC and routing, and introduce cooperation stimulation mechanisms for packet forwarding. We also study the impact of malicious transmitters through a game formulation of denial of service attacks in random access and power-controlled MAC. As a new networking paradigm, network coding extends routing by allowing intermediate transmitters to code over the received packets. We introduce the adaptation of network coding to wireless environment in conjunction with MAC. We address new research problems that arise when network coding is cast in a cross-layer optimization framework with stable operation. We specify the maximum throughput and stability regions, and show the necessity of joint design of MAC and network coding for throughput and energy-efficient operation of cooperative or competitive users. Finally, we discuss the benefits of network coding for throughput stability in single-hop multicast communication over erasure channels. Deterministic and random coding schemes are introduced to optimize the stable throughput properties. The results extend our understanding of fundamental communication limits and trade-offs in wireless networks

    Advanced random access techniques for satellite communications

    Get PDF
    In this thesis, Advanced Random Access techniques for Satellite Communications are studied. In the last years, new advances in multi-access communication protocols together with the increasing need for bidirectional communications in consumer type of interactive satellite terminals have revived the interest for a set of schemes able to guarantee high-speed and low latency communications in bursty traffic conditions. In this work, starting from the latest findings on Aloha-based Random Access schemes, the optimization of such techniques and their use in closed-loop scenarios is investigated with particular regard to the Return Channel over Satellite of Digital Video Broadcasting. The thesis starts with a summary on the state of the art of Demand Assigned and Random Access techniques as well as on the recent evolution from the first to the second version of the Return Channel over Satellite of the Digital Video Broadcasting specification. In chapter 2 a stability and packet delay model for channel analysis and design are presented, showing that proper design through this tools can ensure high performance of the new access scheme. The use of control limit policies is also introduced and its use is thoroughly discussed both for finite and infinite users population showing that, differently from Slotted Aloha, in some cases static design over dynamic policies might be preferable if long propagation delay is present. In chapter 3 the same models and tools introduced for CRDSA are extended to the case of asynchronous Random Access schemes and a comparison of the two families of schemes is put in place demonstrating that asynchronous techniques are convenient only when the signal-to-noise ratio is high enough to ensure decodability of partially colliding packets. In chapter 4 a new access scheme currently patent pending is presented. In this scheme terminals access the channel in an unframed manner. It is shown that such a change brings improvements that further diminish latency due to immediate transmission of the first replica and further boost throughput because the number of loops on the corresponding bipartite graph representation is mitigated. The thesis concludes with a call for a new discussion of resource allocation in multi-access satellite communication scenarios such as DVB-RCS2 in light of the obtained results and of the new requirements in interactive satellite networks
    corecore