SICTA: a 0.693 contention tree algorithm using successive interference cancellation

Contention tree algorithms have provable stability properties, and are known to achieve stable throughput as high as 0.487 for the infinite population Poisson model. A common feature in all these random access protocols is that collided packets at the receive-node are always discarded. In this paper, we derive a novel tree algorithm (TA) that we naturally term SICTA because it relies on successive interference cancellation to resolve collided packets. Performance metrics including throughput and delay are analyzed to establish that SICTA outperforms existing contention tree algorithms reaching 0.693 in stable throughput.

[1]  Desmond P. Taylor,et al.  Packet Switching in Radio Channels: Part ICarrier Sense MultipleAccess Modes and Their ThroughputDelay Characteristics , 2007 .

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

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

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

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

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

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

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

[9]  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.

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

[11]  Ian F. Akyildiz,et al.  Medium access control protocols for multimedia traffic in wireless networks , 1999, IEEE Netw..

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

[13]  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).

[14]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

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

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

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