Premium
Throughput of DS‐CDMA/unslotted ALOHA radio networks with Markovian arrival processes
Author(s) -
Tseng Shu-Ming,
Wang YungChung
Publication year - 2013
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.1354
Subject(s) - aloha , computer science , markovian arrival process , throughput , code division multiple access , computer network , queueing theory , markov process , wireless network , code (set theory) , poisson distribution , wireless , real time computing , telecommunications , statistics , mathematics , set (abstract data type) , programming language
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 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. Copyright © 2011 John Wiley & Sons, Ltd.