43 research outputs found
Exploiting Capture Effect in Frameless ALOHA for Massive Wireless Random Access
The analogies between successive interference cancellation (SIC) in slotted
ALOHA framework and iterative belief-propagation erasure-decoding, established
recently, enabled the application of the erasure-coding theory and tools to
design random access schemes. This approach leads to throughput substantially
higher than the one offered by the traditional slotted ALOHA. In the simplest
setting, SIC progresses when a successful decoding occurs for a single user
transmission. In this paper we consider a more general setting of a channel
with capture and explore how such physical model affects the design of the
coded random access protocol. Specifically, we assess the impact of capture
effect in Rayleigh fading scenario on the design of SIC-enabled slotted ALOHA
schemes. We provide analytical treatment of frameless ALOHA, which is a special
case of SIC-enabled ALOHA scheme. We demonstrate both through analytical and
simulation results that the capture effect can be very beneficial in terms of
achieved throughput.Comment: Accepted for presentation at IEEE WCNC'14 Track 2 (MAC and
Cross-Layer Design
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
Spectral efficiency and optimal medium access control of random access systems over large random spreading CDMA
This paper analyzes the spectral efficiency as a function of medium access
control (MAC) for large random spreading CDMA random access systems that employ
a linear receiver. It is shown that located at higher than the physical layer,
MAC along with spreading and power allocation can effectively perform spectral
efficiency maximization and near-far mitigation.Comment: To appear in IEEE Trans. on Communication
ALOHA Random Access that Operates as a Rateless Code
Various applications of wireless Machine-to-Machine (M2M) communications have
rekindled the research interest in random access protocols, suitable to support
a large number of connected devices. Slotted ALOHA and its derivatives
represent a simple solution for distributed random access in wireless networks.
Recently, a framed version of slotted ALOHA gained renewed interest due to the
incorporation of successive interference cancellation (SIC) in the scheme,
which resulted in substantially higher throughputs. Based on similar principles
and inspired by the rateless coding paradigm, a frameless approach for
distributed random access in slotted ALOHA framework is described in this
paper. The proposed approach shares an operational analogy with rateless
coding, expressed both through the user access strategy and the adaptive length
of the contention period, with the objective to end the contention when the
instantaneous throughput is maximized. The paper presents the related analysis,
providing heuristic criteria for terminating the contention period and showing
that very high throughputs can be achieved, even for a low number for
contending users. The demonstrated results potentially have more direct
practical implications compared to the approaches for coded random access that
lead to high throughputs only asymptotically.Comment: Revised version submitted to IEEE Transactions on Communication
MAC Centered Cooperation - Synergistic Design of Network Coding, Multi-Packet Reception, and Improved Fairness to Increase Network Throughput
We design a cross-layer approach to aid in develop- ing a cooperative
solution using multi-packet reception (MPR), network coding (NC), and medium
access (MAC). We construct a model for the behavior of the IEEE 802.11 MAC
protocol and apply it to key small canonical topology components and their
larger counterparts. The results obtained from this model match the available
experimental results with fidelity. Using this model, we show that fairness
allocation by the IEEE 802.11 MAC can significantly impede performance; hence,
we devise a new MAC that not only substantially improves throughput, but
provides fairness to flows of information rather than to nodes. We show that
cooperation between NC, MPR, and our new MAC achieves super-additive gains of
up to 6.3 times that of routing with the standard IEEE 802.11 MAC. Furthermore,
we extend the model to analyze our MAC's asymptotic and throughput behaviors as
the number of nodes increases or the MPR capability is limited to only a single
node. Finally, we show that although network performance is reduced under
substantial asymmetry or limited implementation of MPR to a central node, there
are some important practical cases, even under these conditions, where MPR, NC,
and their combination provide significant gains
On the Performance of Irregular Repetition Slotted Aloha with Multiple Packet Reception
International audienceA modern method of random access for packet networks, named ``Irregular Repetition Slotted Aloha (IRSA)'', had been proposed: it is based repeating transmitted packets, and on the use of successive interference cancellation at the receiver. In classical idealized settings of slotted random access protocols (where slotted ALOHA achieves 1/e), it has been shown that IRSA could asymptotically achieve the maximal throughput of 1 packet per slot. Additionally, IRSA had previously been studied for many different variants and settings, including the case where the receiver is equipped with ``multiple-packet reception'' (MPR) capability.In this article, we extensively revisit the case of IRSA with MPR. First, one of our major results is the proof that K-IRSA cannot reach the natural bound of throughput, and we prove a new, lower bound for its performance. Second, we give a simple expression for its excellent loss rate at lower loads. Third, we show how to formulate the search for the appropriate parameters of IRSA as an optimization problem, and how to solve it efficiently. By doing that for a comprehensive set of parameters, and by providing this work with simulations, we give numerical results that shed light on the performance of IRSA with MPR
On Coding for Reliable Communication over Packet Networks
We present a capacity-achieving coding scheme for unicast or multicast over
lossy packet networks. In the scheme, intermediate nodes perform additional
coding yet do not decode nor even wait for a block of packets before sending
out coded packets. Rather, whenever they have a transmission opportunity, they
send out coded packets formed from random linear combinations of previously
received packets. All coding and decoding operations have polynomial
complexity.
We show that the scheme is capacity-achieving as long as packets received on
a link arrive according to a process that has an average rate. Thus, packet
losses on a link may exhibit correlation in time or with losses on other links.
In the special case of Poisson traffic with i.i.d. losses, we give error
exponents that quantify the rate of decay of the probability of error with
coding delay. Our analysis of the scheme shows that it is not only
capacity-achieving, but that the propagation of packets carrying "innovative"
information follows the propagation of jobs through a queueing network, and
therefore fluid flow models yield good approximations. We consider networks
with both lossy point-to-point and broadcast links, allowing us to model both
wireline and wireless packet networks.Comment: 33 pages, 6 figures; revised appendi