Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

A slotted ALOHA scheme based on bipartite graph optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Liva, Gianluigi ; Inst. of Commun. & Navig., DLR (German Aerosp. Center), Wessling, Germany

Bipartite graphs have been often used to describe the structure of iteratively-decodable error correcting codes, and to analyze their iterative decoding performance. This paper deals with the application of bipartite graphs to a different problem. More specifically, the bipartite graph description is applied to the iterative interference cancelation process of a recently introduced random access scheme named contention resolution diversity slotted ALOHA. Contention resolution diversity slotted ALOHA relies on MAC bursts repetition and on interference cancelation to increase the throughput of a classic slotted ALOHA access scheme. The graph representation permits to establish a bridge between the iterative interference cancelation process and the iterative erasure recovery process of graph-based codes. Assuming ideal interference cancelation, it is shown how the use of irregular bipartite graphs allows achieving a throughput close to 0.97 packets/slot with a maximum burst repetition rate equal to 16. The iterative interference cancelation analysis is further extended to the case of non-ideal interference cancelation. A discussion on the normalized efficiency is provided as well, considering the average power used by the different approaches.

Published in:

Source and Channel Coding (SCC), 2010 International ITG Conference on

Date of Conference:

18-21 Jan. 2010