Logo image
Achievable throughput and queueing delay for imperfect cooperative retransmission MAC protocols
Conference proceeding

Achievable throughput and queueing delay for imperfect cooperative retransmission MAC protocols

Steven Weber and Athina Petropulu
2008 42ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-4, pp 1421-1425
01 Jan 2008

Abstract

Computer Science Computer Science, Interdisciplinary Applications Engineering Engineering, Electrical & Electronic Science & Technology Technology Telecommunications
Cooperative retransmission (CR) for cellular uplink employs recovery epochs where colliding packets are retransmitted until all packets are recoverable by the base station. We consider a general class of queueing dynamics, appropriate for cellular uplink MAC protocols, where time slots are grouped into epochs, and each epoch results in some subset of the active nodes completing a transmission to the base station. Employing moment generating functions, we express the queue length in terms of the number of arrivals during each epoch, and from here we obtain general expressions for throughput and delay (queueing plus service). We specialize these general results for four MAC uplink protocols: i) independent queues with no collisions (Providing an upper bound on performance), ii) slotted Aloha, iii) perfect cooperative retransmission (each time slot yields a new independent signal combination). and iv) imperfect cooperative retransmission (a time slot gives useful information with probability 1 - q).

Metrics

4 Record Views
1 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Interdisciplinary Applications
Engineering, Electrical & Electronic
Telecommunications
Logo image