2011
DOI: 10.1002/dac.1354
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: SUMMARY 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 a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 21 publications
(49 reference statements)
0
2
0
Order By: Relevance
“…In literature, the most common and easy way to send access requests is ALOHA or S‐ALOHA . However, the collision‐prone transmission leads to retransmission when the traffic load is high.…”
Section: Proposed Mac Protocolmentioning
confidence: 99%
“…In literature, the most common and easy way to send access requests is ALOHA or S‐ALOHA . However, the collision‐prone transmission leads to retransmission when the traffic load is high.…”
Section: Proposed Mac Protocolmentioning
confidence: 99%
“…No closed‐form solution was given. Recently, Tseng et al use the Markov arrival process (MAP) to model a more general input traffic that captures the correlation of interarrival times and applying to analyze the throughput of the direct sequence‐code division multiple access/unslotted ALOHA radio network with MAP. Vassilakis et al apply extended Erlang multirate loss model for the efficient calculation of link occupancy distribution and consequently call blocking probabilities, link utilization, and throughput per service class; the accuracy of the new model is verified by simulation.…”
Section: Introductionmentioning
confidence: 99%