1,021 research outputs found
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
Goodbye, ALOHA!
©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
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
Stability Analysis of Frame Slotted Aloha Protocol
Frame Slotted Aloha (FSA) protocol has been widely applied in Radio Frequency
Identification (RFID) systems as the de facto standard in tag identification.
However, very limited work has been done on the stability of FSA despite its
fundamental importance both on the theoretical characterisation of FSA
performance and its effective operation in practical systems. In order to
bridge this gap, we devote this paper to investigating the stability properties
of FSA by focusing on two physical layer models of practical importance, the
models with single packet reception and multipacket reception capabilities.
Technically, we model the FSA system backlog as a Markov chain with its states
being backlog size at the beginning of each frame. The objective is to analyze
the ergodicity of the Markov chain and demonstrate its properties in different
regions, particularly the instability region. By employing drift analysis, we
obtain the closed-form conditions for the stability of FSA and show that the
stability region is maximised when the frame length equals the backlog size in
the single packet reception model and when the ratio of the backlog size to
frame length equals in order of magnitude the maximum multipacket reception
capacity in the multipacket reception model. Furthermore, to characterise
system behavior in the instability region, we mathematically demonstrate the
existence of transience of the backlog Markov chain.Comment: 14 pages, submitted to IEEE Transaction on Information Theor
- …