Sign-compute-resolve for random access

We present an approach to random access that is based on three elements: physical-layer network coding, signature codes and tree splitting. Upon occurrence of a collision, physical-layer network coding enables the receiver to decode the sum of the information that was transmitted by the individual users. For each user this information consists of the data that the user wants to communicate as well as the user's signature. As long as no more than K users collide, their identities can be recovered from the sum of their signatures. A splitting protocol is used to deal with the case that more than K users collide. We measure the performance of the proposed method in terms of user resolution rate as well as overall throughput of the system. The results show that our approach significantly increases the performance of the system even compared to coded random access, where collisions are not wasted, but are reused in successive interference cancellation.

[1]  Petar Popovski,et al.  Frameless ALOHA Protocol for Wireless Networks , 2012, IEEE Communications Letters.

[2]  Muriel Médard,et al.  Collision Helps - Algebraic Collision Recovery for Wireless Erasure Networks , 2010, 2010 Third IEEE International Workshop on Wireless Network Coding.

[3]  Soung Chang Liew,et al.  Physical-layer network coding: Tutorial, survey, and beyond , 2011, Phys. Commun..

[4]  Frank H. P. Fitzek,et al.  A Class of Algorithms for Collision Resolution with Multiplicity Estimation , 2007, Algorithmica.

[5]  Bobak Nazer.  Successive compute-and-forward , 2012 .

[6]  Deniz Gündüz,et al.  Collision Resolution in Slotted ALOHA with Multi-User Physical-Layer Network Coding , 2011, 2011 IEEE 73rd Vehicular Technology Conference (VTC Spring).

[7]  Michael Gastpar,et al.  Reliable Physical Layer Network Coding , 2011, Proceedings of the IEEE.

[8]  Danyo Danev,et al.  Multiple access adder channel , 2007 .

[9]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[10]  Marco Chiani,et al.  High Throughput Random Access via Codes on Graphs: Coded Slotted ALOHA , 2011, 2011 IEEE International Conference on Communications (ICC).

[11]  Petar Popovski,et al.  Coded Random Access: How Coding Theory Helps to Build Random Access Protocols , 2014, ArXiv.

[12]  Muriel Medard,et al.  Acknowledgement design for collision-recovery-enabled wireless erasure networks , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[13]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[14]  Petar Popovski,et al.  ALOHA Random Access that Operates as a Rateless Code , 2013, IEEE Transactions on Communications.

[15]  Petar Popovski,et al.  Physical Network Coding in Two-Way Wireless Relay Channels , 2007, 2007 IEEE International Conference on Communications.

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

[17]  Giuseppe Cocco,et al.  Network-coded diversity protocol for collision recovery in slotted ALOHA networks , 2014, Int. J. Satell. Commun. Netw..

[18]  Gianluigi Liva,et al.  Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA , 2011, IEEE Transactions on Communications.

[19]  Michael Lentmaier,et al.  Spatially-coupled random access on graphs , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[20]  Michael Gastpar,et al.  Random Access With Physical-Layer Network Coding , 2015, IEEE Transactions on Information Theory.

[21]  Riccardo De Gaudenzi,et al.  Contention Resolution Diversity Slotted ALOHA (CRDSA): An Enhanced Random Access Schemefor Satellite Access Packet Networks , 2007, IEEE Transactions on Wireless Communications.

[22]  Jasper Goseling,et al.  A random access scheme with physical-layer network coding and user identification , 2014, 2014 IEEE International Conference on Communications Workshops (ICC).

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

[24]  Lawrence G. Roberts,et al.  ALOHA packet system with and without slots and capture , 1975, CCRV.

[25]  Petar Popovski,et al.  The Anti-Packets Can Increase the Achievable Throughput of a Wireless Multi-Hop Network , 2006, 2006 IEEE International Conference on Communications.

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

[27]  Michael Gastpar,et al.  Physical-layer network coding on the random-access channel , 2013, 2013 IEEE International Symposium on Information Theory.

[28]  Petar Popovski,et al.  Coded splitting tree protocols , 2013, 2013 IEEE International Symposium on Information Theory.

[29]  Nancy A. Lynch,et al.  Bounded-Contention Coding for Wireless Networks in the High SNR Regime , 2012, DISC.