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

A. Ribeiro, Y. Yu, Georgios B Giannakis, Nikolaos Sidiropoulos

Research output: Contribution to journalConference articlepeer-review

7 Scopus citations


Random access Aloha protocols have well documented merits in terms of simplicity and favorable delaythroughput 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.

Original languageEnglish (US)
Pages (from-to)3628-3631
Number of pages4
JournalIEEE International Conference on Communications
StatePublished - 2005
Event2005 IEEE International Conference on Communications, ICC 2005 - Seoul, Korea, Republic of
Duration: May 16 2005May 20 2005


  • Random Access
  • Spread Spectrum Communications


Dive into the research topics of 'Increasing the throughput of spread-Aloha protocols via long PN spreading codes'. Together they form a unique fingerprint.

Cite this