80 research outputs found
Detection and Combining Techniques for Asynchronous Random Access with Time Diversity
Asynchronous random access (RA) protocols are particularly attractive for
their simplicity and avoidance of tight synchronization requirements. Recent
enhancements have shown that the use of successive interference cancellation
(SIC) can largely boost the performance of these schemes. A further step
forward in the performance can be attained when diversity combining techniques
are applied. In order to enable combining, the detection and association of the
packets to their transmitters has to be done prior to decoding. We present a
solution to this problem, that articulates into two phases. Non-coherent
soft-correlation as well as interference-aware soft-correlation are used for
packet detection. We evaluate the detection capabilities of both solutions via
numerical simulations. We also evaluate numerically the spectral efficiency
achieved by the proposed approach, highlighting its benefits.Comment: 6 pages, 7 figures. Work has been submitted to the 11th International
ITG Conference on Systems, Communications and Coding 201
Multi-slot Coded ALOHA with Irregular Degree Distribution
This paper proposes an improvement of the random multiple access scheme for
satellite communication named Multislot coded ALOHA (MuSCA). MuSCA is a
generalization of Contention Resolution Diversity Slotted ALOHA (CRDSA). In
this scheme, each user transmits several parts of a single codeword of an error
correcting code instead of sending replicas. At the receiver level, the decoder
collects all these parts and includes them in the decoding process even if they
are interfered. In this paper, we show that a high throughput can be obtained
by selecting variable code rates and user degrees according to a probability
distribution. With an optimal irregular degree distribution, our system
achieves a normalized throughput up to 1.43, resulting in a significant gain
compared to CRDSA and MuSCA. The spectral efficiency and the implementation
issues of the scheme are also analyzed.Comment: 6 pages, 8 figure
Interference Calculation in Asynchronous Random Access Protocols using Diversity
The use of Aloha-based Random Access protocols is interesting when channel
sensing is either not possible or not convenient and the traffic from terminals
is unpredictable and sporadic. In this paper an analytic model for packet
interference calculation in asynchronous Random Access protocols using
diversity is presented. The aim is to provide a tool that avoids time-consuming
simulations to evaluate packet loss and throughput in case decodability is
still possible when a certain interference threshold is not exceeded. Moreover
the same model represents the groundbase for further studies in which iterative
Interference Cancellation is applied to received frames.Comment: This paper has been accepted for publication in the Springer's
Telecommunication Systems journal. The final publication will be made
available at Springer. Please refer to that version when citing this paper;
Springer Telecommunication Systems, 201
Frameless ALOHA with Reliability-Latency Guarantees
One of the novelties brought by 5G is that wireless system design has
increasingly turned its focus on guaranteeing reliability and latency. This
shifts the design objective of random access protocols from throughput
optimization towards constraints based on reliability and latency. For this
purpose, we use frameless ALOHA, which relies on successive interference
cancellation (SIC), and derive its exact finite-length analysis of the
statistics of the unresolved users (reliability) as a function of the
contention period length (latency). The presented analysis can be used to
derive the reliability-latency guarantees. We also optimize the scheme
parameters in order to maximize the reliability within a given latency. Our
approach represents an important step towards the general area of design and
analysis of access protocols with reliability-latency guarantees.Comment: Accepted for presentation at IEEE Globecom 201
Characterization of Coded Random Access with Compressive Sensing based Multi-User Detection
The emergence of Machine-to-Machine (M2M) communication requires new Medium
Access Control (MAC) schemes and physical (PHY) layer concepts to support a
massive number of access requests. The concept of coded random access,
introduced recently, greatly outperforms other random access methods and is
inherently capable to take advantage of the capture effect from the PHY layer.
Furthermore, at the PHY layer, compressive sensing based multi-user detection
(CS-MUD) is a novel technique that exploits sparsity in multi-user detection to
achieve a joint activity and data detection. In this paper, we combine coded
random access with CS-MUD on the PHY layer and show very promising results for
the resulting protocol.Comment: Submitted to Globecom 201
Prioritized Random MAC Optimization via Graph-based Analysis
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
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
- …