Throughput of DS-CDMA/unslotted ALOHA radio networks with Markovian arrival processes

Shu Ming Tseng*, Yung Chung Wang

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

3 Scopus citations

Abstract

Previous works on the throughput analysis of the direct sequence-code division multiple access/unslotted ALOHA radio network all used the Poisson arrival process (PAP). However, the interarrival times of PAP are independent, so it is not suited to model today's Internet and multimedia traffic, which have correlated interarrival times. We are motivated to use the Markovian arrival process (MAP), a more general input traffic model that captures the correlation of interarrival times. We are the first to analyze the throughput of the direct sequence-code division multiple access/unslotted ALOHA radio network with MAP. We propose the use of MAP, which encompasses the PAP as a special case. The new MAP model basically generalizes the current traffic and queuing models of multimedia in wireless networks.

Original languageEnglish
Pages (from-to)369-379
Number of pages11
JournalInternational Journal of Communication Systems
Volume26
Issue number3
DOIs
StatePublished - 03 2013
Externally publishedYes

Keywords

  • Internet traffic
  • Markovian arrival process
  • code-division multiple access
  • multimedia traffic
  • pure ALOHA
  • queuing analysis

Fingerprint

Dive into the research topics of 'Throughput of DS-CDMA/unslotted ALOHA radio networks with Markovian arrival processes'. Together they form a unique fingerprint.

Cite this