ePrints

Multiple Access Algorithms without Feedback using Combinatorial Designs

Lookup NU author(s): Dr Rafael Bocklandt

Downloads

• Published version [.pdf]

Abstract

A new class of multiple access algorithms for systems without feedback is introduced and analyzed. A finite population of users is assumed, where each user transmits a packet R times within the next N time slots (and all packets have an equal length of one slot). To improve the performance achieved by randomly selecting these R slots, user codes are invoked such that any two users will only transmit simultaneously in at most one slot, i.e., 2-(N, R, 1) designs. We argue that in most cases, the set of user codes can be generated easily using cyclic designs and provide a method to select T user codes from the set of user codes SN,R in case the user population consists of T < |SN,R| users. We further demonstrate how larger populations, with T > |SN,R|, can still benefit from these user codes in two different manners. Closed formulas that express the success probability of a packet are provided for all population setups. Finally, a comparison with the random selection strategy demonstrates the performance gain realized by the new multiple access algorithms and some engineering rules to optimize the performance are provided.

Publication metadata

Author(s): Peeters G, Bocklandt R, Van Houdt B

Publication type: Article

Publication status: Published

Journal: IEEE Transactions on Communications

Year: 2009

Volume: 57

Issue: 9

Pages: 2724-2733

Date deposited: 25/08/2010

ISSN (print): 0090-6778

ISSN (electronic): 1558-0857

Publisher: IEEE

URL: http://dx.doi.org/10.1109/TCOMM.2009.09.080054

DOI: 10.1109/TCOMM.2009.09.080054

Altmetrics

Share