On the throughput of ARQ over multiple-access relay fading channels with queueing constraints

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, the throughput under queuing constraints in multiple-access relay fading channels achieved by fixed-rate transmissions and a simple automatic repeat request (ARQ) protocol is investigated in the absence of channel side information (CSI) at the transmitters. Transmission is considered to be either in the ON or OFF state, depending on the reliability of the reception, and retransmissions are triggered by the ARQ protocol in the OFF state. The probabilities of these transmission states are identified. Through stability and queuing analysis, feasible set of system parameters is determined, and the maximum constant arrival rates at source nodes, which can be supported by the system under queuing constraints, are characterized in terms of the fixed transmission rates, state probabilities, and quality of service parameters.

Original languageEnglish (US)
Title of host publication2015 IEEE Wireless Communications and Networking Conference, WCNC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages741-746
Number of pages6
ISBN (Electronic)9781479984060
DOIs
StatePublished - Jun 17 2015
Event2015 IEEE Wireless Communications and Networking Conference, WCNC 2015 - New Orleans, United States
Duration: Mar 9 2015Mar 12 2015

Publication series

Name2015 IEEE Wireless Communications and Networking Conference, WCNC 2015

Other

Other2015 IEEE Wireless Communications and Networking Conference, WCNC 2015
CountryUnited States
CityNew Orleans
Period3/9/153/12/15

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Computer Science Applications
  • Signal Processing

Fingerprint Dive into the research topics of 'On the throughput of ARQ over multiple-access relay fading channels with queueing constraints'. Together they form a unique fingerprint.

Cite this