High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm

Random access is well motivated and has been widely applied when the network traffic is bursty and the expected throughput is not high. The main reason behind relatively low-throughput expectations is that collided packets are typically discarded. In this paper, we develop a novel protocol exploiting successive interference cancellation (SIC) in a tree algorithm (TA), where collided packets are reserved for reuse. Our SICTA protocol can achieve markedly higher maximum stable throughput relative to existing alternatives. Throughput performance is analyzed for general d-ary SICTA with both gated and window access. It is shown that the throughput for d-ary SICTA with gated access is about (ln d)/(d - 1), and can reach 0.693 for d = 2. This represents a 40% increase over the renowned first-come-first-serve (FCFS) 0.487 tree algorithm. Delay performance is also analyzed for SICTA with gated access, and numerical results are provided.

[1]  Anthony Ephremides,et al.  Energy-efficient collision resolution in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Pierre A. Humblet,et al.  A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels , 1985, IEEE Trans. Commun..

[3]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics , 1975, IEEE Transactions on Communications.

[4]  George C. Polyzos,et al.  Conflict Resolution Algorithms and their Performance Analysis , 1993 .

[5]  Sem C. Borst,et al.  A novel mechanism for contention resolution in HFC networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[8]  A. G. Pakes,et al.  Some Conditions for Ergodicity and Recurrence of Markov Chains , 1969, Oper. Res..

[9]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[10]  Reinaldo A. Valenzuela,et al.  Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture , 1999 .

[11]  M. Molle,et al.  Computation of the Packet Delay in Massey ’ s Standard and Modified Tree Conflict Resolution Algorithms with Gated Access , 1992 .

[12]  Nada Golmie,et al.  A review of contention resolution algorithms for IEEE 802.14 networks , 1999, IEEE Communications Surveys & Tutorials.

[13]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[14]  John G. Proakis,et al.  Digital Communications , 1983 .

[15]  Sergio Verdu,et al.  Multiuser Detection , 1998 .

[16]  Subrata Banerjee,et al.  Network-assisted diversity for random access wireless networks , 2000, IEEE Trans. Signal Process..

[17]  Raphael Rom,et al.  Multiple Access Protocols: Performance and Analysis , 1990, SIGMETRICS Perform. Evaluation Rev..

[18]  Raphael Rom,et al.  Multiple Access Protocols: Performance and Analysis , 1990, SIGMETRICS Perform. Evaluation Rev..

[19]  Benny Bing.  Broadband Wireless Access , 2000 .

[20]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[21]  Lazaros F. Merakos,et al.  A Method for the Delay Analysis of Random Multiple-Access Algorithms Whose Delay Process is Regenerative , 1987, IEEE J. Sel. Areas Commun..

[22]  Philippe Flajolet,et al.  Q -ary collision resolution algorithms in random-access systems with free or blocked channel access , 1985, IEEE Trans. Inf. Theory.

[23]  Norman Abramson,et al.  The ALOHA System-Another Alternative for Computer Communications , 1899 .

[24]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[25]  Leandros Tassiulas,et al.  Wireless networks with retransmission diversity access mechanisms: stable throughput and delay properties , 2003, IEEE Trans. Signal Process..

[26]  Georgios B. Giannakis,et al.  SICTA: a 0.693 contention tree algorithm using successive interference cancellation , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[27]  Andrew S. Tanenbaum,et al.  Computer Networks , 1981 .

[28]  Gabriel Ruget,et al.  Some Tools for the Study of Channel-Sharing Algorithms , 1981 .

[29]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[30]  Nikos D. Sidiropoulos,et al.  Collision resolution in packet radio networks using rotational invariance techniques , 2002, IEEE Trans. Commun..

[31]  J. Massey.  Collision-Resolution Algorithms and Random-Access Communications , 1981 .