Increasing the throughput of spread-Aloha protocols via long PN spreading codes

Alejandro Ribeiro, Yingqun Yu, Georgios B. Giannakis, Nikos D. Sidiropoulos

Abstract

Random access Aloha protocols have well documented merits in terms of simplicity and favorable delay-throughput trade-off under moderate bursty traffic loads. Short spreading codes have been used in conjunction with random access to endow Aloha with benefits originating from spread-spectrum communications. Instead of short, symbol-periodic spreading, this paper considers long pseudo-random (PN) packet-periodic sequences in the context of spread-Aloha and establishes that long PN codes increase the maximum stable throughput by reducing the probability of collisions. Relying on a dominant system approach, we analyze the resultant throughput and demonstrate that increasing the PN code length quickly transforms the collision-limited channel to an interference-limited one. In particular, we investigate how throughput depends on user load and packet length. Finally, we discuss synchronization issues and provide corroborating numerical results.
BibTeX
@inproceedings{ribeiro2005increasing,
  author = {Alejandro Ribeiro and Yingqun Yu and Georgios B. Giannakis and Nikos D. Sidiropoulos},
  title = {{Increasing the throughput of spread-Aloha protocols via long PN spreading codes}},
  booktitle = {ICC},
  year = {2005},
  doi = {10.1109/icc.2005.1495093},
}

Loading related content...

Figure